Numerical Algorithms

, Volume 9, Issue 1, pp 39–54 | Cite as

Constrained near-minimax approximation by weighted expansion and interpolation using Chebyshev polynomials of the second, third, and fourth kinds

  • J. C. Mason
  • G. H. Elliott


Well known results on near-minimax approximation using Chebyshev polynomials of the first kind are here extended to Chebyshev polynomials of the second, third, and fourth kinds. Specifically, polynomial approximations of degreen weighted by (1−x2)1/2, (1+x)1/2 or (1−x)1/2 are obtained as partial sums of weighted expansions in Chebyshev polynomials of the second, third, or fourth kinds, respectively, to a functionf continuous on [−1, 1] and constrained to vanish, respectively, at ±1, −1 or +1. In each case a formula for the norm of the resulting projection is determined and shown to be asymptotic to 4π−2logn +A +o(1), and this provides in each case and explicit bound on the relative closeness of a minimax approximation. The constantA that occurs for the second kind polynomial is markedly smaller, by about 0.27, than that for the third and fourth kind, while the latterA is identical to that for the first kind, where the projection norm is the classical Lebesgue constant λ n . The results on the third and fourth kind polynomials are shown to relate very closely to previous work of P.V. Galkin and of L. Brutman.

Analogous approximations are also obtained by interpolation at zeros of second, third, or fourth kind polynomials of degreen+1, and the norms of resulting projections are obtained explicitly. These are all observed to be asymptotic to 2π−1logn +B +o(1), and so near-minimax approximations are again obtained. The norms for first, third, and fourth kind projections appear to be converging to each other. However, for the second kind projection, we prove that the constantB is smaller by a quantity asymptotic to 2π−1log2, based on a conjecture about the point of attainment of the supremum defining the projection norm, and we demonstrate that the projection itself is remarkably close to a minimal (weighted) interpolation projection.

All four kinds of Chebyshev polynomials possess a weighted minimax property, and, in consequence, all the eight approximations discussed here coincide with minimax approximations when the functionf is a suitably weighted polynomial of degreen+1.


Degreen Polynomial Approximation Chebyshev Polynomial Analogous Approximation Projection Norm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    L. Brutman, On the Lebesgue function for polynomial interpolation, SIAM J. Numer. Anal. 15(4) (1978) 694–704.Google Scholar
  2. [2]
    L. Brutman, The Fourier operator of even order and its application to an extremum problem in interpolation, inAlgorithms for Approximation 2, J. C. Mason and M. G. Cox (eds.) (Chapman and Hall, London, 1990) pp. 170–176.Google Scholar
  3. [3]
    E. W. Cheney,An Introduction to Approximation Theory, (McGraw Hill, New York, 1966).Google Scholar
  4. [4]
    E.W. Cheney and K.H. Price, Minimal projections, inApproximation Theory, A. Talbot (ed.) (Academic Press, London, 1970).Google Scholar
  5. [5]
    H. Ehlich and K. Zeller, Auswertung der Normen von Interpolationsoperatoren, Math. Ann. 164 (1966) 105–112.Google Scholar
  6. [6]
    P.V. Galkin, Estimates for the Lebesgue constants, Proc. Steklov. Inst. Math. 109 (1971) 1–3.Google Scholar
  7. [7]
    W. Gautschi and S.E. Notaris, Guass-Kronrod quadrature formulae for weight functions of Berstein-Szegö type, J. Comp. Appl. Math. 25 (1989) 199–224.Google Scholar
  8. [8]
    K.O. Geddes and J.C. Mason, Polynomial approximation by projections on the unit circle, SIAM J. Numer. Anal. 12 (1975) 111–120.Google Scholar
  9. [9]
    R. Gunttner, On asymptotics for the uniform norms of Lagrangian interpolating polynomials for extended Chebyshev nodes, SIAM J. Numer. Anal. 25(2) (1988) 461–469.Google Scholar
  10. [10]
    F.W. Luttman and T.J. Rivlin, Some numerical experiments in the theory of polynomial interpolation, IBM Journal 9 (1965) 187–191.Google Scholar
  11. [11]
    J.C. Mason, Near-bestL p approximations by real and complex Chebyshev series, IMA J. Numer. Anal. 3 (1983) 493–504.Google Scholar
  12. [12]
    J.C. Mason and G.H. Elliott, Near-minimax complex approximation by four kinds of Chebyshev polynomial expansion, J. Comp. Appl. Math. 46 (1993) 291–300.Google Scholar
  13. [13]
    J.H. McCabe and G.M. Phillips, On a certain class of Lebesgue constants, BIT 13 (1973) 434–442.Google Scholar
  14. [14]
    M.J.D. Powell, On the maximum errors of polynomial approximations defined by interpolation and least squares criteria, Comp. J. 9 (1967) 404–407.Google Scholar
  15. [15]
    T. Rivlin,The Chebyshev Polynomials (Wiley-Interscience, New York, 1974).Google Scholar
  16. [16]
    G. Szegö, Über die Lebesgueschen Konstanten bei den Fourierschen Reihen, Math. Z. 9 (1921) 163–166.Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1995

Authors and Affiliations

  • J. C. Mason
    • 1
  • G. H. Elliott
    • 2
  1. 1.School of Computing and MathematicsUniversity of HuddersfieldQueensgateEngland
  2. 2.School of Mathematical StudiesUniversity of PortsmouthPortsmouthEngland

Personalised recommendations