A parallel multisplitting solution of the least squares problem

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1099-1506(199801/02)5:1<11::AID-NLA123>3.0.CO;2-F" /><11::AID-NLA123>3.0.CO;2-F 10.1002/(SICI)1099-1506(199801/02)5:1<11::AID-NLA123>3.0.CO;2-FzbMath0937.65049OpenAlexW2166627125MaRDI QIDQ4940812

Rosemary A. Renaut

Publication date: 27 February 2000

Full work available at URL: https://doi.org/10.1002/(sici)1099-1506(199801/02)5:1<11::aid-nla123>3.0.co;2-f

zbMATH Keywords

convergencenumerical examplesparallel algorithmslinear least-squares problemQR factorizationmultisplittingiterative refinement

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items (7)

A projection method for semidefinite linear systems and its applications ⋮ Learning spectral windowing parameters for regularization using unbiased predictive risk and generalized cross validation techniques for multiple data sets ⋮ Parallel computing in linear mixed models ⋮ Multisplitting for regularized least squares with Krylov subspace recycling ⋮ A unified approach to parallel space decomposition methods ⋮ Parallel statistical computing for statistical inference ⋮ Parallelization of Hermitian positive definite systems of equations: a hierarchical Jacobi approach

Cites Work

• Unnamed Item
• PARALLEL MULTISPLITTINGS FOR OPTIMIZATION∗

This page was built for publication: A parallel multisplitting solution of the least squares problem