Fast parallel QR decomposition of block-Toeplitz matrices
From MaRDI portal
Recommendations
Cites work
- A Property of Euclid’s Algorithm and an Application to Padé Approximation
- Displacement ranks of matrices and linear equations
- Fast block Toeplitz orthogonalization
- Fast Parallel Algorithms for QR and Triangular Factorization
- Fast Toeplitz orthogonalization
- Generalized Displacement Structure for Block-Toeplitz, Toeplitz-Block, and Toeplitz-Derived Matrices
- Hyperbolic Householder Algorithms for Factoring Structured Matrices
- Hyperbolic Householder Transforms
- Numerical Aspects of Recursive Realization Algorithms
Cited in
(13)- Parallel QR decomposition of a rectangular matrix
- Fast orthogonal decomposition of rank deficient Toeplitz matrices
- A fast but unstable orthogonal triangularization technique for Toeplitz matrices
- An LDU decomposition algorithm for a block Toeplitz matrix having a parallel and pipelined computing structure
- Fast algorithm for R of QR decomposition of block-Toeplitz matrices
- Fast inverse Cholesky decomposition for rectangular Toeplitz-block matrix
- scientific article; zbMATH DE number 1180525 (Why is no real title available?)
- Fast cholesky factorization algorithm for s. p. d block-Toeplitz matrices
- scientific article; zbMATH DE number 833735 (Why is no real title available?)
- scientific article; zbMATH DE number 857679 (Why is no real title available?)
- Fast qz decomposition and its applications
- Parallel QR Factorization of Block Low-rank Matrices
- Fast block Toeplitz orthogonalization
This page was built for publication: Fast parallel QR decomposition of block-Toeplitz matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4234391)
