Fast Inverse QR Factorization for Toeplitz Matrices
DOI10.1137/0914070zbMATH Open0788.65051OpenAlexW2074911480MaRDI QIDQ4271102FDOQ4271102
Authors: James G. Nagy 
Publication date: 9 January 1994
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0914070
Recommendations
- A fast algorithm for \({\mathcal Q}{\mathcal R}^{-1}\) factorization of Toeplitz matrices
- scientific article; zbMATH DE number 857679
- An Efficient Algorithm for the Regularization of Ill-Conditioned Least Squares Problems with Triangular Toeplitz Matrix
- Fast Parallel Algorithms for QR and Triangular Factorization
- scientific article; zbMATH DE number 2151323
regularizationCholesky decompositionill-conditioned problemsleast squares problemToeplitz matricesparallel implementationGivens rotationoperations countfast QR factorization algorithms
Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Orthogonalization in numerical linear algebra (65F25)
Cited In (9)
- QR factorization for the regularized least squares problem on hypercubes
- Title not available (Why is that?)
- Fast Triangular Factorization and Inversion of Hermitian, Toeplitz, and Related Matrices with Arbitrary Rank Profile
- Fast Toeplitz Orthogonalization Using Inner Products
- Stability analysis of a general Toeplitz system solver
- Title not available (Why is that?)
- Construction of Periodic Prolate Spheroidal Wavelets Using Interpolation
- Fast inverse Cholesky decomposition for rectangular Toeplitz-block matrix
- An Efficient Algorithm for the Regularization of Ill-Conditioned Least Squares Problems with Triangular Toeplitz Matrix
This page was built for publication: Fast Inverse $QR$ Factorization for Toeplitz Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4271102)
