Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method
DOI10.1515/MCMA.2009.015zbMath1180.65007MaRDI QIDQ3654439
No author found.
Publication date: 6 January 2010
Published in: Monte Carlo Methods and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/mcma.2009.015
comparison of methods; numerical examples; boundary integral equation; Markov chain; Laplace equation; Monte Carlo algorithms; stochastic algorithms; matrix-vector product; random sparsification; randomization of iterative methods; sampling with and without replacement; matrix iterations; large systems of linear algebraic equations; Neumann-Ulam method; standard isotropic random walk on boundary process
65C05: Monte Carlo methods
60G50: Sums of independent random variables; random walks
65C40: Numerical analysis or methods applied to Markov chains
35J05: Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation
65N38: Boundary element methods for boundary value problems involving PDEs
Related Items
Cites Work
- The random walk on the boundary method for calculating capacitance
- A fast randomized algorithm for the approximation of matrices
- A randomized Kaczmarz algorithm with exponential convergence
- A Monte Carlo solution method for linear elasticity
- Über das Irrfahrtproblem
- Random Walk on Fixed Spheres for Laplace and Lamé equations
- Approximating Matrix Multiplication for Pattern Recognition Tasks
- Monte Carlo difference schemes for the wave equation
- Fast monte-carlo algorithms for finding low-rank approximations
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- The Monte Carlo Method