Thorsten Hüls
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Thorsten Hüls has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Wolf-Jürgen Beyn
Bielefeld University
7 shared publications Alina Girod
Department of Mathematics, Bielefeld University, Bielefeld, Germany
1 shared publication- Alina Girod
Department of Mathematics, Bielefeld University, Bielefeld, Germany
1 shared publication - Andre Schenke
Fakultät für Mathematik, Universität Bielefeld, Bielefeld, Germany
1 shared publication - Carl Chiarella
University of Technology
1 shared publication - Gary Froyland
School of Mathematics and Statistics, University of New South Wales, Sydney, Australia
1 shared publication
Latest Publications
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 30 (6) , 1859-1902
Angular spectra of linear dynamical systems in discrete time
In this work we introduce the notion of an angular spectrum for a linear discrete time nonautonomous dynamical system. The angular spectrum comprises all accumulation points of longtime averages formed by maximal principal angles between successive subspaces generated by the dynamical system. The angular spectrum is bounded by angular values which have previously been investigated by the authors. In this contribution we derive explicit formulas for the angular spectrum of some autonomous and specific nonautonomous systems. Based on a reduction principle we set up a numerical method for the general case; we investigate its convergence and apply the method to systems with a homoclinic orbit and a strange attractor. Our main theoretical result is a theorem on the invariance of the angular spectrum under summable perturbations of the given matrices (roughness theorem). It applies to systems with a so-called complete exponential dichotomy (CED), a concept which we introduce in this paper and which imposes more stringent conditions than those underlying the exponential dichotomy spectrum.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 30 (6) , 1859-1902
Angular spectra of linear dynamical systems in discrete time
In this work we introduce the notion of an angular spectrum for a linear discrete time nonautonomous dynamical system. The angular spectrum comprises all accumulation points of longtime averages formed by maximal principal angles between successive subspaces generated by the dynamical system. The angular spectrum is bounded by angular values which have previously been investigated by the authors. In this contribution we derive explicit formulas for the angular spectrum of some autonomous and specific nonautonomous systems. Based on a reduction principle we set up a numerical method for the general case; we investigate its convergence and apply the method to systems with a homoclinic orbit and a strange attractor. Our main theoretical result is a theorem on the invariance of the angular spectrum under summable perturbations of the given matrices (roughness theorem). It applies to systems with a so-called complete exponential dichotomy (CED), a concept which we introduce in this paper and which imposes more stringent conditions than those underlying the exponential dichotomy spectrum.
- Open Access
Smoothness properties of principal angles between subspaces with applications to angular values of dynamical systems
In this work we provide detailed estimates of maximal principal angles between subspaces and we analyze their smoothness for smoothly varying subspaces. This leads to a new definition of angular values for linear dynamical systems in continuous time. We derive some of their properties complementary to the theory of angular values developed in [W.-J. Beyn, G. Froyland, and T. Hüls, SIAM J. Appl. Dyn. Syst., 21 (2022), pp. 1245--1286], [W.-J. Beyn, and T. Hüls, SIAM J. Appl. Dyn. Syst., 22 (2023), pp. 162--198] for discrete time systems. The estimates are further employed to establish upper semicontinuity of angular values for some parametric model examples of discrete and continuous type.
Open AccessSmoothness properties of principal angles between subspaces with applications to angular values of dynamical systems
In this work we provide detailed estimates of maximal principal angles between subspaces and we analyze their smoothness for smoothly varying subspaces. This leads to a new definition of angular values for linear dynamical systems in continuous time. We derive some of their properties complementary to the theory of angular values developed in [W.-J. Beyn, G. Froyland, and T. Hüls, SIAM J. Appl. Dyn. Syst., 21 (2022), pp. 1245--1286], [W.-J. Beyn, and T. Hüls, SIAM J. Appl. Dyn. Syst., 22 (2023), pp. 162--198] for discrete time systems. The estimates are further employed to establish upper semicontinuity of angular values for some parametric model examples of discrete and continuous type.
- Open Access
Angular Values of Nonautonomous Linear Dynamical Systems: Part II -Reduction Theory and Algorithm
This work focuses on angular values of nonautonomous dynamical systems which have been introduced for general random and (non)autonomous dynamical systems in a previous publication [W.-J. Beyn, G. Froyland, and T. H\"uls, SIAM J. Appl. Dyn. Syst., 21 (2022), pp. 1245--1286]. The angular value of dimension $s$ measures the maximal average rotation which an $s$-dimensional subspace of the phase space experiences through the dynamics of a discrete-time linear system. Our main results relate the notion of angular value to the well-known dichotomy (or Sacker--Sell) spectrum and its associated spectral bundles. In particular, we prove a reduction theorem which shows that instead of maximizing over all subspaces, it suffices to maximize over so-called trace spaces which have their basis in the spectral fibers. The reduction leads to an algorithm for computing angular values of dimensions one and two. We apply the algorithm to several systems of dimension up to 4 and demonstrate its efficiency to detect the fastest rotating subspace even if it is not dominant under the forward dynamics.Open AccessAngular Values of Nonautonomous Linear Dynamical Systems: Part II -Reduction Theory and Algorithm
This work focuses on angular values of nonautonomous dynamical systems which have been introduced for general random and (non)autonomous dynamical systems in a previous publication [W.-J. Beyn, G. Froyland, and T. H\"uls, SIAM J. Appl. Dyn. Syst., 21 (2022), pp. 1245--1286]. The angular value of dimension $s$ measures the maximal average rotation which an $s$-dimensional subspace of the phase space experiences through the dynamics of a discrete-time linear system. Our main results relate the notion of angular value to the well-known dichotomy (or Sacker--Sell) spectrum and its associated spectral bundles. In particular, we prove a reduction theorem which shows that instead of maximizing over all subspaces, it suffices to maximize over so-called trace spaces which have their basis in the spectral fibers. The reduction leads to an algorithm for computing angular values of dimensions one and two. We apply the algorithm to several systems of dimension up to 4 and demonstrate its efficiency to detect the fastest rotating subspace even if it is not dominant under the forward dynamics. - Open Access
Angular values of nonautonomous and random linear dynamical systems: Part I -- Fundamentals
We introduce the notion of angular values for deterministic linear difference equations and random linear cocycles. We measure the principal angles between subspaces of fixed dimension as they evolve under nonautonomous or random linear dynamics. The focus is on long-term averages of these principal angles, which we call angular values: we demonstrate relationships between different types of angular values and prove their existence for random dynamical systems. For one-dimensional subspaces in two-dimensional systems our angular values agree with the classical theory of rotation numbers for orientation-preserving circle homeomorphisms if the matrix has positive determinant and does not rotate vectors by more than $\frac{\pi}{2}$. Because our notion of angular values ignores orientation by looking at subspaces rather than vectors, our results apply to dynamical systems of any dimension and to subspaces of arbitrary dimension. The second part of the paper delves deeper into the theory of the autonomous case. We explore the relation to (generalized) eigenspaces, provide some explicit formulas for angular values, and set up a general numerical algorithm for computing angular values via Schur decompositions.Open AccessAngular values of nonautonomous and random linear dynamical systems: Part I -- Fundamentals
We introduce the notion of angular values for deterministic linear difference equations and random linear cocycles. We measure the principal angles between subspaces of fixed dimension as they evolve under nonautonomous or random linear dynamics. The focus is on long-term averages of these principal angles, which we call angular values: we demonstrate relationships between different types of angular values and prove their existence for random dynamical systems. For one-dimensional subspaces in two-dimensional systems our angular values agree with the classical theory of rotation numbers for orientation-preserving circle homeomorphisms if the matrix has positive determinant and does not rotate vectors by more than $\frac{\pi}{2}$. Because our notion of angular values ignores orientation by looking at subspaces rather than vectors, our results apply to dynamical systems of any dimension and to subspaces of arbitrary dimension. The second part of the paper delves deeper into the theory of the autonomous case. We explore the relation to (generalized) eigenspaces, provide some explicit formulas for angular values, and set up a general numerical algorithm for computing angular values via Schur decompositions. - 10 September 2018
- Published by Taylor & Francis in Journal of Difference Equations and Applications
- Vol. 24 (11) , 1734-1755
On areas of attraction and repulsion in finite time dynamical systems and their numerical approximation
Stable and unstable fibre bundles with respect to a fixed point or a bounded trajectory are of great dynamical relevance in (non)autonomous dynamical systems. These sets are defined via an infinite limit process. However, the dynamics of several real world models are of interest on a short time interval only. This task requires finite time concepts of attraction and repulsion that have been recently developed in the literature. The main idea consists in replacing the infinite limit process by a monotonicity criterion and in demanding the end points to lie in a small neighbourhood of the reference trajectory. Finite time areas of attraction and repulsion defined in this way are fat sets and their dimension equals the dimension of the state space. We propose an algorithm for the numerical approximation of these sets and illustrate its application to several two- and three-dimensional dynamical systems in discrete and continuous time. Intersections of areas of attraction and repulsion are also calculated, resulting in finite time homoclinic orbits.
- 10 September 2018
- Published by Taylor & Francis in Journal of Difference Equations and Applications
- Vol. 24 (11) , 1734-1755
On areas of attraction and repulsion in finite time dynamical systems and their numerical approximation
Stable and unstable fibre bundles with respect to a fixed point or a bounded trajectory are of great dynamical relevance in (non)autonomous dynamical systems. These sets are defined via an infinite limit process. However, the dynamics of several real world models are of interest on a short time interval only. This task requires finite time concepts of attraction and repulsion that have been recently developed in the literature. The main idea consists in replacing the infinite limit process by a monotonicity criterion and in demanding the end points to lie in a small neighbourhood of the reference trajectory. Finite time areas of attraction and repulsion defined in this way are fat sets and their dimension equals the dimension of the state space. We propose an algorithm for the numerical approximation of these sets and illustrate its application to several two- and three-dimensional dynamical systems in discrete and continuous time. Intersections of areas of attraction and repulsion are also calculated, resulting in finite time homoclinic orbits.
- Open Access
- 1 January 2017
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 22 (9) , 3341-3367
Computing stable hierarchies of fiber bundles
Stable fiber bundles are important structures for understanding nonautonomous dynamics. These sets have a hierarchical structure ranging from stable to strong stable fibers. First, we compute corresponding structures for linear systems and prove an error estimate. The spectral concept of choice is the Sacker-Sell spectrum that is based on exponential dichotomies. Secondly, we tackle the nonlinear case and propose an algorithm for the numerical approximation of stable hierarchies in nonautonomous difference equations. This method generalizes the contour algorithm for computing stable fibers from [38,39]. It is based on Hadamard's graph transform and approximates fibers of the hierarchy by zero-contours of specific operators. We calculate fiber bundles and illustrate errors involved for several examples, including a nonautonomous Lorenz model.
- 1 January 2017
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 22 (9) , 3341-3367
Open AccessComputing stable hierarchies of fiber bundles
Stable fiber bundles are important structures for understanding nonautonomous dynamics. These sets have a hierarchical structure ranging from stable to strong stable fibers. First, we compute corresponding structures for linear systems and prove an error estimate. The spectral concept of choice is the Sacker-Sell spectrum that is based on exponential dichotomies. Secondly, we tackle the nonlinear case and propose an algorithm for the numerical approximation of stable hierarchies in nonautonomous difference equations. This method generalizes the contour algorithm for computing stable fibers from [38,39]. It is based on Hadamard's graph transform and approximates fibers of the hierarchy by zero-contours of specific operators. We calculate fiber bundles and illustrate errors involved for several examples, including a nonautonomous Lorenz model.
- 9 September 2016
- Published by IOP Publishing in Nonlinearity
- Vol. 29 (11) , 3346-3384
Symbolic coding for noninvertible systems: uniform approximation and numerical computation
It is well known that the homoclinic theorem, which conjugates a map near a transversal homoclinic orbit to a Bernoulli subshift, extends from invertible to specific noninvertible dynamical systems. In this paper, we provide a unifying approach that combines such a result with a fully discrete analog of the conjugacy for finite but sufficiently long orbit segments. The underlying idea is to solve appropriate discrete boundary value problems in both cases, and to use the theory of exponential dichotomies to control the errors. This leads to a numerical approach that allows us to compute the conjugacy to any prescribed accuracy. The method is demonstrated for several examples where invertibility of the map fails in different ways.
- 9 September 2016
- Published by IOP Publishing in Nonlinearity
- Vol. 29 (11) , 3346-3384
Symbolic coding for noninvertible systems: uniform approximation and numerical computation
It is well known that the homoclinic theorem, which conjugates a map near a transversal homoclinic orbit to a Bernoulli subshift, extends from invertible to specific noninvertible dynamical systems. In this paper, we provide a unifying approach that combines such a result with a fully discrete analog of the conjugacy for finite but sufficiently long orbit segments. The underlying idea is to solve appropriate discrete boundary value problems in both cases, and to use the theory of exponential dichotomies to control the errors. This leads to a numerical approach that allows us to compute the conjugacy to any prescribed accuracy. The method is demonstrated for several examples where invertibility of the map fails in different ways.
- 29 July 2015
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 56 (2) , 605-631
Nonautonomous systems with transversal homoclinic structures under discretization
- 29 July 2015
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 56 (2) , 605-631
Nonautonomous systems with transversal homoclinic structures under discretization
- Open Access
- 1 January 2014
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Computational Dynamics
- Vol. 1 (1) , 71-109
Continuation and collapse of homoclinic tangles
By a classical theorem transversal homoclinic points of maps lead to shift dynamics on a maximal invariant set, also referred to as a homoclinic tangle. In this paper we study the fate of homoclinic tangles in parameterized systems from the viewpoint of numerical continuation and bifurcation theory. The new bifurcation result shows that the maximal invariant set near a homoclinic tangency, where two homoclinic tangles collide, can be characterized by a system of bifurcation equations that is indexed by a symbolic sequence. These bifurcation equations consist of a finite or infinite set of hilltop normal forms known from singularity theory. For the Hénon family we determine numerically the connected components of branches with multi-humped homoclinic orbits that pass through several tangencies. The homoclinic network found by numerical continuation is explained by combining our bifurcation result with graph-theoretical arguments.
- 1 January 2014
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Computational Dynamics
- Vol. 1 (1) , 71-109
Open AccessContinuation and collapse of homoclinic tangles
By a classical theorem transversal homoclinic points of maps lead to shift dynamics on a maximal invariant set, also referred to as a homoclinic tangle. In this paper we study the fate of homoclinic tangles in parameterized systems from the viewpoint of numerical continuation and bifurcation theory. The new bifurcation result shows that the maximal invariant set near a homoclinic tangency, where two homoclinic tangles collide, can be characterized by a system of bifurcation equations that is indexed by a symbolic sequence. These bifurcation equations consist of a finite or infinite set of hilltop normal forms known from singularity theory. For the Hénon family we determine numerically the connected components of branches with multi-humped homoclinic orbits that pass through several tangencies. The homoclinic network found by numerical continuation is explained by combining our bifurcation result with graph-theoretical arguments.
- 31 May 2012
- Published by Springer Nature
- p. 289-316
A Homoclinic Route to Volatility: Dynamics of Asset Prices Under Autoregressive Forecasting
- 31 May 2012
- Published by Springer Nature
- p. 289-316
A Homoclinic Route to Volatility: Dynamics of Asset Prices Under Autoregressive Forecasting