Fast QR factorization of Vandermonde matrices

DOI10.1016/0024-3795(89)90652-6zbMath0687.65025MaRDI QIDQ1263232

Cèdric J. Demeure

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

zbMATH Keywords

complexity; Cholesky factorization; fast algorithm; normal equations; Vandermonde matrix; QR factorization; least squares solution; exponential mode fitting; Hilbert type matrix; Prony's two step algorithm

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

65F20: Numerical solutions to overdetermined systems, pseudoinverses

65F10: Iterative numerical methods for linear systems

65F05: Direct numerical methods for linear systems and matrix inversion

Related Items

Rectangular Vandermonde matrices on Chebyshev nodes, Bernstein Bézoutians and application to intersection problems, Complexity reduction of least squares problems involving special Vandermonde matrices, Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes, Symbiosis between linear algebra and optimization, On the normal matrix of the polynomial LS problem over the Chebyshev points, The Gramian expression of a Vandermonde matrix on symmetric points

Cites Work

• Linear complexity parallel algorithms for linear systems of equations with recursive structure
• Algebraic methods for Toeplitz-like matrices and operators
• Efficient solution of linear systems of equations with recursive structure
• A General Orthogonalization Technique with Applications to Time Series Analysis and Signal Processing
• Unnamed Item
• Unnamed Item
• Unnamed Item