z-logo
Premium
A simplified adaptive Cartesian grid system for solving the 2D shallow water equations
Author(s) -
Liang Qiuhua
Publication year - 2011
Publication title -
international journal for numerical methods in fluids
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.938
H-Index - 112
eISSN - 1097-0363
pISSN - 0271-2091
DOI - 10.1002/fld.2568
Subject(s) - grid , computer science , shallow water equations , solver , cartesian coordinate system , mesh generation , subdivision , computational science , regular grid , adaptive mesh refinement , domain (mathematical analysis) , grid method multiplication , mathematical optimization , computational fluid dynamics , mathematics , distributed computing , theoretical computer science , geometry , finite element method , mathematical analysis , engineering , civil engineering , structural engineering , aerospace engineering
SUMMARY This paper presents a new simplified grid system that provides local refinement and dynamic adaptation for solving the 2D shallow water equations (SWEs). Local refinement is realized by simply specifying different subdivision levels to the cells on a background uniform coarse grid that covers the computational domain. On such a non‐uniform grid, the structured property of a regular Cartesian mesh is maintained and neighbor information is determined by simple algebraic relationships, i.e. data structure becomes unnecessary. Dynamic grid adaptation is achieved by changing the subdivision level of a background cell. Therefore, grid generation and adaptation is greatly simplified and straightforward to implement. The new adaptive grid‐based SWE solver is tested by applying it to simulate three idealized test cases and promising results are obtained. The new grid system offers a simplified alternative to the existing approaches for providing adaptive mesh refinement in computational fluid dynamics. Copyright © 2011 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here