Skip to main content

Implementation of Monte Carlo algorithms for eigenvalue problem using MPI

  • Conference paper
  • First Online:
Recent Advances in Parallel Virtual Machine and Message Passing Interface (EuroPVM/MPI 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1497))

Abstract

The problem of evaluating the dominant eigenvalue of real matrices using Monte Carlo numerical methods is considered.

Three almost optimal Monte Carlo algorithms are presented:

  • Direct Monte Carlo algorithm (DMC) for calculating the largest eigenvalue of a matrix A. The algorithm uses iterations with the given matrix.

  • Resolvent Monte Carlo algorithm (RMC) for calculating the smallest or the largest eigenvalue. The algorithm uses Monte Carlo iterations with the resolvent matrix and includes parameter controlling the rate of convergence;

  • Inverse Monte Carlo algorithm (IMC) for calculating the smallest eigenvalue. The algorithm uses iterations with inverse matrix.

Numerical tests are performed for a number of large sparse test matrices using MPI on a cluster of workstations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. H. Golub, Ch. F. Van Loon, Matrix Computations, The Johns Hopkins Univ. Press, Baltimore and London, 1996.

    Google Scholar 

  2. J.H. Halton, Sequential Monte Carlo Techniques for the Solution of Linear Systems, TR 92-033, University of North Carolina at Chapel Hill, Department of Computer Science, 46 pp., 1992.

    Google Scholar 

  3. G.A. Mikhailov, A new Monte Carlo algorithm for estimating the maximum eigen-value of an integral operator, Docl. Acad. Nauk SSSR, 191, No 5 (1970), pp. 993–996.

    Google Scholar 

  4. G.A. Mikhailov, Optimization of the “weight” Monte Carlo methods (Nauka, Moscow, 1987).

    Google Scholar 

  5. I.M. Sobol, Monte Carlo numerical methods, Nauka, Moscow, 1973.

    Google Scholar 

  6. V.S.Vladimirov, On the application of the Monte Carlo method to the finding of the least eigenvalue, and the corresponding eigenfunction, of a linear integral equation, in Russian: Teoriya Veroyatnostej i Yeye Primenenie, 1, No 1 (1956),pp. 113–130.

    MATH  Google Scholar 

  7. I. Dimov, A. Karaivanova and P. Yordanova, Monte Carlo Algorithms for calculating eigenvalues, Springer Lectur Notes in Statistics, v.127 (1998) (H. Niederreiter, P. Hellekalek, G. Larcher and P. Zinterhof, Eds)), pp.205–220.

    Google Scholar 

  8. I. Dimov, A. Karaivanova Parallel computations of eigenvalues based on a Monte Carlo approach, Journal of MC Methods and Appl., 1998 (to appear).

    Google Scholar 

  9. Megson, G., V. Alexandrov, I. Dimov, Systolic Matrix Inversion Using a Monte Carlo Method, Journal of Parallel Algorithms and Applications, 3, No 1 (1994), pp. 311–330.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Vassil Alexandrov Jack Dongarra

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dimov, I., Alexandrov, V., Karaivanova, A. (1998). Implementation of Monte Carlo algorithms for eigenvalue problem using MPI. In: Alexandrov, V., Dongarra, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 1998. Lecture Notes in Computer Science, vol 1497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056594

Download citation

  • DOI: https://doi.org/10.1007/BFb0056594

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65041-6

  • Online ISBN: 978-3-540-49705-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics