- Journal Home
- Volume 39 - 2021
- Volume 38 - 2020
- Volume 37 - 2019
- Volume 36 - 2018
- Volume 35 - 2017
- Volume 34 - 2016
- Volume 33 - 2015
- Volume 32 - 2014
- Volume 31 - 2013
- Volume 30 - 2012
- Volume 29 - 2011
- Volume 28 - 2010
- Volume 27 - 2009
- Volume 26 - 2008
- Volume 25 - 2007
- Volume 24 - 2006
- Volume 23 - 2005
- Volume 22 - 2004
- Volume 21 - 2003
- Volume 20 - 2002
- Volume 19 - 2001
- Volume 18 - 2000
- Volume 17 - 1999
- Volume 16 - 1998
- Volume 15 - 1997
- Volume 14 - 1996
- Volume 13 - 1995
- Volume 12 - 1994
- Volume 11 - 1993
- Volume 10 - 1992
- Volume 9 - 1991
- Volume 8 - 1990
- Volume 7 - 1989
- Volume 6 - 1988
- Volume 5 - 1987
- Volume 4 - 1986
- Volume 3 - 1985
- Volume 2 - 1984
- Volume 1 - 1983
- BibTex
- RIS
- TXT
A local remapping algorithm for scalar function on quadrilateral meshes is described. The remapper from a distorted grid to a rezoned grid is usually regarded as a conservative interpolation problem. The present paper introduces a pseudo time to transform the interpolation into an initial value problem on a moving grid, and construct a moving mesh method to solve it. The new feature of the algorithm is the introduction of multipoint information on each edge, which leads to the numerical flux consistent with grid node motion. During the procedure of deriving scheme, we illustrate a framework about how the algorithms on a rectangular mesh are easily generated to those on a moving mesh. The basic ideas include: (i) introducing coordinate transformation, which maps the irregular domain in physical space to a perfectly regular computational domain, and (ii) deriving finite volume methods in the physical domain, which can be viewed as a discretization of the transformed equation. The resulting scheme is second-order accurate, conservative and monotonicity preserving. Numerical examples are carried out to show the good performance of our schemes.
}, issn = {1991-7139}, doi = {https://doi.org/10.4208/jcm.1307-m4182}, url = {http://global-sci.org/intro/article_detail/jcm/9756.html} }A local remapping algorithm for scalar function on quadrilateral meshes is described. The remapper from a distorted grid to a rezoned grid is usually regarded as a conservative interpolation problem. The present paper introduces a pseudo time to transform the interpolation into an initial value problem on a moving grid, and construct a moving mesh method to solve it. The new feature of the algorithm is the introduction of multipoint information on each edge, which leads to the numerical flux consistent with grid node motion. During the procedure of deriving scheme, we illustrate a framework about how the algorithms on a rectangular mesh are easily generated to those on a moving mesh. The basic ideas include: (i) introducing coordinate transformation, which maps the irregular domain in physical space to a perfectly regular computational domain, and (ii) deriving finite volume methods in the physical domain, which can be viewed as a discretization of the transformed equation. The resulting scheme is second-order accurate, conservative and monotonicity preserving. Numerical examples are carried out to show the good performance of our schemes.