Istituto di Scienza e Tecnologie dell'Informazione     
Resta G. The average parallel complexity of cholesky factorization. In: Computers Mathematics with Applications, vol. 22 (9) pp. 27 - 33. Pergamon, 1991.
We analyze the average parallel complexity of the solution of large sparse positive definite linear systems. More precisely, using probabilistic techniques, we study the Cholesky factorization with the application of the minimum degree algorithm. Main results are the estimation of the evolution or sparsity during the factorization and a characterization of the elimination tree in terms of depth and number of leaves. We also conjecture that the number of parallel steps needed to perform the factorization is linear with respect to the matrix size.
Subject Cholesky factorization

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