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

Celý popis

Podrobná bibliografia

Vydané v:	SIAM journal on matrix analysis and applications Ročník 35; číslo 4; s. 1364 - 1406
Hlavní autori:	Ballard, Grey, Becker, Dulceneia, Demmel, James, Dongarra, Jack, Druinsky, Alex, Peled, Inon, Schwartz, Oded, Toledo, Sivan, Yamazaki, Ichitaro
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States SIAM 01.01.2014
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!