Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer

DOI10.1137/0916054zbMATH Open0829.68103OpenAlexW1975124102MaRDI QIDQ4842591FDOQ4842591

Authors: Fredrik Manne, Hjálmtýr Hafsteinsson 

Publication date: 15 August 1995

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/084f1347f13e873371fabd4617d4494782a830d2

Recommendations

• Publication:4860184
• Highly Parallel Sparse Cholesky Factorization
• Publication:4860191
• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• scientific article; zbMATH DE number 1760069
• A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
• scientific article; zbMATH DE number 1302627
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• scientific article; zbMATH DE number 554771

zbMATH Keywords

Cholesky factorizationparallel algorithmsparse matrixgraph coloring techniques

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Graph algorithms (graph-theoretic aspects) (05C85) Factorization of matrices (15A23) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Cited In (12)

• A survey of direct methods for sparse linear systems
• A Scalable High Performant Cholesky Factorization for Multicore with GPU Accelerators
• SOLVING LARGE SCALE LINEAR PROGRAMMING PROBLEMS USING AN INTERIOR POINT METHOD ON A MASSIVELY PARALLEL SIMD COMPUTER
• Title not available (Why is that?)
• A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
• A Mapping Algorithm for Parallel Sparse Cholesky Factorization
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• Title not available (Why is that?)
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• Title not available (Why is that?)
• A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
• Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers

This page was built for publication: Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer

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