Stable/unstable algorithm

  • Thread starter whattttt
  • Start date
  • #1
18
0

Main Question or Discussion Point

Can anyone help in provong whether or not the algorithm

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
 

Answers and Replies

  • #2
33,496
5,188
Can anyone help in provong whether or not the algorithm

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 have you tried?

What is r0? Have you tried calculating a few terms in the sequence? That might give you some insight.

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))
 

Related Threads on Stable/unstable algorithm

  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
3
Views
3K
  • Last Post
Replies
1
Views
5K
  • Last Post
Replies
2
Views
1K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
14
Views
3K
  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
10
Views
2K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
5
Views
1K
Top