Analysis of Monte Carlo accelerated iterative methods for sparse linear systems.

DOI10.1002/NLA.2088MaRDI QIDQ5355096zbMATH OpenOpenAlexFDO

Authors Michele Benzi, T. M. Evans, Steven P. Hamilton, Massimiliano Lupo Pasini, Stuart R. Slattery

Publication date 6 September 2017

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.2088

zbMATH Keywords

iterative methodsMonte Carlo methodspreconditioningresilienceRichardson iterationsparse approximate inversessparse linear systems

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50)

Recommendations

• scientific article; zbMATH DE number 2087124
• Randomized Monte Carlo algorithms for matrix iterations and solving large systems of linear equations
• A Monte Carlo method for the parallel solution of linear systems
• Monte Carlo linear solvers with non-diagonal splitting
• scientific article; zbMATH DE number 2087123

Cited in

(17)

• Block diagonal dominance of matrices revisited: bounds for the norms of inverses and eigenvalue inclusion sets
• A highly parallel algorithm for computing the action of a matrix exponential on a vector based on a multilevel Monte Carlo method
• A Monte Carlo method for computing the action of a matrix exponential on a vector
• A probabilistic linear solver based on a multilevel Monte Carlo method
• Localization in matrix computations: theory and applications
• Uzawa-type and augmented Lagrangian methods for double saddle point systems
• scientific article; zbMATH DE number 3900038 (Why is no real title available?)
• Multiway Monte Carlo method for linear systems
• Randomized vector iterative linear solvers of high precision for large dense system
• A stochastic method for solving time-fractional differential equations
• A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks
• Community-aware empathetic social choice for social network group decision making
• Randomized vector algorithm with iterative refinement for solving boundary integral equations
• Parallel solution of large narrow band linear systems
• Regenerative Ulam-von Neumann algorithm: an innovative Markov chain Monte Carlo method for matrix inversion
• Randomly sparsified Richardson iteration: a dimension-independent sparse linear solver
• Monte Carlo linear solvers with non-diagonal splitting

Describes a project that uses

Uses Software

• IFISS

This page was built for publication: Analysis of Monte Carlo accelerated iterative methods for sparse linear systems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5355096)