Numerical Experiments with Monte Carlo Methods and SPAI Preconditioner for Solving System of Linear Equations

Authors:
Bo Liu;Behrouz Fathi;Vassil N. Alexandrov
Affiliations:
-;-;-
Venue:
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
Year:
2002

Citing 4
Cited 0

A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method

SIAM Journal on Scientific Computing
Parallel Preconditioning with Sparse Approximate Inverses

SIAM Journal on Scientific Computing
Parallel resolvent Monte Carlo algorithms for linear algebra problems

Mathematics and Computers in Simulation - IMACS sponsored Special issue on the second IMACS seminar on Monte Carlo methods
Mixed Monte Carlo Parallel Algorithms for Matrix Computation

ICCS '02 Proceedings of the International Conference on Computational Science-Part II

Quantified Score

Hi-index	0.03

Visualization

Abstract

In this paper we present the results of experiments comparing the performance of the mixed Monte Carlo algorithms and SPAI preconditener with BICGSTAB. The experiments are carried out on a Silicon Graphics ONYX2 machine. Based on our experiments, we conclude that these techniques are comparable from the point of view of robustness and rates of convergence, with the Monte Carlo approach performing better for some general cases and SPAI approach performing better in case of very sparse matrices.