Description of extremal polynomials on several intervals and their computation. I

F. Peherstorfer, K. Schiefermayr

Research output: Contribution to journalArticlepeer-review

19 Citations (Scopus)

Abstract

Let El = ∪j=1l [a2j-i , a2j], a1 < a2 < ... < a2l. First we give a complete characterization of that polynomial of degree n which has n + l extremal points on El. Such a polynomial is called T-polynomial because it shares many properties with the classical Chebyshev polynomial on [-1, 1], e.g., it is minimal with respect to the maximum norm on El, its derivative is minimal with respect to the L1-norm on El, etc. It is known that T-polynomials do not exist on every El. Then it is demonstrated how to generate in a very simple illustrative geometric way from a T-polynomial on l intervals a T-polynomial on l or more intervals. For the case of two and three intervals a complete description of those intervals on which there exists a T-polynomial is provided. Finally, we show how to compute T-polynomials by Newton's method.

Original languageEnglish
Pages (from-to)27-58
Number of pages32
JournalActa Mathematica Hungarica
Volume83
Issue number1-2
Publication statusPublished - Apr 1999
Externally publishedYes

Fingerprint Dive into the research topics of 'Description of extremal polynomials on several intervals and their computation. I'. Together they form a unique fingerprint.

Cite this