Parallel algorithms for sparse triangular system solution

DOI10.1016/0167-8191(93)90048-PzbMath0767.65010MaRDI QIDQ1208515

S. Singh

Publication date: 16 May 1993

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

performanceCholesky factorizationsparse matricesparallel algorithmselimination treecomputation resultsmulti- transputer local memory multiprocessor systemPARAMsparse triangular system

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (3)

Theww^Tfactorization of dense and sparse matrices ⋮ A survey of direct methods for sparse linear systems ⋮ A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS – II TRIANGULAR SYSTEM SOLVERS AND MATRIX MULTIPLICATION

This page was built for publication: Parallel algorithms for sparse triangular system solution