Related papers: A coarse-grid projection method for accelerating i…
Common efficient schemes for the incompressible Navier-Stokes equations, such as projection or fractional step methods, have limited temporal accuracy as a result of matrix splitting errors, or introduce errors near the domain boundaries…
We evaluate an efficient overset grid method for two-dimensional and three-dimensional particulate flows for small numbers of particles at finite Reynolds number. The rigid particles are discretised using moving overset grids overlaid on a…
We propose a multi-resolution strategy that is compatible with the lattice Green's function (LGF) technique for solving viscous, incompressible flows on unbounded domains. The LGF method exploits the regularity of a finite-volume scheme on…
This paper presents a Graphics Processing Units (GPUs) acceleration method of an iterative scheme for gas-kinetic model equations. Unlike the previous GPU parallelization of explicit kinetic schemes, this work features a fast converging…
The Poisson equation is commonly encountered in engineering, for instance in computational fluid dynamics (CFD) where it is needed to compute corrections to the pressure field to ensure the incompressibility of the velocity field. In the…
A computationally efficient method for solving three-dimensional, viscous, incompressible flows on unbounded domains is presented. The method formally discretizes the incompressible Navier-Stokes equations on an unbounded staggered…
We propose an efficient semi-Lagrangian method for solving the two-dimensional incompressible Euler equations with high precision on a coarse grid. The new approach evolves the flow map using the gradient-augmented level set method (GALSM).…
In this paper, we present an advanced high-order compact gas-kinetic scheme (CGKS) for 3D unstructured mixed-element meshes, augmented with a geometric multigrid technique to accelerate steady-state convergence. The scheme evolves…
We present a hybrid particle/grid approach for simulating incompressible fluids on collocated velocity grids. We interchangeably use particle and grid representations of transported quantities to balance efficiency and accuracy. A novel…
An improved numerical solver for the unified solution of compressible and incompressible fluids involving interfaces is proposed. The present method is based on the CIP-CUP (Cubic Interpolated Propagation / Combined, Unified Procedure)…
Implicit methods and GPU parallelization are two distinct yet powerful strategies for accelerating high-order CFD algorithms. However, few studies have successfully integrated both approaches within high-speed flow solvers. The core…
We propose a novel collocated projection method for solving the incompressible Navier-Stokes equations with arbitrary boundaries. Our approach employs non-graded octree grids, where all variables are stored at the nodes. To discretize the…
Despite the progress in high performance computing, Computational Fluid Dynamics (CFD) simulations are still computationally expensive for many practical engineering applications such as simulating large computational domains and highly…
A Cartesian grid method combined with a simplified gas kinetic scheme is presented for subsonic and supersonic viscous flow simulation on complex geometries. Under the Cartesian mesh, the computational grid points are classified into four…
We present a numerical method for solving the Poisson equation on a nested grid. The nested grid consists of uniform grids having different grid spacing and is designed to cover the space closer to the center with a finer grid. Thus our…
Aims. Our aim is to derive a fast and accurate method for computing the gravitational potential of astrophysical objects with high contrasts in density, for which nested or adaptive meshes are required. Methods. We present an extension of…
An a priori reduced order method based on the proper generalised decomposition (PGD) is proposed to compute parametric solutions involving turbulent incompressible flows of interest in an industrial context, using OpenFOAM. The PGD…
Graph condensation reduces the size of large graphs while preserving performance, addressing the scalability challenges of Graph Neural Networks caused by computational inefficiencies on large datasets. Existing methods often rely on…
Incompressible flow solvers based on strong-form meshfree methods represent arbitrary geometries without the need for a global mesh system. However, their local evaluations make it difficult to satisfy incompressibility at the discrete…
Multiphase compressible flows are often characterized by a broad range of space and time scales. Thus entailing large grids and small time steps, simulations of these flows on CPU-based clusters can thus take several wall-clock days.…