Computational models and task scheduling for parallel sparse Cholesky factorization

DOI10.1016/0167-8191(86)90014-1zbMath0609.65014OpenAlexW1980946208MaRDI QIDQ1086977

Joseph W. H. Liu

Publication date: 1986

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

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

zbMATH Keywords

schedulingminimum degree orderingfill-reducing orderingmedium- grained graph modelnumeric factorizationparallel sparse Cholesky factorization

Mathematics Subject Classification ID

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

Related Items (11)

The formal development of a parallel program performing LU-decomposition ⋮ Solution of sparse positive definite systems on a shared-memory multiprocessor ⋮ Decomposition in multidimensional Boolean-optimization problems with sparse matrices ⋮ A parallel graph partitioning algorithm for a message-passing multiprocessor ⋮ Solution of sparse positive definite systems on a hypercube ⋮ Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers ⋮ A survey of direct methods for sparse linear systems ⋮ On evaluating elimination tree based parallel sparse cholesky factorizations ⋮ Hitting sets online and unique-MAX coloring ⋮ Parallel sparse Gaussian elimination with partial pivoting ⋮ Multiprocessing a sparse matrix code on the Alliant FX/8

This page was built for publication: Computational models and task scheduling for parallel sparse Cholesky factorization