### Abstract

Laurent Padé-Chebyshev rational approximants, A _{m} (z,z ^{-1})/B _{n} (z,z ^{-1}), whose Laurent series expansions match that of a given function f(z,z ^{-1}) up to as high a degree in z,z ^{-1} as possible, were introduced for first kind Chebyshev polynomials by Clenshaw and Lord [2] and, using Laurent series, by Gragg and Johnson [4]. Further real and complex extensions, based mainly on trigonometric expansions, were discussed by Chisholm and Common [1]. All of these methods require knowledge of Chebyshev coefficients of f up to degree m+n. Earlier, Maehly [5] introduced Padé approximants of the same form, which matched expansions between f(z,z ^{-1})B _{n} (z,z ^{-1}) and A _{m} (z,z ^{-1}). The derivation was relatively simple but required knowledge of Chebyshev coefficients of f up to degree m+2n. In the present paper, Padé-Chebyshev approximants are developed not only to first, but also to second, third and fourth kind Chebyshev polynomial series, based throughout on Laurent series representations of the Maehly type. The procedures for developing the Padé-Chebyshev coefficients are similar to that for a traditional Padé approximant based on power series [8] but with essential modifications. By equating series coefficients and combining equations appropriately, a linear system of equations is successfully developed into two sub-systems, one for determining the denominator coefficients only and one for explicitly defining the numerator coefficients in terms of the denominator coefficients. In all cases, a type (m,n) Padé-Chebyshev approximant, of degree m in the numerator and n in the denominator, is matched to the Chebyshev series up to terms of degree m+n, based on knowledge of the Chebyshev coefficients up to degree m+2n. Numerical tests are carried out on all four Padé-Chebyshev approximants, and results are outstanding, with some formidable improvements being achieved over partial sums of Laurent-Chebyshev series on a variety of functions. In part II of this paper [7] Padé-Chebyshev approximants of Clenshaw-Lord type will be developed for the four kinds of Chebyshev series and compared with those of the Maehly type.

Language | English |
---|---|

Pages | 3-18 |

Number of pages | 16 |

Journal | Numerical Algorithms |

Volume | 38 |

Issue number | 1-3 |

DOIs | |

Publication status | Published - Mar 2005 |

### Fingerprint

### Cite this

}

*Numerical Algorithms*, vol. 38, no. 1-3, pp. 3-18. https://doi.org/10.1007/BF02810612

**Laurent-Padé approximants to four kinds of Chebyshev polynomial expansions. Part I. Maehly type approximants.** / Mason, J. C.; Crampton, A.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Laurent-Padé approximants to four kinds of Chebyshev polynomial expansions. Part I. Maehly type approximants

AU - Mason, J. C.

AU - Crampton, A.

PY - 2005/3

Y1 - 2005/3

N2 - Laurent Padé-Chebyshev rational approximants, A m (z,z -1)/B n (z,z -1), whose Laurent series expansions match that of a given function f(z,z -1) up to as high a degree in z,z -1 as possible, were introduced for first kind Chebyshev polynomials by Clenshaw and Lord [2] and, using Laurent series, by Gragg and Johnson [4]. Further real and complex extensions, based mainly on trigonometric expansions, were discussed by Chisholm and Common [1]. All of these methods require knowledge of Chebyshev coefficients of f up to degree m+n. Earlier, Maehly [5] introduced Padé approximants of the same form, which matched expansions between f(z,z -1)B n (z,z -1) and A m (z,z -1). The derivation was relatively simple but required knowledge of Chebyshev coefficients of f up to degree m+2n. In the present paper, Padé-Chebyshev approximants are developed not only to first, but also to second, third and fourth kind Chebyshev polynomial series, based throughout on Laurent series representations of the Maehly type. The procedures for developing the Padé-Chebyshev coefficients are similar to that for a traditional Padé approximant based on power series [8] but with essential modifications. By equating series coefficients and combining equations appropriately, a linear system of equations is successfully developed into two sub-systems, one for determining the denominator coefficients only and one for explicitly defining the numerator coefficients in terms of the denominator coefficients. In all cases, a type (m,n) Padé-Chebyshev approximant, of degree m in the numerator and n in the denominator, is matched to the Chebyshev series up to terms of degree m+n, based on knowledge of the Chebyshev coefficients up to degree m+2n. Numerical tests are carried out on all four Padé-Chebyshev approximants, and results are outstanding, with some formidable improvements being achieved over partial sums of Laurent-Chebyshev series on a variety of functions. In part II of this paper [7] Padé-Chebyshev approximants of Clenshaw-Lord type will be developed for the four kinds of Chebyshev series and compared with those of the Maehly type.

AB - Laurent Padé-Chebyshev rational approximants, A m (z,z -1)/B n (z,z -1), whose Laurent series expansions match that of a given function f(z,z -1) up to as high a degree in z,z -1 as possible, were introduced for first kind Chebyshev polynomials by Clenshaw and Lord [2] and, using Laurent series, by Gragg and Johnson [4]. Further real and complex extensions, based mainly on trigonometric expansions, were discussed by Chisholm and Common [1]. All of these methods require knowledge of Chebyshev coefficients of f up to degree m+n. Earlier, Maehly [5] introduced Padé approximants of the same form, which matched expansions between f(z,z -1)B n (z,z -1) and A m (z,z -1). The derivation was relatively simple but required knowledge of Chebyshev coefficients of f up to degree m+2n. In the present paper, Padé-Chebyshev approximants are developed not only to first, but also to second, third and fourth kind Chebyshev polynomial series, based throughout on Laurent series representations of the Maehly type. The procedures for developing the Padé-Chebyshev coefficients are similar to that for a traditional Padé approximant based on power series [8] but with essential modifications. By equating series coefficients and combining equations appropriately, a linear system of equations is successfully developed into two sub-systems, one for determining the denominator coefficients only and one for explicitly defining the numerator coefficients in terms of the denominator coefficients. In all cases, a type (m,n) Padé-Chebyshev approximant, of degree m in the numerator and n in the denominator, is matched to the Chebyshev series up to terms of degree m+n, based on knowledge of the Chebyshev coefficients up to degree m+2n. Numerical tests are carried out on all four Padé-Chebyshev approximants, and results are outstanding, with some formidable improvements being achieved over partial sums of Laurent-Chebyshev series on a variety of functions. In part II of this paper [7] Padé-Chebyshev approximants of Clenshaw-Lord type will be developed for the four kinds of Chebyshev series and compared with those of the Maehly type.

KW - Chebyshev series

KW - Chebyshev-Padé approximant

KW - End-point singularities

KW - Laurent series

KW - Laurent-Padé approximant

KW - Maehly approximant

UR - http://www.scopus.com/inward/record.url?scp=23944438226&partnerID=8YFLogxK

U2 - 10.1007/BF02810612

DO - 10.1007/BF02810612

M3 - Article

VL - 38

SP - 3

EP - 18

JO - Numerical Algorithms

T2 - Numerical Algorithms

JF - Numerical Algorithms

SN - 1017-1398

IS - 1-3

ER -