Railway Computation for Infinite Linear Systems

Authors:
Paola Favati;Grazia Lotti;Ornella Menchi;Francesco Romani
Affiliations:
IIT-CNR Via G. Moruzzi 1, 56124 Pisa, Italy. favati@iit.pi.cnr.it;Dipartimento di Matematica, University of Parma, Via M. D'Azeglio 85/A, 43100, Parma, Italy. lotti@prmat.math.unipr.it;Dipartimento di Informatica, University of Pisa, Corso Italia 40, 56125 Pisa, Italy. menchi@di.unipi.it;Dipartimento di Informatica, University of Pisa, Corso Italia 40, 56125 Pisa, Italy. romani@di.unipi.it.
Venue:
International Journal of Parallel Programming
Year:
2002

Citing 3
Cited 0

Asynchronous two-stage iterative methods

Numerische Mathematik
Analysis of communication systems with timed token protocols using the power-series algorithm

Performance Evaluation
Timing models and local stopping criteria for asynchronous iterative algorithms

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of solving an infinite system of linear equations finitely expressed is addressed. Modifications of the Gauss–Seidel method are presented, especially suitable for the implementation on SMP machines with a small number of processors. One of the proposed parallel algorithms, which concentrates the computational efforts where they are most needed, results to be more efficient than the sequential algorithm, even from the point of view of the total number of operations.