Parallel symbolic factorization of sparse linear systems

DOI10.1016/0167-8191(90)90104-HzbMath0711.65016OpenAlexW2010906970MaRDI QIDQ923593

John R. Gilbert, Hjálmtýr Hafsteinsson

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90104-h

zbMATH Keywords

complexityparallel computationCholesky factorizationsparse linear systemsfill-inelimination treefast parallel algorithm

Mathematics Subject Classification ID

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

Related Items (2)

A systolic algorithm for solving dense linear systems ⋮ A survey of direct methods for sparse linear systems

This page was built for publication: Parallel symbolic factorization of sparse linear systems