# Incremental remapping as a transport/advection algorithm

## Abstract

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 statement of conservation. 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 the authors 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 ofmore »

- Authors:

- Publication Date:

- Research Org.:
- Los Alamos National Lab., NM (US)

- OSTI Identifier:
- 20030415

- Resource Type:
- Journal Article

- Journal Name:
- Journal of Computational Physics

- Additional Journal Information:
- Journal Volume: 160; Journal Issue: 1; Other Information: PBD: 1 May 2000; Journal ID: ISSN 0021-9991

- Country of Publication:
- United States

- Language:
- English

- Subject:
- 42 ENGINEERING; 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; PARTIAL DIFFERENTIAL EQUATIONS; MASS TRANSFER; ALGORITHMS; CALCULATION METHODS

### Citation Formats

```
Dukowicz, J.K., and Baumgardner, J.R.
```*Incremental remapping as a transport/advection algorithm*. United States: N. p., 2000.
Web. doi:10.1006/jcph.2000.6465.

```
Dukowicz, J.K., & Baumgardner, J.R.
```*Incremental remapping as a transport/advection algorithm*. United States. doi:10.1006/jcph.2000.6465.

```
Dukowicz, J.K., and Baumgardner, J.R. Mon .
"Incremental remapping as a transport/advection algorithm". United States. doi:10.1006/jcph.2000.6465.
```

```
@article{osti_20030415,
```

title = {Incremental remapping as a transport/advection algorithm},

author = {Dukowicz, J.K. and Baumgardner, J.R.},

abstractNote = {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 statement of conservation. 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 the authors 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.},

doi = {10.1006/jcph.2000.6465},

journal = {Journal of Computational Physics},

issn = {0021-9991},

number = 1,

volume = 160,

place = {United States},

year = {2000},

month = {5}

}