Cited in
(20)- A note on generating finer‐grain parallelism in a representation tree
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
- A shift strategy for superquadratic convergence in the dqds algorithm for singular values
- Divide and conquer on hybrid GPU-accelerated multicore systems
- Toward a high performance tile divide and conquer algorithm for the dense symmetric eigenvalue problem
- Stable and efficient spectral divide and conquer algorithms for the symmetric eigenvalue decomposition and the SVD
- Detecting localization in an invariant subspace
- EleMRRR
- PMRRR
- XMR
- DLASQ
- HDLASQ
- SBR Toolbox
- MR3-SMP
- PHDC
- A framework for the \(\text{MR}^3\) algorithm: theory and implementation
- An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
- Matrix Depot
- An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
- Fast computation of spectral projectors of banded matrices
This page was built for software: Algorithm 880
