A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method
TL;DR: The Sakurai-Sugiura projection method, which solves generalized eigenvalue problems to find certain eigenvalues in a given domain, was reformulated by using the resolvent theory.
read more
About: This article is published in Journal of Computational and Applied Mathematics. The article was published on 01 Feb 2010. and is currently open access. The article focuses on the topics: Projection method & Eigenvalues and eigenvectors.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A numerical method for nonlinear eigenvalue problems using contour integrals
TL;DR: A contour integral method is proposed to solve nonlinear eigenvalue problems numerically by reducing the original problem to a linear eigen value problem that has identical eigenvalues in the domain.
213
FEAST As A Subspace Iteration Eigensolver Accelerated By Approximate Spectral Projection
Ping Tak Peter Tang,Eric Polizzi +1 more
TL;DR: In this article, the authors present a detailed numerical analysis of the FEAST algorithm and show that it can be interpreted as an accelerated subspace iteration algorithm in conjunction with the Rayleigh-Ritz procedure.
162
Zolotarev quadrature rules and load balancing for the FEAST eigensolver
TL;DR: This work proposes improved rational approximants leading to FEAST variants with faster convergence, in particular, when using rational approximation based on the work of Zolotarev, and improves both convergence robustness and load balancing when FEAST runs on multiple search intervals in parallel.
118
Contour integral eigensolver for non-hermitian systems: a rayleigh-ritz-type approach
Tsutomu Ikegami,Tetsuya Sakurai +1 more
TL;DR: In this paper, the Rayleigh-Ritz-type approach of the contour integral eigensolver is extended to general applicability to non-Hermitian systems, which can extract only the eigenvalues in a given domain.
Feast Eigensolver for Non-Hermitian Problems
TL;DR: A detailed new upgrade of the FEAST eigensolver targeting non-Hermitian eigenvalue problems is presented and thoroughly discussed, aiming at broadening the class of eigenproblems that can be addressed within the framework of theFEAST algorithm.
References
GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
Youcef Saad,Martin H. Schultz +1 more
TL;DR: An iterative method for solving linear systems, which has the property of minimizing at every step the norm of the residual vector over a Krylov subspace.
The principle of minimized iterations in the solution of the matrix eigenvalue problem
TL;DR: In this paper, an interpretation of Dr. Cornelius Lanczos' iteration method, which he has named ''minimized iterations'' is discussed, expounding the method as applied to the solution of the characteristic matrix equations both in homogeneous and nonhomogeneous form.
•Book
Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide
James Demmel,Jack Dongarra,Axel Ruhe,Henk A. van der Vorst,Zhaojun Bai +4 more
- 01 Jan 1987
TL;DR: This book discusses iterative projection methods for solving Eigenproblems, and some of the techniques used to solve these problems came from the literature on Hermitian Eigenvalue.
1.6K
A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
TL;DR: A new method for the iterative computation of a few of the extremal eigenvalues of a symmetric matrix and their associated eigenvectors is proposed that has improved convergence properties and that may be used for general matrices.
559