An algorithm for the computation of steady and unsteady inviscid, compressible, two-dimensional flows is presented. Grid generation utilizes the quadtree spatial subdivision algorithm, allowing automatic meshing of boundaries of arbitrary geometry, and allowing h-adaptivity to geometric and solution features. Internal boundaries and interfaces may move, deform, coalesce, and disintegrate arbitrarily. The flow-solver is based on the MUSCL scheme. For moving boundaries, a novel feature of the algorithm is that the grid is stationary and boundaries are allowed to move across grid-lines. This is enabled by merging cells in the vicinity of boundaries to form composite cells that are topologically invariant during individual motion steps. This merging also eliminates the smallcell time-step constraint introduced by grid nonconformality. The motion of boundaries is tracked
No takes yet. Share an insight, caveat, or question.
Bayyuk et al. (1997) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: