Parallel pivoting algorithms for sparse symmetric matrices
From MaRDI portal
Publication:760156
DOI10.1016/S0167-8191(84)90446-0zbMATH Open0554.65017MaRDI QIDQ760156FDOQ760156
Authors: Frans J. Peters 
Publication date: 1984
Published in: Parallel Computing (Search for Journal in Brave)
Recommendations
numerical stabilityparallel computationLU-decompositionMIMD computerminimum-degree orderingparallel pivoting algorithmssparse symmetric matrices
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)
Cited In (14)
- Which pivot to solve linear systems?
- A survey of direct methods for sparse linear systems
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- A parallel graph partitioning algorithm for a message-passing multiprocessor
- The row/column pivoting strategy on multicomputers
- Parallel pivoting combined with parallel reduction and fill-in control
- A partial pivoting strategy for sparse symmetric matrix decomposition
- Comparing pivoting strategies for almost strictly sign regular matrices
- Design and implementation of a parallel Markowitz threshold algorithm
- Parallel sparse Gaussian elimination with partial pivoting
- A Space Efficient Flexible Pivot Selection Approach to Evaluate Determinant and Inverse of a Matrix
- Title not available (Why is that?)
- A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
- Improving the numerical stability and the performance of a parallel sparse solver
This page was built for publication: Parallel pivoting algorithms for sparse symmetric matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760156)
