Systolic Matrix Inversion Using a Monte Carlo Method

ABSTRACT A systolic array for inverting an n × n matrix using a Monte Carlo method is proposed. The basic array computes a single row of the inverse in 3n + N + T steps ( including input and output time) and O( nNT) cells where N is the number of chains and T is the length of each chain in the stochastic process. A full inverse is computed in the same time but requires O(n2NT) cells. Further improvements reduce the time to 3n/ 2 + N + T using the same number of cells. A number of bounds on N and T are established which show that our design is faster than existing designs for reasonably large values of n Indeed the final arrays require less than n4 cells and have a computing time bounded above by 4n.

[1]  Sun-Yuan Kung,et al.  On supercomputing with systolic/wavefront array processors , 1984 .

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

[3]  J. G. Nash,et al.  Modified Faddeev Algorithm For Matrix Manipulation , 1984, Optics & Photonics.

[4]  Jean-Marc Delosme,et al.  Transformation of Broadcass into Propagations in Systolic Algorithms , 1992, J. Parallel Distributed Comput..

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

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

[7]  Graham M. Megson Mapping a class of run-time dependencies onto regular arrays , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

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

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

[10]  H. T. Kung,et al.  Systolic Arrays for (VLSI). , 1978 .

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

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

[13]  Yves Robert,et al.  Synthesis of Processor Arrays for the Algebraic Path Problem: Unifying Old Results and Deriving New Architectures , 1991, Parallel Process. Lett..

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

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

[16]  Patrice Quinton,et al.  The mapping of linear recurrence equations on regular arrays , 1989, J. VLSI Signal Process..

[17]  R. A. Leibler,et al.  Matrix inversion by a Monte Carlo method , 1950 .