A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
From MaRDI portal
Publication:1343678
DOI10.1007/BF02238079zbMath0814.65027MaRDI QIDQ1343678
Per Christian Hansen, Zahari Zlatev, Kyle A. Gallivan, Tzvetan Ostromsky
Publication date: 30 January 1995
Published in: Computing (Search for Journal in Brave)
numerical experimentssparse matricesGaussian eliminationreordering algorithmcoarse-grain parallel solver
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Improving the numerical stability and the performance of a parallel sparse solver, Solving sparse linear least-squares problems on some supercomputers by using large dense blocks, Design and Implementation of a Parallel Markowitz Threshold Algorithm, A survey of direct methods for sparse linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- Parallel Sparse LU Decomposition on a Mesh Network of Transputers
- Parallel Algorithms for Dense Linear Algebra Computations
- Use of the ${\text{P}}^4 $ and ${\text{P}}^5 $ Algorithms for In-Core Factorization of Sparse Matrices
- A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization
- A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
- Condition Number Estimators in a Sparse Matrix Software
- The Use of BLAS3 in Linear Algebra on a Parallel Processor with a Hierarchical Memory
- Sparse matrix test problems
- Use of Iterative Refinement in the Solution of Sparse Linear Systems
- Reinversion with the preassigned pivot procedure
