Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning
From MaRDI portal
Publication:5161770
DOI10.1137/20M1349217MaRDI QIDQ5161770
Yuanzhe Xi, Lior Horesh, Vassilis Kalantzis
Publication date: 1 November 2021
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.05128
randomized algorithmsmatrix partitioningnon-Hermitian eigenvalue problemsrational filteringcontour integral eigensolvers
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- CUR matrix decompositions for improved data analysis
- Designing rational filter functions for solving eigenvalue problems by contour integration
- An integral method for solving nonlinear eigenvalue problems
- Computing interior eigenvalues of large matrices
- A projection method for generalized eigenvalue problems using numerical integration.
- A harmonic FEAST algorithm for non-Hermitian generalized eigenvalue problems
- A contour-integral based method with Schur-Rayleigh-Ritz procedure for generalized eigenvalue problems
- CIRR: a Rayleigh-Ritz method with contour integral for generalized eigenvalue problems
- Computing Partial Spectra with Least-Squares Rational Filters
- A numerical method for nonlinear eigenvalue problems using contour integrals
- FEAST As A Subspace Iteration Eigensolver Accelerated By Approximate Spectral Projection
- Numerical Algorithms Based on Analytic Function Values at Roots of Unity
- The Exponentially Convergent Trapezoidal Rule
- Zolotarev Quadrature Rules and Load Balancing for the FEAST Eigensolver
- Efficient estimation of eigenvalue counts in an interval
- The university of Florida sparse matrix collection
- Randomized algorithms for the low-rank approximation of matrices
- Beyond Automated Multilevel Substructuring: Domain Decomposition with Rational Filtering
- A Hierarchical Low Rank Schur Complement Preconditioner for Indefinite Linear Systems
- Rayleigh Quotient Based Optimization Methods for Eigenvalue Problems
- A Randomized Algorithm for Principal Component Analysis
- ARPACK Users' Guide
- Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
- Domain decomposition approaches for accelerating contour integration eigenvalue solvers for symmetric eigenvalue problems
- A Fast Contour-Integral Eigensolver for Non-Hermitian Matrices
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- On Updating Problems in Latent Semantic Indexing
- When modified Gram-Schmidt generates a well-conditioned set of vectors
- ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
- Harmonic projection methods for large non-symmetric eigenvalue problems
- Rational Spectral Filters with Optimal Convergence Rate
- Randomized methods for matrix computations
- Solving the Three-Dimensional High-frequency Helmholtz Equation Using Contour Integration and Polynomial Preconditioning
- The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software
- Computing Eigenvalues of Real Symmetric Matrices with Rational Filters in Real Arithmetic
- A Rational Function Preconditioner For Indefinite Sparse Linear Systems
- A FEAST algorithm with oblique projection for generalized eigenvalue problems
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Randomized numerical linear algebra: Foundations and algorithms
This page was built for publication: Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning
