Distributed Sparse Gaussian Elimination and Orthogonal Factorization
From MaRDI portal
Publication:4859546
Recommendations
Cited in
(17)- A survey of direct methods for sparse linear systems
- An organization of sparse gauss elimination for solving partial differntial equations on distributed memory machines
- Distributed Orthogonal Factorization: Givens and Householder Algorithms
- LQ-Schur projection on large sparse matrix equations
- Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors
- Sparse Gaussian Elimination Modulo p: An Update
- A shared- and distributed-memory parallel general sparse direct solver
- Parallel sparse Gaussian elimination with partial pivoting
- Gaussian elimination for the solution of linear systems of equations
- On equilibration and sparse factorization of matrices arising in finite element solutions of partial differential equations
- Hybrid Sparse Linear Solutions with Substituted Factorization
- A scalable parallel factorization of finite element matrices with distributed Schur complements.
- On the Complexity of Sparse Gaussian Elimination via Bordering
- Independent set orderings for parallel matrix factorization by Gaussian elimination
- Purcell's method, projective n-space, and a parallelizable, sparse linear equation solver
- \(S^+\): Efficient 2D sparse LU factorization on parallel machines
- scientific article; zbMATH DE number 434527 (Why is no real title available?)
This page was built for publication: Distributed Sparse Gaussian Elimination and Orthogonal Factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4859546)