2005
DOI: 10.1080/10618560410001729135
|View full text |Cite
|
Sign up to set email alerts
|

A parallel solution-adaptive scheme for multi-phase core flows in solid propellant rocket motors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
58
1

Year Published

2008
2008
2017
2017

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 63 publications
(60 citation statements)
references
References 56 publications
1
58
1
Order By: Relevance
“…The main distinction between different orders of accuracy is in the requirements on the number of ghost cell layers attached to each solution block. As in [15] and the previous work of Groth et al, e.g., [5,7,46,55,56], an efficient domain partitioning is achieved in our implementation by distributing the active solution blocks equally among available processor cores, with more than one block permitted per processor core. This approach efficiently exploits the self-similar nature of the solution blocks and readily produces an effective load balancing.…”
Section: Parallelization With Uniform Treatment Of Sector Boundaries mentioning
confidence: 88%
“…The main distinction between different orders of accuracy is in the requirements on the number of ghost cell layers attached to each solution block. As in [15] and the previous work of Groth et al, e.g., [5,7,46,55,56], an efficient domain partitioning is achieved in our implementation by distributing the active solution blocks equally among available processor cores, with more than one block permitted per processor core. This approach efficiently exploits the self-similar nature of the solution blocks and readily produces an effective load balancing.…”
Section: Parallelization With Uniform Treatment Of Sector Boundaries mentioning
confidence: 88%
“…There were already some other attempts to use the AMR technique for body-fitted multiblock meshes [21,31], where curved geometries were allowed to be transformed into and simulated using a uniform computational domain. This can be achieved by using the coordinate transformation, which represents a transformation from the physical to the computational coordinates.…”
Section: B Adaptive Mesh Refinementmentioning
confidence: 99%
“…The computational efficiency is improved by reducing the required number of computational cells. The existing AMR applications [21,22] generally employ a blockstructured AMR algorithm. It involves 1) representing the 2-D/3-D hierarchical computational domain in blocks; 2) connecting the generated blocks in a quadtree/octree data structure; 3) estimating local truncation errors at all grid points and identifying blocks with excessive errors; 4) regridding the identified blocks by superimposing or removing blocks to accommodate changes in flow physics; and 5) redistributing the computational load between processors to maintain dynamic load balancing.…”
Section: = @Wmentioning
confidence: 99%
“…Impressive results have been obtained for both steady (Aftosmis and Berger, 2002) and unsteady (Murman et al, 2003) flows over highly complex geometries. Sachdev et al (2003) present an extension of the AMR approach to curvilinear meshes.…”
Section: Spatial Discretizationmentioning
confidence: 99%