On Monte Carlo Hybrid Methods for Linear Algebra

This paper presents an enhanced hybrid (e.g. stochastic/deterministic) method for Linear Algebra based on bulding an efficient stochastic s and then solving the corresponding System of Linear Algebraic Equations (SLAE) by applying an iterative method. This is a Monte Carlo preconditioner based on Ma...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2016 7th Workshop on Latest Advances in Scalable Algorithms for Large Scale Systems (ScalA) s. 81 - 88
Hlavní autoři: Davila, Diego, Alexandrov, Vassil, Esquivel-Flores, Oscar A.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.11.2016
Témata:
Algorithm design and analysis
Approximation algorithms
Hybrid Methods for Linear Algebra
Iterative methods
Linear algebra
Mathematical model
Monte Carlo
Monte Carlo methods
Parallelization
Preconditioners
Sparse matrices
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper presents an enhanced hybrid (e.g. stochastic/deterministic) method for Linear Algebra based on bulding an efficient stochastic s and then solving the corresponding System of Linear Algebraic Equations (SLAE) by applying an iterative method. This is a Monte Carlo preconditioner based on Markov Chain Monte Carlo (MCMC) methods to compute a rough approximate matrix inverse first. The above Monte Carlo preconditioner is further used to solve systems of linear algebraic equations thus delivering hybrid stochastic/deterministic algorithms. The advantage of the proposed approach is that the sparse Monte Carlo matrix inversion has a computational complexity linear of the size of the matrix, it is inherently parallel and thus can be obtained very efficiently for large matrices and can be used also as an efficient preconditioner while solving systems of linear algebraic equations. Several improvements, as well as the mixed MPI/OpenMP implementation, are carried out that enhance the scalability of the method and the efficient use of computational resources. A set of different test matrices from several matrix market collections were used to show the consistency of these improvements.
DOI:10.1109/ScalA.2016.015