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

DOI10.1016/J.LAA.2006.11.014MaRDI QIDQ875008zbMATH OpenOpenAlexFDO

Authors A. 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

Cholesky factorizationalgorithmnumerical experimentspolynomial approximationcombinatorial identitiesleast squares approximationChebyshev extrema nodes

Mathematics Subject Classification ID

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

Recommendations

• On the normal matrix of the polynomial LS problem over the Chebyshev points
• Vector Orthogonal Polynomials and Least Squares Approximation
• On numerical methods for discrete least-squares approximation by trigonometric polynomials
• scientific article; zbMATH DE number 811973
• Discrete Least Squares Approximation by Trigonometric Polynomials

Cites work

• scientific article; zbMATH DE number 486467 (Why is no real title available?)
• scientific article; zbMATH DE number 638126 (Why is no real title available?)
• scientific article; zbMATH DE number 1083107 (Why is no real title available?)
• scientific article; zbMATH DE number 2107939 (Why is no real title available?)
• scientific article; zbMATH DE number 852536 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3407003 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Fast QR factorization of Vandermonde matrices
• On the normal matrix of the polynomial LS problem over the Chebyshev points
• Rectangular Vandermonde matrices on Chebyshev nodes
• The special functions and their approximations. Vol. I, II
• Vandermonde systems on Gauss-Lobatto Chebyshev nodes

Cited in

(5)

• Constrained near-minimax approximation by weighted expansion and interpolation using Chebyshev polynomials of the second, third, and fourth kinds
• Explicit solution of the finite time \(L_{2}\)-norm polynomial approximation problem
• Gauss-Lobatto to Bernstein polynomials transformation
• An optimized iterative method for numerical solution of large systems of equations based on the extremal property of zeroes of Chebyshev polynomials
• On the normal matrix of the polynomial LS problem over the Chebyshev points

Describes a project that uses

Uses Software

• Mathematica
• OPQ

This page was built for publication: Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875008)