Parallel MCGLS and ICGLS methods for least squares problems on distributed memory architectures

DOI10.1023/B:SUPE.0000026847.75355.69MaRDI QIDQ704663zbMATH OpenOpenAlexFDO

Authors Laurence T. Yang, Richard P. Brent

Publication date 19 January 2005

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:supe.0000026847.75355.69

zbMATH Keywords

CGLSinner productsglobal communicationlarge and sparse matricesLeast squares problemsMCGLS and ICGLS methodsparallel distributed memory architectures

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• scientific article; zbMATH DE number 2040826
• SOLVING SPARSE LEAST SQUARES PROBLEMS WITH PRECONDITIONED CGLS METHOD ON PARALLEL DISTRIBUTED MEMORY COMPUTERS
• Parallel algorithms for the iterative solution of sparse least-squares problems
• An improved ICGS algorithm suitable for distributed parallel computing
• Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors

Cited in

(3)

• scientific article; zbMATH DE number 434529 (Why is no real title available?)
• scientific article; zbMATH DE number 2040826 (Why is no real title available?)
• An improved ICGS algorithm suitable for distributed parallel computing

This page was built for publication: Parallel MCGLS and ICGLS methods for least squares problems on distributed memory architectures

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