A Data Structure for Parallel L/U Decomposition

DOI10.1109/TC.1982.1675979zbMath0479.68034MaRDI QIDQ3938489

Jochen A. G. Jess, H. G. M. Kees

Publication date: 1982

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

scheduleparallel processingtask graphtriangulated graphtearingelimination-treesparse matrix pivoting

Mathematics Subject Classification ID

Data structures (68P05) Theory of operating systems (68N25) Theory of software (68N99)

Related Items

Solution of sparse positive definite systems on a hypercube ⋮ Design and Implementation of a Parallel Markowitz Threshold Algorithm ⋮ Reordering for parallelism ⋮ A survey of direct methods for sparse linear systems ⋮ On evaluating elimination tree based parallel sparse cholesky factorizations ⋮ Width, depth, and space: tradeoffs between branching and dynamic programming ⋮ Parallel sparse Gaussian elimination with partial pivoting ⋮ Improving parallel ordering of sparse matrices using genetic algorithms ⋮ LU factorization on parallel computers