Related papers: A Consistent Discrete 3D Hodge-type Decomposition:…
The Hodge decomposition is well-known for compact manifolds. The result has been extended by Kodaira to include non-compact manifolds and $L^2$ forms. We further extend the Hodge decomposition to the Sobolev space $H^1$ for general…
In the context of intra-cluster medium turbulence, it is essential to be able to split the turbulent velocity field in a compressive and a solenoidal component. We describe and implement a new method for this aim, i.e., performing a…
A radial basis function (RBF) method based on matrix-valued kernels is presented and analyzed for computing two types of vector decompositions on bounded domains: one where the normal component of the divergence-free part of the field is…
The simulation of fluid flow problems, specifically incompressible flows governed by the Navier-Stokes equations (NSE), holds fundamental significance in a range of scientific and engineering applications. Traditional numerical methods…
Compatible Discrete Operator schemes preserve basic properties of the continuous model at the discrete level. They combine discrete differential operators that discretize exactly topological laws and discrete Hodge operators that…
The incompressible Hall-magnetohydrodynamics (Hall--MHD) system presents substantial analytical and computational challenges due to its stiff, highly nonlinear Hall term and the strict requirement that the magnetic field remains solenoidal.…
Topological abstractions offer a method to summarize the behavior of vector fields but computing them robustly can be challenging due to numerical precision issues. One alternative is to represent the vector field using a discrete approach,…
Numerical methods for solving the ideal magnetohydrodynamic (MHD) equations in more than one space dimension must confront the challenge of controlling errors in the discrete divergence of the magnetic field. One approach that has been…
Several aspects of managing a sensor network (e.g., motion planning for data mules, serial data fusion and inference) benefit once the network is linearized to a path. The linearization is often achieved by constructing a space filling…
We propose a new discrete FFT-based method for computational homogenization of micromechanics on a regular grid that is simple, fast and robust. The discretization scheme is based on a tetrahedral stencil that displays three crucial…
The present work develops hybrid multigrid methods for high-order discontinuous Galerkin discretizations of elliptic problems. Fast matrix-free operator evaluation on tensor product elements is used to devise a computationally efficient PDE…
The persistent homology transform (PHT) represents a shape with a multiset of persistence diagrams parameterized by the sphere of directions in the ambient space. In this work, we describe a finite set of diagrams that discretize the PHT…
Methods of three-dimensional deconvolution (3DD) or volumetric deconvolution of optical complex-valued wavefronts diffracted by 3D samples with the 3D point spread function are presented. Particularly, the quantitative correctness of the…
Approximate convex decomposition aims to decompose a 3D shape into a set of almost convex components, whose convex hulls can then be used to represent the input shape. It thus enables efficient geometry processing algorithms specifically…
In this paper, we investigate the use of compactly supported divergence-free wavelets for the representation of the Navier-Stokes solution. After reminding the theoretical construction of divergence-free wavelet vectors, we present in…
We introduce a monotone (degenerate elliptic) discretization of the Monge-Ampere operator, on domains discretized on cartesian grids. The scheme is consistent provided the solution hessian condition number is uniformly bounded. Our approach…
Many tasks in geometry processing are modeled as variational problems solved numerically using the finite element method. For solid shapes, this requires a volumetric discretization, such as a boundary conforming tetrahedral mesh.…
The vector field of a mixed-monotone system is decomposable via a decomposition function into increasing (cooperative) and decreasing (competitive) components, and this decomposition allows for, e.g., efficient computation of reachable sets…
We introduce the cut finite element method in the language of finite element exterior calculus, by formulating a stabilisation -- for any form degree -- that makes the method robust with respect to the position of the interface relative to…
We present a new fully automatic block-decomposition hexahedral meshing algorithm capable of producing high quality meshes that strictly preserve feature curve networks on the input surface and align with an input surface cross-field. We…