Solution of sparse positive definite systems on a shared-memory multiprocessor

DOI10.1007/BF01407878zbMath0642.65019MaRDI QIDQ1101182

B. George

Publication date: 1986

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

zbMATH Keywords

numerical experimentsparallel computationparallel algorithmssparse Cholesky factorizationsparse triangular solutions

Mathematics Subject Classification ID

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

Related Items

Task scheduling for parallel sparse Cholesky factorization, A survey of direct methods for sparse linear systems, Parallel sparse Gaussian elimination with partial pivoting, A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION, A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS – II TRIANGULAR SYSTEM SOLVERS AND MATRIX MULTIPLICATION

Uses Software

• symrcm
• YSMP

Cites Work

• Unnamed Item
• Parallel Cholesky factorization on a shared-memory multiprocessor
• Computational models and task scheduling for parallel sparse Cholesky factorization
• Parallel implementation of multifrontal schemes
• Modification of the minimum-degree algorithm by multiple elimination
• Yale sparse matrix package I: The symmetric codes
• The Design of a User Interface for a Sparse Matrix Package