AbstractA new parallel algorithm for the solution of linear systems, based upon the Monte Carlo approach, is shown. The method allows one to obtain the solution of a linear system with parallel cost growing as the logarithm of the size of the coefficient matrix, and with “probabilistic” error bounded in terms of the Chebyshev inequality
We describe a new Monte Carlo method based on a multilevel method for computing the action of the re...
We argue that Monte Carlo algorithms are ideally suited to parallel computing, and that “parallel Mo...
Fast, but approximate, solutions to linear algebra problems have many potential applications, such ...
AbstractA new parallel algorithm for the solution of linear systems, based upon the Monte Carlo appr...
AbstractA Monte Carlo method for solving systems of non-linear equations is presented and discussed....
Abstract. The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Mon...
The problem of solving System of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical...
Abstract. We argue that Monte Carlo algorithms are ideally suited to parallel computing, and that “p...
AbstractWe present randomized algorithms for the solution of some numerical linear algebra problems....
A novel algorithm for computing the action of a matrix exponential over a vector is proposed. The al...
Available from British Library Document Supply Centre- DSC:DXN057977 / BLDSC - British Library Docum...
In this paper we introduce a new algorithm, based on the successful work of Fathi and Alexandrov, on...
For solution of a system of linear algebraic equations by the Monte Carlo method a method of the suc...
In this paper we consider hybrid (fast stochastic approximation and deterministic refinement) algori...
In this paper we deal with performance analysis of Monte Carlo algorithm for large linear algebra pr...
We describe a new Monte Carlo method based on a multilevel method for computing the action of the re...
We argue that Monte Carlo algorithms are ideally suited to parallel computing, and that “parallel Mo...
Fast, but approximate, solutions to linear algebra problems have many potential applications, such ...
AbstractA new parallel algorithm for the solution of linear systems, based upon the Monte Carlo appr...
AbstractA Monte Carlo method for solving systems of non-linear equations is presented and discussed....
Abstract. The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Mon...
The problem of solving System of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical...
Abstract. We argue that Monte Carlo algorithms are ideally suited to parallel computing, and that “p...
AbstractWe present randomized algorithms for the solution of some numerical linear algebra problems....
A novel algorithm for computing the action of a matrix exponential over a vector is proposed. The al...
Available from British Library Document Supply Centre- DSC:DXN057977 / BLDSC - British Library Docum...
In this paper we introduce a new algorithm, based on the successful work of Fathi and Alexandrov, on...
For solution of a system of linear algebraic equations by the Monte Carlo method a method of the suc...
In this paper we consider hybrid (fast stochastic approximation and deterministic refinement) algori...
In this paper we deal with performance analysis of Monte Carlo algorithm for large linear algebra pr...
We describe a new Monte Carlo method based on a multilevel method for computing the action of the re...
We argue that Monte Carlo algorithms are ideally suited to parallel computing, and that “parallel Mo...
Fast, but approximate, solutions to linear algebra problems have many potential applications, such ...
DOI
Add to ORKG