[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

The Relationships Between Chebyshev, Legendre and Jacobi Polynomials: The Generic Superiority of Chebyshev Polynomials and Three Important Exceptions

  • Published:
Journal of Scientific Computing Aims and scope Submit manuscript

Abstract

We analyze the asymptotic rates of convergence of Chebyshev, Legendre and Jacobi polynomials. One complication is that there are many reasonable measures of optimality as enumerated here. Another is that there are at least three exceptions to the general principle that Chebyshev polynomials give the fastest rate of convergence from the larger family of Jacobi polynomials. When \(f(x)\) is singular at one or both endpoints, all Gegenbauer polynomials (including Legendre and Chebyshev) converge equally fast at the endpoints, but Gegenbauer polynomials converge more rapidly on the interior with increasing order \(m\). For functions on the surface of the sphere, associated Legendre functions, which are proportional to Gegenbauer polynomials, are best for the latitudinal dependence. Similarly, for functions on the unit disk, Zernike polynomials, which are Jacobi polynomials in radius, are superior in rate-of-convergence to a Chebyshev–Fourier series. It is true, as was conjectured by Lanczos 60 years ago, that excluding these exceptions, the Chebyshev coefficients \(a_{n}\) usually decrease faster than the Legendre coefficients \(b_{n}\) by a factor of \(\sqrt{n}\). We calculate the proportionality constant for a few examples and restrictive classes of functions. The more precise claim that \(b_{n} \sim \sqrt{\pi /2} \sqrt{n} a_{n}\), made by Lanczos and later Fox and Parker, is true only for rather special functions. However, individual terms in the large \(n\) asymptotics of Chebyshev and Legendre coefficients usually do display this proportionality.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Alpert, B.A., Rokhlin, V.: A fast algorithm for the evaluation of Legendre expansions. SIAM J. Sci. Comput. 12, 158–179 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Askey, R.: Orthogonal Polynomials and Special Functions. SIAM, Philadelphia (1975)

    Book  Google Scholar 

  3. Beals, R., Wong, R.: Special Functions: A Graduate Text. Cambridge University Press, Cambridge (2010)

    Book  Google Scholar 

  4. Boyd, J.P.: The rate of convergence of Hermite function series. Math. Comput. 35, 1309–1316 (1980)

    Article  MATH  Google Scholar 

  5. Boyd, J.P.: The optimization of convergence for Chebyshev polynomial methods in an unbounded domain. J. Comput. Phys. 45, 43–79 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  6. Boyd, J.P.: Chebyshev and Fourier Spectral Methods, 2d edn, p. 665. Dover, Mineola, New York (2001)

    MATH  Google Scholar 

  7. Boyd, J.P.: Trouble with Gegenbauer reconstruction for defeating Gibbs’ phenomenon: Runge phenomenon in the diagonal limit of Gegenbauer polynomial approximations. J. Comput. Phys. 204, 253–264 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. Boyd, J.P.: Asymptotic Fourier coefficients for a \(c^{\infty }\) bell (Smoothed-“Top-Hat” Function) and the Fourier Extension Problem. J. Sci. Comput. 29, 1–24 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  9. Boyd, J.P.: Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding. J. Eng. Math. 56, 203–219 (2006)

    Article  MATH  Google Scholar 

  10. Boyd, J.P., Yu, F.: Comparing six spectral methods for interpolation and the Poisson equation in a disk: radial basis functions, Logan-Shepp ridge polynomials, Fourier-Bessel, Fourier-Chebyshev, Zernike polynomials, and double Chebyshev series. J. Comput. Phys. 230, 1408–1438 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  11. Cheney, E.W.: Introduction to Approximation Theory. McGraw-Hill Book Co., New York (1966)

    MATH  Google Scholar 

  12. Dai, G.-M., Mahajan, V.N.: Orthonormal polynomials in wavefront analysis: error analysis. Appl. Opt. 47, 3433–3445 (2008)

    Article  Google Scholar 

  13. Elliott, D.: The evaluation and estimation of the coefficients in the Chebyshev series expansion of a function. Math. Comput. 18, 274–284 (1964)

    Article  Google Scholar 

  14. Fox, L., Parker, I.B.: Chebyshev Polynomials in Numerical Analysis, 2nd edn. Oxford University Press, London (1972)

  15. Gasper, G., Rahman, M.: Basic Hypergeometric Series. Cambridge University Press, Cambridge (2004)

    Book  MATH  Google Scholar 

  16. Gottlieb, D., Shu, C.-W.: On the Gibbs phenomenon and its resolution. SIAM Rev. 39, 644–668 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  17. Handscomb, D.C.: The relative sizes of the terms in Chebyshev and other ultraspherical expansions. IMA J. Appl. Math. 11, 241–246 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  18. Jackson, D.: The Theory of Approximation, Vol. 11 of Colloquium Publications (American Mathematical Society). The American Mathematical Society, New York (1930)

    Google Scholar 

  19. Lanczos, C.: Introduction. In: Tables of Chebyshev polynomials \(s_{n}(x)\) and \(c_{n}(x)\). Applied Mathematics Series, Technical Report 9, 191 pp. United States Government Printing Office, Washington, DC (1952)

  20. Light, W.A.: Some optimality conditions for Chebyshev expansions. J. Approx. Theory 27, 113–126 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  21. Livermore, P.W., Jones, C.A., Worland, S.J.: Spectral radial basis functions for full sphere computations. J. Comput. Phys. 227(19), 1209–1224 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  22. Luke, Y.L.: The Special Functions and Their Approximations, vol. I & II. Academic Press, New York (1969)

    MATH  Google Scholar 

  23. Luke, Y.L.: Mathematical Functions and Their Approximations, p. 566. Academic Press, New York (1975)

    MATH  Google Scholar 

  24. Mason, J.C., Handscomb, D.C.: Chebyshev Polynomials. Chapman and Hall/CRC Press, Boca Raton, Florida (2003)

    MATH  Google Scholar 

  25. Mastroianni, G., Milovanovic, G.V.: Interpolation Processes: Basic Theory and Applications. Springer, New York (2008)

    Book  Google Scholar 

  26. Miller, G.F.: On the convergence of Chebyshev series for functions possessing a singularity in the range of representation. SIAM J. Numer. Anal. 3, 390–409 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  27. Orszag, S.A.: Fourier series on spheres. Mon. Weather Rev. 102, 56–75 (1974)

    Article  Google Scholar 

  28. Patera, A.T.: A spectral element method for fluid dynamics: laminar flow in a channel expansion. J. Comput. Phys. 54, 468–488 (1984)

    Article  MATH  Google Scholar 

  29. Petschek, R., Boyd, J.P.: Asymptotics of the coefficients of expansions in Jacobi polynomials. (2013) (to be submitted)

  30. Rivlin, T.J.: Chebyshev Polynomials From Approximation Theory to Algebra and Number Theory. Wiley, New York (1990)

    MATH  Google Scholar 

  31. Rivlin, T.J., Wilson, M.W.: An optimal property of Chebyshev expansions. J. Approx. Theory 2, 312–317 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  32. Snyder, M.A.: Chebyshev Methods in Numerical Approximation, p. 150. Prentice-Hall, Englewood Cliffs, New Jersey (1966)

    MATH  Google Scholar 

  33. Srivastava, H., Manocha, H.: A Treatise on Generating Functions. E. Horwood, New York (1984)

    MATH  Google Scholar 

  34. Szegö, G.: Orthogonal Polynomials, 2d edn. American Mathematical Society, New York (1959)

    MATH  Google Scholar 

  35. Tuan, P.D., Elliott, D.: Coefficients in series expansions for certain classes of functions. Math. Comput. 26, 213–232 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  36. Zernike, F.: Beugungstheorie des Schneidenverfahrens und seiner verbesserten Form der Phasenkontrastmethode. Physica 1, 689–704 (1934)

    Article  MATH  Google Scholar 

Download references

Acknowledgments

This work was supported by NSF Grants OCE0451951, ATM 0723440 and OCE 1059703. We thank the reviewer for helpful comments.

Author information

Authors and Affiliations

  1. Department of Atmospheric, Oceanic and Space Science, University of Michigan, 2455 Hayward Avenue, Ann Arbor, MI, 48109, USA

    John P. Boyd

  2. Department of Physics, Case Western Reserve University, Cleveland, OH, USA

    Rolfe Petschek

Authors
  1. John P. Boyd
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rolfe Petschek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to John P. Boyd.

Appendix: Lacunary Chebyshev Theorem

Appendix: Lacunary Chebyshev Theorem

Definition 1

(m-Lacunary Series) A Chebyshev series of the form

$$\begin{aligned} f(x) = \sum _{n=0}^{\infty } \, a_{n} T_{nm}(x) \end{aligned}$$
(110)

so that each nonzero Chebyshev coefficient is followed by \((m-1)\) zero coefficients is an \(m\)-lacunary series.

We must append a warning: the term “lacunary”, which is a Latin adjective that simply means “having gaps”, is often applied in mathematics in the narrow sense of a power series or Fourier series whose gaps of zero coefficients increase as a geometric progression or faster so that the sum is a “lacunary function” which cannot be analytically continued beyond a “natural boundary”.

Theorem 7

( \(m\) -Lacunary Chebyshev Series) Suppose

$$\begin{aligned} f(x) \equiv g(T_{m}(x)) \end{aligned}$$
(111)

where \(m\) is an integer and \(g(x)\) is analytic everywhere on \(x \in [-1, 1]\) with the Chebyshev series

$$\begin{aligned} g(x) \equiv \sum _{n=0}^{\infty } g_{n} T_{n}(x) \end{aligned}$$
(112)

Then all Chebyshev coefficients of \(f(x)\) whose degrees are not multipliers of \(m\) are zero. More precisely

$$\begin{aligned} f(x) \equiv \sum _{n=0}^{\infty } g_{n} T_{nm}(x) \end{aligned}$$
(113)

Proof

With the trigonometric change of coordinate, \(x=\cos (t), f(\cos (t))= g(\cos (mt))\). With the further change of coordinate \(T \equiv m t\), this becomes \(g(\cos (T))\) which, because of the analyticity of \(g\) has a nice Fourier cosine series in \(T\):

$$\begin{aligned} g(\cos (T)) \equiv \sum _{n=0}^{\infty } g_{n} \cos (nT) \end{aligned}$$
(114)

Converting this series back to \(t\) gives a Fourier series in which all terms except those whose degrees are multiples of \(m\) are missing.

$$\begin{aligned} g(\cos (mt)) \equiv \sum _{n=0}^{\infty } g_{n} \cos (nmT) \end{aligned}$$
(115)

The substitution \(T={arccos}(x)\) and recalling that \(T_{k}(x)=\cos (k {arccos}(x))\) gives the theorem. \(\square \)

A simpler version of this theorem was proved in [9]. A special case is the long-known identity \(T_{n}(T_{m}(x)) = T_{mn}(x)\).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Boyd, J.P., Petschek, R. The Relationships Between Chebyshev, Legendre and Jacobi Polynomials: The Generic Superiority of Chebyshev Polynomials and Three Important Exceptions. J Sci Comput 59, 1–27 (2014). https://doi.org/10.1007/s10915-013-9751-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10915-013-9751-7

Keywords

Mathematics Subject Classification

Search

Navigation