Skip to main content
Conference ProceedingsOPEN ACCESS

Relaxed monte carlo linear solver

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2073 1289-1297
DOI: 10.1007/3-540-45545-0_140
3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The problem of solving systems of linear algebraic equations by parallel Monte Carlo numerical methods is considered. A parallel Monte Carlo method with relaxation is presented. This is a report of a research in progress, showing the effectiveness of this algorithm. Theoretical justification of this algorithm and numerical experiments are presented. The algorithms were implemented on a cluster of workstations using MPI.

Author supplied keywords

Cite

CITATION STYLE

APA

Tan, C. J. K., & Alexandrov, V. (2001). Relaxed monte carlo linear solver. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2073, pp. 1289–1297). Springer Verlag. https://doi.org/10.1007/3-540-45545-0_140

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free