Download presentation
Presentation is loading. Please wait.
1
4 Interpolation and Polynomial Approximation
Pade Approximation Numerical Methods Dr. Lai Shengjian Research Building 710#, UESTC
2
Pade Approximations The notion of rational approximations for ๐(๐) that will be approximated over a small portion of its domain. A rational approximation to ๐(๐) on [๐,๐] is the quotient of two polynomial ๐ท ๐ต (๐) and ๐ธ ๐ด ๐ Goal is to make the maximum error as small as possible. The method of pade requires that ๐(๐) and its derivative be continuous at ๐= ๐. The rational function ๐น ๐ต,๐ด (๐) has N+M+1 unknown coefficients. Assume ๐(๐) is analytic and has the Maclaurin expansiong Form the difference ๐ ๐ ๐ธ ๐ด ๐ โ ๐ท ๐ต ๐ =๐(๐)
3
Pade Approximations The lower index j=M+N+1 in the summation on the right side of Eq. because the first N+M derivatives of ๐(๐) and ๐น ๐ต,๐ด (๐) are to agree at ๐=๐. Set equal to zero for k=0,1,2,โฆ,N+M to obtain N+M+1 linear equations.
4
Pade Approximations Ex Establish the Pade approximation ๐น ๐,๐ (๐) over [โ๐,๐] Simplify the computations if we start with ๐ ๐ =๐๐๐( ๐ ๐/๐ )
5
Continued Fraction Form
6
Continued Fraction Form
Ex The pade requires a minimum of 12 arithmetic operations to perform an evaluation. How to reduce this number to seven by the use of continued fractions.
7
Continued Fraction Form
Compare ๐น ๐,๐ (๐) with the Taylor polynomial ๐ท ๐ (๐) of degree ๐ต=๐
8
Excercise Homework Exercises P174 4 Program (Report4: ๆๅผไธๅค้กนๅผ้ผ่ฟ็ๆฐๅผ่ฎก็ฎๆนๆณๅฎ้ช) Algorithm4.1.3 P139 1; Algorithm4.3.5 P154 2; Algorithm P170 6,7; Algorithm4.6.3 P175 1,3 Report File Format: ๅญฆๅท_ๅงๅ_report4.doc Upload the Online Class(ไบๅจๆๅญฆ็ฉบ้ด๏ ็ฝ็ปๅญฆๅ ๏ ็ฉ็ๅญฆ ้ข๏ ๆฐๅผ่ฎก็ฎๆนๆณ).
Similar presentations
© 2024 SlidePlayer.com Inc.
All rights reserved.