Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userChaotic attractors from border-collision bifurcations: stable border fixed points and determinant-based Lyapunov exponent bounds
120
0
0.0
(
0
)
Authors
D.J.W. Simpson
Ask ChatGPT about the research
No Arabic abstract
The collision of a fixed point with a switching manifold (or border) in a piecewise-smooth map can create many different types of invariant sets. This paper explores two techniques that, combined, establish a chaotic attractor is created in a border-collision bifurcation in $mathbb{R}^d$ $(d ge 1)$. First, asymptotic stability of the fixed point at the bifurcation is characterised and shown to imply a local attractor is created. Second, a lower bound on the maximal Lyapunov exponent is obtained from the determinants of the one-sided Jacobian matrices associated with the fixed point. Special care is taken to accommodate points whose forward orbits intersect the switching manifold as such intersections can have a stabilising effect. The results are applied to the two-dimensional border-collision normal form focusing on parameter values for which the map is piecewise area-expanding.
rate research
Read More
Let $X$ be a set of points whose coordinates are known with limited accuracy; our aim is to give a characterization of the vanishing ideal $I(X)$ independent of the data uncertainty. We present a method to compute a polynomial basis $B$ of $I(X)$ which exhibits structural stability, that is, if $widetilde X$ is any set of points differing only slightly from $X$, there exists a polynomial set $widetilde B$ structurally similar to $B$, which is a basis of the perturbed ideal $ I(widetilde X)$.
The Lyapunov exponent characterizes the asymptotic behavior of long matrix products. Recognizing scenarios where the Lyapunov exponent is strictly positive is a fundamental challenge that is relevant in many applications. In this work we establish a novel tool for this task by deriving a quantitative lower bound on the Lyapunov exponent in terms of a matrix sum which is efficiently computable in ergodic situations. Our approach combines two deep results from matrix analysis --- the $n$-matrix extension of the Golden-Thompson inequality and the Avalanche-Principle. We apply these bounds to the Lyapunov exponents of Schrodinger cocycles with certain ergodic potentials of polymer type and arbitrary correlation structure. We also derive related quantitative stability results for the Lyapunov exponent near aligned diagonal matrices and a bound for almost-commuting matrices.
In some maps the existence of an attractor with a positive Lyapunov exponent can be proved by constructing a trapping region in phase space and an invariant expanding cone in tangent space. If this approach fails it may be possible to adapt the strategy by considering an induced map (a first return map for a well-chosen subset of phase space). In this paper we show that such a construction can be applied to the two-dimensional border-collision normal form (a continuous piecewise-linear map) if a certain set of conditions are satisfied and develop an algorithm for checking these conditions. The algorithm requires relatively few computations, so it is a more efficient method than, for example, estimating the Lyapunov exponent from a single orbit in terms of speed, numerical accuracy, and rigor. The algorithm is used to prove the existence of an attractor with a positive Lyapunov exponent numerically in an area of parameter space where the map has strong rotational characteristics and the consideration of an induced map is critical for the proof of robust chaos.
In this paper we consider the problem of computing all possible order ideals and also sets connected to 1, and the corresponding border bases, for the vanishing ideal of a given finite set of points. In this context two different approaches are discussed: based on the Buchberger-Moller Algorithm, we first propose a new algorithm to compute all possible order ideals and the corresponding border bases for an ideal of points. The second approach involves adapting the Farr-Gao Algorithm for finding all sets connected to 1, as well as the corresponding border bases, for an ideal of points. It should be noted that our algorithms are term ordering free. Therefore they can compute successfully all border bases for an ideal of points. Both proposed algorithms have been implemented and their efficiency is discussed via a set of benchmarks.
In modeling physical systems it is sometimes useful to construct border bases of 0-dimensional polynomial ideals which are contained in the ideal generated by a given set of polynomials. We define and construct such subideal border bases, provide some basic properties and generalize a suitable variant of the Buchberger-Moeller algorithm as well as the AVI-algorithm to the subideal setting. The subideal version of the AVI-algorithm is then applied to an actual industrial problem.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
