An adaptive multigrid method for the euler equations

It is well known that an accurate solution to the Euler equations requires more resolution in some parts of the flow field than others. Just where these regions are, and how fine the mesh spacing must be, depends on characteristics of the solution to be computed, and changes with different flow parameters, such as Mach number, angle of attack, etc. Therefore, it cannot be known in advance of the computation. A solution technique which gets comparable accuracy over the entire flow field, thus using fewer points in smoother regions of the solution and more elsewhere, would clearly be optimal. In this talk, we describe a method of local adaptive grid refinement for the solution of the steady Euler equations in two dimensions, which automatically selects regions requiring mesh refinement by measuring the local truncation error. Our method of refinement uses locally uniform fine rectangles which are superimposed on a global coarse grid. Possibly several nested levels of refined grids will be used until a given accuracy is attained. The fine grid patches are in the same coordinate system as the underlying coarse grid. All the data management is done in the computational plane, where, since we use rectangular grids, the data structures and bookkeeping can be very simple (see figure i). Furthermore, the same data structures and control flow needed for adaptive grid refinement are also required for multigrid convergence acceleration. This can therefore be added with little additional cost. Other adaptive mesh strategies have previously been proposed. Many of them are moving grid point methods, where a logically rectangular mesh is distorted to put more grid points in region where the solution error is large. Brackbill and Saltzman [3] do this by having their mesh minimize a functional which includes terms measuring the solution error, grid smoothness, and grid orthogonality. Rai and Anderson [4] attract the grid points into regions with high error by determining grid point speeds. These methods seem to work well in the examples in the literature, and they do not suffer from the difficulties with conservation that a patched grid method has at the grid interfaces. However, controlling the grid skewness in these methods is very difficult, and will be more so in three dimensions. Our method does not have this drawback. Furthermore, in a moving grid point method, it is still desirable to have a mechanism to add new points if necessary. Recent work by Murman and Usab [5] presents a similar approach to grid adaption using nested grid patches, but does not include a procedure for automatic control of the error. We add here that