lecture16 - Michael T. Heath Scientic Computing 10 / 55...

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

View Full Document Right Arrow Icon
CMPSC/MATH 451 Numerical Computations Lecture 16 September 28, 2011 Prof. Kamesh Madduri
Background image of page 1

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

View Full DocumentRight Arrow Icon
This class I handed out graded midterm exams I went over exam solutions in class (I will post the solutions in the “exam” folder on Angel) Non-linear equations Conditioning, absolute condition number 2
Background image of page 2
Nonlinear Equations Numerical Methods in One Dimension Methods for Systems of Nonlinear Equations Nonlinear Equations Solutions and Sensitivity Convergence Sensitivity and Conditioning Conditioning of root finding problem is opposite to that for evaluating function Absolute condition number of root finding problem for root x * of f : R R is 1 / | f 0 ( x * ) | Root is ill-conditioned if tangent line is nearly horizontal In particular, multiple root ( m > 1 ) is ill-conditioned Absolute condition number of root finding problem for root x * of f : R n R n is k J - 1 f ( x * ) k , where J f is Jacobian matrix of f , { J f ( x ) } ij = ∂f i ( x ) /∂x j Root is ill-conditioned if Jacobian matrix is nearly singular
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Michael T. Heath Scientic Computing 10 / 55 Nonlinear Equations Numerical Methods in One Dimension Methods for Systems of Nonlinear Equations Nonlinear Equations Solutions and Sensitivity Convergence Sensitivity and Conditioning Michael T. Heath Scientic Computing 11 / 55 Nonlinear Equations Numerical Methods in One Dimension Methods for Systems of Nonlinear Equations Nonlinear Equations Solutions and Sensitivity Convergence Sensitivity and Conditioning What do we mean by approximate solution x to nonlinear system, k f ( x ) k or k x-x * k 0 ? First corresponds to small residual, second measures closeness to (usually unknown) true solution x * Solution criteria are not necessarily small simultaneously Small residual implies accurate solution only if problem is well-conditioned Michael T. Heath Scientic Computing 12 / 55...
View Full Document

This note was uploaded on 01/19/2012 for the course CMPSC 451 taught by Professor Staff during the Spring '08 term at Pennsylvania State University, University Park.

Page1 / 5

lecture16 - Michael T. Heath Scientic Computing 10 / 55...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online