Communication-Avoiding Symmetric-Indefinite Factorization

We describe and analyze a novel symmetric triangular factorization algorithm. The algorithm is essentially a block version of Aasen's triangular tridiagonalization. It factors a dense symmetric matrix $A$ as the product $A=PLTLT}PT},$ where $P$ is a permutation matrix, $L$ is lower triangular,...

Full description

Bibliographic Details

Published in:	SIAM journal on matrix analysis and applications Vol. 35; no. 4; pp. 1364 - 1406
Main Authors:	Ballard, Grey, Becker, Dulceneia, Demmel, James, Dongarra, Jack, Druinsky, Alex, Peled, Inon, Schwartz, Oded, Toledo, Sivan, Yamazaki, Ichitaro
Format:	Journal Article
Language:	English
Published:	United States SIAM 01.01.2014
Subjects:	Aasen's factorization Adaptation Algorithms Asymptotic properties Blocking communication-avoiding algorithms Factorization Hierarchies MATHEMATICS AND COMPUTING Optimization Parallel computers symmetric-indefinite matrices
ISSN:	0895-4798, 1095-7162
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!