Parallel Bidiagonalization of a Dense Matrix
From MaRDI portal
Recommendations
- Orthogonal reduction of dense matrices to bidiagonal form on computers with distributed memory architectures
- Efficient parallel reduction to bidiagonal form.
- Parallel reduction of banded matrices to bidiagonal form
- Block and Parallel Versions of One-Sided Bidiagonalization
- A new stable bidiagonal reduction algorithm
Cited in
(13)- Orthogonal reduction of dense matrices to bidiagonal form on computers with distributed memory architectures
- Parallel tri- and bi-diagonalization of bordered bidiagonal matrices
- An efficient and accurate parallel algorithm for the singular value problem of bidiagonal matrices
- The design of a parallel dense linear algebra software library: Reduction to Hessenberg, tridiagonal, and bidiagonal form
- Efficient parallel reduction to bidiagonal form.
- High-performance bidiagonal reduction using tile algorithms on homogeneous multicore architectures
- Block and Parallel Versions of One-Sided Bidiagonalization
- Cache efficient bidiagonalization using BLAS 2.5 operators
- scientific article; zbMATH DE number 4001323 (Why is no real title available?)
- scientific article; zbMATH DE number 2110457 (Why is no real title available?)
- scientific article; zbMATH DE number 833649 (Why is no real title available?)
- Parallel reduction of banded matrices to bidiagonal form
- A robust and efficient parallel SVD solver based on restarted Lanczos bidiagonalization
This page was built for publication: Parallel Bidiagonalization of a Dense Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3516130)
