A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
From MaRDI portal
Publication:5498689
DOI10.1145/2543696zbMath1305.65124OpenAlexW1974224127WikidataQ113310315 ScholiaQ113310315MaRDI QIDQ5498689
Publication date: 10 February 2015
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/48627
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)
Related Items (6)
Refined isogeometric analysis of quadratic eigenvalue problems ⋮ A polynomial Jacobi-Davidson solver with support for non-monomial bases and deflation ⋮ Refined isogeometric analysis for generalized Hermitian eigenproblems ⋮ GPU-Accelerated LOBPCG Method with Inexact Null-Space Filtering for Solving Generalized Eigenvalue Problems in Computational Electromagnetics Analysis with Higher-Order FEM ⋮ Cholesky-Like Factorization of Symmetric Indefinite Matrices and Orthogonalization with Respect to Bilinear Forms ⋮ Predicting band structure of 3D mechanical metamaterials with complex geometry via XFEM
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- PRIMME
- Improving the parallel performance of a domain decomposition preconditioning technique in the Jacobi-Davidson method for large scale eigenvalue problems
- Convergence theory for inexact inverse iteration applied to the generalised nonsymmetric eigenproblem
- Generalizations of harmonic and refined Rayleigh-Ritz
- Davidson's method and preconditioning for generalized eigenvalue problems
- A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
- A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices
- Eigenvalues of Ax=lambdaBx for real symmetric matrices A and B computed by reduction to a pseudosymmetric form and the HR process
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
- Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method
- Parallel computation of spectral portrait of large matrices by Davidson type methods
- Robust preconditioning of large, sparse, symmetric eigenvalue problems
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- Matrix Algorithms
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- Anasazi software for the numerical solution of large-scale eigenvalue problems
- The university of Florida sparse matrix collection
- Computing a partial generalized real Schur form using the Jacobi–Davidson method
- SLEPc
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems Under Limited Memory. Part II: Seeking Many Eigenvalues
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- Block algorithms for reordering standard and generalized Schur forms
- Algorithm 866
- The Jacobi-Davidson method
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- ARPACK Users' Guide
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- A Parallel Jacobi--Davidson-type Method for Solving Large Generalized Eigenvalue Problems in Magnetohydrodynamics
- Templates for the Solution of Algebraic Eigenvalue Problems
- Modern methods for the iterative computation of eigenpairs of matrices of high dimension
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- Efficient parallel solution to large‐size sparse eigenproblems with block FSAI preconditioning
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- pARMS: a parallel version of the algebraic recursive multilevel solver
- Iterative Validation of Eigensolvers: A Scheme for Improving the Reliability of Hermitian Eigenvalue Solvers
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
This page was built for publication: A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
