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

performance; Cholesky factorization; sparse matrices; parallel algorithms; elimination tree; computation results; multi- transputer local memory multiprocessor system; PARAM; sparse triangular system

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65Y05: Parallel numerical computation

65Y20: Complexity and performance of numerical algorithms

65F05: Direct numerical methods for linear systems and matrix inversion

65Y10: Numerical algorithms for specific classes of architectures

Related Items

Theww^Tfactorization of dense and sparse matrices, A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS – II TRIANGULAR SYSTEM SOLVERS AND MATRIX MULTIPLICATION