Related papers: Approximation of curves with piecewise constant or…
The Hausdorff distance is a metric commonly used to compute the set similarity of geometric sets. For sets containing a total of $n$ points, the exact distance can be computed na\"{i}vely in $O(n^2)$ time. In this paper, we show how to…
We survey recent developments in the field of complexity of pathwise approximation in $p$-th mean of the solution of a stochastic differential equation at the final time based on finitely many evaluations of the driving Brownian motion.…
We establish uniform error bounds of the L1 discretization of the Caputo derivative of H\"older continuous functions. The result can be understood as: error = (degree of smoothness - order of the derivative). We present an elementary proof…
Traditional problems in computational geometry involve aspects that are both discrete and continuous. One such example is nearest-neighbor searching, where the input is discrete, but the result depends on distances, which vary continuously.…
Let $X$ be a semistable curve and $L$ a line bundle whose multidegree is uniform, i.e., in the range between those of the structure sheaf and the dualizing sheaf of $X$. We establish an upper bound for $h^0(X,L)$, which generalizes the…
We discuss a discretization by polygonal lines of the Euler-Bernoulli bending energy and of Euler elasticae under clamped boundary conditions. We show Hausdorff convergence of the set of almost minimizers of the discrete bending energy to…
We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and $G_\delta$-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to…
The main motivation of this paper arises from the study of Carnot-Carath\'eodory spaces, where the class of 1-rectifiable sets does not contain smooth non-horizontal curves; therefore a new definition of rectifiable sets including…
We derive $H_{\text{curl}}$-error estimates and improved $L^2$-error estimates for the Maxwell equations approximated using edge finite elements. These estimates only invoke the expected regularity pickup of the exact solution in the scale…
We calculate the Gromov--Hausdorff distance between a line segment and a circle in the Euclidean plane. To do that, we introduced a few new notions like round spaces and nonlinearity degree of a metric space.
We prove a $C^m$ Lusin approximation theorem for horizontal curves in the Heisenberg group. This states that every absolutely continuous horizontal curve whose horizontal velocity is $m-1$ times $L^1$ differentiable almost everywhere…
We study discrete curvatures computed from nets of curvature lines on a given smooth surface, and prove their uniform convergence to smooth principal curvatures. We provide explicit error bounds, with constants depending only on properties…
The Riemannian manifold of curves with a Sobolev metric is an important and frequently studied model in the theory of shape spaces. Various numerical approaches have been proposed to compute geodesics, but so far elude a rigorous…
We want to propose a new discretization ansatz for the second order Hessian complex exploiting benefits of isogeometric analysis, namely the possibility of high-order convergence and smoothness of test functions. Although our approach is…
Approximations of the image and integral funnel of the closed ball of the space $L_p,$ $p>1,$ under Urysohn type integral operator are considered. The closed ball of the space $L_p,$ $p>1,$ is replaced by the set consisting of a finite…
We decide the stability and compute the Lyapunov exponent of continuous-time linear switching systems with a guaranteed dwell time. The main result asserts that the discretization method with step size~$h$ approximates the Lyapunov exponent…
The Large Deformation Diffeomorphic Metric Mapping (LDDMM) or flow of diffeomorphism is a classical framework in the field of shape spaces and is widely applied in mathematical imaging and computational anatomy. Essentially, it equips a…
Given a corkscrew domain with uniformly rectifiable boundary, we construct a surjective trace map onto the $L^p$ Hajlasz-Sobolev space on the boundary from the space of functions on the domain with $L^p$ norm involving the non-tangential…
We compute the closest convex piecewise linear-quadratic (PLQ) function with minimal number of pieces to a given univariate piecewise linear-quadratic function. The Euclidean norm is used to measure the distance between functions. First, we…
The Euler scheme is one of the standard schemes to obtain numerical approximations of stochastic differential equations (SDEs). Its convergence properties are well-known in the case of globally Lipschitz continuous coefficients. However, in…