Fast orthogonal decomposition of rank deficient Toeplitz matrices
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3902535 (Why is no real title available?)
- A General Orthogonalization Technique with Applications to Time Series Analysis and Signal Processing
- A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
- Fast Toeplitz Orthogonalization Using Inner Products
- Fast Toeplitz orthogonalization
- QR factorization of Toeplitz matrices
- Rang revealing QR factorizations
- Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
- The numerical stability of the lattice algorithm for least squares linear prediction problems
Cited in
(7)- Symbiosis between linear algebra and optimization
- Full rank Cholesky factorization for rank deficient matrices
- Stability analysis of a general Toeplitz system solver
- High performance algorithms for Toeplitz and block Toeplitz matrices
- Fast matrix decomposition in \(\mathbb F_2\)
- Orthogonalization Via Deflation: A Minimum Norm Approach for Low-Rank Approximations of a Matrix
- Rank properties of a sequence of block bidiagonal Toeplitz matrices
This page was built for publication: Fast orthogonal decomposition of rank deficient Toeplitz matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208061)