A fast contour-integral eigensolver for non-Hermitian matrices
From MaRDI portal
(Redirected from Publication:4588944)
Recommendations
- Feast eigensolver for non-Hermitian problems
- A FEAST algorithm with oblique projection for generalized eigenvalue problems.
- Contour integral eigensolver for non-Hermitian systems: a Rayleigh-Ritz-type approach
- A contour-integral based method with Schur-Rayleigh-Ritz procedure for generalized eigenvalue problems
- On the non-Hermitian FEAST algorithms with oblique projection for eigenvalue problems
Cites work
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1889799 (Why is no real title available?)
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD
- A FEAST algorithm with oblique projection for generalized eigenvalue problems.
- A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations
- A Simultaneous Iteration Algorithm for Real Matrices
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- A direct imaging method for inverse scattering using the generalized Foldy-Lax formulation
- A fast QR algorithm for companion matrices
- A fast algorithm for particle simulations
- A fast randomized eigensolver with structured LDL factorization update
- A projection method for generalized eigenvalue problems using numerical integration.
- A short review on entanglement in quantum spin systems
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines
- A superfast structured solver for Toeplitz linear systems via randomized sampling
- Applications and generalizations of Fisher–Hartwig asymptotics
- Asymptotics of eigenvalues and eigenvectors of Toeplitz matrices
- Bounds on tail probabilities of discrete distributions
- CIRR: a Rayleigh-Ritz method with contour integral for generalized eigenvalue problems
- Computing all or some eigenvalues of symmetric \(\mathcal{H}_{\ell}\)-matrices
- Computing partial spectra with least-squares rational filters
- Data spectroscopy: eigenspaces of convolution operators and clustering
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Designing rational filter functions for solving eigenvalue problems by contour integration
- Efficient estimation of eigenvalue counts in an interval.
- Efficient structured multifrontal factorization for general large sparse matrices
- Eigenpairs of Toeplitz and disordered Toeplitz matrices with a Fisher-Hartwig symbol
- FEAST as a subspace iteration eigensolver accelerated by approximate spectral projection
- Fast algorithms for hierarchically semiseparable matrices
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Implicit double shift \(QR\)-algorithm for companion matrices
- Multiple Scattering of Waves
- Norms and exclusion theorems
- Numerical methods for large eigenvalue problems
- On the complexity of some hierarchical structured matrix algorithms
- On the stability of some hierarchical rank structured matrix algorithms
- Parallel randomized and matrix-free direct solvers for large structured dense linear systems
- Parallel stochastic estimation method of eigenvalue distribution
- Quantum spin chain, Toeplitz determinants and the Fisher-Hartwig conjecture
- Randomized sparse direct solvers
- Spectral asymptotics in one-dimensional periodic lattices with geometric interaction
- Subspace Iteration Randomization and Singular Value Problems
- Superfast and stable structured solvers for Toeplitz least squares via randomized sampling
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
- The Multiple Scattering of Waves. I. General Theory of Isotropic Scattering by Randomly Distributed Scatterers
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- Zolotarev quadrature rules and load balancing for the FEAST eigensolver
Cited in
(14)- Beyond automated multilevel substructuring: domain decomposition with rational filtering
- Designing rational filter functions for solving eigenvalue problems by contour integration
- On the convergence of orthogonalization-free conjugate gradient method for extreme eigenvalues of Hermitian matrices: a Riemannian optimization interpretation
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- A robust randomized indicator method for accurate symmetric eigenvalue detection
- Flexible subspace iteration with moments for an effective contour integration‐based eigensolver
- Contour integral eigensolver for non-Hermitian systems: a Rayleigh-Ritz-type approach
- An algorithm for identifying eigenvectors exhibiting strong spatial localization
- Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning
- A contour integral-based algorithm for computing generalized singular values
- Analytical low-rank compression via proxy point selection
- EigenWave: an optimal O(N) method for computing eigenvalues and eigenvectors by time-filtering the wave equation
- Feast eigensolver for non-Hermitian problems
- Verified partial eigenvalue computations using contour integrals for Hermitian generalized eigenproblems
This page was built for publication: A fast contour-integral eigensolver for non-Hermitian matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4588944)
