Abstract
In this paper we consider mixed (fast stochastic approximation and deterministic refinement) algorithms for Matrix Inversion (MI) and Solving Systems of Linear Equations (SLAE). Monte Carlo methods are used for the stochastic approximation, since it is known that they are very efficient in finding a quick rough approximation of the element or a row of the inverse matrix or finding a component of the solution vector. In this paper we show how the stochastic approximation of the MI can be combined with a deterministic refinement procedure to obtain MI with the required precision and further solve the SLAE using MI. We employ a splitting A = D - C of a given non-singular matrix A, where D is a diagonal dominant matrix and matrix C is a diagonal matrix. In our algorithm for solving SLAE and MI different choices of D can be considered in order to control the norm of matrix T = D-1C, of the resulting SLAE and to minimize the number of the Markov Chains required to reach given precision. Experimental results with dense and sparse matrices are presented.
Chapter PDF
Similar content being viewed by others
Keywords
References
Fathi Vajargah B., Liu B. and Alexandrov V., On the preconditioner Monte Carlo methods for solving linear systems. MCM 2001, Salzburg, Austria (presented).
Ortega, J., Numerical Analysis, SIAM edition, USA, 1990.
Alexandrov V.N., Efficient parallel Monte Carlo Methods for Matrix Computation, Mathematics and computers in Simulation, Elsevier 47 pp. 113–122, Netherlands, (1998).
Golub, G.H., Ch., F., Van Loan, Matrix Computations, The Johns Hopkins Univ. Press, Baltimore and London, (1996)
Taft K. and Fathi Vajargah B., Monte Carlo Method for Solving Systems of Linear Algebraic Equations with Minimum Markov Chains. International Conference PDPTA’2000 Las Vegas, (2000).
Sobol I.M. Monte Carlo Numerical Methods. Moscow, Nauka, 1973 (in Russian).
Dimov I., Alexandrov V.N. and Karaivanova A., Resolvent Monte Carlo Methods for Linear Algebra Problems, Mathematics and Computers in Simulation, Vo155, pp. 25–36, 2001.
Fathi Vajargah B. and Alexandrov V.N., Coarse Grained Parallel Monte Carlo Algorithms for Solving Systems of Linear Equations with Minimum Communication, in Proc. of PDPTA, June 2001, Las Vegas, 2001, pp. 2240–2245.
Alexandrov V.N. and Karaivanova A., Parallel Monte Carlo Algorithms for Sparse SLAE using MPI, LNCS 1697, Springer 1999, pp. 283–290.
Alexandrov V.N., Rau-Chaplin A., Dehne F. and Taft K., Efficient Coarse Grain Monte Carlo Algorithms for matrix computation using PVM, LNCS 1497, pp. 323–330, Springer, August 1998.
Dimov I.T., Dimov T.T., et all, A new iterative Monte Carlo Approach for Inverse Matrix Problem, J. of Computational and Applied Mathematics 92 pp 15–35 (1998).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fathi, B., Liu, B., Alexandrov, V. (2002). Mixed Monte Carlo Parallel Algorithms for Matrix Computation. In: Sloot, P.M.A., Hoekstra, A.G., Tan, C.J.K., Dongarra, J.J. (eds) Computational Science — ICCS 2002. ICCS 2002. Lecture Notes in Computer Science, vol 2330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46080-2_63
Download citation
DOI: https://doi.org/10.1007/3-540-46080-2_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43593-8
Online ISBN: 978-3-540-46080-0
eBook Packages: Springer Book Archive