Istituto di Scienza e Tecnologie dell'Informazione     
Codenotti B., Resta G. The average parallel complexity of some sparse problems. Internal note IEI-B4-02, 1990.
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.

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional