A Modified Version of the Waxman Algorithm
W. A. Berger, H. G. Miller
Abstract
The iterative algorithm recently proposed by Waxman for solving eigenvalue problems, which relies on the method of moments, has been modified to improve its convergence considerably without sacrificing its benefits or elegance. The suggested modification is based on methods to calculate low-lying eigenpairs of large bounded hermitian operators or matrices.
Create a lesson
Related papers
2-Morita Theory of E2-Algebras and Module Categories
Rongge Xu, Holiverse Yang
Multiscale Loop Vertex Expansion for Cumulants, the ϕ42 Model
Vincent Rivasseau
Quasi-polynomiality and N-point functions of single connected leaky completed Hurwitz numbers
Chongyu Wang, Chenglang Yang
Coupled stochastic variational principles for multiscale surface gravity waves -- Part I: theoretical framework
Etienne Mémin, Arnaud Debussche
The Sharp Spectral Transition for Almost Mathieu Operators via Alternating Resonances
Jiawei He, Xueyin Wang
Dynamical classical-field limit of Bosonic Gibbs states: Renormalized Hartree NLS correlations in 2D and 3D
Phan Thành Nam, Rongchan Zhu, Xiangchan Zhu