×

Incremental remapping as a transport/advection algorithm. (English) Zbl 0972.76079

Summary: There are two fundamentally different strategies for solving the standard transport or continuity equation, corresponding to whether it is expressed as a partial differential equation or as an integral conservation law. The more common approach is to discretize the partial differential equation and to march the solution forward in time. The alternative method is to project cell volumes along Lagrangian trajectories as far forward or backward in time as desired, and then to remap the resulting density distribution onto some target mesh. This latter approach is known as remapping. Remapping has many advantages, not the least of which is that the time step is limited only by accuracy considerations, but it tends to be expensive and complex.
In this paper we show that if the time step is made sufficiently short such that trajectories are confined to the nearest neighbor cells, then the remapping may be written as a flux-form transport algorithm, and it becomes nearly as simple and efficient as standard transport schemes. The resulting method, called incremental remapping, retains most of the advantages of general remapping. These include: (a) geometric basis for transport, (b) compatibility of associated tracer transport with simple tracer advection, i.e., retention of tracer monotonicity properties, and (c) efficient handling of multiple tracers since each additional tracer adds only a relatively small incremental cost.

MSC:

76M25 Other numerical methods (fluid mechanics) (MSC2010)
76R99 Diffusion and convection

Software:

REMAP3D
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] Peyret, R.; Taylor, T. D., Computational Methods for Fluid flow (1983) · Zbl 0514.76001
[2] LeVeque, R. J., Numerical Methods for Conservation Laws (1992) · Zbl 0847.65053
[3] Roache, P. J., Fundamentals of Computational Fluid Dynamics (1998)
[4] Schär, C.; Smolarkiewicz, P. K., A synchronous and iterative flux-correction formalism for coupled transport, J. Comput. Phys., 128, 101 (1996) · Zbl 0861.76054
[5] VanderHeyden, W. B.; Kashiwa, B. A., Compatible fluxes for van Leer advection, J. Comput. Phys., 146, 1 (1998) · Zbl 0932.76058
[6] Thompson, P. A., Compressible-Fluid dynamics, 16 (1972)
[7] Smolarkiewicz, P. K.; Pudykiewicz, J. A., A class of semi-lagrangian approximations for fluids, J. Atmos. Sci., 49, 2082 (1992)
[8] Dukowicz, J. K.; Kodis, J. W., Accurate conservative remapping (rezoning) for arbitrary Lagrangian-Eulerian computations, SIAM J. Statist. Comput., 8, 305 (1987) · Zbl 0644.76085
[9] Miller, D. S.; Burton, D. E.; Oliviera, J. S., Efficient Second Order Remapping on Arbitrary Two Dimensional Meshes (1996)
[10] Grandy, J., Conservative remapping and region overlays by intersecting arbitrary polyhedra, J. Comput. Phys., 148, 433 (1999) · Zbl 0932.76073
[11] Dukowicz, J. K.; Padial, N. T., REMAP3D: A Conservative Three-Dimensional Remapping Code (1991)
[12] Mosso, S. J.; Burton, D. E.; Harrison, A. K.; Linnebur, E. J.; Swartz, B. K., A Second Order, Two- and Three-Dimensional Remap Method (1998)
[13] Leslie, L. M.; Purser, R. J., Three-dimensional mass-conserving semi-Lagrangian scheme employing forward trajectories, Mon. Wea. Rev., 123, 2551 (1995)
[14] Leonard, B. P.; Lock, A. P.; MacVean, M. K., Conservative explicit unrestricted-time-step multidimensional constancy preserving advection schemes, Mon. Wea. Rev., 124, 2588 (1996)
[15] Staniforth, A.; Côté, J., Semi-Lagrangian integration schemes for atmospheric models-A review, Mon. Wea. Rev., 119, 2206 (1991)
[16] Hirt, C. W.; Amsden, A. A.; Cook, J. L., An arbitrary Lagrangian-Eulerian computing method for all flow speeds, J. Comput. Phys., 14, 227 (1974) · Zbl 0292.76018
[17] Van Leer, B., Towards the ultimate conservative difference scheme. V. A second-order sequel to Godunov’s method, J. Comput. Phys., 32, 101 (1979) · Zbl 1364.65223
[18] Dukowicz, J. K.; Ramshaw, J. D., Tensor viscosity method for convection in numerical fluid dynamics, J. Comput. Phys., 32, 71 (1979) · Zbl 0408.76001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.