Parallel pivoting algorithms for sparse symmetric matrices
It is shown that for sufficiently sparse symmetric matrices some pivots may be processed simultaneously. The author extends the results of \textit{J. A. G. Jess} and \textit{H. G. M. Kees} [IEEE Trans. Comput. C-31, 231-239 (1982; Zbl 0479.68034)] by removing the no fill-in restriction. Algorithms which yield maximum parallelism, are given for a computer with sufficiently many processors and a common memory. Additional algorithms are given for a computer with an arbitrary but fixed number of processors. It is assumed that the numerical stability does not depend on the order in which the diagonal elements are chosen as pivots.
- 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
- Parallel pivoting combined with parallel reduction and fill-in control
- The row/column pivoting strategy on multicomputers
- Which pivot to solve linear systems?
- Improving the numerical stability and the performance of a parallel sparse solver
- Comparing pivoting strategies for almost strictly sign regular matrices
- scientific article; zbMATH DE number 434524 (Why is no real title available?)
- A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
- A partial pivoting strategy for sparse symmetric matrix decomposition
- A Space Efficient Flexible Pivot Selection Approach to Evaluate Determinant and Inverse of a Matrix
- Design and implementation of a parallel Markowitz threshold algorithm
- A survey of direct methods for sparse linear systems
- Parallel sparse Gaussian elimination with partial pivoting
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)
