Search arXivSearch

arXiv · 2607.10217

Optimal Control of Saddle Node Bifurcations

Abstract

Nonautonomous saddle node bifurcations commonly appear in mathematical models, however, an optimal control theory tailored to such systems is not yet well established. We present conceptual work on the nonautonomous saddle node normal form. We develop an approach that reformulates the optimal control problem into an unconstrained minimization problem by exploiting a connection between bifurcation and rate-induced overshoots. The key component is a rate function that assigns the critical rate to every nonautonomous forcing. We show that in the saddle node normal form, the critical rate is unique, and hence the rate function is well defined. While this reformulation is valid in any case, the rate function is often unknown. To resolve this, we additionally present an approximation of the rate function that leads to a closed form expression of the approximated control. This makes the approach appealing in situations, in which we need repeated solves of the control problem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christopher Beekmann, Kerstin Lux-Gottschalk. 2026-07-11. Optimal Control of Saddle Node Bifurcations. https://arxiv.org/abs/2607.10217

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS