We propose a novel discrete concept for the total generalized variation (TGV), which has originally been derived to reduce the staircasing effect in classical total variation (TV) regularization, in image denoising problems. We describe discrete, second-order TGV for piecewise constant functions on triangular meshes, thus allowing the TGV functional to be applied to more general data structures than pixel images, and in particular in the context of finite element discretizations. Particular attention is given to the description of the kernel of the TGV functional, which, in the continuous setting, consists of linear polynomials. We discuss how to take advantage of this kernel structure using piecewise constant functions on triangular meshes. Numerical experiments include denoising and inpainting problems for images defined on non-standard grids, including data from a 3D scanner.
Let $Ω$ be a Lipschitz polyhedral (can be nonconvex) domain in $\mathbb{R}^{3}$, and $V_{h}$ denotes the finite element space of continuous piecewise linear polynomials. On non-obtuse quasi-uniform tetrahedral meshes, we prove that the finite element projection $R_{h}u$ of $u \in H^{1}(Ω) \cap C(\overlineΩ)$ (with $R_{h} u$ interpolating $u$ at the boundary nodes) satisfies \begin{align*} \Vert R_{h} u\Vert_{L^{\infty}(Ω)} \leq C \vert \log h \vert \Vert u\Vert_{L^{\infty}(Ω)}. \end{align*} If we further assume $u \in W^{1,\infty}(Ω)$, then \begin{align*} \Vert R_{h} u\Vert_{W^{1, \infty}(Ω)} …
Shape spaces are fundamental in a variety of applications including image registration, morphing, matching, interpolation, and shape optimization. In this work, we consider two-dimensional shapes represented by triangular meshes of a given connectivity. We show that the collection of admissible configurations representable by such meshes form a smooth manifold. For this manifold of planar triangular meshes we propose a geodesically complete Riemannian metric. It is a distinguishing feature of this metric that it preserves the mesh connectivity and prevents the mesh from degrading along geodesi…
Discretization of the equations of Viscous Plastic and Elastic Viscous Plastic (EVP) sea ice dynamics on triangular meshes can be done by placing discrete velocities at vertices, cells or edges. Since there are more cells and edges than vertices, the cell- and edge-based discretizations simulate more linear kinematic features at the same mesh than the vertex discretization. However, the discretization based on cell and edge velocities suffer from kernels in the strain rate or stress divergence operators and need either special strain rate computations as proposed here for cell velocities, or s…
We present a high-order entropy stable discontinuous Galerkin (ESDG) method for the two dimensional shallow water equations (SWE) on curved triangular meshes. The presented scheme preserves a semi-discrete entropy inequality and remains well-balanced for continuous bathymetry profiles. We provide numerical experiments which confirm the high-order accuracy and theoretical properties of the scheme, and compare the presented scheme to an entropy stable scheme based on simplicial summation-by-parts (SBP) finite difference operators. Finally, we report the computational performance of an implementa…
We consider in this work the numerical resolution of a 2D shallow water system with a Coriolis effect and bottom friction stresses on unstructured meshes by a new Finite Volume Characteristics (FVC) scheme, which has been introduced in the preliminary works that will be cited below. Our main goal is to extend this approach to 2D unstructured formalism while preserving the physical and mathematical properties of the system, including the C-property. First, we present our extension by preserving the advantages of the finite volume discretization such as conservation property and the method of ch…
A highly efficient gas-kinetic scheme with fourth-order accuracy in both space and time is developed for the Navier-Stokes equations on triangular meshes. The scheme combines an efficient correction procedure via reconstruction (CPR) framework with a robust gas-kinetic flux formula, which computes both the flux and its time-derivative. The availability of the flux time-derivative makes it straightforward to adopt an efficient two-stage temporal discretization to achieve fourth-order time accuracy. In addition, through the gas-kinetic evolution model, the inviscid and viscous fluxes are coupled…
A numerical algorithm is presented to solve a benchmark problem proposed by Hemker. The algorithm incorporates asymptotic information into the design of appropriate piecewise-uniform Shishkin meshes. Moreover, different co-ordinate systems are utilized due to the different geometries and associated layer structures that are involved in this problem. Numerical results are presented to demonstrate the effectiveness of the proposed numerical algorithm.
This paper presents a lowest-order immersed Raviart-Thomas mixed triangular finite element method for solving elliptic interface problems on unfitted meshes independent of the interface. In order to achieve the optimal convergence rates on unfitted meshes, an immersed finite element finite (IFE) is constructed by modifying the traditional Raviart-Thomas element. Some important properties are derived including the unisolvence of IFE basis functions, the optimal approximation capabilities of the IFE space and the corresponding commuting digram. Optimal error estimates are rigorously proved for t…
We investigate the piecewise linear nonconforming Crouzeix-Raviar and the lowest order Raviart-Thomas finite-element methods for the Poisson problem on three-dimensional anisotropic meshes. We first give error estimates of the Crouzeix-Raviart and the Raviart-Thomas finite-element approximate problems. We next present the equivalence between the Raviart-Thomas finite-element method and the enriched Crouzeix-Raviart finite-element method. We emphasise that we do not impose either shape-regular or maximum-angle condition during mesh partitioning. Numerical results confirm the results that we obt…
In this paper we present an immersed weak Galerkin method for solving second-order elliptic interface problems on polygonal meshes, where the meshes do not need to be aligned with the interface. The discrete space consists of constants on each edge and broken linear polynomials satisfying the interface conditions in each element. For triangular meshes, such broken linear plynomials coincide with the basis functions in immersed finite element methods [26]. We establish some approximation properties of the broken linear polynomials and the discrete weak gradient of a certain projection of the so…
This work describes a concise algorithm for the generation of triangular meshes with the help of standard adaptive finite element methods. We demonstrate that a generic adaptive finite element solver can be repurposed into a triangular mesh generator if a robust mesh smoothing algorithm is applied between the mesh refinement steps. We present an implementation of the mesh generator and demonstrate the resulting meshes via examples.
University of Houston（休斯顿大学）；Moscow State University（莫斯科国立大学）；RWTH-Aachen University（亚琛工业大学）；Institute of Computational Mathematics and Scientific/Engineering Computing, NCMIS, AMSS, Chinese Academy of Sciences（中国科学院数学与系统科学研究院计算数学与科学工程计算研究所，国家数学与交叉研究中心）
Trimpack is a library of routines written in Fortran that allow to create unstructured triangular meshes in any domain and with an user-defined size distribution. The user must write a program that uses the elements of the library as if it were a mathematical tool. First, the domain must be defined, using point-defined boundaries, which the user provides. The library internally uses splines to mesh the boundaries with the node distribution function provided by the user. Several meshing methods are available, from simple Dalaunay mesh creation from a point cloud, an incremental Steiner-type alg…
