Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors
From MaRDI portal
Recommendations
- Distributed Sparse Gaussian Elimination and Orthogonal Factorization
- Parallel sparse Cholesky factorization on a shared memory multiprocessor
- Sparse Orthogonal Decomposition on a Hypercube Multiprocessor
- Multifrontal Computation with the Orthogonal Factors of Sparse Matrices
- scientific article; zbMATH DE number 554771
- scientific article; zbMATH DE number 833698
- Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
- Parallel Cholesky factorization on orthogonal multiprocessors
- scientific article; zbMATH DE number 833704
Cited in
(13)- Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
- A coarse-grained parallel QR-factorization algorithm for sparse least squares problems
- Hierarchical orthogonal factorization: sparse least squares problems
- Distributed-memory hierarchical interpolative factorization
- The scalability of parallel computers for sparse QR factorisation
- Distributed Orthogonal Factorization: Givens and Householder Algorithms
- scientific article; zbMATH DE number 1226271 (Why is no real title available?)
- scientific article; zbMATH DE number 554771 (Why is no real title available?)
- Algorithm 980: Sparse QR factorization on the GPU
- scientific article; zbMATH DE number 833698 (Why is no real title available?)
- Multifrontal Computation with the Orthogonal Factors of Sparse Matrices
- Turbo‐SMT: Parallel coupled sparse matrix‐Tensor factorizations and applications
- A survey of direct methods for sparse linear systems
This page was built for publication: Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883663)