Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes

DOI10.1016/j.laa.2006.11.014zbMath1123.65056OpenAlexW2111326439MaRDI QIDQ875008

Alfredo Eisinberg, Giuseppe Fedele

Publication date: 10 April 2007

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2006.11.014

zbMATH Keywords

algorithmcombinatorial identitiespolynomial approximationnumerical experimentsCholesky factorizationleast squares approximationChebyshev extrema nodes

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Algorithms for approximation of functions (65D15)

Related Items

Gauss-Lobatto to Bernstein polynomials transformation

Uses Software

• Mathematica
• OPQ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast QR factorization of Vandermonde matrices
• On the normal matrix of the polynomial LS problem over the Chebyshev points
• The special functions and their approximations. Vol. I, II
• Vandermonde systems on Gauss-Lobatto Chebyshev nodes
• Rectangular Vandermonde matrices on Chebyshev nodes