Aggregation Methods for Solving Sparse Triangular Systems on Multiprocessors

DOI10.1137/0911008zbMath0692.65009OpenAlexW2042879774MaRDI QIDQ3034726

Joel H. Saltz

Publication date: 1990

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0911008

zbMATH Keywords

parallel algorithmsmultiprocessor systemsshared-memory systemautomated problem partitioninglarge sparse triangular systems

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05) Theory of operating systems (68N25)

Related Items

Parallel processing of biological sequence comparison algorithms, A parallel multithreaded sparse triangular linear system solver, Linear algebra software for large-scale accelerated multicore computing, A survey of direct methods for sparse linear systems, Factors Impacting Performance of Multithreaded Sparse Triangular Solve, Fine-Grained Parallel Incomplete LU Factorization