SBR Toolbox
From MaRDI portal
Cited in
(33)- High-performance bidiagonal reduction using tile algorithms on homogeneous multicore architectures
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
- On MR\(^3\)-type algorithms for the tridiagonal symmetric eigenproblem and bidiagonal SVD
- Minimizing communication in numerical linear algebra
- Divide and conquer on hybrid GPU-accelerated multicore systems
- Families of Algorithms for Reducing a Matrix to Condensed Form
- A fixed-point method for approximate projection onto the positive semidefinite cone
- Backward error analysis of the AllReduce algorithm for Householder QR decomposition
- Toward a high performance tile divide and conquer algorithm for the dense symmetric eigenvalue problem
- A high performance QDWH-SVD solver using hardware accelerators
- The singular value decomposition: anatomy of optimizing an algorithm for extreme scale
- Implementation details of an extended OQDS algorithm for singular values
- A framework for symmetric band reduction
- Algorithm 826
- EleMRRR
- POOCLAPACK
- PMRRR
- XMR
- Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
- PLASMA
- Algorithm 880
- PLASMA
- Algorithm 953
- Look-ahead in the two-sided reduction to compact band forms for symmetric eigenvalue problems and the SVD
- ELPA
- Algorithm 977
- Pochoir
- iMod
- Communication lower bounds and optimal algorithms for numerical linear algebra
- A fast band-Krylov eigensolver for macromolecular functional motion simulation on multicore architectures and graphics processors
- BDSVDX
- Solving dense generalized eigenproblems on multi-threaded architectures
- Efficient reduction of banded Hermitian positive definite generalized eigenvalue problems to banded standard eigenvalue problems
This page was built for software: SBR Toolbox
