A practical and portable model of programming for iterative solvers on distributed memory machines

DOI10.1016/0167-8191(96)00017-8zbMath0900.68093OpenAlexW2007244686MaRDI QIDQ1352021

Philippe Angot, Samuel Kortas

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0167-8191(96)00017-8

zbMATH Keywords

Parallel implementationIterative solversParallel efficiencyDistributed memory machinesMIMD/SPMD machinesModel of programmingPartitioned algorithms

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of operating systems (68N25)

Related Items (1)

Domain decomposition methods for solving the Burgers equation.

This page was built for publication: A practical and portable model of programming for iterative solvers on distributed memory machines