Skip to main content
SpringerLink
Log in

Improvements on the hybrid Monte Carlo algorithms for matrix computations

  • Published:
Sādhanā Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2

Similar content being viewed by others

References

  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–146

    Article  MathSciNet  Google Scholar 

  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–262

    Article  Google Scholar 

  3. Fathi-Vajargah B 2007 Different stochastic algorithms to obtain matrix inversion. Appl. Math. Comput. 189: 1841–1846

    MathSciNet  MATH  Google Scholar 

  4. Fathi-Vajargah B 2007 New advantages to obtain accurate matrix inversion. Appl. Math. Comput. 189: 1798–1804

    MathSciNet  MATH  Google Scholar 

  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–752

  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–28

    MathSciNet  MATH  Google Scholar 

  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–2718

    Article  MathSciNet  Google Scholar 

  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–612

    Article  Google 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, Spain

  10. Strassburga J and Alexandrovb V 2013 A Monte Carlo approach to sparse approximate inverse matrix computations. Proc. Comput. Sci. 18: 2307–2316

    Article  Google Scholar 

  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–4510

    Article  MathSciNet  Google Scholar 

  12. Ji H and Li Y 2012 Reusing random walks in Monte Carlo methods for linear systems. Proc. Comput. Sci. 9: 383–392

    Article  Google Scholar 

  13. Okten G 2005 Solving linear equations by Monte Carlo simulations. SIAM J. Sci. Comput. 27: 511–531

    Article  MathSciNet  Google Scholar 

  14. Saad Y 2003 Iterative methods for sparse linear systems. Philadelphia: SIAM

    Book  Google Scholar 

  15. Sobol I M 1975 The Monte Carlo method. Chicago: The University of Chicago Press

    MATH  Google 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–2122

  17. Sen S K and Krishnamurthy E V 1974 Rank-Augmented LU-Algorithm for computing generalized matrix inverses. IEEE Trans. Comput. 23: 199–201

    Article  MathSciNet  Google Scholar 

  18. Axelsson O 1996 Iterative solution methods. Cambridge: Cambridge University Press

    MATH  Google Scholar 

  19. Website: http://math.nist.gov/MatrixMarket/matrices.html

Download references

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.

Author information

Authors and Affiliations

  1. Department of Statistics, Faculty of Mathematical Sciences, University of Guilan, P.O. Box 41335-19141, Rasht, Iran

    Behrouz Fathi-Vajargah

  2. Department of Applied Mathematics, Faculty of Mathematical Sciences, University of Guilan, P.O. Box 41335-19141, Rasht, Iran

    Zeinab Hassanzadeh

Authors
  1. Behrouz Fathi-Vajargah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zeinab Hassanzadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zeinab Hassanzadeh.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fathi-Vajargah, B., Hassanzadeh, Z. Improvements on the hybrid Monte Carlo algorithms for matrix computations. Sādhanā 44, 1 (2019). https://doi.org/10.1007/s12046-018-0983-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s12046-018-0983-y

Keywords

Search

Navigation