Complexity reduction of least squares problems involving special Vandermonde matrices
From MaRDI portal
Publication:675689
DOI10.1007/BF02127697zbMATH Open0868.65020MaRDI QIDQ675689FDOQ675689
Publication date: 18 August 1997
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Recommendations
- scientific article
- Optimization of the determinant of the Vandermonde matrix and related matrices
- Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
- scientific article
- Optimally Conditioned Vandermonde-Like Matrices
- On low-complexity approximation of matrices
- Publication:3468531
- On the arithmetic operational complexity for solving Vandermonde linear equations
- A new complexity bound for the least-squares problem
- Fast Solution of Confluent Vandermonde Linear Systems
Cites Work
- A new algorithm for special Vandermonde systems
- Kronecker products and coupled matrix Riccati differential systems
- Perturbation bounds for the Cholesky and QR factorizations
- Fast QR factorization of Vandermonde matrices
- Discrete Least Squares Approximation by Trigonometric Polynomials
- The block decomposition of a Vandermonde matrix and its applications
- Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
- Norms of analytic interpolation projections on general domains
Cited In (5)
This page was built for publication: Complexity reduction of least squares problems involving special Vandermonde matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675689)
