Multiway Monte Carlo Method for Linear Systems
From MaRDI portal
Publication:5243527
DOI10.1137/18M121527XzbMath1482.65017arXiv1608.04361OpenAlexW2983915904MaRDI QIDQ5243527
Publication date: 18 November 2019
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.04361
Computational methods for sparse matrices (65F50) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Complexity and performance of numerical algorithms (65Y20)
Uses Software
Cites Work
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- A Monte Carlo synthetic-acceleration method for solving the thermal radiation diffusion equation
- A Monte Carlo method for solving unsteady adjoint equations
- Monte Carlo linear solvers with non-diagonal splitting
- Robustness and applicability of Markov chain Monte Carlo algorithms for eigenvalue problems
- A new iterative Monte Carlo approach for inverse matrix problem
- Sequential Monto Carlo techniques for the solution of linear systems
- Scalar and parallel optimized implementation of the direct simulation Monte Carlo method
- A parallel implementation of the direct simulation Monte Carlo method
- A new \textit{walk on equations} Monte Carlo method for solving systems of linear algebraic equations
- Convergence Analysis of Markov Chain Monte Carlo Linear Solvers Using Ulam--von Neumann Algorithm
- The university of Florida sparse matrix collection
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method
- Analysis of Monte Carlo accelerated iterative methods for sparse linear systems
- Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Computational Science – ICCS 2005
- A Note on the Inversion of Matrices by Random Walks
- Parallel resolvent Monte Carlo algorithms for linear algebra problems
This page was built for publication: Multiway Monte Carlo Method for Linear Systems
