Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation

DOI10.1137/0612041zbMATH Open0739.65024OpenAlexW2046806661MaRDI QIDQ3977064FDOQ3977064

Authors: Lothar Reichel 

Publication date: 25 June 1992

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0612041

Recommendations

• Fast factorization of rectangular Vandermonde matrices with Chebyshev nodes
• Fast inversion of Vandermonde-like matrices involving orthogonal polynomials
• Publication:4938056
• Fast QR factorization of low-rank changes of Vandermonde-like matrices
• Vandermonde with Arnoldi

zbMATH Keywords

algorithmVandermonde matrixinverse eigenvalue problemorthogonal polynomialsGivens rotationsoverdetermined systems\(QR\) factorizationdiscrete inner product

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Algorithms for approximation of functions (65D15) Orthogonalization in numerical linear algebra (65F25)

Cited In (26)

• Construction of polynomials that are orthogonal with respect to a discrete bilinear form
• Generation of orthogonal rational functions by procedures for structured matrices
• Structural and computational properties of possibly singular semiseparable matrices
• Fast qz decomposition and its applications
• Fast QR factorization of Vandermonde matrices
• Downdating of Szegö polynomials and data-fitting applications
• Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices
• Algorithms for Modifying Recurrence Relations of Orthogonal Polynomial and Rational Functions when Changing the Discrete Inner Product
• The Gramian expression of a Vandermonde matrix on symmetric points
• On sensitivity of Gauss-Christoffel quadrature
• Computing approximate Fekete points by QR factorizations of Vandermonde matrices
• Computation of Gauss-type quadrature formulas
• A method to compute recurrence relation coefficients for bivariate orthogonal polynomials by unitary matrix transformations
• Quantum QR decomposition in the computational basis
• On generating Sobolev orthogonal polynomials
• Title not available (Why is that?)
• VDR decomposition of Chebyshev-Vandermonde matrices with the Arnoldi Process
• Recurrence relations for orthogonal rational functions
• A parallel algorithm for discrete least squares rational approximation
• Orthogonal polyanalytic polynomials and normal matrices
• Fast least squares estimation of amplitude and phase of damped cosines
• Orthonormal rational function vectors
• Title not available (Why is that?)
• Discrete linearized least-squares rational approximation on the unit circle
• 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 Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation

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