NUMERICAL METHODS Flashcards
Why do we need numerical methods ?
Because behind polynomial 4 there is no formula to solve roots, so to find roots and solve equations we need numerical methods
Change of sign method, what is it
What are the CONDTIONS
Thisnis when you habe values and you test for y, and if you get a CHANGE of sign this means there is ATLEAST 1 (could be more ) roots between these two x values
However this is only true when the CURVE IS CONTINOUS BETWEEN THESE TWO POINTS, if not, then there could be asymptotes or a discontinuity between , and still work, but no root
So change of sign digestion full
If there’s a change of sign AND the curve is CONTINOUS there is ATLEAST 1 ROOT between those two points
How to do the change of sign , all the steps
Get on to one side,
Must introduce a function , so LET F(X) = etc
- now can do f( a) = , f(b) =
As there is a change of sign AND the function is CONTINOUS between a and b, there must be atleast one root between a and b
If there is no change of sign and curve is CONTINOUS , does that mean there are NO roots between here?
NO, it means we don’t know, because there could be a root and as we have no change of sign our values too far,
Or no roots at all
How to show that root is correct to certain dp?
Take upper and lower bound and sub and show there is a sign change so CONTINOUS means there is a root between this interval therefore it’s correct to this number of dp
Assuming we don’t know it’s CONTINOUS, what are thus the 3 ways that change or sign fails
Spec points LEARN
1) if it’s not CONTINOUS and thus a vertical asymtope in between ( change of sign no root)
2)if there’s a repeated root ( never a change of sign but a root)
3) if the range is too large ( several roots, so no change of sign but hella roots)
How does fixed point iteration fail?
- either it doesn’t converge to root you want
- or jus diverges away and never hits
What condition means it will never converge at a root?
When the grsdient of the graph at root is not between -1 < grad <1 . When this happens it does not converge
When does staircase / cobeweb form?
When the gradient at root is negaitve cobweb , when positive staricade
How to do fixed point iteration, what to ALWAYS DO ONCE FOUND A ROOT TO DO IMPORTANT
1) make f (x) in form x = g(x) so roots of this are roots of f(x)
2) make recurrence , and start with x0
3) spam recurrence until get answer to dp
NOW MUST CHECK and verify using change of sign , go back to original f(x)
- if verified then calm, if not continue
Again what MUST YOU DO when finding root with fixed point
Verify using changing of sign ALWAYS
So how to try and converge at the other root?
The only way I’d to change the rearrangement originally, this will try converge ar other root, such that grsdient is now between -1 and 1!
How does Newton raphsom work?
Starting value, finds tangent, goes to x axis, goes back to y, tangent, keeps doing to home in
3 ways Newton raphsom fails ? LEARN
1) if you sub in a stationary point, this is when f prime x is =0, and thus you’ll get 1/0 undefined
2) using change of sign you know there’s a root between ( assuming CONTINOUS ). However , using these values homes in on OTHER ROOTS, and completely missed this one
3) asymtope or discontinuities like change of sign !