A higher-order compact method in space and time based on parallel implementation of the Thomas algorithm (Q1570339): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:56, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A higher-order compact method in space and time based on parallel implementation of the Thomas algorithm |
scientific article |
Statements
A higher-order compact method in space and time based on parallel implementation of the Thomas algorithm (English)
0 references
18 April 2001
0 references
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.
0 references
parallel computing
0 references
higher-order numerical method
0 references
compact scheme
0 references
pipelined Gauss elimination
0 references
Thomas algorithm
0 references
