Partitioning Inverse Monte Carlo Iterative Algorithm for Finding the Three Smallest Eigenpairs of Generalized Eigenvalue Problem
Joint Authors
Fathi Vajargah, Behrouz
Mehrdoust, Farshid
Source
Advances in Numerical Analysis
Issue
Vol. 2011, Issue 2011 (31 Dec. 2011), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2011-04-11
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract EN
A new Monte Carlo approach for evaluating the generalized eigenpair of real symmetric matrices will be proposed.
Algorithm for the three smallest eigenpairs based on the partitioning inverse Monte Carlo iterative (IMCI) method will be considered.
American Psychological Association (APA)
Fathi Vajargah, Behrouz& Mehrdoust, Farshid. 2011. Partitioning Inverse Monte Carlo Iterative Algorithm for Finding the Three Smallest Eigenpairs of Generalized Eigenvalue Problem. Advances in Numerical Analysis،Vol. 2011, no. 2011, pp.1-9.
https://search.emarefa.net/detail/BIM-501222
Modern Language Association (MLA)
Fathi Vajargah, Behrouz& Mehrdoust, Farshid. Partitioning Inverse Monte Carlo Iterative Algorithm for Finding the Three Smallest Eigenpairs of Generalized Eigenvalue Problem. Advances in Numerical Analysis No. 2011 (2011), pp.1-9.
https://search.emarefa.net/detail/BIM-501222
American Medical Association (AMA)
Fathi Vajargah, Behrouz& Mehrdoust, Farshid. Partitioning Inverse Monte Carlo Iterative Algorithm for Finding the Three Smallest Eigenpairs of Generalized Eigenvalue Problem. Advances in Numerical Analysis. 2011. Vol. 2011, no. 2011, pp.1-9.
https://search.emarefa.net/detail/BIM-501222
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-501222
