How to find limit of a second-order recursion
$begingroup$
Suppose there is a sequence
$$u_n = au_{n-1} - a^2u_{n-1}^2 + bu_{n-2} - b^2u_{n-2}^2$$
with the boundary condition, $u_0, u_1$ both are positive and less than $1$.
How can I show that this sequence is convergent?
Actually, my goal is to show that $u_n$ converges to a value greater than $0$.
Possibly, when $a + b > 1$ then $limlimits_{nrightarrow infty} u_n neq 0$ as I experiment with a computer progam.
calculus recursion
$endgroup$
add a comment |
$begingroup$
Suppose there is a sequence
$$u_n = au_{n-1} - a^2u_{n-1}^2 + bu_{n-2} - b^2u_{n-2}^2$$
with the boundary condition, $u_0, u_1$ both are positive and less than $1$.
How can I show that this sequence is convergent?
Actually, my goal is to show that $u_n$ converges to a value greater than $0$.
Possibly, when $a + b > 1$ then $limlimits_{nrightarrow infty} u_n neq 0$ as I experiment with a computer progam.
calculus recursion
$endgroup$
1
$begingroup$
Isn't this just $u_n=cu_{n-1}+du_{n-2}$ with $c=a-a^2,,d=b-b^2$? Study the roots of the auxiliary polynomial $lambda^2+(a^2-a)lambda+b^2-b$.
$endgroup$
– J.G.
Dec 24 '18 at 8:42
$begingroup$
I am sorry for this confusion. There is a typo here. There are squares of $u_{n-1}$ and $u_{n-2}$. Thanks.
$endgroup$
– user2843539
Dec 24 '18 at 8:46
add a comment |
$begingroup$
Suppose there is a sequence
$$u_n = au_{n-1} - a^2u_{n-1}^2 + bu_{n-2} - b^2u_{n-2}^2$$
with the boundary condition, $u_0, u_1$ both are positive and less than $1$.
How can I show that this sequence is convergent?
Actually, my goal is to show that $u_n$ converges to a value greater than $0$.
Possibly, when $a + b > 1$ then $limlimits_{nrightarrow infty} u_n neq 0$ as I experiment with a computer progam.
calculus recursion
$endgroup$
Suppose there is a sequence
$$u_n = au_{n-1} - a^2u_{n-1}^2 + bu_{n-2} - b^2u_{n-2}^2$$
with the boundary condition, $u_0, u_1$ both are positive and less than $1$.
How can I show that this sequence is convergent?
Actually, my goal is to show that $u_n$ converges to a value greater than $0$.
Possibly, when $a + b > 1$ then $limlimits_{nrightarrow infty} u_n neq 0$ as I experiment with a computer progam.
calculus recursion
calculus recursion
edited Dec 24 '18 at 10:12
J.G.
32.6k23250
32.6k23250
asked Dec 24 '18 at 8:36
user2843539user2843539
64
64
1
$begingroup$
Isn't this just $u_n=cu_{n-1}+du_{n-2}$ with $c=a-a^2,,d=b-b^2$? Study the roots of the auxiliary polynomial $lambda^2+(a^2-a)lambda+b^2-b$.
$endgroup$
– J.G.
Dec 24 '18 at 8:42
$begingroup$
I am sorry for this confusion. There is a typo here. There are squares of $u_{n-1}$ and $u_{n-2}$. Thanks.
$endgroup$
– user2843539
Dec 24 '18 at 8:46
add a comment |
1
$begingroup$
Isn't this just $u_n=cu_{n-1}+du_{n-2}$ with $c=a-a^2,,d=b-b^2$? Study the roots of the auxiliary polynomial $lambda^2+(a^2-a)lambda+b^2-b$.
$endgroup$
– J.G.
Dec 24 '18 at 8:42
$begingroup$
I am sorry for this confusion. There is a typo here. There are squares of $u_{n-1}$ and $u_{n-2}$. Thanks.
$endgroup$
– user2843539
Dec 24 '18 at 8:46
1
1
$begingroup$
Isn't this just $u_n=cu_{n-1}+du_{n-2}$ with $c=a-a^2,,d=b-b^2$? Study the roots of the auxiliary polynomial $lambda^2+(a^2-a)lambda+b^2-b$.
$endgroup$
– J.G.
Dec 24 '18 at 8:42
$begingroup$
Isn't this just $u_n=cu_{n-1}+du_{n-2}$ with $c=a-a^2,,d=b-b^2$? Study the roots of the auxiliary polynomial $lambda^2+(a^2-a)lambda+b^2-b$.
$endgroup$
– J.G.
Dec 24 '18 at 8:42
$begingroup$
I am sorry for this confusion. There is a typo here. There are squares of $u_{n-1}$ and $u_{n-2}$. Thanks.
$endgroup$
– user2843539
Dec 24 '18 at 8:46
$begingroup$
I am sorry for this confusion. There is a typo here. There are squares of $u_{n-1}$ and $u_{n-2}$. Thanks.
$endgroup$
– user2843539
Dec 24 '18 at 8:46
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
This is a long comment, or possibly half an answer.
If the sequence has a limit $L$ then $$L=aL-a^2L^2+bL-b^2L^2tag{1},$$which can be rearranged viz. $0=L(a+b-1-(a^2+b^2)L)$. Therefore $L$ is nonexistent, $L=0$ or $$L=frac{a+b-1}{a^2+b^2}tag{2},$$the latter being the only case in which $u_n$ converges to a non-zero value. Indeed, in this case that value is positive iff $a+b>1$, as you've conjectured.
The hard part is checking whether the sequence has a limit. Define $$epsilon_n:=u_n-L=a(epsilon_{n-1}+L)-a^2(epsilon_{n-1}+L)^2+b(epsilon_{n-2}+L)-b^2(epsilon_{n-2}+L)^2-L.$$This simplifies for a root of (1) to $$epsilon_n=a(1-2aL)epsilon_{n-1}-a^2epsilon_{n-1}^2+b(1-2bL)epsilon_{n-2}-b^2epsilon_{n-2}^2tag{3}.$$The real question is whether (2) and (3) imply $epsilon_nto 0$. I suspect that can be proved from your boundary conditions (possibly with some further requirement on $a,,b$), but I'm not sure how. But if any proof strategy works, it'll be that one.
$endgroup$
$begingroup$
Thank you for a detailed suggestion. I will try to work with (3).
$endgroup$
– user2843539
Dec 24 '18 at 14:00
add a comment |
$begingroup$
If there is a limit u, then
$u = au - a^2u^2 + bu - b^2u^2.$
Requiring u to be nonzero gives
$1 = a - a^2u + b - b^2u.$
Whereupon $u = (a + b - 1)/(a^2 + b^2).$
Whence, if 1 < a + b and u is a nonzero limit, then 0 < u.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3051073%2fhow-to-find-limit-of-a-second-order-recursion%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
This is a long comment, or possibly half an answer.
If the sequence has a limit $L$ then $$L=aL-a^2L^2+bL-b^2L^2tag{1},$$which can be rearranged viz. $0=L(a+b-1-(a^2+b^2)L)$. Therefore $L$ is nonexistent, $L=0$ or $$L=frac{a+b-1}{a^2+b^2}tag{2},$$the latter being the only case in which $u_n$ converges to a non-zero value. Indeed, in this case that value is positive iff $a+b>1$, as you've conjectured.
The hard part is checking whether the sequence has a limit. Define $$epsilon_n:=u_n-L=a(epsilon_{n-1}+L)-a^2(epsilon_{n-1}+L)^2+b(epsilon_{n-2}+L)-b^2(epsilon_{n-2}+L)^2-L.$$This simplifies for a root of (1) to $$epsilon_n=a(1-2aL)epsilon_{n-1}-a^2epsilon_{n-1}^2+b(1-2bL)epsilon_{n-2}-b^2epsilon_{n-2}^2tag{3}.$$The real question is whether (2) and (3) imply $epsilon_nto 0$. I suspect that can be proved from your boundary conditions (possibly with some further requirement on $a,,b$), but I'm not sure how. But if any proof strategy works, it'll be that one.
$endgroup$
$begingroup$
Thank you for a detailed suggestion. I will try to work with (3).
$endgroup$
– user2843539
Dec 24 '18 at 14:00
add a comment |
$begingroup$
This is a long comment, or possibly half an answer.
If the sequence has a limit $L$ then $$L=aL-a^2L^2+bL-b^2L^2tag{1},$$which can be rearranged viz. $0=L(a+b-1-(a^2+b^2)L)$. Therefore $L$ is nonexistent, $L=0$ or $$L=frac{a+b-1}{a^2+b^2}tag{2},$$the latter being the only case in which $u_n$ converges to a non-zero value. Indeed, in this case that value is positive iff $a+b>1$, as you've conjectured.
The hard part is checking whether the sequence has a limit. Define $$epsilon_n:=u_n-L=a(epsilon_{n-1}+L)-a^2(epsilon_{n-1}+L)^2+b(epsilon_{n-2}+L)-b^2(epsilon_{n-2}+L)^2-L.$$This simplifies for a root of (1) to $$epsilon_n=a(1-2aL)epsilon_{n-1}-a^2epsilon_{n-1}^2+b(1-2bL)epsilon_{n-2}-b^2epsilon_{n-2}^2tag{3}.$$The real question is whether (2) and (3) imply $epsilon_nto 0$. I suspect that can be proved from your boundary conditions (possibly with some further requirement on $a,,b$), but I'm not sure how. But if any proof strategy works, it'll be that one.
$endgroup$
$begingroup$
Thank you for a detailed suggestion. I will try to work with (3).
$endgroup$
– user2843539
Dec 24 '18 at 14:00
add a comment |
$begingroup$
This is a long comment, or possibly half an answer.
If the sequence has a limit $L$ then $$L=aL-a^2L^2+bL-b^2L^2tag{1},$$which can be rearranged viz. $0=L(a+b-1-(a^2+b^2)L)$. Therefore $L$ is nonexistent, $L=0$ or $$L=frac{a+b-1}{a^2+b^2}tag{2},$$the latter being the only case in which $u_n$ converges to a non-zero value. Indeed, in this case that value is positive iff $a+b>1$, as you've conjectured.
The hard part is checking whether the sequence has a limit. Define $$epsilon_n:=u_n-L=a(epsilon_{n-1}+L)-a^2(epsilon_{n-1}+L)^2+b(epsilon_{n-2}+L)-b^2(epsilon_{n-2}+L)^2-L.$$This simplifies for a root of (1) to $$epsilon_n=a(1-2aL)epsilon_{n-1}-a^2epsilon_{n-1}^2+b(1-2bL)epsilon_{n-2}-b^2epsilon_{n-2}^2tag{3}.$$The real question is whether (2) and (3) imply $epsilon_nto 0$. I suspect that can be proved from your boundary conditions (possibly with some further requirement on $a,,b$), but I'm not sure how. But if any proof strategy works, it'll be that one.
$endgroup$
This is a long comment, or possibly half an answer.
If the sequence has a limit $L$ then $$L=aL-a^2L^2+bL-b^2L^2tag{1},$$which can be rearranged viz. $0=L(a+b-1-(a^2+b^2)L)$. Therefore $L$ is nonexistent, $L=0$ or $$L=frac{a+b-1}{a^2+b^2}tag{2},$$the latter being the only case in which $u_n$ converges to a non-zero value. Indeed, in this case that value is positive iff $a+b>1$, as you've conjectured.
The hard part is checking whether the sequence has a limit. Define $$epsilon_n:=u_n-L=a(epsilon_{n-1}+L)-a^2(epsilon_{n-1}+L)^2+b(epsilon_{n-2}+L)-b^2(epsilon_{n-2}+L)^2-L.$$This simplifies for a root of (1) to $$epsilon_n=a(1-2aL)epsilon_{n-1}-a^2epsilon_{n-1}^2+b(1-2bL)epsilon_{n-2}-b^2epsilon_{n-2}^2tag{3}.$$The real question is whether (2) and (3) imply $epsilon_nto 0$. I suspect that can be proved from your boundary conditions (possibly with some further requirement on $a,,b$), but I'm not sure how. But if any proof strategy works, it'll be that one.
answered Dec 24 '18 at 10:11
J.G.J.G.
32.6k23250
32.6k23250
$begingroup$
Thank you for a detailed suggestion. I will try to work with (3).
$endgroup$
– user2843539
Dec 24 '18 at 14:00
add a comment |
$begingroup$
Thank you for a detailed suggestion. I will try to work with (3).
$endgroup$
– user2843539
Dec 24 '18 at 14:00
$begingroup$
Thank you for a detailed suggestion. I will try to work with (3).
$endgroup$
– user2843539
Dec 24 '18 at 14:00
$begingroup$
Thank you for a detailed suggestion. I will try to work with (3).
$endgroup$
– user2843539
Dec 24 '18 at 14:00
add a comment |
$begingroup$
If there is a limit u, then
$u = au - a^2u^2 + bu - b^2u^2.$
Requiring u to be nonzero gives
$1 = a - a^2u + b - b^2u.$
Whereupon $u = (a + b - 1)/(a^2 + b^2).$
Whence, if 1 < a + b and u is a nonzero limit, then 0 < u.
$endgroup$
add a comment |
$begingroup$
If there is a limit u, then
$u = au - a^2u^2 + bu - b^2u^2.$
Requiring u to be nonzero gives
$1 = a - a^2u + b - b^2u.$
Whereupon $u = (a + b - 1)/(a^2 + b^2).$
Whence, if 1 < a + b and u is a nonzero limit, then 0 < u.
$endgroup$
add a comment |
$begingroup$
If there is a limit u, then
$u = au - a^2u^2 + bu - b^2u^2.$
Requiring u to be nonzero gives
$1 = a - a^2u + b - b^2u.$
Whereupon $u = (a + b - 1)/(a^2 + b^2).$
Whence, if 1 < a + b and u is a nonzero limit, then 0 < u.
$endgroup$
If there is a limit u, then
$u = au - a^2u^2 + bu - b^2u^2.$
Requiring u to be nonzero gives
$1 = a - a^2u + b - b^2u.$
Whereupon $u = (a + b - 1)/(a^2 + b^2).$
Whence, if 1 < a + b and u is a nonzero limit, then 0 < u.
answered Dec 24 '18 at 10:10
William ElliotWilliam Elliot
8,9562820
8,9562820
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3051073%2fhow-to-find-limit-of-a-second-order-recursion%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
$begingroup$
Isn't this just $u_n=cu_{n-1}+du_{n-2}$ with $c=a-a^2,,d=b-b^2$? Study the roots of the auxiliary polynomial $lambda^2+(a^2-a)lambda+b^2-b$.
$endgroup$
– J.G.
Dec 24 '18 at 8:42
$begingroup$
I am sorry for this confusion. There is a typo here. There are squares of $u_{n-1}$ and $u_{n-2}$. Thanks.
$endgroup$
– user2843539
Dec 24 '18 at 8:46