|
Organizers |
Monte Carlo techniques for solving large sparse linear systems
by
Todor Dimov
Central Laboratory for Parallel Processing, Bulgarian Academy of Sciences, Acad. G. Bonchev Bl. 25A, 1113 Sofia, Bulgaria
Coauthors: Rayna Georgieva
Iterative Monte Carlo algorithms, appropriate for solving the linear systems with large scale sparse matrices of general case are considered. The algorithm with minimal stochastic (probable) error, based on adjoint formulation of the problem, is presented. Balancing of the both systematic and stochastic errors is studied. Numerical results for some test matrices are performed. The algorithms under consideration are well parallelized.
http://copern.bas.bg:80/~tdimov
Date received: February 24, 2000
Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caen-36.