CS205A hw5_solutions

Scientific Computing

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

View Full Document Right Arrow Icon
CS205 Homework #5 Solutions Problem 1 [Heath 5.5, p.248] 1. Show that the iterative method x k +1 = x k - 1 f ( x k ) - x k f ( x k - 1 ) f ( x k ) - f ( x k - 1 ) is mathematically equivalent to the secant method for solving a scalar nonlinear equa- tion f ( x ) = 0. 2. When implemented in finite-precision floating-point arithmetic, what advantages or disadvantages does the formula given in part (1) have compared with the formula for the secant method (given in the notes and in Heath, section 5.5.4)? Solutions 1. Starting with the secant method update formula is given as x k +1 = x k - f ( x k )( x k - x k - 1 ) f ( x k ) - f ( x k - 1 ) = x k ( f ( x k ) - f ( x k - 1 )) - f ( x k )( x k - x k - 1 ) f ( x k ) - f ( x k - 1 ) = x k f ( x k ) - x k f ( x k - 1 ) - x k f ( x k ) + x k - 1 f ( x k ) f ( x k ) - f ( x k - 1 ) = x k - 1 f ( x k ) - x k f ( x k - 1 ) f ( x k ) - f ( x k - 1 ) 2. When we’re near the solution x k - 1 and x k are close to each other and thus their difference is near zero. Similarly f ( x k - 1 ) and f ( x k ) are close to each other so their difference is near zero. Thus we have an indefinite form in secant computing ( x k - x k - 1 ) / ( f
Background image of page 1

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

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 4

CS205A hw5_solutions - CS205 Homework#5 Solutions Problem...

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

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