Partitioning inverse Monte Carlo iterative algorithm for finding the three smallest eigenpairs of generalized eigenvalue problem
From MaRDI portal
Publication:541172
DOI10.1155/2011/826376zbMath1217.65005OpenAlexW2072419230WikidataQ58654952 ScholiaQ58654952MaRDI QIDQ541172
Farshid Mehrdoust, Behrouz Fathi-Vajargah
Publication date: 6 June 2011
Published in: Advances in Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/230320
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Monte Carlo methods (65C05)
Cites Work
This page was built for publication: Partitioning inverse Monte Carlo iterative algorithm for finding the three smallest eigenpairs of generalized eigenvalue problem