A Modified Version of the Waxman Algorithm
classification
🧮 math-ph
math.MPquant-ph
keywords
algorithmmodifiedwaxmanbeenbenefitsboundedcalculateconsiderably
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.