CSC_349_HANDOUT#10

# CSC_349_HANDOUT#10 - COMPUTER SCIENCE 349A Handout Number...

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

COMPUTER SCIENCE 349A Handout Number 10 QUADRATIC CONVERGENCE OF NEWTON'S METHOD The following result is proved on p. 141 of the 5 th ed. (p. 150 of the 6 th ed.) Theorem If Newton's method is applied to 0 ) ( = x f producing a sequence {} i x that converges to a root t x and if 0 ) ( t x f , then the order of convergence is 2. If 0 ) ( = t x f and Newton's method converges to a root t x , then we will see later that the order of convergence is NOT quadratic. Example 1. An illustration of quadratic convergence of Newton’s method. Here x x x f = cos ) ( . This was computed in MATLAB, so at most 16 correct digits are possible. The underlined digits are all correct. i i x no. of correct digits ______ _________________________ ________________ 0 = 4 π 0.7 853 98 1 1 0.739 5 361 3 2 0.7390 851 7 81 7 3 0.7390 8513 3215 16 11 14 4 0.7390 8513 3215 1607 16 Example 2 . The following illustrates the possible effect of a poor initial approximation with Newton's method, yet the eventual characteristic quadratic convergence. Here

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 12/10/2011 for the course CSC 349 taught by Professor Oadje during the Spring '11 term at University of Victoria.

### Page1 / 2

CSC_349_HANDOUT#10 - COMPUTER SCIENCE 349A Handout Number...

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

View Full Document
Ask a homework question - tutors are online