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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Concurrency and computation Jg. 26; H. 16; S. 2713 - 2726
Hauptverfasser:	Zou, Dan, Dou, Yong, Guo, Song, Li, Rongchun, Deng, Lin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Blackwell Publishing Ltd 01.11.2014
Schlagworte:	Algorithms Cholesky factorization Computation Concurrency GPU Graphics processing units Platforms Solvers sparse Cholesky factorization supernodal method Utilization
ISSN:	1532-0626, 1532-0634
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!