Related papers: 3D Adaptive Central Schemes: part I Algorithms for…
The predictive accuracy of wall-modelled LES is influenced by a combination of the subgrid model, the wall model, the numerical dissipation induced primarily by the convective numerical scheme, and also by the density and topology of the…
This work presents a novel interpolation-free mesh adaptation technique for the Euler equations within the arbitrary Lagrangian Eulerian framework. For the spatial discretization, we consider a residual distribution scheme, which provides a…
This paper presents a novel algorithmic framework for the computational design, simulation, and fabrication of a hexagonal grid-based double-curvature structure with planar hexagonal panels. The journey begins with constructing a robust…
We proposed a piecewise quadratic reconstruction method in multiple dimensions, which is in an integrated style, for finite volume schemes to scalar conservation laws. This integrated quadratic reconstruction is parameter-free and…
We design and analyze an iterative two-grid algorithm for the finite element discretizations of strongly nonlinear elliptic boundary value problems in this paper. We propose an iterative two-grid algorithm, in which a nonlinear problem is…
We present a new finite volume scheme for anisotropic heterogeneous diffusion problems on unstructured irregular grids, which simultaneously gives an approximation of the solution and of its gradient. In the case of simplicial meshes, the…
New implicit and implicit-explicit time-stepping methods for the wave equation in second-order form are described with application to two and three-dimensional problems discretized on overset grids. The implicit schemes are single step,…
We present an efficient dimension-by-dimension finite-volume method which solves the adiabatic magnetohydrodynamics equations at high discretization order, using the constrained-transport approach on Cartesian grids. Results are presented…
This paper aims to develop distributed algorithms for nonconvex optimization problems with complicated constraints associated with a network. The network can be a physical one, such as an electric power network, where the constraints are…
This work studies three multigrid variants for matrix-free finite-element computations on locally refined meshes: geometric local smoothing, geometric global coarsening, and polynomial global coarsening. We have integrated the algorithms…
We present a machine-learning based Volume Of Fluid method to simulate multi-material flows on three-dimensional domains. One of the novelties of the method is that the flux fraction is computed by evaluating a previously trained neural…
The convergence analysis for least-squares finite element methods led to various adaptive mesh-refinement strategies: Collective marking algorithms driven by the built-in a posteriori error estimator or an alternative explicit…
We present an adaptive refinement algorithm for T-splines on unstructured 2D meshes. While for structured 2D meshes, one can refine elements alternatingly in horizontal and vertical direction, such an approach cannot be generalized directly…
In this paper we generalize to non-uniform grids of quad-tree type the Compact WENO reconstruction of Levy, Puppo and Russo (SIAM J. Sci. Comput., 2001), thus obtaining a truly two-dimensional non-oscillatory third order reconstruction with…
Recent works in geometric deep learning have introduced neural networks that allow performing inference tasks on three-dimensional geometric data by defining convolution, and sometimes pooling, operations on triangle meshes. These methods,…
This work is an attempt to develop an approximate scheme for estimating the volume-based truncation errors in the finite volume analysis of laminar flows. The volume-based truncation error is the net flow error across the faces of a control…
A general framework for the development of high-order compact schemes has been proposed recently. The core steps of the schemes are composed of the following. 1). Based on a kinetic model equation, from a generalized initial distribution of…
The computation of Voronoi Diagrams, or their dual Delauney triangulations is difficult in high dimensions. In a recent publication Polianskii and Pokorny propose an iterative randomized algorithm facilitating the approximation of Voronoi…
This work concerns adaptive refinement procedures for meshes of polygonal virtual elements. Specifically, refinement procedures previously proposed by the authors for structured meshes are generalized for the challenging case of arbitrary…
Navigating topological transitions in cellular mechanical systems is a significant challenge for existing simulation methods. While abstract models lack predictive capabilities at the cellular level, explicit network representations…