Sparse Cholesky Factorization on a Local-Memory Multiprocessor
From MaRDI portal
Publication:3783413
DOI10.1137/0909021zbMath0642.65018OpenAlexW2045325210MaRDI QIDQ3783413
No author found.
Publication date: 1988
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0909021
Cholesky factorizationmultiprocessor systemNumerical resultslocal-memory multiprocessorbinary hypercube topologylarge sparse 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 (8)
A parallel graph partitioning algorithm for a message-passing multiprocessor ⋮ Task scheduling for parallel sparse Cholesky factorization ⋮ An iterative aggregation/disaggregation procedure for modelling the long-term behaviour of continuous-time evanescent random processes ⋮ A survey of direct methods for sparse linear systems ⋮ Modelling and analysis of communication overhead for parallel matrix algorithms ⋮ A parallel interior point algorithm for linear programming on a network of transputers ⋮ A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION ⋮ PMORSy: parallel sparse matrix ordering software for fill-in minimization
This page was built for publication: Sparse Cholesky Factorization on a Local-Memory Multiprocessor
