Numerical methods Flashcards

(5 cards)

1
Q

State 2 problems to consider with the Newton-Raphson method

A
  • May not converge to the required root if the first approximation is close to a stationary point on the curve
  • Will not converge if the derivation is zero at one of the values of xn
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

When will an equation use the cobweb method to find its root?

A

When the gradient is less than 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

When will an equation use the staircase method to find its root?

A

When the gradient is more than 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

When will a cobweb or staircase converge?

A

When the modulus of the gradient is less than 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

When will a cobweb or a staircase diverge?

A

When the modulus of the gradient is more then 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly