论文信息 - Coarse Grained Parallel Monte Carlo Algorithms for Solving SLAE Using PVM

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.

Andrew Rau-Chaplin | Frank Dehne | Vassil N. Alexandrov | Keith Taft

[1] J. Halton. Sequential monte carlo techniques for the solution of linear systems , 1994 .

[2] Graham M. Megson,et al. Systolic Matrix Inversion Using a Monte Carlo Method , 1994, Parallel Algorithms Appl..

[3] Vassil N. Alexandrov,et al. Comparison of Three Monte Carlo Methods for Matrix Inversion , 1996, Euro-Par, Vol. II.

[4] J. Westlake. Handbook of Numerical Matrix Inversion and Solution of Linear Equations , 1968 .

[5] F. Dehne,et al. Robotique, Image Et Vision Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers Algorithmes G Eom Etriques Parall Eles Multi-echelles Pour Machines Multi-processeurs a Gros Grain , 2007 .

[6] Andrew Rau-Chaplin,et al. Scalable parallel geometric algorithms for coarse grained multicomputers , 1993, SCG '93.

[7] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .

[8] Gene H. Golub,et al. Matrix computations , 1983 .