Adaptive Multiresolution Schemes for Shock Computations
โ Scribed by Ami Harten
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 672 KB
- Volume
- 115
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper we present adaptive multiresolution schemes for the computation of discontinuous solutions of hyperbolic conservation laws. Starting with the given grid, we consider the grid-averages of the numerical solution for a hierarchy of nested grids which is obtained by diadic coarsening, and we compute its equivalent multiresolution representation. This representation of the numerical solution consists of the grid-averages of the coarsest grid and the set of errors in predicting the grid-averages of each level of resolution from the next coarser one; these errors depend on the size of the grid and the local regularity of the solution. At a jump-discontinuity they remain the size of the jump, independent of the level of resolution; this observation enables us to identify the location of discontinuities in the numerical solution. In a region of smoothness, once the numerical solution is resolved to our satisfaction at a certain locality of some grid, then the prediction errors there for this grid and all finer ones are small; this enables us to obtain data compression by setting to zero the terms of the multiresolution representation that fall below a specified tolerance. The numerical flux of the adaptive scheme is taken to be that of a standard centered scheme, unless it corresponds to an identified discontinuity, in which case it is taken to be the flux of an ENO scheme. We use the data compression of the numerical solution in order to reduce the number of numerical flux evaluations as follows: We start with the computation of the exact numerical fluxes at the few grid-points of the coarsest grid, and then we proceed through diadic refinement to the given grid. At each step of refinement we add values for the numerical flux at the new grid-points which are the centers of the coarser cells. Wherever the solution is locally well resolved (i.e., the corresponding prediction error is below the specified tolerance) the costly exact value of the numerical flux function is replaced by an accurate enough approximate value which is obtained by an inexpensive interpolation from the values of the coarser grid. (c) 1994 Academic Press, Inc.
๐ SIMILAR VOLUMES
This paper presents a solution to the problem of creating region adjacency graph (RAG) pyramids on parallel computers comprising the hypercube topology. RAG pyramids represent hierarchies of irregular tesselations, with each tesselation generated in parallel by independent stochastic processes, and
DEDICATED TO THE MEMORY OF AMI HARTEN tion schemes have the potential to also simplify the grid generation process. In 1D the amount of time spent on This paper presents multiresolution schemes for the efficient numerical solution of one-dimensional conservation laws with viscos-grid generation is n
We present multiresolution (MR) schemes for the efficient numerical solution of the one-dimensional system of the reactive Euler equations, which has possibly stiff source terms. The original version of the method was developed by A. Harten (1995, Comm. Pure Appl. Math. 48(12), 1305) for homogeneous
This paper proposes a multiresolution procedure adapted to triangular cell-averages to improve the performance of finite volume schemes by reducing flux evaluation cost, using the approach introduced by A. Harten. A specific coarse-to-fine prediction scheme is proposed that ensures the stability of