{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lecture19

# lecture19 - CMPSC/MATH 451 Numerical Computations Lecture...

This preview shows pages 1–5. Sign up to view the full content.

CMPSC/MATH 451 Numerical Computations Lecture 19 October 5, 2011 Prof. Kamesh Madduri

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Class Overview Newton’s method convergence theorems Exercises Secant method 2
Nonlinear Equations Numerical Methods in One Dimension Methods for Systems of Nonlinear Equations Bisection Method Fixed-Point Iteration and Newton’s Method Additional Methods Convergence of Newton’s Method Newton’s method transforms nonlinear equation f ( x ) = 0 into ﬁxed-point problem x = g ( x ) , where g ( x ) = x - f ( x ) /f 0 ( x ) and hence g 0 ( x ) = f ( x ) f 00 ( x ) / ( f 0 ( x )) 2 If x * is simple root (i.e., f ( x * ) = 0 and f 0 ( x * ) 6 = 0 ), then g 0 ( x * ) = 0 Convergence rate of Newton’s method for simple root is therefore quadratic ( r = 2 ) But iterations must start close enough to root to converge < interactive example > Michael T. Heath Scientiﬁc Computing 27 / 55

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Nonlinear Equations Numerical Methods in One Dimension Methods for Systems of Nonlinear Equations Bisection Method Fixed-Point Iteration and Newton’s Method
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 7

lecture19 - CMPSC/MATH 451 Numerical Computations Lecture...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online