Parallel and fully recursive multifrontal sparse Cholesky

We describe the design, implementation, and performance of a new parallel sparse Cholesky factorization code. The code uses a multifrontal factorization strategy. Operations on small dense submatrices are performed using new dense matrix subroutines that are part of the code, although the code can a...

Celý popis

Podrobná bibliografia

Vydané v:	Future generation computer systems Ročník 20; číslo 3; s. 425 - 440
Hlavní autori:	Irony, Dror, Shklarski, Gil, Toledo, Sivan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.04.2004
Predmet:	Block layouts Cilk Multifrontal factorizations Parallel Cholesky factorization Recursive factorizations Recursive layouts Sparse Cholesky factorization Parallel Cholesky factorization Recursive factorizations Cilk Block layouts Sparse Cholesky factorization Multifrontal factorizations Recursive layouts
ISSN:	0167-739X, 1872-7115
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!