Coarse grained parallel Monte Carlo algorithms for solving SLAE using PVM
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.
Unable to display preview. Download preview PDF.
- 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, 1989Google 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
- 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
- 9.Sobol' I.M. Monte Carlo numerical methods. Moscow, Nauka, 1973 (Russian) (English version Univ. of Chicago Press 1984).Google Scholar