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

DOI10.1023/B:SUPE.0000026847.75355.69zbMATH Open1101.68390OpenAlexW2000074722MaRDI QIDQ704663FDOQ704663

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Distributed systems (68M14)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)