- #1

- 18

- 0

r_n+1= r_n/1+sqrt(2-r_n)

is stable. I have tried using error analysis but am struggling to get the algorithm in a form that can be easily dealt with. Thanks in advance

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter whattttt
- Start date

- #1

- 18

- 0

r_n+1= r_n/1+sqrt(2-r_n)

is stable. I have tried using error analysis but am struggling to get the algorithm in a form that can be easily dealt with. Thanks in advance

- #2

Mark44

Mentor

- 34,904

- 6,648

What have you tried?

r_n+1= r_n/1+sqrt(2-r_n)

is stable. I have tried using error analysis but am struggling to get the algorithm in a form that can be easily dealt with. Thanks in advance

What is r

I'm guessing that this is your recursion equation:

[tex]r_{n + 1} = \frac{r_n}{1 + \sqrt{2 - r_n}}[/tex]

If that is correct, your equation needs more parentheses, like this:

r_n+1= r_n/(1+sqrt(2-r_n))

Share: