A harmonic FEAST algorithm for non-Hermitian generalized eigenvalue problems

DOI10.1016/J.LAA.2019.04.036zbMATH Open1431.65048OpenAlexW2942710129MaRDI QIDQ2321349FDOQ2321349

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

contour integralspectral projectiongeneralized eigenvalue problemsgeneralized Schur form

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• FEAST as a subspace iteration eigensolver accelerated by approximate spectral projection
• Templates for the Solution of Algebraic Eigenvalue Problems
• CIRR: a Rayleigh-Ritz method with contour integral for generalized eigenvalue problems
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• A majorization-minimization approach to the sparse generalized eigenvalue problem
• Matrix algorithms. Vol. 2: Eigensystems
• Numerical Methods for Large Eigenvalue Problems
• A Filtered Lanczos Procedure for Extreme and Interior Eigenvalue Problems
• A projection method for generalized eigenvalue problems using numerical integration.
• A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method
• An integral method for solving nonlinear eigenvalue problems
• Contour integral eigensolver for non-Hermitian systems: a Rayleigh-Ritz-type approach
• Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
• An Algorithm for Generalized Matrix Eigenvalue Problems
• Stable and efficient spectral divide and conquer algorithms for the symmetric eigenvalue decomposition and the SVD
• Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems
• Dissecting the FEAST algorithm for generalized eigenproblems
• A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
• Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
• Computing Eigenvalues of Real Symmetric Matrices with Rational Filters in Real Arithmetic
• An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
• Efficient estimation of eigenvalue counts in an interval
• A FEAST algorithm with oblique projection for generalized eigenvalue problems
• Computing partial spectra with least-squares rational filters
• Feast eigensolver for non-Hermitian problems

Cited In (3)

• An algorithm for identifying eigenvectors exhibiting strong spatial localization
• Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning
• Feast eigensolver for non-Hermitian problems

Uses Software

• JDQR
• FEAST
• JDQZ
• CIRR

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321349)