There is today a wide body of literature concerning parallel algorithms in numerical linear algebra. Parallel algorithms have been developed since the early sixties, although no parallel architecture had been constructed at that time. A systematic development of the notion of concurrency immplies the departure from the traditional sequential machine, and from the sequential nature of the algorithms running on it. Advances in technology over the last decades have been extremely impressive.
Preconditioning and parallel linear systems solvers
Codenotti B
1988
Abstract
There is today a wide body of literature concerning parallel algorithms in numerical linear algebra. Parallel algorithms have been developed since the early sixties, although no parallel architecture had been constructed at that time. A systematic development of the notion of concurrency immplies the departure from the traditional sequential machine, and from the sequential nature of the algorithms running on it. Advances in technology over the last decades have been extremely impressive.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_419303-doc_148147.pdf
accesso aperto
Descrizione: Preconditioning and parallel linear systems solvers
Dimensione
436.53 kB
Formato
Adobe PDF
|
436.53 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
