A modified version of the Waxman algorithm
From MaRDI portal
Publication:3445839
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.
Recommendations
- scientific article; zbMATH DE number 1131789
- A modification of krawczyk's algorithm
- scientific article; zbMATH DE number 123365
- scientific article; zbMATH DE number 746214
- scientific article; zbMATH DE number 5605689
- scientific article; zbMATH DE number 1092103
- One modification of Gomory's algorithm
- scientific article; zbMATH DE number 721769
- scientific article; zbMATH DE number 3886105
- scientific article; zbMATH DE number 3993296
Cited in
(7)- Estimates of Eigenvalues for Iterative Methods
- A modification of krawczyk's algorithm
- On the absence of spurious eigenstates in an iterative algorithm proposed by Waxman
- Lord-Wingersky algorithm Version 2.5 with applications
- Improving the convergence of an iterative algorithm proposed by Waxman
- scientific article; zbMATH DE number 3886105 (Why is no real title available?)
- A Variant of the F4 Algorithm
This page was built for publication: A modified version of the Waxman algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3445839)