On Finding the Smallest Generalized Eigenpair Using Markov Chain Monte Carlo Algorithm

HTML  Download Download as PDF (Size: 290KB)  PP. 594-596  
DOI: 10.4236/am.2012.36092    3,394 Downloads   5,558 Views  
Author(s)

ABSTRACT

This paper proposes a new technique based on inverse Markov chain Monte Carlo algorithm for finding the smallest generalized eigenpair of the large scale matrices. Some numerical examples show that the proposed method is efficient.

Share and Cite:

F. Mehrdoust, "On Finding the Smallest Generalized Eigenpair Using Markov Chain Monte Carlo Algorithm," Applied Mathematics, Vol. 3 No. 6, 2012, pp. 594-596. doi: 10.4236/am.2012.36092.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.