相关论文: A thresholding algorithm to Willmore-type flows vi…

Motivated by a recent method for approximate solution of Fredholm equations of the first kind, we develop a corresponding method for a class of Fredholm equations of the \emph{second kind}. In particular, we consider the class of equations…

We define rigorously a solution to the fourth-order total variation flow equation in $\mathbb{R}^n$. If $n\geq3$, it can be understood as a gradient flow of the total variation energy in $D^{-1}$, the dual space of $D^1_0$, which is the…

The classical Perceptron algorithm of Rosenblatt can be used to find a linear threshold function to correctly classify $n$ linearly separable data points, assuming the classes are separated by some margin $\gamma > 0$. A foundational result…

In this paper we study minimum cut and maximum flow problems on planar graphs, both in static and in dynamic settings. First, we present an algorithm that given an undirected planar graph computes the minimum cut between any two given…

We propose a variational scheme for computing Wasserstein gradient flows. The scheme builds upon the Jordan--Kinderlehrer--Otto framework with the Benamou-Brenier's dynamic formulation of the quadratic Wasserstein metric and adds a…

We study the stochastic Willmore flow and the stochastic surface diffusion flow for closed or non-closed curves on $\mathbb{R}^2$ in this paper. We equivalently formulate them as a stochastic one-phase Stefan problem (or a stochastic free…

The nonlinear Forchheimer equations are used to describe the dynamics of fluid flows in porous media when Darcy's law is not applicable. In this article, we consider the generalized Forchheimer flows for slightly compressible fluids, and…

We present formalisations of the correctness of executable algorithms to solve minimum-cost flow problems in Isabelle/HOL. Two of the algorithms are based on the technique of scaling, most notably Orlin's algorithm, which has the fastest…

We introduce new diffuse approximations of the Willmore functional and the Willmore flow. They are based on a corresponding approximation of the perimeter that has been studied by Amstutz-van Goethem [{\em Interfaces Free Bound. 14…

The aim of this article is to study the limiting behavior of the solutions for the scaled generalized Euler equations of compressible fluid flow. When the initial data is of Riemann type, we showed the existence of solution which consists…

The evaluation and consideration of the mean flow in wave evolution equations are necessary for the accurate prediction of fluid particle trajectories under wave groups, with relevant implications in several domains, from the transport of…

Parameter choosing in classical edge detection algorithms can be a costly and complex task. Choosing the correct parameters can improve considerably the resulting edge-map. In this paper we present a version of Edge Drawing algorithm in…

We design an $n^{2+o(1)}$-time algorithm that constructs a cut-equivalent (Gomory-Hu) tree of a simple graph on $n$ nodes. This bound is almost-optimal in terms of $n$, and it improves on the recent $\tilde{O}(n^{2.5})$ bound by the authors…

We consider the thresholding scheme, a time discretization for mean curvature flow introduced by Merriman, Bence and Osher. We prove a convergence result in the multi-phase case. The result establishes convergence towards a weak formulation…

In this note, we revisit the problem of flow approximation properties of neural ordinary differential equations (NODEs). The approximation properties have been considered as a flow controllability problem in recent literature. The neural…

We give the first almost-linear total time algorithm for deciding if a flow of cost at most $F$ still exists in a directed graph, with edge costs and capacities, undergoing decremental updates, i.e., edge deletions, capacity decreases, and…

In this paper we study the initial boundary value problem for the system $\Delta v= u_{x_1},\ u_t-\mbox{div}\left(\left((a|\mathbf{q}|+m)I+(b-a)\frac{\mathbf{q}\otimes\mathbf{q}}{|\mathbf{q}|}\right)\nabla u\right)=-\nabla…

In this article we study the asymptotic behavior of incompressible, ideal, time-dependent two dimensional flow in the exterior of a single smooth obstacle when the size of the obstacle becomes very small. Our main purpose is to identify the…

We present an extension of the Piecewise Parabolic Method to special relativistic fluid dynamics in multidimensions. The scheme is conservative, dimensionally unsplit, and suitable for a general equation of state. Temporal evolution is…

We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow problems. Each electrical flow is given by the solution of a…