Partitioning inverse Monte Carlo iterative algorithm for finding the three smallest eigenpairs of generalized eigenvalue problem.
Vajargah, Behrouz Fathi ; Mehrdoust, Farshid
Advances in Numerical Analysis, Tome 2011 (2011), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2011-01-01
DOI : https://doi.org/10.1155/2011/826376
EUDML-ID : urn:eudml:doc:230320 
@article{05904354,
     title = {Partitioning inverse Monte Carlo iterative algorithm for finding the three smallest eigenpairs of generalized eigenvalue problem.},
     journal = {Advances in Numerical Analysis},
     volume = {2011},
     year = {2011},
     doi = {10.1155/2011/826376},
     zbl = {1217.65005},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05904354}
}

Vajargah, Behrouz Fathi; Mehrdoust, Farshid. Partitioning inverse Monte Carlo iterative algorithm for finding the three smallest eigenpairs of generalized eigenvalue problem.. Advances in Numerical Analysis, Tome 2011 (2011) . doi : 10.1155/2011/826376. http://gdmltest.u-ga.fr/item/05904354/