Complexity reduction of least squares problems involving special Vandermonde matrices

DOI10.1007/BF02127697zbMath0868.65020MaRDI QIDQ675689

T. Tommasini

Publication date: 18 August 1997

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmVandermonde matrixleast squares problemsQR factorizationcomplexity reduction

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items (1)

The Gramian expression of a Vandermonde matrix on symmetric points

Cites Work

• Norms of analytic interpolation projections on general domains
• Perturbation bounds for the Cholesky and QR factorizations
• Kronecker products and coupled matrix Riccati differential systems
• The block decomposition of a Vandermonde matrix and its applications
• A new algorithm for special Vandermonde systems
• Fast QR factorization of Vandermonde matrices
• Discrete Least Squares Approximation by Trigonometric Polynomials
• Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation

This page was built for publication: Complexity reduction of least squares problems involving special Vandermonde matrices