𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Adaptive moving mesh methods for simulating one-dimensional groundwater problems with sharp moving fronts

✍ Scribed by Weizhang Huang; Li Zheng; Xiaoyong Zhan


Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
464 KB
Volume
54
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

Accurate modelling of groundwater flow and transport with sharp moving fronts often involves high computational cost, when a fixed/uniform mesh is used. In this paper, we investigate the modelling of groundwater problems using a particular adaptive mesh method called the moving mesh partial differential equation approach. With this approach, the mesh is dynamically relocated through a partial differential equation to capture the evolving sharp fronts with a relatively small number of grid points. The mesh movement and physical system modelling are realized by solving the mesh movement and physical partial differential equations alternately. The method is applied to the modelling of a range of groundwater problems, including advection dominated chemical transport and reaction, non‐linear infiltration in soil, and the coupling of density dependent flow and transport. Numerical results demonstrate that sharp moving fronts can be accurately and efficiently captured by the moving mesh approach. Also addressed are important implementation strategies, e.g. the construction of the monitor function based on the interpolation error, control of mesh concentration, and two‐layer mesh movement. Copyright © 2002 John Wiley & Sons, Ltd.


📜 SIMILAR VOLUMES


The Numerical Solution of One-Dimensiona
✍ J.A. Mackenzie; M.L. Robertson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 292 KB

An adaptive moving mesh method is developed for the numerical solution of an enthalpy formulation of heat conduction problems with a phase change. The algorithm is based on a very simple mesh modification strategy that allows the smooth evolution of mesh nodes to track interfaces. At each time step