A recursive root convergions question

  • Thread starter transgalactic
  • Start date
  • Tags
    Root
In summary, the conversation discusses how to prove the convergence and find the limit of a sequence given by a recursive equation. A possible approach is to assume the sequence converges to a and then take the limit on both sides of the defining equation to solve for a in terms of x and y. The next step would be to determine if the limit is less than or greater than 1, and then try to prove whether the sequence is decreasing or increasing and if it has a lower or upper bound.
  • #1
transgalactic
1,395
0
i wrote the question
and how i tried to solve it this link

http://img514.imageshack.us/img514/5053/img9151yd0.gif
 
Last edited by a moderator:
Physics news on Phys.org
  • #2
You are given that [itex]a_1= 1[/itex] and [itex]a_{n+1}= \sqrt{x+ a_ny}[/itex] for fixed positive numbers x and y. You are trying to find prove that the sequence converges and find its limit, right?

You then write that you are using
[tex]L= \lim_{n\rightarrow\infty} ^n\sqrt{a_n}= \lim_{n\rightarrow\infty}\frac{a_{n+1}}{a_n}[/tex]
I have no idea why or why you think those two limits are the same! I suspect you have combined the ratio test and the root test. It is true that if either of those limits is less than 1 then the sequence converges but they are not necessarily equal.

In any case, that will not tell you what the limit of the sequence is and there is a much easier way to find it. First, although you will need to prove the sequence converges, start by assuming the sequence converges to "a".

Now take the limit on both sides of the defining equation: look at [itex]\lim_{n\rightarrow\infty} a_{n+1}= [itex]lim_{n\rightarrow\infty}\sqrt{x+ a_ny}[/itex].
That should easily give you an equation for a in terms of x and y.

Is that limit less than or greater than 1 (that may depend on x and y)? If less than 1, try to prove this is a decreasing sequence having a lower bound. If greater than 1, try to prove it is an increasing sequence having an upper bound.
 

FAQ: A recursive root convergions question

What is a recursive root convergence?

A recursive root convergence is a mathematical concept that involves finding the value of a root using repeated iterations or calculations. It is commonly used in algorithms and computer programs to solve complex equations or find the root of a function.

How does a recursive root convergence work?

A recursive root convergence works by starting with an initial guess for the root and then using a formula or algorithm to refine that guess until it converges to the actual root. This process is repeated until the desired level of accuracy is achieved.

What is the importance of recursive root convergence?

Recursive root convergence is important because it allows us to find the root of a function or equation with a high level of accuracy. It is commonly used in different fields of science and engineering to solve complex problems and make predictions based on mathematical models.

What are some applications of recursive root convergence?

Recursive root convergence has many applications in different fields such as physics, finance, and computer science. It is used to solve equations in quantum mechanics, predict stock prices, and optimize algorithms, among other things.

Are there any limitations to recursive root convergence?

While recursive root convergence is a powerful tool, it has some limitations. The method may fail to converge if the initial guess is too far from the actual root or if the function is not well-behaved. Additionally, it may require a large number of iterations to reach a desired level of accuracy, which can be computationally expensive.

Similar threads

Replies
8
Views
2K
Replies
13
Views
1K
Replies
11
Views
862
Replies
7
Views
2K
Replies
3
Views
2K
Replies
12
Views
2K
Back
Top