Related papers: Quartic Gradient Flow
The saddle point (SP) calculation is a grand challenge for computationally intensive energy function in computational chemistry area, where the saddle point may represent the transition state (TS). The traditional methods need to evaluate…
Classical Computational Fluid Dynamics (CFD) of long-time processes with strongly separated time scales is computationally extremely demanding if not impossible. Consequently, the state-of-the-art description of such systems is not capable…
We solve the problem of topological classification for smooth structurally stable flows on closed four-dimensional manifolds, the non-wandering set of which contains exactly two saddle equilibria, and the wandering set contains isolated…
Gradient-based algorithms are effective for many machine learning tasks, but despite ample recent effort and some progress, it often remains unclear why they work in practice in optimising high-dimensional non-convex functions and why they…
The scaled-particle theory equation of state for the two-dimensional hard-disk fluid on a curved surface is proposed and used to determine the saddle-splay modulus of a particle-laden fluid interface. The resulting contribution to…
Gradient-based optimization methods are the most popular choice for finding local optima for classical minimization and saddle point problems. Here, we highlight a systemic issue of gradient dynamics that arise for saddle point problems,…
The gauge-invariant two-point function of the Higgs field at the same spacetime point can make a natural gauge-invariant order parameter for spontaneous gauge symmetry breaking. However, this composite operator is ultraviolet divergent and…
The transient start-up flow solution with slip is a useful tool to verify Computational Fluid Dynamics (CFD) simulations. However, a highly accurate, open-source black box solution does not seem to be available. Our method provides a fast,…
This paper considers the problem of understanding the exit time for trajectories of gradient-related first-order methods from saddle neighborhoods under some initial boundary conditions. Given the 'flat' geometry around saddle points,…
Variational inference with natural-gradient descent often shows fast convergence in practice, but its theoretical convergence guarantees have been challenging to establish. This is true even for the simplest cases that involve concave…
Let $S(A)$ denote the orbit of a complex or real matrix $A$ under a certain equivalence relation such as unitary similarity, unitary equivalence, unitary congruences etc. Efficient gradient-flow algorithms are constructed to determine the…
We define a new geometric flow, which we shall call the $K$-flow, on 3-dimensional Riemannian manifolds; and study the behavior of Thurston's model geometries under this flow both analytically and numerically. As an example, we show that an…
Particles moving inside a fluid near, and interacting with, invariant manifolds is a common phenomenon in a wide variety of applications. One elementary question is whether we can determine once a particle has entered a neighbourhood of an…
Mathematical Programs with Vanishing Constraints (MPVCs) are a notoriously challenging class of problems owing to their lack of constraint qualification. Therefore, to tackle these problems, relaxation-based approaches are typically used.…
The fluidic pinball has been recently proposed as an attractive and effective flow configuration for exploring machine learning fluid flow control. In this contribution, we focus on the route to chaos in this system without actuation, as…
Turbulent flows present rich dynamics originating from non-trivial energy fluxes across scales, non-stationary forcings and geometrical constraints. This complexity manifests in non-hyperbolic chaos, randomness, state-dependent persistence…
It is shown that application of dynamic flows concept in 4-dimensional Euclidean space makes possible to form Minkowski space and to formulate the generalized variational problem of electrodynamics and gravi- dynamics. It is shown that…
The article is devoted to the development of algorithmic methods ensuring efficient complexity bounds for strongly convex-concave saddle point problems in the case when one of the groups of variables is high-dimensional, and the other is…
The classical irrotational capillary-gravity water wave problem described by the Euler equations with a nonlinear free surface boundary condition over a flat bed is considered. A modified flow force has been defined and a new formulation of…
We study the performance of stochastic first-order methods for finding saddle points of convex-concave functions. A notorious challenge faced by such methods is that the gradients can grow arbitrarily large during optimization, which may…