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

DOI10.1016/S0167-8191(98)00034-9MaRDI QIDQ1274375zbMATH OpenOpenAlexFDO

Authors 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

block algorithmcoarse-grained parallelismdrop-tolerancegeneral sparse matrixleast squares problempartitioningQR-factorizationreordering

Mathematics Subject Classification ID

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

Recommendations

• Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
• Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors
• Sparse QR factorization on a massively parallel computer
• scientific article; zbMATH DE number 833698

Cited in

(13)

• A pipelined Givens method for computing the QR factorization of a sparse matrix
• Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
• Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
• Hierarchical orthogonal factorization: sparse least squares problems
• scientific article; zbMATH DE number 4199985 (Why is no real title available?)
• MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least‐Squares Problems
• QR Factorization for Linear Least-Squares Problems on a Hypercube Multiprocessor
• scientific article; zbMATH DE number 741167 (Why is no real title available?)
• Sparse QR factorization in MATLAB
• scientific article; zbMATH DE number 833698 (Why is no real title available?)
• A survey of direct methods for sparse linear systems
• Improved parallel QR method for large least squares problems involving Kronecker products
• QR factorization for the regularized least squares problem on hypercubes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1274375)