Pages that link to "Item:Q1127454"
From MaRDI portal
The following pages link to Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors (Q1127454):
Displaying 16 items.
- Parallel MCGLS and ICGLS methods for least squares problems on distributed memory architectures (Q704663) (← links)
- Parallel algorithms for the iterative solution of sparse least-squares problems (Q916307) (← links)
- The solution of large-scale least-squares problems on supercomputers (Q918420) (← links)
- A coarse-grained parallel QR-factorization algorithm for sparse least squares problems (Q1274375) (← links)
- Solving sparse linear least-squares problems on some supercomputers by using large dense blocks (Q1371662) (← links)
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (Q1625762) (← links)
- LSRN: A parallel iterative solver for strongly over- or underdetermined systems (Q2875015) (← links)
- Efficient Parallel Nonnegative Least Squares on Multicore Architectures (Q3116463) (← links)
- Parallel Sparse LU Decomposition on a Mesh Network of Transputers (Q3136552) (← links)
- Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods (Q4594173) (← links)
- Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors (Q4883663) (← links)
- A parallel multisplitting solution of the least squares problem (Q4940812) (← links)
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems (Q5066598) (← links)
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems (Q5230611) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
- Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement (Q5889340) (← links)
