Reordering sparse matrices for parallel elimination
From MaRDI portal
Publication:1123535
DOI10.1016/0167-8191(89)90064-1zbMath0677.65023OpenAlexW2059098138MaRDI QIDQ1123535
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
elimination treeNumerical examplesparallel Gaussian eliminationfill-reducing orderingreordering algorithmsparse symmetric positive-definite matrix
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A clique tree algorithm for partitioning a chordal graph into transitive subgraphs, A parallel solver for the \(hp\)-version of finite element methods, Solution of sparse positive definite systems on a hypercube, A heuristic approach to the treedepth decomposition problem for large graphs, Task scheduling for parallel sparse Cholesky factorization, A survey of direct methods for sparse linear systems, Sparse QR factorization on a massively parallel computer, A parallel multi-\(p\) method, The impact of high-performance computing in the solution of linear systems: Trends and problems, Improving parallel ordering of sparse matrices using genetic algorithms, Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
