Skip to main content

Coarse grained parallel Monte Carlo algorithms for solving SLAE using PVM

  • Conference paper
  • First Online:

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

Abstract

The problem of solving System of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. Three Monte Carlo algorithms are presented. In case when copy of the matrix is sent to each processor the execution time for solving SLAE by Monte Carlo on p processors is bounded by O(nNT/p) (excluding the initial loading of the data) where N is the number of chains and T is the length of the chain in the stochastic process, which are independent of matrix size n.

Numerical tests are performed for a number of dense and sparse test matrices using PVM on a cluster of workstations.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V.Alexandrov and S. Lakka Comparison of three Parallel Monte Carlo Methods for Matrix Inversion, Proc. of EUROPAR96, Lyon, France, Vol II, pp. 72–80.

    Google Scholar 

  2. V.Alexandrov and G.M. Megson Solving Sytem of Linear algebraic Equations by Monte Carlo Method on Regular Arrays, Proc. of PARCELLA96, 16–20 September, Berlin, Germany, pp. 137–146, 1996.

    Google Scholar 

  3. Bertsekas D.P. and Tsitsiklis, Parallel and Distributed Computation, Prentice Hall, 1989

    Google Scholar 

  4. F. Dehne, A. Fabri, and A. Rau-Chaplin, Scalable parallel geometric algorithms for multicomputers, Proc. 7th ACM Symp. on Computational Geometry, 1993.

    Google Scholar 

  5. I. Dimov and V.Alexandrov A New Highly Convergent Monte Carlo Method for Matrix Computations, Proc. of IMACS Monte Carlo Seminar, April 1–4, 1997, Belgium (in print).

    Google Scholar 

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

    MATH  Google Scholar 

  7. 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 

  8. G.M.Megson, V.Aleksandrov, I. Dimov Systolic Matrix Inversion Using Monte Carlo Method, J. Parallel Algorithms and Applications, Vol.3, pp.311–330, 1994.

    MATH  Google Scholar 

  9. Sobol' I.M. Monte Carlo numerical methods. Moscow, Nauka, 1973 (Russian) (English version Univ. of Chicago Press 1984).

    Google Scholar 

  10. Westlake J.R., A Handbook of Numerical Matrix Inversion and Solution of Linear Equations, John Wiley and Sons, New York, 1968.

    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

Alexandrov, V., Dehne, F., Rau-Chaplin, A., Taft, K. (1998). Coarse grained parallel Monte Carlo algorithms for solving SLAE using PVM. 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/BFb0056591

Download citation

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

  • 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