Supernodal sparse Cholesky factorization on graphics processing units

SUMMARY Sparse Cholesky factorization is the most computationally intensive component in solving large sparse linear systems and is the core algorithm of numerous scientific computing applications. A large number of sparse Cholesky factorization algorithms have previously emerged, exploiting archite...

Celý popis

Podrobná bibliografia

Vydané v:	Concurrency and computation Ročník 26; číslo 16; s. 2713 - 2726
Hlavní autori:	Zou, Dan, Dou, Yong, Guo, Song, Li, Rongchun, Deng, Lin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Blackwell Publishing Ltd 01.11.2014
Predmet:	Algorithms Cholesky factorization Computation Concurrency GPU Graphics processing units Platforms Solvers sparse Cholesky factorization supernodal method Utilization
ISSN:	1532-0626, 1532-0634
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!