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 neeeded, results to be more efficient than the sequential algorithm, even from the point of view of the total number of operations.

Railway computation for infinite linear systems

Favati P;
2002

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 neeeded, results to be more efficient than the sequential algorithm, even from the point of view of the total number of operations.
2002
Istituto di informatica e telematica - IIT
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/46119
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact