Related papers: A thresholding algorithm to Willmore-type flows vi…
We investigate the time-complexity of the All-Pairs Max-Flow problem: Given a graph with $n$ nodes and $m$ edges, compute for all pairs of nodes the maximum-flow value between them. If Max-Flow (the version with a given source-sink pair…
A gradient flow equation for $\lambda\phi^{4}$ theory in $D=4$ is formulated. In this scheme the gradient flow equation is written in terms of the renormalized probe variable $\Phi(t,x)$ and renormalized parameters $m^{2}$ and $\lambda$ in…
Quartic eigenvalue problem $(\lambda^4 A + \lambda^3 B + \lambda^2C + \lambda D + E)x = \mathbf{0}$ naturally arises e.g. when solving the Orr-Sommerfeld equation in the analysis of the stability of the {Poiseuille} flow, in theoretical…
In this article, the author investigates flow lines of the classical Willmore flow, which start to move in a smooth parametrization of a Hopf-torus in $\mathbb{S}^3$. We prove that any such flow line of the Willmore flow exists globally, in…
We present a new proof of the Willmore inequality for an arbitrary bounded domain $\Omega\subset\mathbb{R}^{n}$ with smooth boundary. Our proof is based on a parametric geometric inequality involving the electrostatic potential for the…
We discuss a short-time existence theorem of solutions to the initial value problem for a fourth-order dispersive flow for curves parametrized by the real line into a compact K\"ahler manifold. Our equations geometrically generalize a…
In this paper, we propose a new method to compute the solution of time-dependent Schr\"odinger equation (TDSE). Using push-forward maps and Wasserstein Hamiltonian flow, we reformulate the TDSE as a Hamiltonian system in terms of…
We propose an efficient threshold dynamics method for topology optimization for fluids modeled with the Stokes equation. The proposed algorithm is based on minimization of an objective energy function that consists of the dissipation power…
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any graph on n vertices into an O(n\log n)-edge graph on the same…
We present faster algorithms for approximate maximum flow in undirected graphs with good separator structures, such as bounded genus, minor free, and geometric graphs. Given such a graph with $n$ vertices, $m$ edges along with a recursive…
We propose and analyze stable finite element approximations for Willmore flow of planar curves. The presented schemes are based on a novel weak formulation which combines an evolution equation for curvature with the curvature formulation…
We propose a quasi-Grassmannian gradient flow model for eigenvalue problems of linear operators, aiming to efficiently address many eigenpairs. Our model inherently ensures asymptotic orthogonality: without the need for initial…
We present a new flow framework for separation logic reasoning about programs that manipulate general graphs. The framework overcomes problems in earlier developments: it is based on standard fixed point theory, guarantees least flows,…
A nonlinear parabolic equation of sixth order is analyzed. The equation arises as a reduction of a model from quantum statistical mechanics, and also as the gradient flow of a second-order information functional with respect to the…
Geometric gradient flows for elastic energies of Willmore type play an important role in mathematics and in many applications. The evolution of elastic curves has been studied in detail both for closed as well as for open curves. Although…
We investigate a new phase field model for representing non-oriented interfaces, approximating their area and simulating their area-minimizing flow. Our contribution is related to the approach proposed in arXiv:2105.09627 that involves ad…
This paper constructs the first quantum algorithm for wavelet packet transforms with a "parabolic scaling" tree structure, sometimes called wave atom transforms. Classically, wave atoms are used to construct sparse representations of…
We establish the existence of positive solutions for a system of coupled fourth-order partial differential equations on a bounded domain $\Omega \subset \mathbb{R}^n$\begin{align*} \left\{\begin{array}{l} \Delta^2u_1 +\beta_1 \Delta…
We present a family of fast pseudo-approximation algorithms for the minimum balanced vertex separator problem in a graph. Given a graph $G=(V,E)$ with $n$ vertices and $m$ edges, and a (constant) balance parameter $c\in(0,1/2)$, where $G$…
We present an $m^{4/3+o(1)}\log W$-time algorithm for solving the minimum cost flow problem in graphs with unit capacity, where $W$ is the maximum absolute value of any edge weight. For sparse graphs, this improves over the best known…