Related papers: Solution of the Bj\"orling problem by discrete app…
In this article, we discuss the numerical solution of diffusion equations on random surfaces within the isogeometric framework. We describe in detail, how diffusion problems on random surfaces can be modelled and how quantities of interest…
We propose a unifying algorithm for non-smooth non-convex optimization. The algorithm approximates the objective function by a convex model function and finds an approximate (Bregman) proximal point of the convex model. This approximate…
We determine the globally minimum time $T$ needed to translate a thin submerged flat plate a given distance parallel to its surface within a work budget. The Reynolds number for the flow is assumed to be large so that the drag on the plate…
A nonlinear diffusion equation, interpreted as a Wasserstein gradient flow, is numerically solved in one space dimension using a higher-order minimizing movement scheme based on the BDF (backward differentiation formula) discretization. In…
As a parametric polynomial curve family, B\'ezier curves are widely used in safe and smooth motion design of intelligent robotic systems from flying drones to autonomous vehicles to robotic manipulators. In such motion planning settings,…
This paper deals with finding surfaces in $\mathbb{R}^3$ which are as close as possible to being flat and span a given contour such that the contour is a geodesic on the sought surface. We look for a surface which minimizes the total…
This article provides a general iterative approximation to partial differential equations, and thus establish existence of smooth solution. The heart of the method is to contract (or expand) the boundary conditions uniformly in the domain,…
Minimal surfaces of general type in Euclidean 4-space are characterized with the conditions that the ellipse of curvature at any point is centered at this point and has two different principal axes. Any minimal surface of general type…
This paper deals with a method for the approximation of a spectral density function among the solutions of a generalized moment problem a` la Byrnes/Georgiou/Lindquist. The approximation is pursued with respect to the Kullback-Leibler…
In this paper, we propose a new assumption (1.2) that involves a small oscillation and $C^2$ norms for maps from smooth bounded domains into Euclidean spaces. Furthermore, by assuming that the domain has non-negative Ricci curvature, we…
The main objective of this paper is to derive the Enneper-Weierstrass representation of minimal surfaces in $\mathbb{E}^3$ using the soliton surface approach. We exploit the Bryant-type representation of conformally parametrized surfaces in…
The goal in the min-\# curve simplification problem is to reduce the number of the vertices of a polygonal curve without changing its shape significantly. We study curve-restricted min-\# simplification of polygonal curves, in which the…
Well-conditioned boundary integral methods for the solution of elliptic boundary value problems (BVPs) are powerful tools for static and dynamic physical simulations. When there are many close-to-touching boundaries (eg, in complex fluids)…
A method for detecting and approximating fault lines or surfaces, respectively, or decision curves in two and three dimensions with guaranteed accuracy is presented. Reformulated as a classification problem, our method starts from a set of…
We describe a convex relaxation for the Gilbert-Steiner problem both in $R^d$ and on manifolds, extending the framework proposed in [9], and we discuss its sharpness by means of calibration type arguments. The minimization of the resulting…
In this paper, we prove that the Max-Morse Matching Problem is approximable, thus resolving an open problem posed by Joswig and Pfetsch. We describe two different approximation algorithms for the Max-Morse Matching Problem. For…
A discrete harmonic surface is a trivalent graph which satisfies the balancing condition in the 3-dimensional Euclidean space and achieves energy minimizing under local deformations. Given a topological trivalent graph, a holomorphic…
The partition function of the 2d Ising model with random nearest neighbor coupling is expressed in the dual lattice made of square plaquettes. The dual model is solved in the the mean field and in different types of Bethe-Peierls…
In this paper we study "discrete polynomial blending," a term used to define a certain discretized version of curve blending whereby one approximates from the "sum of tensor product polynomial spaces" over certain grids. Our strategy is to…
We present a non-conforming least squares method for approximating solutions of second order elliptic problems with discontinuous coefficients. The method is based on a general Saddle Point Least Squares (SPLS) method introduced in previous…