Complexity reduction of least squares problems involving special Vandermonde matrices
From MaRDI portal
Publication:675689
Recommendations
- scientific article; zbMATH DE number 5670956
- 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; zbMATH DE number 4159337
- 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
- Discrete Least Squares Approximation by Trigonometric Polynomials
- Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
- Fast QR factorization of Vandermonde matrices
- Kronecker products and coupled matrix Riccati differential systems
- Norms of analytic interpolation projections on general domains
- Perturbation bounds for the Cholesky and QR factorizations
- The block decomposition of a Vandermonde matrix and its applications
Cited in
(6)- On least squares problems with certain Vandermonde-Khatri-Rao structure with applications to DMD
- Fast least squares estimation of amplitude and phase of damped cosines
- The Gramian expression of a Vandermonde matrix on symmetric points
- QR factorization of confluent Vandermonde matrices
- Fast QR factorization of Vandermonde matrices
- scientific article; zbMATH DE number 5670956 (Why is no real title available?)
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)
