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 (2011)
- Volume: 2011, page Article ID 826376, 9 p.-Article ID 826376, 9 p.
- ISSN: 1687-9562
Access Full Article
topHow to cite
topVajargah, Behrouz Fathi, and Mehrdoust, Farshid. "Partitioning inverse Monte Carlo iterative algorithm for finding the three smallest eigenpairs of generalized eigenvalue problem.." Advances in Numerical Analysis 2011 (2011): Article ID 826376, 9 p.-Article ID 826376, 9 p.. <http://eudml.org/doc/230320>.
@article{Vajargah2011,
author = {Vajargah, Behrouz Fathi, Mehrdoust, Farshid},
journal = {Advances in Numerical Analysis},
keywords = {inverse Monte Carlo iterative algorithm; real symmetric matrices; smallest eigenpairs},
language = {eng},
pages = {Article ID 826376, 9 p.-Article ID 826376, 9 p.},
publisher = {Hindawi Publishing Corporation, New York},
title = {Partitioning inverse Monte Carlo iterative algorithm for finding the three smallest eigenpairs of generalized eigenvalue problem.},
url = {http://eudml.org/doc/230320},
volume = {2011},
year = {2011},
}
TY - JOUR
AU - Vajargah, Behrouz Fathi
AU - Mehrdoust, Farshid
TI - Partitioning inverse Monte Carlo iterative algorithm for finding the three smallest eigenpairs of generalized eigenvalue problem.
JO - Advances in Numerical Analysis
PY - 2011
PB - Hindawi Publishing Corporation, New York
VL - 2011
SP - Article ID 826376, 9 p.
EP - Article ID 826376, 9 p.
LA - eng
KW - inverse Monte Carlo iterative algorithm; real symmetric matrices; smallest eigenpairs
UR - http://eudml.org/doc/230320
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.