Symbolic Cholesky factorization on a local-memory multiprocessor
type: Item
instance of: scholarly article
title: Symbolic Cholesky factorization on a local-memory multiprocessor
zbMATH Open document ID: 0618.65023
DOI: 10.1016/0167-8191(87)90009-3
author: Yanyan Li
published in: Parallel Computing
publication date: 1987-01-01T00:00:00Z
review text: One of the standard steps of the Cholesky factorization algorithm, namely the parallel symbolic factorization step for sparse symmetric matrices is presented. The algorithm is designed for a message-passing distributed- memory multiprocessor (no global memory is shared). Numerical experiments on Intel hypercube are given.
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 65F50
zbMATH DE Number: 4003358
zbMATH Keywords: Intel iPSC hypercube
zbMATH Keywords: Cholesky factorization
zbMATH Keywords: parallel symbolic factorization
zbMATH Keywords: sparse symmetric matrices
zbMATH Keywords: message-passing distributed- memory multiprocessor
zbMATH Keywords: Numerical experiments
MaRDI profile type: Publication
full work available at URL: 0167-8191(87)90009-3
OpenAlex ID: W2070259793
description: scientific article; zbMATH DE number 4003358