Comparison of three Monte Carlo methods for Matrix Inversion-Reference-Cited by-同舟云学术

Comparison of three Monte Carlo methods for Matrix Inversion

Published:1996 Issue: Volume: Page:72-80
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Alexandrov V. N.,Lakka S.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0024687

Reference18 articles.

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

2. Curtiss J.H., Monte Carlo methods for the iteration of linear operators. J. Math Phys., vol 32, No 4 (1954), pp. 209–232.

3. Curtiss J.H. A Theoretical Comparison of the Efficiencies of two classical methods and a Monte Carlo method for Computing one component of the solution of a set of Linear Algebraic Equations., Proc. Symposium on Monte Carlo Methods, John Wiley and Sons, 1956, pp.191–233.

4. Dimov I. and O. Tonev, Random Walk on Distant Mesh Points Monte Carlo Method. Journal of Statistical Physics, Vol. 70, Nos.5/6, pp. 1333–1342, 1993.

5. Delosme J.M., A parallel algorithm for the algebraic path problem Parallel and Distributed Algorithms, eds. Cosnard et all, Bonas, France, 1988, pp67–78.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A new highly convergent Monte Carlo method for matrix computations;Mathematics and Computers in Simulation;1998-08

2. Efficient parallel Monte Carlo methods for matrix computations;Mathematics and Computers in Simulation;1998-08

3. Coarse grained parallel Monte Carlo algorithms for solving SLAE using PVM;Recent Advances in Parallel Virtual Machine and Message Passing Interface;1998