Related papers: A thresholding algorithm to Willmore-type flows vi…
The optimization problems with a sparsity constraint is a class of important global optimization problems. A typical type of thresholding algorithms for solving such a problem adopts the traditional full steepest descent direction or…
This paper generalizes the dynamical system proposed by Wang et al. [Siam. J. Sci. Comput., 2021] to multiobjective optimization by investigating a multiobjective accelerated gradient-like flow with asymptotically vanishing normalized…
In this paper, a regularity result for the Willmore flow is presented. It is established by means of a truncated translation technique in conjunction with the Implicit Function Theorem.
In many recent applications when new materials and technologies are developed it is important to describe and simulate new nonlinear and nonlocal diffusion transport processes. A general class of such models deals with nonlocal fractional…
In this paper we present a mathematical analysis for a steady-state laminar boundary layer flow, governed by the Ostwald-de Wael power-law model of an incompressible non- Newtonian fluid past a semi-infinite power-law stretched flat plate…
This article is concerned with the existence and the long time behavior of weak solutions to certain coupled systems of fourth-order degenerate parabolic equations of gradient flow type. The underlying metric is a Wasserstein-like…
In this paper we present a novel algorithm for simulating geometrical flows, and in particular the Willmore flow, with conservation of volume and area. The idea is to adapt the class of diffusion-redistanciation algorithms to the Willmore…
Here we continue the investigation of the M\"obius-invariant Willmore flow (MIWF), starting to move in arbitrary smooth and umbilic-free initial immersions $F_0$ which map some fixed compact torus $\Sigma$ into $\mathbb{R}^n$ respectively…
In this paper, we introduce a geometric flow for Lagrangian submanifolds in a K\"ahler manifold that stays in its initial Hamiltonian isotopy class and is a gradient flow for volume. The stationary solutions are the Hamiltonian stationary…
We study the Willmore problem with free boundary by means of a new {\L}ojasiewicz-Simon gradient inequality for functionals on infinite dimensional manifolds. In contrast to previous works, we do not rely on a gradient-like representation…
In this article a unified approach to iterative soft-thresholding algorithms for the solution of linear operator equations in infinite dimensional Hilbert spaces is presented. We formulate the algorithm in the framework of generalized…
We give an iterative algorithm for finding the maximum flow between a set of sources and sinks that lie on the boundary of a planar graph. Our algorithm uses only O(n) queries to simple data structures, achieving an O(n log n) running time…
We consider the generalized Forchheimer flows for slightly compressible fluids. Using Muskat's and Ward's general form of Forchheimer equations, we describe the fluid dynamics by a nonlinear degenerate parabolic equation for the density. We…
Using the flow governing equation approach to similarity, Weyburne (D. Weyburne, arXiv:1701.02364, 2016) recently showed that for 2-D turbulent boundary layer flows, the Prandtl Plus scalings are NOT, in general, the proper similarity…
In the semi-streaming model, an algorithm must process any $n$-vertex graph by making one or few passes over a stream of its edges, use $O(n \cdot \text{polylog }n)$ words of space, and at the end of the last pass, output a solution to the…
In 1990, Alon, Seymour, and Thomas gave the first balanced separator of size $O(h^{3/2}\sqrt{n})$ for any $K_h$-minor-free graph, which has had numerous algorithmic applications. They conjectured that the size of the balanced separator can…
We propose, analyze and test a new adaptive penalty scheme that picks the penalty parameter $\epsilon$ element by element small where $\nabla\cdot u^h$ is large. We start by analyzing and testing the new scheme on the most simple but…
A new algorithm has been developed to compute low Mach Numbers supercritical fluid flows. The algorithm is applied using a finite volume method based on the SIMPLER algorithm. Its main advantages are to decrease significantly the CPU time,…
This paper is focused on the generalized Forchheimer flows of slightly compressible fluids in porous media. They are reformulated as a degenerate parabolic equation for the pressure. The initial boundary value problem is studied with…
We present semi-streaming algorithms for basic graph problems that have optimal per-edge processing times and therefore surpass all previous semi-streaming algorithms for these tasks. The semi-streaming model, which is appropriate when…