In this paper, we give a first look at the average parallel complexity of some prob1em s concerning random graphs and matrices. More precise1y, we consider the solution of large sparse positive definite linear systems, which arise in a variety of contexts, e.g. scientific computation.
The average parallel complexity of some sparse problems
Codenotti B;Resta G
1990
Abstract
In this paper, we give a first look at the average parallel complexity of some prob1em s concerning random graphs and matrices. More precise1y, we consider the solution of large sparse positive definite linear systems, which arise in a variety of contexts, e.g. scientific computation.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_489220-doc_203667.pdf
accesso aperto
Descrizione: The average parallel complexity of some sparse problems
Dimensione
979.86 kB
Formato
Adobe PDF
|
979.86 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
