arXiv research

New finite element method for complex forms in any dimension.

We present a local formulation for 2D Discrete Exterior Calculus (DEC) similar to that of the Finite Element Method (FEM), which allows a natural treatment of material heterogeneity (element by element). It also allows us to deduce, in a robust manner, anisotropic fluxes and the DEC discretization of the pullback of 1-…

Study shows how numerical discretization affects reconstructions and parameter distributions in nano metrology.

We revisit the theory of Discrete Exterior Calculus (DEC) in 2D for general triangulations, relying only on Vector Calculus and Matrix Algebra. We present DEC numerical solutions of the Poisson equation and compare them against those found using the Finite Element Method with linear elements (FEML).

Mixed finite element methods solve a PDE using two or more variables. The theory of Discrete Exterior Calculus explains why the degrees of freedom associated to the different variables should be stored on both primal and dual domain meshes with a discrete Hodge star used to transfer information between the meshes. We s…

This article presents a finite element method (FEM) for a partial integro-differential equation (PIDE) to price two-asset options with underlying price processes modeled by an exponential Levy process. We provide a variational formulation in a weighted Sobolev space, and establish existence and uniqueness of the FEM-ba…

A new method splits surface flow discretizations into streamfunctions and harmonic fields.

The paper constructs discrete Hessian and divdiv complexes on triangulations and proves their cohomology isomorphic to continuous versions.

Generalized meshes for non-regular geometries, including fractures.

We provide an action for gauge theories discretized on simplicial meshes, inspired by finite element methods. The action is discretely gauge invariant and we give a proof of consistency. A discrete Noether's theorem that can be applied to our setting, is also proved.

We consider $n$-dimensional discrete motions such that any two neighbouring positions correspond in a pure rotation ("rotating motions"). In the Study quadric model of Euclidean displacements these motions correspond to quadrilateral nets with edges contained in the Study quadric ("rotation nets"). The main focus of ou…

Generative Adversarial Networks (GAN) have limitations when the goal is to generate sequences of discrete elements. The reason for this is that samples from a distribution on discrete objects such as the multinomial are not differentiable with respect to the distribution parameters. This problem can be avoided by using…

This article reports on the confluence of two streams of research, one emanating from the fields of numerical analysis and scientific computation, the other from topology and geometry. In it we consider the numerical discretization of partial differential equations that are related to differential complexes so that de …

We propose a deterministic numerical method for pricing vanilla options under the SABR stochastic volatility model, based on a finite element discretization of the Kolmogorov pricing equations via non-symmetric Dirichlet forms. Our pricing method is valid under mild assumptions on parameter configurations of the proces…

Paper proposes a method to speed up discrete diffusion models by distilling many steps into few.

A novel method optimizes variable-stiffness structures for better strength and weight.

We consider the group of smooth diffeomorphisms of the circle. We show that any recurrent $f$ (in the sense that $\{f^n\}_{n \in Z}$ is not discrete) is in fact a distortion element (in the sense that its iterates can be written as short compositions involving finitely many smooth diffeomorphisms). Thus rotations are d…

A new discrete calculus for bundle-valued forms is proposed and validated.

The estimation of probability densities based on available data is a central task in many statistical applications. Especially in the case of large ensembles with many samples or high-dimensional sample spaces, computationally efficient methods are needed. We propose a new method that is based on a decomposition of the…

This note will prove a discreteness criterion for groups of orientation-preserving isometries of the hyperbolic space which contain a parabolic element. It can be viewed as a generalization of the well-known results of Shimizu-Leutbecher and Jorgensen in dimensions 2 and 3, and is closely related to Waterman's inequali…

We investigate geometric aspects of the the Bäcklund transform of principal contact element nets. A Bäcklund transform exists if and only if it the principal contact element net is of constant negative Gaussian curvature (a pseudosphere). We describe an elementary construction of the Bäcklund transform and prove its co…

A new field of discrete differential geometry is presently emerging on the border between differential and discrete geometry. Whereas classical differential geometry investigates smooth geometric shapes (such as surfaces), and discrete geometry studies geometric shapes with finite number of elements (such as polyhedra)…

In this paper we introduce a discrete integrable system generalizing the discrete (real) cross-ratio system in $S^4$ to complex values of a generalized cross-ratio by considering $S^4$ as a real section of the complex Plücker quadric, realized as the space of two-spheres in $S^4.$ We develop the geometry of the Plücker…

The Hodge decomposition provides a very powerful mathematical method for the analysis of 2D and 3D vector fields. It states roughly that any vector field can be $L^2$-orthogonally decomposed into a curl-free, divergence-free, and a harmonic field. The harmonic field itself can be further decomposed into three component…

