{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lecture18

# lecture18 - 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 18 October 3, 2011 Prof. Kamesh Madduri

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

View Full Document
Class Overview Fixed point iteration Local convergence Newton’s 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 Fixed-Point Problems Fixed point of given function g : R R is value x such that x = g ( x ) Many iterative methods for solving nonlinear equations use fixed-point iteration scheme of form x k +1 = g ( x k ) where fixed points for g are solutions for f ( x ) = 0 Also called functional iteration , since function g is applied repeatedly to initial starting value x 0 For given equation f ( x ) = 0 , there may be many equivalent fixed-point problems x = g ( x ) with different choices for g Michael T. Heath Scientific Computing 18 / 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 / 11

lecture18 - 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