Comparison of structured- and unstructured-grid, compressible and incompressible methods using the vortex pairing problem (Q2632953)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Comparison of structured- and unstructured-grid, compressible and incompressible methods using the vortex pairing problem |
scientific article; zbMATH DE number 7054968
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparison of structured- and unstructured-grid, compressible and incompressible methods using the vortex pairing problem |
scientific article; zbMATH DE number 7054968 |
Statements
Comparison of structured- and unstructured-grid, compressible and incompressible methods using the vortex pairing problem (English)
0 references
15 May 2019
0 references
high-resolution
0 references
high-order
0 references
low-Mach
0 references
vortex
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.779180645942688
0 references
0.7374641299247742
0 references
0.7335977554321289
0 references
0.7245051264762878
0 references
