Parallel Tall-and-Skinny QR Factorization Based on LU-CholeskyQR Algorithm

We present optimal parallel QR factorization algorithms with reduced communication overhead. QR factorization is widely applied to solve various problems in numerical linear algebra. Our focus is on problems involving dense tall-and-skinny matrices in large-scale parallel distributed memory systems....

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings / IEEE International Conference on Cluster Computing S. 1 - 10
Hauptverfasser:	Uchino, Yuki, Imamura, Toshiyuki
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 02.09.2025
Schlagworte:	Benchmark testing Cluster computing Clustering algorithms communication-avoiding algorithm Costs Data communication Error analysis High performance computing Linear algebra LU factorization Numerical stability Parallel algorithms tall-and-skinny QR factorization
ISSN:	2168-9253
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!