Chebyshev Polynomials: From Approximation Theory to Algebra and Number Theory
This Secodnd Edition continues the fine tradition of its predecessor by surveying the most important properties of the Chebyshev polynomials and introducing mathematical analysis. New to this edition are approximately 80 exercises and a chapter which introduces some elementary algebraic and number theoretic properties of the Chebyshev polynomials. Additional coverage focuses on extremal and iterative properties.
15 pages matching recall Exercise in this book
Results 1-3 of 15
What people are saying - Write a review
We haven't found any reviews in the usual places.
Definitions and Some Elementary Properties
B Maximizing Linear Functionals on
6 other sections not shown
absolutely convergent Ak(f algebraic integer array of nodes Bernstein Bernstein's inequality best approximation canonical representation Chebyshev condition Chebyshev expansion Chebyshev polynomials commutes with x2 complex numbers continuous function contradiction convergent convex denned denote distinct points equality holds Equation Erdos established exists extremal for F f1 dx finite fundamental polynomials given hence Hermite interpolation Hint implies integer coefficients interpolating polynomial interval irreducible over Q leading coefficient Lebesgue constants Lemma linear functional mathematical induction minimal polynomial monic monotone increasing nonnegative norm notation nth root obtain orthogonal polynomials partial sums polynomial interpolation polynomial of degree positive primitive nth root Proof properties proved quadrature formula recall Exercise Remark result right-hand side Rolle's theorem root of unity satisfies the Chebyshev sequence Show solution subset Suppose Theorem 2.1 theory trigonometric polynomial unique extremal view of Exercise yields