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

Full description

Bibliographic Details

Published in:	Concurrency and computation Vol. 26; no. 16; pp. 2713 - 2726
Main Authors:	Zou, Dan, Dou, Yong, Guo, Song, Li, Rongchun, Deng, Lin
Format:	Journal Article
Language:	English
Published:	Blackwell Publishing Ltd 01.11.2014
Subjects:	Algorithms Cholesky factorization Computation Concurrency GPU Graphics processing units Platforms Solvers sparse Cholesky factorization supernodal method Utilization
ISSN:	1532-0626, 1532-0634
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!