Parallel reduction to hessenberg form with algorithm-based fault tolerance

This paper studies the resilience of a two-sided factorization and presents a generic algorithm-based approach capable of making two-sided factorizations resilient. We establish the theoretical proof of the correctness and the numerical stability of the approach in the context of a Hessenberg Reduct...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	2013 SC - International Conference for High Performance Computing, Networking, Storage and Analysis (SC) S. 1 - 11
Hauptverfasser:	Jia, Yulu, Bosilca, George, Luszczek, Piotr, Dongarra, Jack J.
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	New York, NY, USA ACM 17.11.2013
Schriftenreihe:	ACM Conferences
Schlagworte:	Algorithm design and analysis Algorithm-based fault tolerance Checkpointing Computer Science Dense linear algebra Eigenvalues and eigenfunctions Engineering Fault tolerance Fault tolerant systems Hessenberg reduction Libraries Mathematics of computing > Mathematical software Parallel numerical libraries Prediction algorithms ScaLAPACK hessenberg reduction algorithm-based fault tolerance ScaLAPACK dense linear algebra parallel numerical libraries
ISBN:	9781450323789, 1450323782
ISSN:	2167-4329
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!