Fast QR factorization of low-rank changes of Vandermonde-like matrices

DOI10.1007/S100920050019MaRDI QIDQ1294068zbMATH OpenOpenAlexFDO

Authors Luca Genignani

Publication date 11 January 2000

Published in Calcolo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s100920050019

zbMATH Keywords

Vandermonde matricesRemez algorithmleast-squares problemsLanczos-type methodsinverse QR factorization

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Recommendations

• Fast QR factorization of Vandermonde matrices
• Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
• Fast factorization of rectangular Vandermonde matrices with Chebyshev nodes
• Fast inversion of Vandermonde-like matrices involving orthogonal polynomials

Cited in

(6)

• Fast QR factorization of Vandermonde matrices
• The fast generalized Parker-Traub algorithm for inversion of Vandermonde and related matrices
• Computing approximate Fekete points by QR factorizations of Vandermonde matrices
• QR factorization of confluent Vandermonde matrices
• Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
• Fast least squares estimation of amplitude and phase of damped cosines

This page was built for publication: Fast QR factorization of low-rank changes of Vandermonde-like matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294068)