1 / 8

Introduction to Numerical Analysis I

Introduction to Numerical Analysis I. Fixed Point Iteration. MATH/CMPSC 455. Fixed-Point Iteration. This can generate convergent or divergent sequences! Our interest lies mainly in the following case ：. Definition: The real number is a fixed point of the function if. Give .

toby
Download Presentation

Introduction to Numerical Analysis I

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Introduction to Numerical Analysis I Fixed Point Iteration MATH/CMPSC 455

  2. Fixed-Point Iteration This can generate convergent or divergent sequences! Our interestlies mainly in the following case： Definition: The real number is a fixed point of the function if

  3. Give No Converge? Yes Out put

  4. Root: Fixed Point: Example: Which one is better?

  5. Question: How can we guarantee F has a fixed point? Definition (Contractive Mapping): A mapping (or function) is said to be contractive if Theorem (Contractive Mapping Theorem): A contractive function has a unique fixed point. Moreover, the fixed point is the limit of the sequence obtained by the Fixed-Point Iteration.

  6. Example: Example: Example:

  7. Error Analysis Definition (Linear Convergence):Let denote the error at step n of a iterative method. The method is said to be obey linear convergence with rate S, if Theorem 1.6 (Linear Convergence of FPI): Assume that is continuously differentiable, that , and Then Fixed-Point Iteration converges linearly with rate to the fixed point for initial guesses sufficiently close to the fixed point.

  8. Example: Explain why the FPI converges for the following function: Example: Find the fixed points Example: Calculate by using FPI

More Related