The Block Successive Relaxation Additive Tterative method for least squares problems

DOI10.1080/00207169608804527MaRDI QIDQ2710802zbMATH OpenOpenAlexFDO

Authors M. M. Martins, D. J. Evans

Publication date 19 December 2002

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169608804527

zbMATH Keywords

least squares problemsmultisplittingoptimum parametersuccessive underrelaxationSUR

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Recommendations

• Block overrelaxation iterative methods for indefinite least squares problems
• Convergence of block iterative methods applied to sparse least-squares problems
• scientific article; zbMATH DE number 3988613
• scientific article; zbMATH DE number 3992794
• The convergence of the two-block SAOR method for least-squares problems

Cites work

• A note on the SOR and CG methods for large least squares problems
• Additive polynomial preconditions for parallel computers
• scientific article; zbMATH DE number 3658896 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• scientific article; zbMATH DE number 3366440 (Why is no real title available?)
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Successive underrelaxation (SUR) and generalised conjugate gradient (GCG) methods for hyperbolic difference equations on a parallel computer
• The least squares problem and pseudo-inverses

Cited in

(2)

• scientific article; zbMATH DE number 3988613 (Why is no real title available?)
• scientific article; zbMATH DE number 756188 (Why is no real title available?)

This page was built for publication: The Block Successive Relaxation Additive Tterative method for least squares problems

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