An efficient implementation of parallel eigenvalue computation for massively parallel processing
From MaRDI portal
Recommendations
- Toward an Efficient Parallel Eigensolver for Dense Symmetric Matrices
- A Parallel Eigensolver for Dense Symmetric Matrices Based on Multiple Relatively Robust Representations
- Efficient solution of symmetric/Hermitian eigenvalue problems on parallel arrays of vector processors
- A massively parallel dense symmetric eigensolver with communication splitting multicasting algorithm
- scientific article; zbMATH DE number 1817673
Cited in
(20)- Squeezing the most out of eigenvalue solvers on high-performance computers
- Efficient solution of symmetric/Hermitian eigenvalue problems on parallel arrays of vector processors
- Performance of the block Jacobi method for the symmetric eigenvalue problem on a modern massively parallel computer
- A massively parallel dense symmetric eigensolver with communication splitting multicasting algorithm
- scientific article; zbMATH DE number 1817673 (Why is no real title available?)
- scientific article; zbMATH DE number 6531153 (Why is no real title available?)
- A Parallel Implementation of the Trace Minimization Eigensolver
- Parallel Diagonalization Performance on High-Performance Computers
- Toward an Efficient Parallel Eigensolver for Dense Symmetric Matrices
- Parallel computations of eigenvalues based on a Monte Carlo approach
- Parallel implementations of the trace minimization scheme trace{min} for the sparse symmetric eigenvalue problem
- A shift selection strategy for parallel shift-invert spectrum slicing in symmetric self-consistent eigenvalue computation
- Computing the smallest eigenvalue of large ill-conditioned Hankel matrices
- An efficient Jacobi-like algorithm for parallel eigenvalue computation
- Large-Scale Scientific Computing
- Fast eigensolver for dense real-symmetric matrices
- Accelerating Computation of Eigenvectors in the Dense Nonsymmetric Eigenvalue Problem
- Distributed-parallel proper orthogonal/dynamic mode decompositions of large flow data
- Efficient eigenvalue and singular value computations on shared memory machines
- Distributed Jacobi joint diagonalization on clusters of personal computers
This page was built for publication: An efficient implementation of parallel eigenvalue computation for massively parallel processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958605)
