Dimov, I.; Alexandrov, V.; Karaivanova, A. - In: Mathematics and Computers in Simulation (MATCOM) 55 (2001) 1, pp. 25-35
In this paper, we consider Monte Carlo (MC) algorithms based on the use of the resolvent matrix for solving linear algebraic problems. Estimates for the speedup and efficiency of the algorithms are presented. Some numerical examples performed on cluster of workstations using MPI are given.
