相关论文: A thresholding algorithm to Willmore-type flows vi…
We consider fully discrete numerical approximations for axisymmetric Willmore flow that are unconditionally stable and work reliably without remeshing. We restrict our attention to surfaces without boundary, but allow for spontaneous…
We study the well-established problem of finding an optimal routing of unsplittable flows in a graph. While by now there is an extensive body of work targeting the problem on graph classes such as paths and trees, we aim at using the…
This work studies Willmore flows of tori and their singularities via a dimension reduction approach. We introduce a Willmore flow that preserves the degenerate constraint of prescribed conformal class and, for rotationally symmetric initial…
We introduce a novel unit-time ordinary differential equation (ODE) flow called the preconditioned F\"{o}llmer flow, which efficiently transforms a Gaussian measure into a desired target measure at time 1. To discretize the flow, we apply…
We propose an energy-stable parametric finite element method (PFEM) for the planar Willmore flow and establish its unconditional energy stability of the full discretization scheme. The key lies in the introduction of two novel geometric…
This paper focuses on a one-dimensional fourth-order nonlinear dispersive partial differential equation for curve flows on a K\"ahler manifold. The equation arises as a fourth-order extension of the one-dimensional Schr\"odinger flow…
We consider a scalar valued elliptic partial differential equation on a sufficiently smooth domain $\Omega$, subject to a regularized Tresca friction-type boundary condition on a subset $\Gamma$ of $\partial \Omega$. The friction threshold,…
We consider obstacle problems for the Willmore functional in the class of graphs of functions and surfaces of revolution with Dirichlet boundary conditions. We prove the existence of minimisers of the obstacle problems under the assumption…
Kuwert and Sch\"atzle showed in 2001 that the Willmore flow converges to a standard round sphere, if the initial energy is small. In this situation, we prove stability estimates for the barycenter and the quadratic moment of the surface.…
In this paper, we introduce a new framework for approximately solving flow problems in capacitated, undirected graphs and apply it to provide asymptotically faster algorithms for the maximum $s$-$t$ flow and maximum concurrent…
We introduce an ordinary differential equation (ODE) based deep generative method for learning conditional distributions, named Conditional F\"ollmer Flow. Starting from a standard Gaussian distribution, the proposed flow could approximate…
In this paper we consider generalized flow problems where there is an $m$-edge $n$-node directed graph $G = (V,E)$ and each edge $e \in E$ has a loss factor $\gamma_e >0$ governing whether the flow is increased or decreased as it crosses…
We consider the solution of initial value problems within the context of hybrid systems and emphasise the use of high precision approximations (in software for exact real arithmetic). We propose a novel algorithm for the computation of…
We consider the area-preserving Willmore evolution of surfaces that are close to a half-sphere with a small radius, sliding on the boundary S of a domain while meeting it orthogonally. We prove that the flow exists for all times and keeps a…
We consider the Willmore flow equation for complete, properly immersed surfaces in Rn. Given bounded geometry on the initial surface, we extend the result by Kuwert and Sch\"atzle in 2002 and prove short time existence and uniqueness of the…
The paper presents a dynamic solution method for dynamic minimum parametric networks flow. The solution method solves the problem for a special parametric dynamic network with linear lower bound functions of a single parameter. Instead…
We extend thresholding methods for numerical realization of mean curvature flow on obstacles to the anisotropic setting where interfacial energy depends on the orientation of the interface. This type of schemes treats the interface…
The well-posedness of a phase-field approximation to the Willmore flow with volume constraint is established. The existence proof relies on the underlying gradient flow structure of the problem: the time discrete approximation is solved by…
It is well known that classical formulations resembling the Horn and Schunck model are still largely competitive due to the modern implementation practices. In most cases, these models outperform many modern flow estimation methods. In view…
The purpose of the present work is to expand substantially the type of control and estimation problems that can be addressed following the paradigm of Schr\"odinger bridges, by incorporating termination (killing) of stochastic flows.…