A higher-order compact method in space and time based on parallel implementation of the Thomas algorithm
The authors propose a method to parallelize high-order compact numerical algorithms for the solution of three-dimensional partial differential equations in a space-time domain. This method is compared with the basic pipelined Thomas algorithm. In the proposed algorithm, the processors are used for the next computational tasks, whereas in the basic pipelined Thomas algorithm they stay idle waiting for the data from neighboring processors at the forward and the backward steps of the Thomas algorithm.
scientific article; zbMATH DE number 1471801