The parallel QR factorization algorithm for tridiagonal linear systems
From MaRDI portal
Recommendations
Cited in
(20)- On the existence of the new quadrant interlocking factorization for parallel solution of tridiagonal linear systems
- A Parallel QR Factorization Algorithm with Controlled Local Pivoting
- scientific article; zbMATH DE number 27309 (Why is no real title available?)
- A novel parallel algorithm based on the Gram-Schmidt method for tridiagonal linear systems of equations
- Parallel solution in time of ODEs: Some achievements and perspectives
- Improved parallel QR method for large least squares problems involving Kronecker products
- Existence of the new quadrant interlocking factorization for parallel solution of tridiagonal linear systems
- scientific article; zbMATH DE number 1330403 (Why is no real title available?)
- Fast Parallel Algorithms for QR and Triangular Factorization
- A New Class of Parallel Algorithms for Solving Systems of Linear Equations
- A New Wz Factorization For Parallel Solution Of Tridiagonal Systems
- Parallel QR decomposition of a rectangular matrix
- Parallel model order reduction based on block discrete Fourier transform and Krylov subspace for parametric systems
- A new quadrant interlocking factorization for parallel solution of tridiagonal linear systems
- Parallel complexities and computations of cholesky's decomposition and QR factorization
- Parallel Factorizations for Tridiagonal Matrices
- Parallel \textit{QR} factorization of block-tridiagonal matrices
- Parallel QR Factorization of Block Low-rank Matrices
- Stabilization and experience with the partitioning method for tridiagonal systems
- scientific article; zbMATH DE number 741167 (Why is no real title available?)
This page was built for publication: The parallel QR factorization algorithm for tridiagonal linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672945)