A Parallel Eigensolver for Dense Symmetric Matrices Based on Multiple Relatively Robust Representations
From MaRDI portal
Publication:5693186
Recommendations
- Toward an Efficient Parallel Eigensolver for Dense Symmetric Matrices
- A parallel algorithm for the dense symmetric eigenvalue problem on a transputer array
- A massively parallel dense symmetric eigensolver with communication splitting multicasting algorithm
- scientific article; zbMATH DE number 434520
- Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- scientific article; zbMATH DE number 819138
- A comparison of two parallel algorithms for the symmetric eigenproblem
- A parallel algorithm for the generalized symmetric eigenvalue problem on a hybrid multiprocessor
- scientific article; zbMATH DE number 2080149
Cited in
(18)- Randomized Joint Diagonalization of Symmetric Matrices
- Toward a high performance tile divide and conquer algorithm for the dense symmetric eigenvalue problem
- A shift selection strategy for parallel shift-invert spectrum slicing in symmetric self-consistent eigenvalue computation
- N Roots of the Secular Equation in O(N) Operations
- Parallel block tridiagonalization of real symmetric matrices
- Improved accuracy and parallelism for MRRR-based eigensolvers -- a mixed precision approach
- A Parallel Implementation of the Trace Minimization Eigensolver
- scientific article; zbMATH DE number 2080149 (Why is no real title available?)
- ScaLAPACK's MRRR algorithm
- Solving dense generalized eigenproblems on multi-threaded architectures
- Fast eigensolver for dense real-symmetric matrices
- scientific article; zbMATH DE number 833712 (Why is no real title available?)
- A massively parallel dense symmetric eigensolver with communication splitting multicasting algorithm
- A note on generating finer‐grain parallelism in a representation tree
- High-performance solvers for dense Hermitian eigenproblems
- A framework for the \(\text{MR}^3\) algorithm: theory and implementation
- Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers
- An efficient implementation of parallel eigenvalue computation for massively parallel processing
This page was built for publication: A Parallel Eigensolver for Dense Symmetric Matrices Based on Multiple Relatively Robust Representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5693186)
