A fast dynamic smooth adaptive meshing scheme with applications to compressible flow

نویسندگان

چکیده

We develop a fast-running smooth adaptive meshing (SAM) algorithm for dynamic curvilinear mesh generation, which is based on fast solution strategy of the time-dependent Monge-Ampère (MA) equation, det⁡∇ψ(x,t)=G∘ψ(x,t). The novelty our approach new so-called perturbation formulation MA, constructs map ψ via composition sequence near-identity deformations reference mesh. Then, we formulate version deformation method [21] that results in simple, fast, and high-order accurate numerical scheme SAM optimal complexity when applied to generation solutions hyperbolic systems such as Euler equations gas dynamics. perform series challenging 2D 3D experiments grids with large deformations, demonstrate able produce meshes comparable state-of-the-art solvers [22], [18], while running approximately 200 times faster. then coupled simple Arbitrary Lagrangian Eulerian (ALE) Specifically, implement C-method [64], [65] ALE interface tracking contact discontinuities. both Noh implosion problem well classical Rayleigh-Taylor instability problem. Results confirm low-resolution simulations using SAM-ALE compare favorably high-resolution uniform runs.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical Investigation on Compressible Flow Characteristics in Axial Compressors Using a Multi Block Finite Volume Scheme

An unsteady two-dimensional numerical investigation was performed on the viscous flow passing through a multi-blade cascade. A Cartesian finite-volume approach was employed and it was linked to Van-Leer's and Roe's flux splitting schemes to evaluate inviscid flux terms. To prevent the oscillatory behavior of numerical results and to increase the accuracy, Monotonic Upstream Scheme for Conservat...

متن کامل

using adaptive meshing for solving the transonic flow around airfoils

numerical analyses have shown that successful flow simulations and the accuracy of solution noticeably depend on the number of nodes used in computational meshing. a suitable meshing should have the capability of adapting with main flow parameters. because the number of total nodes that can be used in numerical simulation is limited, making such grid for complex flows is almost difficult, if it...

متن کامل

Dynamic Load Balancing for Ocean Circulation Model with Adaptive Meshing

This paper reports the parallel implementation of adaptive mesh reenement within nite diierence ocean circulation models. The implementation is based on the model of Malleable Tasks with ineeciency factor which allows a simple expression of the diierent levels of paral-lelism with a good eeciency. Our goal within this work was to validate this approach on an actual application. For that, we hav...

متن کامل

A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications

A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...

متن کامل

Central Upwind Scheme for a Compressible Two-Phase Flow Model

In this article, a compressible two-phase reduced five-equation flow model is numerically investigated. The model is non-conservative and the governing equations consist of two equations describing the conservation of mass, one for overall momentum and one for total energy. The fifth equation is the energy equation for one of the two phases and it includes source term on the right-hand side whi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Physics

سال: 2023

ISSN: ['1090-2716', '0021-9991']

DOI: https://doi.org/10.1016/j.jcp.2023.112280