Parallel sparse Gaussian elimination with partial pivoting
From MaRDI portal
DOI10.1007/BF02023054zbMATH Open0716.90078MaRDI QIDQ753685FDOQ753685
Authors: D. Kharzeev 
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 4070168
- Distributed Sparse Gaussian Elimination and Orthogonal Factorization
- Parallel pivoting algorithms for sparse symmetric matrices
- Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)
Cites Work
- The Evolution of the Minimum Degree Ordering Algorithm
- Nested Dissection of a Regular Finite Element Mesh
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Computing the Minimum Fill-In is NP-Complete
- A New Implementation of Sparse Gaussian Elimination
- Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
- Title not available (Why is that?)
- An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
- The Multifrontal Solution of Unsymmetric Sets of Linear Equations
- Parallel implementation of multifrontal schemes
- Sparse matrix test problems
- On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices
- Computational models and task scheduling for parallel sparse Cholesky factorization
- Solution of sparse positive definite systems on a shared-memory multiprocessor
- Multiprocessing a sparse matrix code on the Alliant FX/8
- Title not available (Why is that?)
- A compact row storage scheme for Cholesky factors using elimination trees
- On General Row Merging Schemes for Sparse Givens Transformations
- Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
- A Data Structure for Sparse $QR$ and $LU$ Factorizations
- An Optimal Agorithm for Symbolic Factorization of Symmetric Matrices
- Title not available (Why is that?)
- A Data Structure for Parallel L/U Decomposition
- Title not available (Why is that?)
Cited In (22)
- An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
- A survey of direct methods for sparse linear systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- An organization of sparse gauss elimination for solving partial differntial equations on distributed memory machines
- Design and Implementation of a Parallel Markowitz Threshold Algorithm
- Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
- The Impact of Hardware Gather/Scatter on Sparse Gaussian Elimination
- Stability of a pivoting strategy for parallel Gaussian elimination
- Title not available (Why is that?)
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- Parallel Symbolic Factorization for Sparse LU with Static Pivoting
- Distributed Sparse Gaussian Elimination and Orthogonal Factorization
- Sparse Gaussian Elimination Modulo p: An Update
- On the row merge tree for sparse LU factorization with partial pivoting
- General Sparse Elimination Requires No Permanent Integer Storage
- Gaussian elimination for the solution of linear systems of equations
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- Parallel pivoting algorithms for sparse symmetric matrices
- On the Complexity of Sparse Gaussian Elimination via Bordering
- Analysis of Pairwise Pivoting in Gaussian Elimination
- Gaussian elimination with partial pivoting and load balancing on a multiprocessor
Uses Software
This page was built for publication: Parallel sparse Gaussian elimination with partial pivoting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753685)
