The eigenvalues slicing library (EVSL): algorithms, implementation, and software
From MaRDI portal
(Redirected from Publication:5230632)
Abstract: This paper describes a software package called EVSL (for EigenValues Slicing Library) for solving large sparse real symmetric standard and generalized eigenvalue problems. As its name indicates, the package exploits spectrum slicing, a strategy that consists of dividing the spectrum into a number of subintervals and extracting eigenpairs from each subinterval independently. In order to enable such a strategy, the methods implemented in EVSL rely on a quick calculation of the spectral density of a given matrix, or a matrix pair. What distinguishes EVSL from other currently available packages is that EVSL relies entirely on filtering techniques. Polynomial and rational filtering are both implemented and are coupled with Krylov subspace methods and the subspace iteration algorithm. On the implementation side, the package offers interfaces for various scenarios including matrix-free modes, whereby the user can supply his/her own functions to perform matrix-vector operations or to solve sparse linear systems. The paper describes the algorithms in EVSL, provides details on their implementations, and discusses performance issues for the various methods.
Recommendations
- SLEPc
- A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
- Strategies for spectrum slicing based on restarted Lanczos methods
- Computing the eigenvalues of symmetric \(\mathcal{H}^2\)-matrices by slicing the spectrum
- scientific article; zbMATH DE number 1953314
Cites work
- A filtered Lanczos procedure for extreme and interior eigenvalue problems
- A numerical method for nonlinear eigenvalue problems using contour integrals
- A projection method for generalized eigenvalue problems using numerical integration.
- A set of level 3 basic linear algebra subprograms
- A spectrum slicing method for the Kohn-Sham problem
- A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
- A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
- Adaptive projection subspace dimension for the thick-restart Lanczos method
- Algorithm 827
- Algorithm 832
- An extended set of FORTRAN basic linear algebra subprograms
- Anasazi software for the numerical solution of large-scale eigenvalue problems
- Approximating spectral densities of large matrices
- ARPACK Users' Guide
- Basic Linear Algebra Subprograms for Fortran Usage
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn-Sham equation
- CIRR: a Rayleigh-Ritz method with contour integral for generalized eigenvalue problems
- Computing partial spectra with least-squares rational filters
- Cucheb: a GPU implementation of the filtered Lanczos procedure
- Direct Methods for Sparse Linear Systems
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- Fast computation of spectral densities for generalized eigenvalue problems
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
- LAPACK Users' Guide
- Numerical methods for large eigenvalue problems
- Parallel implementations of the trace minimization scheme trace{min} for the sparse symmetric eigenvalue problem
- PARDISO: a high-performance serial and parallel sparse linear solver in semiconductor device simulation
- PRIMME: preconditioned iterative multimethod eigensolver -- methods and software description
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- Self-consistent-field calculations using Chebyshev-filtered subspace iteration
- SLEPc
- State-of-the-art eigensolvers for electronic structure calculations of large scale nano-systems
- The loss of orthogonality in the Gram-Schmidt orthogonalization process
- The trace minimization method for the symmetric generalized eigenvalue problem
- The University of Florida sparse matrix collection
- Thick-restart Lanczos method for electronic structure calculations
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
Cited in
(22)- POWEV: A subroutine package to evaluate eigenvalues and eigenvectors of large sparse matrices
- On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems
- A non-perturbative approach to computing seismic normal modes in rotating planets
- Computational materials science and engineering
- EVSL
- Strategies for spectrum slicing based on restarted Lanczos methods
- A novel algebraic multigrid approach based on adaptive smoothing and prolongation for ill-conditioned systems
- Rational Spectral Filters with Optimal Convergence Rate
- Proxy-GMRES: Preconditioning via GMRES in Polynomial Space
- A new class of AMG interpolation methods based on matrix-matrix multiplications
- Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning
- ELSI -- an open infrastructure for electronic structure solvers
- Hybrid eigensolvers for nuclear configuration interaction calculations
- Limited‐memory polynomial methods for large‐scale matrix functions
- A parallel algorithm for computing partial spectral factorizations of matrix pencils via Chebyshev approximation
- Improvements to SLEPc in releases 3.14--3.18
- A rational filtering algorithm for sequences of shifted symmetric linear systems with applications to frequency response analysis
- An SVD-based fast algorithm for 3D Maxwell's equations with perfect electric conductor and quasi-periodic boundary conditions
- On a shrink-and-expand technique for symmetric block eigensolvers
- A novel splitting strategy to accelerate solving generalized eigenvalue problem from Kohn-Sham density functional theory
- EigenWave: an optimal O(N) method for computing eigenvalues and eigenvectors by time-filtering the wave equation
- A structure-preserving Chebyshev-filtered subspace iteration for the Bethe-Salpeter eigenvalue problem
Describes a project that uses
Uses Software
This page was built for publication: The eigenvalues slicing library (EVSL): algorithms, implementation, and software
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230632)
