论文信息 - Comparison of Three Monte Carlo Methods for Matrix Inversion

Comparison of Three Monte Carlo Methods for Matrix Inversion

Three Monte Carlo methods for Matrix Inversion (MI) are considered: with absorption, without absorption with uniform transition frequency function, and without absorption with almost optimal transition frequency function.

Vassil N. Alexandrov | S. Lakka

[1] J. Halton. A Retrospective and Prospective Survey of the Monte Carlo Method , 1970 .

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

[3] Ahmed El-Amawy. A Systolic Architecture for Fast Dense Matrix Inversion , 1989, IEEE Trans. Computers.

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

[5] Graham M. Megson. A Fast Faddeev Array , 1992, IEEE Trans. Computers.

[6] Ivan Dimov,et al. Random walk on distant mesh points Monte Carlo methods , 1993 .

[7] Sanjay V. Rajopadhye. An improved systolic algorithm for the algebraic path problem , 1993, Integr..

[8] Yves Robert,et al. Systolic solution of the Algebraic Path Problem , 1987 .

[9] Charles M. Grinstead,et al. Introduction to probability , 1999, Statistics for the Behavioural Sciences.

[10] Sun-Yuan Kung,et al. Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems , 1987, IEEE Transactions on Computers.