The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software
From MaRDI portal
Publication:5230632
DOI10.1137/18M1170935zbMath1420.65050arXiv1802.05215OpenAlexW2967701142WikidataQ127375191 ScholiaQ127375191MaRDI QIDQ5230632
Yousef Saad, Ruipeng Li, Yuanzhe Xi, Lucas Erlandson
Publication date: 28 August 2019
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.05215
parallel computingKrylov subspace methodsspectral densitypolynomial filteringspectrum slicingrational filtering
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Orthogonalization in numerical linear algebra (65F25)
Related Items
A non-perturbative approach to computing seismic normal modes in rotating planets, ELSI -- an open infrastructure for electronic structure solvers, Hybrid eigensolvers for nuclear configuration interaction calculations, Limited‐memory polynomial methods for large‐scale matrix functions, Computational Materials Science and Engineering, A Novel Algebraic Multigrid Approach Based on Adaptive Smoothing and Prolongation for Ill-Conditioned Systems, A New Class of AMG Interpolation Methods Based on Matrix-Matrix Multiplications, Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning, On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems, EVSL, Rational Spectral Filters with Optimal Convergence Rate, Proxy-GMRES: Preconditioning via GMRES in Polynomial Space
Uses Software
Cites Work
- Unnamed Item
- PRIMME
- Parallel implementations of the trace minimization scheme trace{min} for the sparse symmetric eigenvalue problem
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
- Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn-Sham equation
- The loss of orthogonality in the Gram-Schmidt orthogonalization process
- Self-consistent-field calculations using Chebyshev-filtered subspace iteration
- State-of-the-art eigensolvers for electronic structure calculations of large scale nano-systems
- A projection method for generalized eigenvalue problems using numerical integration.
- The trace minimization method for the symmetric generalized eigenvalue problem
- Cucheb: a GPU implementation of the filtered Lanczos procedure
- Thick-restart Lanczos method for electronic structure calculations
- A spectrum slicing method for the Kohn-Sham problem
- CIRR: a Rayleigh-Ritz method with contour integral for generalized eigenvalue problems
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- Approximating Spectral Densities of Large Matrices
- A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems
- Computing Partial Spectra with Least-Squares Rational Filters
- A numerical method for nonlinear eigenvalue problems using contour integrals
- Anasazi software for the numerical solution of large-scale eigenvalue problems
- Adaptive Projection Subspace Dimension for the Thick-Restart Lanczos Method
- The university of Florida sparse matrix collection
- Numerical Methods for Large Eigenvalue Problems
- A Filtered Lanczos Procedure for Extreme and Interior Eigenvalue Problems
- Direct Methods for Sparse Linear Systems
- SLEPc
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- An extended set of FORTRAN basic linear algebra subprograms
- LAPACK Users' Guide
- A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Basic Linear Algebra Subprograms for Fortran Usage
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- A set of level 3 basic linear algebra subprograms
- ARPACK Users' Guide
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- PARDISO: a high-performance serial and parallel sparse linear solver in semiconductor device simulation
- Fast Computation of Spectral Densities for Generalized Eigenvalue Problems
- Algorithm 827
- Algorithm 832
