Fast QR factorization of Vandermonde matrices

DOI10.1016/0024-3795(89)90652-6MaRDI QIDQ1263232zbMATH OpenOpenAlexFDO

Authors 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

fast algorithmCholesky factorizationcomplexitynormal equationsleast squares solutionVandermonde matrixQR factorizationexponential mode fittingHilbert type matrixProny's two step algorithm

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3116984 (Why is no real title available?)
• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• scientific article; zbMATH DE number 3054885 (Why is no real title available?)
• A General Orthogonalization Technique with Applications to Time Series Analysis and Signal Processing
• 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

Cited in

(15)

• \textsc{mxpfit}: a library for finding optimal multi-exponential approximations
• Symbiosis between linear algebra and optimization
• Deterministic sparse FFT for M-sparse vectors
• Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes
• Rectangular Vandermonde matrices on Chebyshev nodes
• Fast qz decomposition and its applications
• Bernstein Bézoutians and application to intersection problems
• The Gramian expression of a Vandermonde matrix on symmetric points
• 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
• Fast factorization of rectangular Vandermonde matrices with Chebyshev nodes
• 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)