This preview shows pages 1–5. Sign up to view the full content.
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 Document
Unformatted text preview: CMPSC/MATH 451 Numerical Computations Lecture 18 October 3, 2011 Prof. Kamesh Madduri Class Overview Fixed point iteration Local convergence Newtons method 2 Nonlinear Equations Numerical Methods in One Dimension Methods for Systems of Nonlinear Equations Bisection Method FixedPoint Iteration and Newtons Method Additional Methods FixedPoint 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 fixedpoint 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 For given equation f ( x ) = 0 , there may be many equivalent fixedpoint problems x = g ( x ) with different choices for g Michael T. Heath Scientific Computing 18 / 55 Nonlinear Equations Numerical Methods in One Dimension Methods for Systems of Nonlinear Equations Bisection Method FixedPoint Iteration and Newtons Method Additional Methods...
View
Full
Document
 Spring '08
 staff

Click to edit the document details