Fast QR factorization of Vandermonde matrices
DOI10.1016/0024-3795(89)90652-6zbMATH Open0687.65025OpenAlexW1972706155MaRDI QIDQ1263232FDOQ1263232
Publication date: 1989
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(89)90652-6
Recommendations
- Fast QR factorization of low-rank changes of Vandermonde-like matrices
- scientific article; zbMATH DE number 2206698
- QR factorization of confluent Vandermonde matrices
- Complexity reduction of least squares problems involving special Vandermonde matrices
- Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
fast algorithmCholesky factorizationcomplexitynormal equationsleast squares solutionVandermonde matrixQR factorizationexponential mode fittingHilbert type matrixProny's two step algorithm
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Analysis of algorithms and problem complexity (68Q25) Iterative numerical methods for linear systems (65F10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic methods for Toeplitz-like matrices and operators
- Efficient solution of linear systems of equations with recursive structure
- Linear complexity parallel algorithms for linear systems of equations with recursive structure
- A General Orthogonalization Technique with Applications to Time Series Analysis and Signal Processing
Cited In (14)
- \textsc{mxpfit}: a library for finding optimal multi-exponential approximations
- Symbiosis between linear algebra and optimization
- Deterministic sparse FFT for \(M\)-sparse vectors
- Rectangular Vandermonde matrices on Chebyshev nodes
- Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes
- Fast qz decomposition and its applications
- The Gramian expression of a Vandermonde matrix on symmetric points
- Bernstein Bézoutians and application to intersection problems
- Deterministic sparse sublinear FFT with improved numerical stability
- Computing approximate Fekete points by QR factorizations of Vandermonde matrices
- On the normal matrix of the polynomial LS problem over the Chebyshev points
- QR factorization of confluent Vandermonde matrices
- Fast least squares estimation of amplitude and phase of damped cosines
- Complexity reduction of least squares problems involving special Vandermonde matrices
This page was built for publication: Fast QR factorization of Vandermonde matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1263232)
