Parallel reduction of banded matrices to bidiagonal form
From MaRDI portal
Recommendations
- Efficient parallel reduction to bidiagonal form.
- scientific article; zbMATH DE number 1330401
- Orthogonal reduction of dense matrices to bidiagonal form on computers with distributed memory architectures
- Parallel Bidiagonalization of a Dense Matrix
- A Parallel Algorithm for Reducing Symmetric Banded Matrices to Tridiagonal Form
Cited in
(13)- scientific article; zbMATH DE number 3878239 (Why is no real title available?)
- An input/output efficient algorithm for Hessenberg reduction
- Algorithms for Hessenberg-triangular reduction of Fiedler linearization of matrix polynomials
- Cache efficient bidiagonalization using BLAS 2.5 operators
- Parallel Bidiagonalization of a Dense Matrix
- Parallel tri- and bi-diagonalization of bordered bidiagonal matrices
- Simultaneous multidiagonalization for the CS decomposition
- scientific article; zbMATH DE number 2110457 (Why is no real title available?)
- Algorithm 841: BHESS: Gaussian reduction to a similar banded Hessenberg form
- The singular value decomposition: anatomy of optimizing an algorithm for extreme scale
- Orthogonal reduction of dense matrices to bidiagonal form on computers with distributed memory architectures
- A Parallel Algorithm for Reducing Symmetric Banded Matrices to Tridiagonal Form
- Efficient parallel reduction to bidiagonal form.
This page was built for publication: Parallel reduction of banded matrices to bidiagonal form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672098)
