1991
DOI: 10.1016/s0167-8191(05)80104-8
|View full text |Cite
|
Sign up to set email alerts
|

A method to parallelize tridiagonal solvers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
14
0

Year Published

1993
1993
2023
2023

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 43 publications
(14 citation statements)
references
References 2 publications
0
14
0
Order By: Relevance
“…These equations were numerically solved using a fourth-order explicit Runge-Kutta time integration in conjunction with a sixth-order compact scheme with eighth-order filter for spatial derivatives (Kennedy & Carpenter 1994); the filtering (applied at interior points only) is required to maintain numerical stability for long-time integrations but since it acts only on the shortest waves that can be resolved on the grid, it does not act as a turbulence model allowing underresolved computations. A parallelization using three-dimensional domain decomposition and message passing, and an efficient parallel tridiagonal solver (Muller & Scheerer 1991) were used.…”
Section: Description Of the Dns Databasementioning
confidence: 99%
“…These equations were numerically solved using a fourth-order explicit Runge-Kutta time integration in conjunction with a sixth-order compact scheme with eighth-order filter for spatial derivatives (Kennedy & Carpenter 1994); the filtering (applied at interior points only) is required to maintain numerical stability for long-time integrations but since it acts only on the shortest waves that can be resolved on the grid, it does not act as a turbulence model allowing underresolved computations. A parallelization using three-dimensional domain decomposition and message passing, and an efficient parallel tridiagonal solver (Muller & Scheerer 1991) were used.…”
Section: Description Of the Dns Databasementioning
confidence: 99%
“…23 The computations were parallelized using three-dimensional domain decomposition and message passing interface; the tridiagonal solver for the spatial discretization scheme was efficiently parallelized. 24 p and T were computed from the EOS and the known functional dependence of e on (T, p) using an iterative scheme. The grid spacing, ∆x, was uniform and was selected to ensure that the smallest scales relevant to dissipation were resolved.…”
Section: Description Of the Dns Databasementioning
confidence: 99%
“…Notable among these are cyclic reduction [6,16], recursive doubling [27], and partition methods [22,32]. These algorithms have typically targeted vector supercomputers such as the Illiac IV, CDC STAR-100 and Cray-1.…”
Section: Introductionmentioning
confidence: 99%