Supernodal symbolic Cholesky factorization on a local-memory multiprocessor
type: Item
instance of: scholarly article
title: Supernodal symbolic Cholesky factorization on a local-memory multiprocessor
zbMATH Open document ID: 0767.65011
DOI: 10.1016/0167-8191(93)90045-M
published in: Parallel Computing
publication date: 1993-05-16T00:00:00Z
review text: An improvement in the author's algorithm [(1) cf. \textit{A. George}, \textit{M. T. Heath}, \textit{E. Ng} and \textit{J. W-H. Liu} ibid. 5, 85-95 (1987; Zbl 0618.65023)] is described. First, a symbolic factorization algorithm for serial machines is presented. This is followed by a description of the parallel version of the sequential algorithm (1) and the proposed improvements. These improvements exploit the supernodal structure. The improved algorithm is compared with the original one using an Intel iPSC/2 on two sets of test problems. The programs are written in Fortran and compiled with optimization turned on. More than \(50\%\) improvement is observed for matrices of order greater than 5,000 on 16 or more processors.
reviewed by: R. P. Tewarson
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 166529
zbMATH Keywords: sparse matrices
zbMATH Keywords: large sparse symmetric positive definite matrix
zbMATH Keywords: local- memory multiprocessor
zbMATH Keywords: Cholesky factorization
zbMATH Keywords: parallel computation
zbMATH Keywords: symbolic factorization algorithm
zbMATH Keywords: Intel iPSC/2
zbMATH Keywords: test problems
author: Esmond G. Ng
MaRDI profile type: Publication
full work available at URL: 0167-8191(93)90045-m
OpenAlex ID: W2042303567
Recommended article: A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
Recommended article: Symbolic Cholesky factorization on a local-memory multiprocessor
Recommended article: Sparse Cholesky Factorization on a Local-Memory Multiprocessor
Recommended article: A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
Recommended article: Parallel Cholesky factorization on a shared-memory multiprocessor
Recommended article: Q4737756
Recommended article: Parallel sparse Cholesky factorization on a shared memory multiprocessor
Recommended article: Parallel Cholesky factorization on orthogonal multiprocessors
Recommended article: Q4945411
Recommended article: Near optimal Cholesky factorization on orthogonal multiprocessors.
description: scientific article; zbMATH DE number 166529