On simplifying 'incremental remap'-type transport schemes
The flux-form incremental remapping transport scheme introduced by Dukowicz and Baumgardner converts the transport problem into a remapping problem. This involves identifying overlap areas between quadrilateral flux-areas and regular square grid cells which is non-trivial and leads to some algorithm complexity. In the simpler swept area approach (originally introduced by Hirt et al.) the search for overlap areas is eliminated even if the flux-areas overlap several regular grid cells. The resulting simplified scheme leads to a much simpler and robust algorithm. We show that for sufficiently small Courant numbers (approximately CFL ≤ 1/2) the simplified (or swept area) scheme can be more accurate than the original incremental remapping scheme. This is demonstrated through a Von Neumann stability analysis, an error analysis and in idealized transport test cases on the sphere using the 'incremental remapping'-based scheme called FF-CSLAM (Flux-Form version of the Conservative Semi-Lagrangian Multi-tracer scheme) on the cubed-sphere.
document
https://n2t.org/ark:/85065/d7ks6t3w
eng
geoscientificInformation
Text
publication
2016-01-01T00:00:00Z
publication
2011-09-10T00:00:00Z
NOTICE: This is the author's version of a work accepted for publication by Elsevier. Changes resulting from the publishing process, including peer review, editing, corrections, structural formatting and other quality control mechanisms, may not be reflected in this document. Changes may have been made to this work since it was submitted for publication.
None
OpenSky Support
UCAR/NCAR - Library
PO Box 3000
Boulder
80307-3000
name: homepage
pointOfContact
OpenSky Support
UCAR/NCAR - Library
PO Box 3000
Boulder
80307-3000
name: homepage
pointOfContact
2025-07-17T14:26:12.698616