Copy of Fixed Point Iteration: Rearrangement Method x=g(x)
Numerical method for finding roots of [math]f(x)=0[/math], by rearranging to [math]x=g(x)[/math] and iterating [math]x_{n+1}=g(x_n)[/math]
Made and shared by Micky Bullock [url]www.mickybullock.com[/url]
Designed principally for use with the MEI-OCR C3 Coursework on Numerical Methods
- Resource Type
-
Activity
- Tags
-
- Target Group (Age)
- 15 – 18
- Language
- English (United Kingdom)
Error
A timeout occurred. Trying to re-save …
Sorry, but the server is not responding. Please wait a few minutes and then try to save again.