Related papers: A new method to compute periodic orbits in general…
We propose a general framework for computer-assisted verification of the presence of symmetry breaking, period-tupling and touch-and-go bifurcations of symmetric periodic orbits for reversible maps. The framework is then adopted to…
We construct an algorithm for approximating the invariant tori created at a Neimark-Sacker bifurcation point. It is based on the same philosophy as many algorithms for approximating the periodic orbits created at a Hopf bifurcation point,…
The paper deals with dynamics of expanding Lorenz maps, which appear in a natural way as Poincar\`e maps in geometric models of well-known Lorenz attractor. Using both analytical and symbolic approaches, we study connections between…
This paper presents a combined sliding-mode control and subspace stabilization methodology for orbital stabilization of periodic trajectories in underactuated mechanical systems with one degree of underactuation. The approach starts with…
We present a semi-Lagrangian characteristic mapping method for the incompressible Euler equations on a rotating sphere. The numerical method uses a spatio-temporal discretization of the inverse flow map generated by the Eulerian velocity as…
In the framework of the spatial circular Hill three-body problem we illustrate the application of symplectic invariants to analyze the network structure of symmetric periodic orbit families. The extensive collection of families within this…
For appropriately chosen weights, temporal averages in chaotic systems can be approximated as a weighted sum of averages over reference states, such as unstable periodic orbits. Under strict assumptions, such as completeness of the orbit…
This paper presents the first optimal-rate $p$-th order methods with $p\geq 1$ for finding first and second-order stationary points of non-convex smooth objective functions over Riemannian manifolds. In contrast to the geodesically convex…
In this paper we propose a heuristic technique for distributing points on the surface of a unit n-dimensional Euclidean sphere, generated as the orbit of a finite cyclic subgroup of orthogonal matrices, the so called cyclic group codes.…
In this work, we propose a high-order multiscale method for an elliptic model problem with rough and possibly highly oscillatory coefficients. Convergence rates of higher order are obtained using the regularity of the right-hand side only.…
We present a method for computing all the symmetries of a rational ruled surface defined by a rational parametrization which works directly in parametric rational form, i.e. without computing or making use of the implicit equation of the…
We present a general review of the bifurcation sequences of periodic orbits in general position of a family of resonant Hamiltonian normal forms with nearly equal unperturbed frequencies, invariant under $Z_2 \times Z_2$ symmetry. The rich…
The Pyragas method of feedback control has attracted much interest as a method of stabilising unstable periodic orbits in a number of situations. We show that a time-delayed feedback control similar to the Pyragas method can be used to…
We introduce symplectic billiards for pairs of possibly non-convex polygons. After establishing basic properties, we give several criteria on pairs of polygons for the symplectic billiard map to be fully periodic, i.e. $\textit{every}$…
Correspondence is a ubiquitous problem in computer vision and graph matching has been a natural way to formalize correspondence as an optimization problem. Recently, graph matching solvers have included higher-order terms representing…
We present a Bayesian inference methodology for the estimation of orbital parameters on single-line spectroscopic binaries with astrometric data, based on the No-U-Turn sampler Markov chain Monte Carlo algorithm. Our approach is designed to…
We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we…
In the classical context of robotic mapping and localization, map matching is typically defined as the task of finding a rigid transformation (i.e., 3DOF rotation/translation on the 2D moving plane) that aligns the query and reference maps…
The matching of multiple objects (e.g. shapes or images) is a fundamental problem in vision and graphics. In order to robustly handle ambiguities, noise and repetitive patterns in challenging real-world settings, it is essential to take…
In this paper we develop further a method for detecting unstable periodic orbits (UPOs) by stabilising transformations, where the strategy is to transform the system of interest in such a way that the orbits become stable. The main…