Sparse Cholesky Factorization on a Local-Memory Multiprocessor

DOI10.1137/0909021MaRDI QIDQ3783413zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

Cholesky factorizationmultiprocessor systemNumerical resultslocal-memory multiprocessorbinary hypercube topologylarge sparse positive definite matrix

Mathematics Subject Classification ID

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

Recommendations

• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• scientific article; zbMATH DE number 833696
• Highly Parallel Sparse Cholesky Factorization
• Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
• A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
• scientific article; zbMATH DE number 833702
• scientific article; zbMATH DE number 1760069
• Parallel Cholesky factorization on a shared-memory multiprocessor
• Symbolic Cholesky factorization on a local-memory multiprocessor
• A Mapping Algorithm for Parallel Sparse Cholesky Factorization

Cited in

(15)

• A survey of direct methods for sparse linear systems
• A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION
• Modelling and analysis of communication overhead for parallel matrix algorithms
• A parallel graph partitioning algorithm for a message-passing multiprocessor
• Locality of reference in sparse Cholesky factorization methods
• A parallel interior point algorithm for linear programming on a network of transputers
• A note on communication analysis of parallel sparse Cholesky factorization on a hypercube
• PMORSy: parallel sparse matrix ordering software for fill-in minimization
• An iterative aggregation/disaggregation procedure for modelling the long-term behaviour of continuous-time evanescent random processes
• Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
• Task scheduling for parallel sparse Cholesky factorization
• Communication results for parallel sparse Cholesky factorization on a hypercube
• Supernodal symbolic Cholesky factorization on a local-memory multiprocessor
• Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers
• Symbolic Cholesky factorization on a local-memory multiprocessor

This page was built for publication: Sparse Cholesky Factorization on a Local-Memory Multiprocessor

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