A coarse-grained parallel QR-factorization algorithm for sparse least squares problems

DOI10.1016/S0167-8191(98)00034-9zbMath0909.68071OpenAlexW2064079662MaRDI QIDQ1274375

Zahari Zlatev, Tzvetan Ostromsky, Per Christian Hansen

Publication date: 12 January 1999

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(98)00034-9

zbMATH Keywords

partitioningleast squares problemreorderingblock algorithmQR-factorizationcoarse-grained parallelismdrop-tolerancegeneral sparse matrix

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (2)

Solving sparse linear least-squares problems on some supercomputers by using large dense blocks ⋮ A survey of direct methods for sparse linear systems

This page was built for publication: A coarse-grained parallel QR-factorization algorithm for sparse least squares problems