Parallelization strategies for subspace methods to solve large eigenproblems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1262866
- scientific article; zbMATH DE number 5524926
- Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
- Subspace iteration methods with preconditioning for eigenvalues of very large matrices
- Improving the parallel performance of a domain decomposition preconditioning technique in the Jacobi-Davidson method for large scale eigenvalue problems
Cited in
(11)- A parallel implementation of the Jacobi-Davidson eigensolver for unsymmetric matrices
- Parallel solution of large-scale eigenvalue problem for master equation in protein folding dynamics
- Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems Under Limited Memory. Part II: Seeking Many Eigenvalues
- A parallel refined Davidson method for solving the large scale eigen problem
- Improving the parallel performance of a domain decomposition preconditioning technique in the Jacobi-Davidson method for large scale eigenvalue problems
- Parallel eigenanalysis of multiaquifer systems
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
- Subspace iteration methods with preconditioning for eigenvalues of very large matrices
- An Algebraic Substructuring Method for Large-Scale Eigenvalue Calculation
- A Parallel Jacobi--Davidson-type Method for Solving Large Generalized Eigenvalue Problems in Magnetohydrodynamics
This page was built for publication: Parallelization strategies for subspace methods to solve large eigenproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2751214)
