Convergence analysis of Markov chain Monte Carlo linear solvers using Ulam-von Neumann algorithm
DOI10.1137/130904867zbMATH Open1282.65015OpenAlexW2033459956MaRDI QIDQ2855100FDOQ2855100
Authors: Hao Ji, Michael Mascagni, Yaohang Li
Publication date: 24 October 2013
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.odu.edu/computerscience_fac_pubs/66
Recommendations
- On the convergence of the Markov chain simulation method
- scientific article; zbMATH DE number 5520724
- Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms
- Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review
- Increasing the efficiency of the Monte Carlo method and reducing the length of Markov chains for solving linear systems
- Comparison of methodologies to assess the convergence of Markov chain Monte Carlo methods
Markov chain Monte Carlo methodconvergence analysislinear solvertransition probability matrixvon Neumann seriesUlam-von Neumann algorithm
Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms (68W40) Iterative numerical methods for linear systems (65F10)
Cited In (13)
- A new \textit{walk on equations} Monte Carlo method for solving systems of linear algebraic equations
- An improved ``walk on equations Monte Carlo algorithm for linear algebraic systems
- A new Monte Carlo method for solving system of linear algebraic equations
- Multiway Monte Carlo method for linear systems
- Randomized vector iterative linear solvers of high precision for large dense system
- A parallel Monte Carlo method for solving electromagnetic scattering in clusters of dielectric objects
- A stochastic method for solving time-fractional differential equations
- Monte Carlo method for the real and complex fuzzy system of linear algebraic equations
- A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks
- A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method
- Approximating matrix eigenvalues by subspace iteration with repeated random sparsification
- A probabilistic linear solver based on a multilevel Monte Carlo method
- A Monte Carlo method for computing the action of a matrix exponential on a vector
This page was built for publication: Convergence analysis of Markov chain Monte Carlo linear solvers using Ulam-von Neumann algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2855100)