35th Aerospace Sciences Meeting and Exhibit 1997
DOI: 10.2514/6.1997-333
|View full text |Cite
|
Sign up to set email alerts
|

An implicit algorithm for solving time dependent flows on unstructured grids

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
55
0

Year Published

2004
2004
2015
2015

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 150 publications
(55 citation statements)
references
References 10 publications
0
55
0
Order By: Relevance
“…A Newton sub-iteration method is used to improve time accuracy of the point-implicit method; the resulting method is second-order accurate in time. Tomaro et al [59] converted the code from explicit to implicit, enabling CFL numbers as high as 10 6 .…”
Section: Cfd Solvermentioning
confidence: 99%
“…A Newton sub-iteration method is used to improve time accuracy of the point-implicit method; the resulting method is second-order accurate in time. Tomaro et al [59] converted the code from explicit to implicit, enabling CFL numbers as high as 10 6 .…”
Section: Cfd Solvermentioning
confidence: 99%
“…Tomaro et al 3 converted the code from explicit to implicit, enabling CFL numbers as high as CF L ≈ 10 6 . Grismer et al 4 parallelized the code, with a demonstrated linear speed-up on as many as 4,000 processors.…”
Section: Cobaltmentioning
confidence: 99%
“…Strang, et al [3] validated the numerical method on a number of problems, including the Spalart-Allmaras (SA) model, which forms the core for the Detached Eddy Simulation (DES) model available in Cobalt. Tomaro, et al [4] converted the code from explicit to implicit, enabling CFL numbers as high as 10 6 . Grismer, et al [5] parallelized the code, yielding linear speed-up on as many as 2,800 processors.…”
Section: Flow Solvermentioning
confidence: 99%