A projection method for generalized eigenvalue problems using numerical integration
Tetsuya Sakurai,Hiroshi Sugiura +1 more
TL;DR: In this article, a method for finding certain eigenvalues of a generalized eigenvalue problem that lie in a given domain of the complex plane is proposed, which projects the matrix pencil onto a subspace associated with the eigen values that are located in the domain via numerical integration.
read more
About: This article is published in Journal of Computational and Applied Mathematics. The article was published on 01 Oct 2003. and is currently open access. The article focuses on the topics: Eigenvalue perturbation & Divide-and-conquer eigenvalue algorithm.
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
The Exponentially Convergent Trapezoidal Rule
TL;DR: It is shown that far from being a curiosity, the trapezoidal rule is linked with computational methods all across scientific computing, including algorithms related to inverse Laplace transforms, special functions, complex analysis, rational approximation, integral equations, and the computation of functions and eigenvalues of matrices and operators.
Density-Matrix-Based Algorithm for Solving Eigenvalue Problems
TL;DR: A new numerical algorithm for solving the symmetric eigenvalue problem is presented, which takes its inspiration from the contour integration and density matrix representation in quantum mechanics.
468
An integral method for solving nonlinear eigenvalue problems
TL;DR: In this paper, a numerical method for computing all eigenvalues (and the corresponding eigenvectors) of a nonlinear holomorphic eigenvalue problem that lie within a given contour in the complex plane is proposed.
343
Electron-correlated fragment-molecular-orbital calculations for biomolecular and nano systems.
Shigenori Tanaka,Yuji Mochizuki,Yuji Mochizuki,Yuto Komeiji,Yoshio Okiyama,Kaori Fukuzawa,Kaori Fukuzawa +6 more
TL;DR: With the aid of the advances in high-performance computing, the FMO method promises larger, faster, and more accurate simulations of biomolecular and related systems, including the descriptions of dynamical behaviors in solvent environments.
273
Thick-restart block Lanczos method for large-scale shell-model calculations
TL;DR: In this article, the authors proposed a block Lanczos method for large-scale shell-model calculations, which is an extension of the traditional thick-restart block-Lanczos method with the block algorithm.
264
References
BI-CGSTAB: a fast and smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems
TL;DR: Numerical experiments indicate that the new variant of Bi-CG, named Bi- CGSTAB, is often much more efficient than CG-S, so that in some cases rounding errors can even result in severe cancellation effects in the solution.
5.5K
•Book
The Symmetric Eigenvalue Problem
Beresford N. Parlett
- 01 Jan 1980
TL;DR: Parlett as discussed by the authors presents mathematical knowledge that is needed in order to understand the art of computing eigenvalues of real symmetric matrices, either all of them or only a few.
3.7K
The Symmetric Eigenvalue Problem.
TL;DR: Parlett as discussed by the authors presents mathematical knowledge that is needed in order to understand the art of computing eigenvalues of real symmetric matrices, either all of them or only a few.
3.4K