.png){kind=icon}
Return
Fully threaded tree algorithms for adaptive refinement fluid dynamics simulations
.png){kind=icon}
PRE
AI
DOI：10.1006/jcph.1998.9998.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A fully threaded tree (FTT) for adaptive mesh refinement (AMR) of regular meshes is described. By using a tree threaded at all levels, tree traversals for finding nearest neighbors are avoided. All operations on a tree including tree modifications are O(N), where N is a number of cells and can be pel formed in parallel. An implementation of the tree requires 2N words of memory, In this paper, FTT is applied to the integration of the Euler equations of fluid dynamics. The integration on a tree can utilize Bur evaluation algorithms used for grids, but requires a different time-stepping strategy to be computationally efficient. An adaptive-mesh time-stepping algorithm is described in which different time steps are used at different levels of the tree, Time stepping and mesh refinement are interleaved to avoid extensive buffer layers of fine mesh which were otherwise required ahead of moving shocks. A filtering algorithm for removing high-frequency noise during mesh refinement is described. Test examples are presented, and the FTT performance is evaluated. (C) 1998 Academic Press.
Keywords:
MESH REFINEMENT
EULER EQUATIONS
SHOCK-WAVES
GRIDS
Journal
IF:
3.8
Papers:
1.6W
Citations:
7.4W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSave
ShareSaveResults of the Pegasus Phase 3 Randomized Trial Demonstrating Superiority of the C3 Inhibitor, Pegcetacoplan, Compared to Eculizumab in Patients with Paroxysmal Nocturnal Hemoglobinuria.png)
Blood
BloodIF0
PREAI
ShareSaveShareSave
View more