Advertisement

Sādhanā

, 44:1 | Cite as

Improvements on the hybrid Monte Carlo algorithms for matrix computations

  • Behrouz Fathi-Vajargah
  • Zeinab Hassanzadeh
Article
  • 9 Downloads

Abstract

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.

Keywords

System of linear algebraic equations Markov chain Monte Carlo convergence analysis transition probability matrix inversion 

Notes

Acknowledgements

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.

References

  1. 1.
    Drovandi C C, Pettitt N A and Henderson D A 2014 Marginal reversible jump Markov chain Monte Carlo with application to motor unit number estimation. Comput. Statist. Data Anal. 72: 128–146MathSciNetCrossRefGoogle Scholar
  2. 2.
    Veselinović M A, Velimorović D, Kaličanin B, Toropova A, Toropov A and Veselinović J 2017 Prediction of gas chromatographic retention indices based on Monte Carlo method. Talanta 168: 257–262CrossRefGoogle Scholar
  3. 3.
    Fathi-Vajargah B 2007 Different stochastic algorithms to obtain matrix inversion. Appl. Math. Comput. 189: 1841–1846MathSciNetzbMATHGoogle Scholar
  4. 4.
    Fathi-Vajargah B 2007 New advantages to obtain accurate matrix inversion. Appl. Math. Comput. 189: 1798–1804MathSciNetzbMATHGoogle Scholar
  5. 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
  6. 6.
    Benzi M, Evans T M, Hamilton S P, Pasini M L and Slattery S R 2016 Analysis of Monte Carlo accelerated iterative methods for sparse linear systems. Numer. Linear Algebra Appl. 24: 1–28MathSciNetzbMATHGoogle Scholar
  7. 7.
    Alexandrov V and Esquivel-Flores O A 2015 Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations. Comput. Math. Appl. 70: 2709–2718MathSciNetCrossRefGoogle Scholar
  8. 8.
    Branford S, Sahin C, Thandavan A, Weihrauch C, Alexandrov V and Dimov I T 2008 Monte Carlo methods for matrix computations on the grid. Future Gener. Comput. Syst. 24: 605–612CrossRefGoogle Scholar
  9. 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
  10. 10.
    Strassburga J and Alexandrovb V 2013 A Monte Carlo approach to sparse approximate inverse matrix computations. Proc. Comput. Sci. 18: 2307–2316CrossRefGoogle Scholar
  11. 11.
    Dimov I, Maire S and Sellier J M 2015 A new walk on equations Monte Carlo method for solving systems of linear algebraic equations. Appl. Math. Model. 39: 4494–4510MathSciNetCrossRefGoogle Scholar
  12. 12.
    Ji H and Li Y 2012 Reusing random walks in Monte Carlo methods for linear systems. Proc. Comput. Sci. 9: 383–392CrossRefGoogle Scholar
  13. 13.
    Okten G 2005 Solving linear equations by Monte Carlo simulations. SIAM J. Sci. Comput. 27: 511–531MathSciNetCrossRefGoogle Scholar
  14. 14.
    Saad Y 2003 Iterative methods for sparse linear systems. Philadelphia: SIAMCrossRefGoogle Scholar
  15. 15.
    Sobol I M 1975 The Monte Carlo method. Chicago: The University of Chicago PresszbMATHGoogle Scholar
  16. 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
  17. 17.
    Sen S K and Krishnamurthy E V 1974 Rank-Augmented LU-Algorithm for computing generalized matrix inverses. IEEE Trans. Comput. 23: 199–201MathSciNetCrossRefGoogle Scholar
  18. 18.
    Axelsson O 1996 Iterative solution methods. Cambridge: Cambridge University PresszbMATHGoogle Scholar
  19. 19.

Copyright information

© Indian Academy of Sciences 2018

Authors and Affiliations

  1. 1.Department of Statistics, Faculty of Mathematical SciencesUniversity of GuilanRashtIran
  2. 2.Department of Applied Mathematics, Faculty of Mathematical SciencesUniversity of GuilanRashtIran

Personalised recommendations