Parallel algorithms for the iterative solution of sparse least-squares problems
From MaRDI portal
Recommendations
Cited in
(19)- An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
- A parallel algorithm for discrete least squares rational approximation
- LSRN: A parallel iterative solver for strongly over- or underdetermined systems
- scientific article; zbMATH DE number 3967813 (Why is no real title available?)
- Parallel minimum norm solution of sparse block diagonal column overlapped underdetermined systems
- scientific article; zbMATH DE number 833698 (Why is no real title available?)
- Design of an iterative solution module for a parallel sparse matrix library (P\_SPARSLIB)
- A parallel multisplitting solution of the least squares problem
- Parallel tools for solving incremental dense least squares problems: application to space geodesy
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
- scientific article; zbMATH DE number 4126566 (Why is no real title available?)
- Parallel Cholesky-based reduction for the weighted integer least squares problem
- A Parallel Nonlinear Least-Squares Solver: Theoretical Analysis and Numerical Results
- Parallel algorithm for householder transformation with applications to Ill-conditioned problems
- Optimal parallel randomized algorithms for sparse addition and identification
- Parallel MCGLS and ICGLS methods for least squares problems on distributed memory architectures
- The Parallel Modification to the Levenberg-Marquardt Algorithm
- scientific article; zbMATH DE number 4056886 (Why is no real title available?)
- scientific article; zbMATH DE number 2040826 (Why is no real title available?)
This page was built for publication: Parallel algorithms for the iterative solution of sparse least-squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916307)
