316 citations · 1.1k across the 37 of their papers we have counts for
37 papers
EDMD for expanding circle maps and their complex perturbations
Oscar F. Bandtlow, Wolfram Just, Julia Slipantschuk
We show that spectral data of the Koopman operator arising from an analytic expanding circle map can be effectively calculated using an EDMD-type algorithm combining a collocat…
Resonances for rational Anosov maps on the torus
Julia Slipantschuk, Oscar F. Bandtlow, Wolfram Just
A complete description of resonances for rational toral Anosov diffeomorphisms preserving certain Reinhardt domains is presented. As a consequence it is shown that every homotopy c…
Continuation with Non-invasive Control Schemes: Revealing Unstable States in a Pedestrian Evacuation Scenario
Ilias Panagiotopoulos, Jens Starke, Jan Sieber +1
This paper presents a framework to perform bifurcation analysis in laboratory experiments or simulations. We employ control-based continuation to study the dynamics of a macroscopi…
Softening of the Euler buckling criterion under discretisation of compliance
D. J. Carter, D. J. Dunstan, W. Just +2
Euler solved the problem of the collapse of tall thin columns under unexpectedly small loads in 1744. The analogous problem of the collapse of circular elastic rings or tubes under…
Dynamic mode decomposition for analytic maps
Julia Slipantschuk, Oscar F. Bandtlow, Wolfram Just
Extended dynamic mode decomposition (EDMD) provides a class of algorithms to identify patterns and effective degrees of freedom in complex dynamical systems. We show that the modes…
Visibility graphs and symbolic dynamics
Lucas Lacasa, Wolfram Just
Visibility algorithms are a family of geometric and ordering criteria by which a real-valued time series of N data is mapped into a graph of N nodes. This graph has been shown to o…