On the normal matrix of the polynomial LS problem over the Chebyshev points

DOI10.1016/j.laa.2003.09.002zbMath1049.65028OpenAlexW2005196902MaRDI QIDQ1826715

Paolo Pugliese

Publication date: 6 August 2004

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

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

zbMATH Keywords

polynomial approximationnumerical experimentsCholesky factorizationleast squares methodVandermonde matrix

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computation of special functions and constants, construction of tables (65D20) Approximation by polynomials (41A10) Direct numerical methods for linear systems and matrix inversion (65F05) Real polynomials: analytic properties, etc. (26C05)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast QR factorization of Vandermonde matrices
• Optimal sampling schedule for parameter estimation of linear models with unknown but bounded measurement errors
• Vandermonde matrices on integer nodes: The rectangular case
• Rectangular Vandermonde matrices on Chebyshev nodes