A modified version of the Waxman algorithm

Berger, W.A.; Miller, H.G.

dc.contributor.author	Berger, W.A.
dc.contributor.author	Miller, H.G.
dc.date.accessioned	2007-06-04T07:20:54Z
dc.date.available	2007-06-04T07:20:54Z
dc.date.issued	2007-05
dc.description.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.	en
dc.format.extent	150040 bytes
dc.format.mimetype	application/pdf
dc.identifier.citation	Berger, WA & Miller, HG 2007. 'A Modified version of the Waxman algorithm', Journal of Physics A: Mathematical and Theoretical, vol. 40, no. 21, pp5675-5680 [http://www.iop.org/EJ/journal/JPhysA].	en
dc.identifier.isbn	10.1088/1751-8113/40/21/014
dc.identifier.issn	1751-8121
dc.identifier.uri	http://hdl.handle.net/2263/2614
dc.language.iso	en	en
dc.publisher	American Institute of Physics	en
dc.rights	Americal Institute of Physics	en
dc.subject	Waxman algorithm	en
dc.subject.lcsh	Algorithms
dc.subject.lcsh	Transformations (Mathematics)
dc.subject.lcsh	Eigenvalues
dc.subject.lcsh	Hermitian operators
dc.subject.lcsh	Moments method (Statistics)
dc.title	A modified version of the Waxman algorithm	en
dc.type	Article	en