Feast eigensolver for non-Hermitian problems
From MaRDI portal
Publication:2830645
DOI10.1137/15M1026572zbMATH Open1352.65119arXiv1506.04463OpenAlexW2963625221MaRDI QIDQ2830645FDOQ2830645
Authors: James Kestyn, Eric Polizzi, Ping Tak Peter Tang 
Publication date: 28 October 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Abstract: A detailed new upgrade of the FEAST eigensolver targeting non-Hermitian eigenvalue problems is presented and thoroughly discussed. It aims at broadening the class of eigenproblems that can be addressed within the framework of the FEAST algorithm. The algorithm is ideally suited for computing selected interior eigenvalues and their associated right/left bi-orthogonal eigenvectors,located within a subset of the complex plane. It combines subspace iteration with efficient contour integration techniques that approximate the left and right spectral projectors. We discuss the various algorithmic choices that have been made to improve the stability and usability of the new non-Hermitian eigensolver. The latter retains the convergence property and multi-level parallelism of Hermitian FEAST, making it a valuable new software tool for the scientific community.
Full work available at URL: https://arxiv.org/abs/1506.04463
Recommendations
- On the non-Hermitian FEAST algorithms with oblique projection for eigenvalue problems
- A harmonic FEAST algorithm for non-Hermitian generalized eigenvalue problems
- Arnoldi-Faber method for large non Hermitian eigenvalue problems
- Dissecting the FEAST algorithm for generalized eigenproblems
- A fast contour-integral eigensolver for non-Hermitian matrices
- Dynamical systems and non-Hermitian iterative eigensolvers
- scientific article; zbMATH DE number 1193040
- scientific article; zbMATH DE number 108458
- Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems
- On expansion of search subspaces for large non-Hermitian eigenproblems
convergencestabilityalgorithmparallel computationcontour integrationinterior eigenvaluesspectral projectorssubspace iterationFEASTbiorthogonal vectorsnon-Hermitian eigenproblemright/left eigenvectors
Parallel numerical computation (65Y05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- LAPACK Users' Guide
- PRIMME: preconditioned iterative multimethod eigensolver -- methods and software description
- FEAST as a subspace iteration eigensolver accelerated by approximate spectral projection
- Anasazi software for the numerical solution of large-scale eigenvalue problems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- ARPACK Users' Guide
- Templates for the Solution of Algebraic Eigenvalue Problems
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
- CIRR: a Rayleigh-Ritz method with contour integral for generalized eigenvalue problems
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Functions of Matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- A projection method for generalized eigenvalue problems using numerical integration.
- A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method
- Numerical methods for large eigenvalue problems
- The exponentially convergent trapezoidal rule
- On fast factorization pivoting methods for sparse symmetric indefinite systems
- Contour integral eigensolver for non-Hermitian systems: a Rayleigh-Ritz-type approach
- Thick-restart Lanczos method for large symmetric eigenvalue problems
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- A Krylov--Schur algorithm for large eigenproblems
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- SLEPc
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- An Algorithm for Generalized Matrix Eigenvalue Problems
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- Daubechies wavelets for high performance electronic structure calculations: the BigDFT project
- Title not available (Why is that?)
- Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
- Zolotarev quadrature rules and load balancing for the FEAST eigensolver
- Computing eigenvalues of real symmetric matrices with rational filters in real arithmetic
- Numerical solution of large nonsymmetric eigenvalue problems
- Efficient estimation of eigenvalue counts in an interval.
Cited In (20)
- A harmonic FEAST algorithm for non-Hermitian generalized eigenvalue problems
- Coupling of incompressible free-surface flow, acoustic fluid and flexible structure via a modal basis
- FEAST as a subspace iteration eigensolver accelerated by approximate spectral projection
- Computing leaky modes of optical fibers using a FEAST algorithm for polynomial eigenproblems
- FEAST for differential eigenvalue problems
- An algorithm for identifying eigenvectors exhibiting strong spatial localization
- An Augmented Matrix-Based CJ-FEAST SVDsolver for Computing a Partial Singular Value Decomposition with the Singular Values in a Given Interval
- Computing partial spectra with least-squares rational filters
- A spectral analysis of the nonlinear Schrödinger equation in the co-exploding frame
- Bifurcation analysis of stationary solutions of two-dimensional coupled Gross-Pitaevskii equations using deflated continuation
- On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems
- A FEAST SVDsolver based on Chebyshev-Jackson series for computing partial singular triplets of large matrices
- On the non-Hermitian FEAST algorithms with oblique projection for eigenvalue problems
- Analytical low-rank compression via proxy point selection
- A fast contour-integral eigensolver for non-Hermitian matrices
- A FEAST algorithm with oblique projection for generalized eigenvalue problems.
- Projection method for eigenvalue problems of linear nonsquare matrix pencils
- Stability and response of trapped solitary wave solutions of coupled nonlinear Schrödinger equations in an external, $\mathcal{PT}$- and supersymmetric potential
- A Rational Function Preconditioner For Indefinite Sparse Linear Systems
- Beyond automated multilevel substructuring: domain decomposition with rational filtering
Uses Software
This page was built for publication: Feast eigensolver for non-Hermitian problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830645)
