The design and implementation of the MRRR algorithm
From MaRDI portal
Recommendations
Cited in
(19)- Glued Matrices and the MRRR Algorithm
- Localization in matrix computations: theory and applications
- Fast computation of spectral projectors of banded matrices
- Computing the Bidiagonal SVD Through an Associated Tridiagonal Eigenproblem
- Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations
- Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications
- On tridiagonal matrices unitarily equivalent to normal matrices
- Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
- High-performance sampling of generic determinantal point processes
- Computations of eigenpair subsets with the MRRR algorithm
- ScaLAPACK's MRRR algorithm
- Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
- A spectral scheme for Kohn-Sham density functional theory of clusters
- Subsampling algorithms for semidefinite programming
- Twisted factorization of a banded matrix
- Restructuring the tridiagonal and bidiagonal QR algorithms for performance
- A note on generating finer‐grain parallelism in a representation tree
- The singular value decomposition: anatomy of optimizing an algorithm for extreme scale
- Look-ahead in the two-sided reduction to compact band forms for symmetric eigenvalue problems and the SVD
This page was built for publication: The design and implementation of the MRRR algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549194)