New “Walk on Equations” Monte Carlo Algorithm for Linear Systems

A novel version of Monte Carlo algorithm for solving systems of linear algebraic equations is presented and studied. The algorithm is similar to the “Walk on Equations” Monte Carlo method recently developed by Ivan Dimov, Sylvain Maire and Jean Michel Sellier. It is done a comparison with the Gauss-...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2023-12, Vol.2675 (1), p.12037
Main Authors: Todorov, Venelin, Georgiev, Slavi, Apostolov, Stoyan
Format: Article
Language:English
Subjects:
Algorithms
Gauss-Seidel method
Iterative methods
Linear algebra
Linear systems
Monte Carlo simulation
Physics
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A novel version of Monte Carlo algorithm for solving systems of linear algebraic equations is presented and studied. The algorithm is similar to the “Walk on Equations” Monte Carlo method recently developed by Ivan Dimov, Sylvain Maire and Jean Michel Sellier. It is done a comparison with the Gauss-Seidel method for matrices up to size of 2 12 . The algorithm could be drastically improved by choosing appropriate values for the relaxation parameters, which in turn leads to dramatic reduction in time and lower relative errors for a given number of iterations. What is more, a sequential Monte Carlo method of John Halton based on an iterative use of the control variate method has been applied. Some of the most important numerical applications are the large system, coming from a finite element approximation of problems, describing a beam structure in constructive mechanics, and the block-diagonal matrices, which come from discretization of models in a regime-switching economy.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/2675/1/012037