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 CJ-FEAST GSVDsolver for computing a partial GSVD of a large matrix pair with the generalized singular values in a given interval
Zhongxiao Jia,Kailiang Zhang +1 more
TL;DR: A CJ-FEAST GSVDsolver is proposed to compute a partial generalized singular value decomposition (GSVD) of a large matrix pair $(A,B) with the generalized singular values in a given interval and accuracy estimates are derived for the approximate spectral projector and its eigenvalues.
A Parallel Eigensolver Using Contour Integration for Generalized Eigenvalue Problems in Molecular Simulation
Tetsuya Sakurai,Hiroto Tadano,Tsutomu Ikegami,Umpei Nagashima +3 more
TL;DR: A parallel eigensolver using contour integration is proposed for generalized eigenvalue problems in molecular simulation, leveraging sparse matrices and numerical integration to compute interior eigenvalues and eigenvectors efficiently in biochemistry applications.
•Posted Content
A randomized FEAST algorithm for generalized eigenvalue problems
TL;DR: This work develops a new non-Hermitian scheme for the FEAST algorithm, a typical contour-integral based eigensolver for computing the eigenvalues inside a given region in the complex plane.
Boundary integral equations for calculating complex eigenvalues of transmission problems
TL;DR: This paper considers waveguide problems for the Helmholtz equation in two dimensions and standard scattering problems for Maxwell's equations in three dimensions and proposes new BIEs for transmission problems with which one can distinguish true and fictitious eigenvalues easily.
Eigenvalue analysis for acoustic problem in 3D by boundary element method with the block Sakurai–Sugiura method
TL;DR: In this paper, the authors presented accurate numerical solutions for nonlinear eigenvalue analysis of three-dimensional acoustic cavities by boundary element method (BEM) and employed a contour integral method, called block Sakurai-Sugiura (SS) method, by which the NEP is converted to a standard linear eigen value problem and the dimension of eigenspace is reduced.
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