A Data Structure for Parallel L/U Decomposition

DOI10.1109/TC.1982.1675979MaRDI QIDQ3938489zbMATH OpenFDO

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

Publication date 1982

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

Full work available at URL https://doi.org/10.1109/TC.1982.1675979

zbMATH Keywords

elimination-treeparallel processingschedulesparse matrix pivotingtask graphtearingtriangulated graph

Mathematics Subject Classification ID

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

Cited in

(9)

• LU factorization on parallel computers
• Solution of sparse positive definite systems on a hypercube
• Width, depth, and space: tradeoffs between branching and dynamic programming
• Improving parallel ordering of sparse matrices using genetic algorithms
• Reordering for parallelism
• On evaluating elimination tree based parallel sparse cholesky factorizations
• 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: A Data Structure for Parallel L/U Decomposition

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