Constrained near-minimax approximation by weighted expansion and interpolation using Chebyshev polynomials of the second, third, and fourth kinds
From MaRDI portal
Publication:1893527
DOI10.1007/BF02143926zbMath0828.65057MaRDI QIDQ1893527
Publication date: 10 January 1996
Published in: Numerical Algorithms (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical interpolation (65D05)
Related Items (3)
The combinatorial power of the companion matrix ⋮ Near-minimax complex approximation by four kinds of Chebyshev polynomial expansion ⋮ Chebyshev polynomials of the second, third and fourth kinds in approximation, indefinite integration, and integral transforms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Grauss-Kronrod quadrature formulae for weight functions of Bernstein- Szegö type
- Near-minimax complex approximation by four kinds of Chebyshev polynomial expansion
- Auswertung der Normen von Interpolationsoperatoren
- Near-best Lp Approximations by Real and Complex Chebyshev Series
- On Asymptotics for the Uniform Norms of the Lagrange Interpolation Polynomials Corresponding to Extended Chebyshev Nodes
- On the Lebesgue Function for Polynomial Interpolation
- On a certain class of Lebesgue constants
- On the Maximum Errors of Polynomial Approximations Defined by Interpolation and by Least Squares Criteria
This page was built for publication: Constrained near-minimax approximation by weighted expansion and interpolation using Chebyshev polynomials of the second, third, and fourth kinds