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

Full description

Bibliographic Details

Published in:	Proceedings / IEEE International Conference on Cluster Computing pp. 1 - 10
Main Authors:	Uchino, Yuki, Imamura, Toshiyuki
Format:	Conference Proceeding
Language:	English
Published:	IEEE 02.09.2025
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!