Fast block Toeplitz orthogonalization
From MaRDI portal
Recommendations
Cites work
- A fast but unstable orthogonal triangularization technique for Toeplitz matrices
- A lattice algorithm for factoring the spectrum of a moving average process
- An Error Analysis of a Method for Solving Matrix Equations
- Fast Toeplitz orthogonalization
- Fast projection methods for minimal design problems in linear system theory
- Methods for Modifying Matrix Factorizations
- QR factorization of Toeplitz matrices
- Recursive Algorithms for the Matrix Pade Problem
Cited in
(15)- Hybrid algorithm for fast Toeplitz orthogonalization
- A limit result concerning the \(QR\) factorization of banded Toeplitz matrices
- Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems
- Fast Toeplitz Orthogonalization Using Inner Products
- Fast parallel QR decomposition of block-Toeplitz matrices
- scientific article; zbMATH DE number 857679 (Why is no real title available?)
- QR factorization of Toeplitz matrices
- Fast inverse Cholesky decomposition for rectangular Toeplitz-block matrix
- Updating the QR decomposition of block tridiagonal and block Hessenberg matrices
- Fast orthogonal decomposition of rank deficient Toeplitz matrices
- A fast but unstable orthogonal triangularization technique for Toeplitz matrices
- Fast algorithms for computing QR and Cholesky factors of Toeplitz operators
- The WY Representation for Products of Householder Matrices
- Fast cholesky factorization algorithm for s. p. d block-Toeplitz matrices
- Fast algorithm for \(R\) of QR decomposition of block-Toeplitz matrices
This page was built for publication: Fast block Toeplitz orthogonalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911220)