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
Development and performance evaluation of the Block-product type iterative methods with the variable grouping strategy
Hiroshi Tadano
TL;DR: Development and performance evaluation of the Block-product type iterative methods with the variable grouping strategy TLDR: Variable grouping strategy improves the accuracy of Block Krylov subspace methods by dynamically adjusting the number of update terms.
A real-valued block conjugate gradient type method for solving complex symmetric linear systems with multiple right-hand sides
TL;DR: This work proposes a new block conjugate gradient type method based on the Schur complement of a certain 2-by-2 real block form that consists of building blocks that involve only real arithmetic with real symmetric matrices of the original size.
Computing Partial Spectra with Least-Squares Rational Filters
Yuanzhe Xi,Yousef Saad +1 more
TL;DR: This work presents a method for computing partial spectra of Hermitian matrices, based on a combination of subspace iteration with rational filtering, and adopts a least-squares (LS) viewpoint for designing filters.
A numerical method for polynomial eigenvalue problems using contour integral
TL;DR: In this article, a numerical method using contour integral to solve polynomial eigenvalue problems (PEPs) is proposed, which finds eigenvalues contained in a certain domain which is defined by a surrounding integral path.
A quadrature-based eigensolver with a Krylov subspace method for shifted linear systems for Hermitian eigenproblems in lattice QCD
TL;DR: In this article, a quadrature-based eigensolver was proposed to find eigenpairs of Hermitian matrices arising in lattice quantum chromodynamics.
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