Improvements on the hybrid Monte Carlo algorithms for matrix computations
- 59 Downloads
In this paper, we present some improvements on the Markov chain Monte Carlo and hybrid Markov chain Monte Carlo algorithms for matrix computations. We discuss the convergence of the Monte Carlo method using the Ulam–von Neumann approach related to selecting the transition probability matrix. Specifically, we show that if the norm of the iteration matrix T is less than 1 then the Monte Carlo Almost Optimal method is convergent. Moreover, we suggest a new technique to approximate the inverse of the strictly diagonally dominant matrix and we exert some modifications and corrections on the hybrid Monte Carlo algorithm to obtain the inverse matrix in general. Finally, numerical experiments are discussed to illustrate the efficiency of the theoretical results.
KeywordsSystem of linear algebraic equations Markov chain Monte Carlo convergence analysis transition probability matrix inversion
The authors would like to thank the reviewer(s) and the corresponding editor, Prof. Manoj Kumar Tiwari, for their valuable comments and suggestions in the significant improvement of the manuscript.
- 5.Alexandrov V, Atanassov E, Dimov I, Branford S, Thandavan A and Weihrauch C 2005 Parallel hybrid Monte Carlo algorithms for matrix computations. In: Proceedings Part III of the 5th International Conference, Atlanta, GA, USA, May 22–25, Lecture Notes in Computer Science 3516, pp. 744–752Google Scholar
- 9.Davila D, Alexandrov V and Esquivel-Flores O A 2016 On Monte Carlo hybrid methods for linear algebra. In: Proceedings of the 7th Workshop on Latest Advances in Scalable Algorithms for Large-scale Systems, SpainGoogle Scholar
- 16.Ji H, Mascagni M and Li Y 2013 Convergence analysis of Markov chain Monte Carlo linear solvers using Ulam–Von Neumann algorithm. SIAM J. Numer. Anal. 51: 2107–2122Google Scholar