A contour-integral based method for counting the eigenvalues inside a region
From MaRDI portal
Publication:1999893
DOI10.1007/s10915-018-0838-zzbMath1417.65117OpenAlexW2893494236MaRDI QIDQ1999893
Publication date: 27 June 2019
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-018-0838-z
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rang revealing QR factorizations
- An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
- A projection method for generalized eigenvalue problems using numerical integration.
- Counting eigenvalues in domains of the complex field
- CIRR: a Rayleigh-Ritz method with contour integral for generalized eigenvalue problems
- Matrix Algorithms
- Approximating Spectral Densities of Large Matrices
- Parallel stochastic estimation method of eigenvalue distribution
- FEAST As A Subspace Iteration Eigensolver Accelerated By Approximate Spectral Projection
- Efficient estimation of eigenvalue counts in an interval
- Numerical Methods for Large Eigenvalue Problems
- Mathematical Systems Theory I
- A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
- Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
- Templates for the Solution of Algebraic Eigenvalue Problems
- A FEAST algorithm with oblique projection for generalized eigenvalue problems
- An Algorithm for Generalized Matrix Eigenvalue Problems
This page was built for publication: A contour-integral based method for counting the eigenvalues inside a region