Abstract result on correlations of pairs in exponentially growing discrete subsets.

Develops numerical methods for PDEs on hypergraphs and networks.

We describe algorithms for finding harmonic cochains, an essential ingredient for solving elliptic partial differential equations in exterior calculus. Harmonic cochains are also useful in computational topology and computer graphics. We focus on finding harmonic cochains cohomologous to a given cocycle. Amongst other …

Graph Neural Networks model 3D granular flow simulations.

In this paper, we generalize our results in \cite{GX3} to triangulated surfaces in hyperbolic background geometry, which means that all triangles can be embedded in the standard hyperbolic space. We introduce a new discrete Gaussian curvature by dividing the classical discrete Gauss curvature by an area element, which …

In this paper, we establish that, for statistically convex-cocompact actions, contracting elements are exponentially generic in counting measure. Among others, the following exponential genericity results are obtained as corollaries for the set of hyperbolic elements in relatively hyperbolic groups, the set of rank-1 e…

Let ${{\bf H}_{\mathbb H}}^n$ denote the $n$-dimensional quaternionic hyperbolic space. The linear group ${\rm{Sp}}(n,1)$ acts by the isometries of ${{\bf H}_{\mathbb H}}^n$. A subgroup $G$ of ${\rm {Sp}}(n,1)$ is called \emph{Zariski dense} if it does not fix a point on ${{\bf H}_{\mathbb H}}^n \cup \partial {{\bf H}_…

In this paper we consider ultra-parallel complex hyperbolic triangle groups of type $[m_1,m_2,0]$, i.e. groups of isometries of the complex hyperbolic plane, generated by complex reflections in three ultra-parallel complex geodesics two of which intersect on the boundary. We prove some discreteness and non-discreteness…

The heat coefficients related to the Laplace-Beltrami operator defined on the hyperbolic compact manifold $H^3/\Ga$ are evaluated in the case in which the discrete group $\Ga$ contains elliptic and hyperbolic elements. It is shown that while hyperbolic elements give only exponentially vanishing corrections to the trace…

We construct first examples of discrete geometrically finite subgroups of PU(2,1) which contain parabolic elements, and are isomorphic to surface groups.

Let $G$ be a semisimple Lie group with discrete series. We use maps $K_0(C^*_rG)\to \mathbb{C}$ defined by orbital integrals to recover group theoretic information about $G$, including information contained in $K$-theory classes not associated to the discrete series. An important tool is a fixed point formula for equiv…

Branching Flows generates sequences of varying lengths using binary trees.

New method approximates anisotropic curve shortening flow.

Principal binets generalize curvature line surfaces to square lattices and are a discrete integrable system.

New bounds for MCMC on discrete spaces without dimension dependence.

We consider non-elementary representations of two generator free groups in $PSL(2,\mathbb{C})$, not necessarily discrete or free, $G = < A, B >$. A word in $A$ and $B$, $W(A,B)$, is a palindrome if it reads the same forwards and backwards. A word in a free group is {\sl primitive} if it is part of a minimal generating …

We strengthen the results of \cite{A1}, consequently, we improve the claims of \cite{A2} obtaining the best possible results. Namely, we prove that if a subgroup $Γ$ of $\mathrm{Diff}_{+}(I)$ contains a free semigroup on two generators then $Γ$ is not $C_0$-discrete. Using this, we extend the Hölder's Theorem in $\math…

This paper deals with pricing of European and American options, when the underlying asset price follows Heston model, via the interior penalty discontinuous Galerkin finite element method (dGFEM). The advantages of dGFEM space discretization with Rannacher smoothing as time integrator with nonsmooth initial and boundar…

Isogeometric analysis is a recently developed computational approach that integrates finite element analysis directly into design described by non-uniform rational B-splines (NURBS). In this paper we show that price surfaces that occur in option pricing can be easily described by NURBS surfaces. For a class of stochast…

Superconvergence of differential structure on discretized surfaces is studied in this paper. The newly introduced geometric supercloseness provides us with a fundamental tool to prove the superconvergence of gradient recovery on deviated surfaces. An algorithmic framework for gradient recovery without exact geometric i…

Finite element method approximates scalar curvature in arbitrary dimensions.

We propose a general modeling and algorithmic framework for discrete structure recovery that can be applied to a wide range of problems. Under this framework, we are able to study the recovery of clustering labels, ranks of players, signs of regression coefficients, cyclic shifts, and even group elements from a unified…

New method for mesh denoising using TGV of normal vector field.

The paper approximates Levi-Civita connection and curvature on 2D manifolds using finite elements.