Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
From MaRDI portal
Publication:3977064
DOI10.1137/0612041zbMath0739.65024OpenAlexW2046806661MaRDI QIDQ3977064
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
algorithmorthogonal polynomialsdiscrete inner productinverse eigenvalue problemVandermonde matrixGivens rotationsoverdetermined systems\(QR\) factorization
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Algorithms for approximation of functions (65D15) Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonalization in numerical linear algebra (65F25)
Related Items
Orthogonal polyanalytic polynomials and normal matrices ⋮ Discrete linearized least-squares rational approximation on the unit circle ⋮ Construction of polynomials that are orthogonal with respect to a discrete bilinear form ⋮ On sensitivity of Gauss-Christoffel quadrature ⋮ Quantum QR decomposition in the computational basis ⋮ Recurrence relations for orthogonal rational functions ⋮ On generating Sobolev orthogonal polynomials ⋮ A method to compute recurrence relation coefficients for bivariate orthogonal polynomials by unitary matrix transformations ⋮ Complexity reduction of least squares problems involving special Vandermonde matrices ⋮ Downdating of Szegö polynomials and data-fitting applications ⋮ A parallel algorithm for discrete least squares rational approximation ⋮ Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices ⋮ Computation of Gauss-type quadrature formulas ⋮ The Gramian expression of a Vandermonde matrix on symmetric points ⋮ Orthonormal rational function vectors ⋮ Structural and computational properties of possibly singular semiseparable matrices ⋮ Generation of orthogonal rational functions by procedures for structured matrices
