Reordering sparse matrices for parallel elimination

DOI10.1016/0167-8191(89)90064-1MaRDI QIDQ1123535zbMATH OpenOpenAlexFDO

Authors Joseph W. H. Liu

Publication date 1989

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(89)90064-1

zbMATH Keywords

elimination treeNumerical examplesparallel Gaussian eliminationfill-reducing orderingreordering algorithmsparse symmetric positive-definite matrix

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Recommendations

• A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
• scientific article; zbMATH DE number 4070168
• On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
• Techniques for parallel manipulation of sparse matrices
• scientific article; zbMATH DE number 4066229
• Large-Scale Scientific Computing
• Parallel sparse matrix solution and performance
• Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
• Finding optimal ordering of sparse matrices for column-oriented parallel Cholesky factorization
• Sparse Matrix Computations on Parallel Processor Arrays

Cited in

(26)

• A parallel multi-\(p\) method
• Multicolor reordering of sparse matrices resulting from irregular grids
• A survey of direct methods for sparse linear systems
• Task scheduling for parallel sparse Cholesky factorization
• A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
• scientific article; zbMATH DE number 4131525 (Why is no real title available?)
• A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
• PMORSy: parallel sparse matrix ordering software for fill-in minimization
• On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
• A parallel solver for the \(hp\)-version of finite element methods
• The Minimum Degree Ordering with Constraints
• Reordering for parallelism
• Finding optimal ordering of sparse matrices for column-oriented parallel Cholesky factorization
• Evaluation of Orderings for Unsymmetric Sparse Matrices
• Solution of sparse positive definite systems on a hypercube
• Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
• Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
• The impact of high-performance computing in the solution of linear systems: Trends and problems
• A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs
• Sparse QR factorization on a massively parallel computer
• Independent set orderings for parallel matrix factorization by Gaussian elimination
• Improving parallel ordering of sparse matrices using genetic algorithms
• Minimum communication cost reordering for parallel sparse Cholesky factorization
• A heuristic approach to the treedepth decomposition problem for large graphs
• A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
• scientific article; zbMATH DE number 3876585 (Why is no real title available?)

This page was built for publication: Reordering sparse matrices for parallel elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123535)