Search arXivSearch

arXiv · 2308.00048

Efficient reduction of vertex clustering using front tracking with surface normal propagation restriction

Abstract

A significant computational expense and source of numerical errors in front tracking is the remeshing of the triangulated front, required due to distortion and compaction of the front following the Lagrangian advection of its vertices. Additionally, in classic front tracking, the remeshing of the front mesh is required not only due to the deformation of the front shape, but also because the vertices of the front are translated in the direction tangential to the front, induced by the front advection. We present the normal-only advection (NOA) front-tracking method with the aim of preventing the tangential motion of the front vertices and the associated vertex clustering, in order to reduce the number of remeshing operations required to retain a high-quality triangulated interface. To this end, we reformulate the velocity used to advect the front at each discrete front-vertex position. The proposed method is validated and tested against the classic front-tracking method, comparing volume conservation, shape preservation, computational costs, and the overall need for front remeshing, as well as experimental results for canonical interfacial flows. The presented results demonstrate that the NOA front-tracking method leads to a typical reduction of remeshing operations by 80 % or more compared to the classic front-tracking method for well-resolved cases, and results in a smoother front mesh, which is essential for an accurate representation of the geometrical properties of the front. The volume conservation error is reduced by approximately one order of magnitude with the proposed method compared to the classic front-tracking method, at a similar computational cost.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christian Gorges, Azur Hodžić, Fabien Evrard, Berend van Wachem, Clara M. Velte, Fabian Denner. 2023-07-31. Efficient reduction of vertex clustering using front tracking with surface normal propagation restriction. https://doi.org/10.1016/j.jcp.2023.112406

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bi-Hamiltonian in Semiflexible Polymers built upon Overdamping Process

Quantifying the interaction between a system of interest and its ambient conditions, the memory effect links the states of two distinct Hamiltonians: one for the target system and one for the environment. In this paper, we propose the diffusion process derived from the Smoluchowski equation that can derive the evolution process described by the memory effect integration in a non Markovian regime. The Smoluchowski picture, within the framework of stochastic thermodynamics, justifies a diffusion process incorporated into the equations of motion, and the result of the derivation enables a coarse-grained molecular dynamics simulation with the modified equation of motion to reproduce attenuation from collisions between single walled carbon nanotubes (SWCNTs) under far from equilibrium conditions. The results of the numerical experiments on the collision confirm that heat diffusion compensates for the correlated momentum arising from the memory effect between the two Hamiltonians in both equilibrium and far from equilibrium states.

physics.comp-ph

Translation of transient acoustic fields

A method is presented for the translation of acoustic field data from a source to a target region. Field data are represented as spherical harmonic expansions on spheres surrounding the source and target regions respectively and expansions are translated using a ``point and shoot'' method using the Kirchhoff--Helmholtz integral to carry out an axial translation from one sphere to the other. The principal motivation for the method is its use in a time-domain Fast Multipole Method, and test cases reflective of this application are presented. The method converges to six digits for appropriate values of parameters and for the values of $N$ considered here computational effort scales approximately as $N^{2}$ where $N$ is the order of spherical harmonic expansion for the field data. The method is causal and thus avoids artifacts generated in methods which are not based on intrinsically causal formulations.

physics.comp-ph

Learning continuous reaction paths for transition-state prediction

Transition states are defined by reaction pathways, yet most machine-learning methods predict them as isolated geometries. We introduce MARC-TS, a two-stage framework that learns a continuous, endpoint-conditioned path, queries it at any resolution and uses local path context to refine a transition-state candidate. We construct T1x-IRC-8K, a dataset of 8,209 reactions and 1,088,725 path-resolved geometries. On held-out reactions, the path model reduced complete-path error by 48.4% relative to endpoint interpolation, and the localizer achieved a mean aligned structural error of 0.127 Å. Quantum-chemical optimization and vibrational analysis yielded 405 frequency-confirmed first-order saddle-point candidates from 410 predictions. In a 100-reaction nudged elastic band comparison, learned-path initialization reached a joint geometry-and-force target for 66% of reactions, compared with 12% for geometric interpolation after 100 optimizer steps. By treating the path as a reusable representation rather than an auxiliary output, MARC-TS connects transition-state prediction, mechanistic interpretation and quantum-chemical refinement.

physics.comp-ph