A harmonic FEAST algorithm for non-Hermitian generalized eigenvalue problems

DOI10.1016/j.laa.2019.04.036zbMath1431.65048OpenAlexW2942710129MaRDI QIDQ2321349

Guojian Yin

Publication date: 29 August 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2019.04.036

zbMATH Keywords

spectral projectioncontour integralgeneralized eigenvalue problemsgeneralized Schur form

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (2)

Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning ⋮ An algorithm for identifying eigenvectors exhibiting strong spatial localization

Uses Software

• JDQR
• FEAST
• JDQZ
• CIRR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• A majorization-minimization approach to the sparse generalized eigenvalue problem
• An integral method for solving nonlinear eigenvalue problems
• Contour integral eigensolver for non-Hermitian systems: a Rayleigh-Ritz-type approach
• An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
• A projection method for generalized eigenvalue problems using numerical integration.
• Dissecting the FEAST algorithm for generalized eigenproblems
• CIRR: a Rayleigh-Ritz method with contour integral for generalized eigenvalue problems
• A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method
• Matrix Algorithms
• Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems
• Computing Partial Spectra with Least-Squares Rational Filters
• Feast Eigensolver for Non-Hermitian Problems
• Stable and Efficient Spectral Divide and Conquer Algorithms for the Symmetric Eigenvalue Decomposition and the SVD
• 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
• A Filtered Lanczos Procedure for Extreme and Interior Eigenvalue Problems
• Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
• 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
• Computing Eigenvalues of Real Symmetric Matrices with Rational Filters in Real Arithmetic
• A FEAST algorithm with oblique projection for generalized eigenvalue problems
• An Algorithm for Generalized Matrix Eigenvalue Problems

This page was built for publication: A harmonic FEAST algorithm for non-Hermitian generalized eigenvalue problems