- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
Advances in Numerical Analysis
Volume 2011 (2011), Article ID 826376, 9 pages
doi:10.1155/2011/826376
Partitioning Inverse Monte Carlo Iterative Algorithm for Finding the Three Smallest Eigenpairs of Generalized Eigenvalue Problem
Department of Statistics, Faculty of Mathematical Sciences, University of Guilan, P.O. Box 1914, Rasht, Iran
Received 5 December 2010; Accepted 15 February 2011
Academic Editor: Michele Benzi
Copyright © 2011 Behrouz Fathi Vajargah and Farshid Mehrdoust. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
How to Cite this Article
Behrouz Fathi Vajargah and Farshid Mehrdoust, “Partitioning Inverse Monte Carlo Iterative Algorithm for Finding the Three Smallest Eigenpairs of Generalized Eigenvalue Problem,” Advances in Numerical Analysis, vol. 2011, Article ID 826376, 9 pages, 2011. doi:10.1155/2011/826376