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.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
Bertsekas D.P. and Tsitsiklis, Parallel and Distributed Computation, Prentice Hall, 1989
F. Dehne, A. Fabri, and A. Rau-Chaplin, Scalable parallel geometric algorithms for multicomputers, Proc. 7th ACM Symp. on Computational Geometry, 1993.
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).
G. H. Golub, Ch. F. Van Loon, Matrix Computations, The Johns Hopkins Univ. Press, Baltimore and London, 1996.
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.
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.
Sobol' I.M. Monte Carlo numerical methods. Moscow, Nauka, 1973 (Russian) (English version Univ. of Chicago Press 1984).
Westlake J.R., A Handbook of Numerical Matrix Inversion and Solution of Linear Equations, John Wiley and Sons, New York, 1968.
Author information
Authors and Affiliations
Editor information
Rights 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