This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: x 2 = x 1 – f(x 1 ) f ’(x 1 ) Repeated application of this process is called Newton’s Method. Each successive application of this procedure is called an iteration . Newton’s Method for Approximating Newton’s Method for Approximating the Zeros of a Function the Zeros of a Function 1. Make an initial estimate x 1 that is “close to” c. (A graph is helpful.) 2. Determine a new approximation x n+1 = x n – f(x n ) f ’(x n ) 3. If x nx n+1 is within the desired accuracy, let x n+1 serve as the final approximation. Otherwise, return to step 2 and calculate a new approximation. Joke Time Joke Time Who was the dancing VicePresident in 2000? Algore rhythum What does a lumberjack do to trees? axioms...
View
Full
Document
This note was uploaded on 12/01/2011 for the course MATH 112 taught by Professor Jarvis during the Fall '08 term at BYU.
 Fall '08
 JARVIS
 Calculus

Click to edit the document details