SearcharxivSearch

arXiv · 2506.05081

Very high-order accurate finite volume scheme for the streamfunction-vorticity formulation of incompressible fluid flows with polygonal meshes on arbitrary curved boundaries

Abstract

Conventional mathematical models for simulating incompressible fluid flow problems are based on the Navier-Stokes equations expressed in terms of pressure and velocity. In this context, pressure-velocity coupling is a key issue, and countless numerical techniques and methods have been developed over the decades to solve these equations efficiently and accurately. In two dimensions, an alternative approach is to rewrite the Navier-Stokes equations regarding two scalar quantities: the streamfunction and the vorticity. Compared to the primitive variables approach, this formulation does not require pressure to be computed, thereby avoiding the inherent difficulties associated with the pressure-velocity coupling. However, deriving boundary conditions for the streamfunction and vorticity is challenging. This work proposes an efficient, high-order accurate finite-volume discretisation of the two-dimensional incompressible Navier-Stokes equations in the streamfunction-vorticity formulation. A detailed discussion is devoted to deriving the appropriate boundary conditions and their numerical treatment, including on arbitrary curved boundaries. The reconstruction for off-site data method is employed to avoid the difficulties associated with generating curved meshes to preserve high-orders of convergence in arbitrary curved domains, such as sophisticated meshing algorithms, cumbersome quadrature rules, and intricate non-linear transformations. This method approximates arbitrary curved boundaries with a conventional linear piecewise approximation, while constrained polynomial reconstructions near the boundary fulfil the prescribed conditions at the physical boundary. Several incompressible fluid flow test cases in non-trivial 2D curved domains are presented and discussed to demonstrate the accuracy and effectiveness of the proposed methodology in achieving very high orders of convergence.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ricardo Costa, Stéphane Clain, Gaspar J. Machado, João M. Nóbrega. 2025-06-05. Very high-order accurate finite volume scheme for the streamfunction-vorticity formulation of incompressible fluid flows with polygonal meshes on arbitrary curved boundaries. https://arxiv.org/abs/2506.05081

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

KEEP EXPLORING

Related papers

Why we should condition denoising diffusion generative models on windows of past observations

Data assimilation (DA) is, traditionally, a cycling process that relies on time-dependent priors to propagate information from past observations to future cycles. Using denoising diffusion generative modeling for DA is challenging because standard approaches use a fixed training data set, which in turn leads to a static prior that ignores information from past observations. Because past observations are ignored, DA systems with static priors lead to larger posterior errors than cycling DA systems. Incorporating time-dependent priors into generative models, however, requires expensive and frequent retraining. Motivated by linear systems theory - where the dependence of a prediction of a Kalman filter on past observations decays exponentially - we condition diffusion models on short windows of past observations. Specifically, we describe training procedures for two frameworks: a diffusion DA system predicting the current state given a set of past observations, and a diffusion ``direct observation prediction'' (DOP) system, predicting future observations given a set of past observations. Using a canonical linear system, we show that both systems can achieve the minimal posterior error characteristic of a fully-cycled DA/DOP system, without re-training, provided the time windows are long enough. The linear setup ensures analytical tractability, avoids confounding neural network training errors, and confirms that conditioning on windows of past observations is required for efficient and accurate diffusion-based DA or DOP.

math-ph

The kinematic structures and the inertial geometry of a moving charge

We ask how much of the geometry a charged particle moves in is fixed by its motion, and how much a particle must bring. We ask of a symplectic structure only that it relate velocity to momentum as Hamilton's equations do, and we ask it of every energy at once. In particular, we show that the structures meeting that demand are the canonical one and its twists by a closed two-form of the base. A field provides the two-form, a particle the multiplier before it, which we identify constitutively with its charge. Thus, a single energy governs a family of structures, and each particle takes the one its charge fixes. We then ask what a particle must bring to be given a momentum, and we show that the degree of that map settles the degree at which a field enters Newton's Second Law. An antisymmetric bilinear form returns no Lorentz force, whilst a Randers metric returns one --- a length whose difference from a Riemannian one is linear in the velocity. Moreover, we find that metric already within the twisted structure, as its primitive over a level of the free energy, and its law of transport to be nonlinear, no affine connection being known to serve. Under an indefinite signature the length parts from the dynamics, and the extremals turn from shortest to longest. On the round sphere a monopole flux leaves no such metric, whilst the transport remains and prequantisation, given a unit of action, restricts the charge to a lattice. In this manner, we conclude that each charge-to-mass ratio receives a geometry of its own, so that by a functionalist criterion none of them is the spacetime of a charged particle.

math-ph