A parallel multisplitting solution of the least squares problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 238288
- Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
- Parallel algorithms for the iterative solution of sparse least-squares problems
- scientific article; zbMATH DE number 822132
- Iterative methods for least-square problems based on proper splittings.
Cites work
Cited in
(14)- A parallel algorithm for discrete least squares rational approximation
- A unified approach to parallel space decomposition methods
- A projection method for semidefinite linear systems and its applications
- Parallelization of Hermitian positive definite systems of equations: a hierarchical Jacobi approach
- Parallel computing in linear mixed models
- Parallel statistical computing for statistical inference
- Efficient Parallel Nonnegative Least Squares on Multicore Architectures
- scientific article; zbMATH DE number 4056886 (Why is no real title available?)
- A Parallel Nonlinear Least-Squares Solver: Theoretical Analysis and Numerical Results
- Multisplitting for regularized least squares with Krylov subspace recycling.
- scientific article; zbMATH DE number 238288 (Why is no real title available?)
- The Parallel Modification to the Levenberg-Marquardt Algorithm
- Learning spectral windowing parameters for regularization using unbiased predictive risk and generalized cross validation techniques for multiple data sets
- Parallel Cholesky-based reduction for the weighted integer least squares problem
This page was built for publication: A parallel multisplitting solution of the least squares problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4940812)