Solution of sparse positive definite systems on a shared-memory multiprocessor
type: Item
instance of: scholarly article
title: Solution of sparse positive definite systems on a shared-memory multiprocessor
zbMATH Open document ID: 0642.65019
DOI: 10.1007/BF01407878
author: B. George
published in: International Journal of Parallel Programming
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 65F50
zbMATH DE Number: 4046952
zbMATH Keywords: parallel algorithms
zbMATH Keywords: parallel computation
zbMATH Keywords: sparse Cholesky factorization
zbMATH Keywords: sparse triangular solutions
zbMATH Keywords: numerical experiments
describes a project that uses: YSMP
describes a project that uses: symrcm
MaRDI profile type: Publication
cites work: Parallel Cholesky factorization on a shared-memory multiprocessor
cites work: Q3664299
cites work: Parallel implementation of multifrontal schemes
cites work: Yale sparse matrix package I: The symmetric codes
cites work: The Design of a User Interface for a Sparse Matrix Package
cites work: Modification of the minimum-degree algorithm by multiple elimination
cites work: Computational models and task scheduling for parallel sparse Cholesky factorization
description: scientific article; zbMATH DE number 4046952