Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors

DOI10.1016/S0167-8191(97)00064-1zbMath0903.68095MaRDI QIDQ1127454

Chunguang Sun

Publication date: 13 August 1998

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

zbMATH Keywords

sparse matrixparallel algorithmsmultifrontal methodleast squares problemsorthogonal factorizationtriangular solutiondistributed-memory multiprocessors

Mathematics Subject Classification ID

Computer system organization (68M99) Distributed algorithms (68W15)

Related Items (6)

Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement ⋮ A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows ⋮ A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems ⋮ Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods ⋮ A survey of direct methods for sparse linear systems ⋮ Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems

This page was built for publication: Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors