Periodic-orbit analysis and scaling laws of intermingled basins of attraction in an ecological dynamical system

Chaotic dynamical systems with two or more attractors lying on invariant subspaces may, provided certain mathematical conditions are fulfilled, exhibit intermingled basins of attraction: Each basin is riddled with holes belonging to basins of the other attractors. In order to investigate the occurrence of such phenomenon in dynamical systems of ecological interest (two-species competition with extinction) we have characterized quantitatively the intermingled basins using periodic-orbit theory and scaling laws. The latter results agree with a theoretical prediction from a stochastic model, and also with an exact result for the scaling exponent we derived for the specific class of models investigated. We discuss the consequences of the scaling laws in terms of the predictability of a final state (extinction of either species) in an ecological experiment.

Contrasts in the basins of attraction of structurally identical iterative root finding methods

A numerical comparison is performed between three methods of third order with the same structure, namely BSC, Halley’s and Euler–Chebyshev’s methods. As the behavior of an iterative method applied to a nonlinear equation can be highly sensitive to the starting points, the numerical comparison is carried out, allowing for complex starting points and for complex roots, on the basins of attraction in the complex plane. Several examples of algebraic and transcendental equations are presented.

Basins of attraction changes by amplitude constraining of oscillators with limited power supply

We investigate the dynamics of a Duffing oscillator driven by a limited power supply, such that the source of forcing is considered to be another oscillator, coupled to the first one. The resulting dynamics come from the interaction between both systems. Moreover, the Duffing oscillator is subjected to collisions with a rigid wall (amplitude constraint). Newtonian laws of impact are combined with the equations of motion of the two coupled oscillators. Their solutions in phase space display periodic (and chaotic) attractors, whose amplitudes, especially when they are too large, can be controlled by choosing the wall position in suitable ways. Moreover, their basins of attraction are significantly modified, with effects on the final state system sensitivity. (c) 2005 Elsevier Ltd. All rights reserved.

Detecting changes in the basin of attraction of a dynamical system: Application to the postural restoring system

A method that provides athree-dimensional representation ofthe basin ofattraction of a dynamical system from experimen tal data was applied tothe problem ofdynamic balance restoration. The method isbased onthe density ofthe data onthe phase space ofthe system under study and makes use ofmodeling and numerical curve fittingtools.For the dynamical system ofbalance restora tion,the shape and the size of the basin of attraction depend on the dynamics of the postural restoring mechanisms and contain important information regarding the biomechanical,as well as the neuromuscular condition of the individual. The aim ofthis work was toexamine the ability ofthe method todetect, through the observed changes inthe shape and/or the size ofthe calculated basins of attraction, (a)the inherent differences between different systems (in the current application, postural restoring systems of different individuals)and (b)induced chan ges in the same system (thepostural restoring system of an individual).The results ofthe study confirm the validity of the method and furthermore justify its robustness.

Multistability and Self-Similarity in the Parameter-Space of a Vibro-Impact System

The dynamics of a dissipative vibro-impact system called impact-pair is investigated. This system is similar to Fermi-Ulam accelerator model and consists of an oscillating one-dimensional box containing a point mass moving freely between successive inelastic collisions with the rigid walls of the box. In our numerical simulations, we observed multistable regimes, for which the corresponding basins of attraction present a quite complicated structure with smooth boundary. In addition, we characterize the system in a two-dimensional parameter space by using the largest Lyapunov exponents, identifying self-similar periodic sets. Copyright (C) 2009 Silvio L.T. de Souza et al.

Stable MPC for tracking with maximal domain of attraction

In this work, a stable MPC that maximizes the domain of attraction of the closed-loop system is proposed. The proposed approach is suitable to real applications in the sense that it accounts for the case of output tracking, it is offset free if the output target is reachable and minimizes the offset if some of the constraints are active at steady state. The new approach is based on the definition of a Minkowski functional related to the input and terminal constraints of the stable infinite horizon MPC. It is also shown that the domain of attraction is defined by the system model and the constraints, and it does not depend on the controller tuning parameters. The proposed controller is illustrated with small order examples of the control literature. (C) 2011 Elsevier Ltd. All rights reserved.

Enlarging the domain of attraction of stable MPC controllers, maintaining the output performance

This work presents an alternative way to formulate the stable Model Predictive Control (MPC) optimization problem that allows the enlargement of the domain of attraction, while preserving the controller performance. Based on the dual MPC that uses the null local controller, it proposed the inclusion of an appropriate set of slacked terminal constraints into the control problem. As a result, the domain of attraction is unlimited for the stable modes of the system, and the largest possible for the non-stable modes. Although this controller does not achieve local optimality, simulations show that the input and output performances may be comparable to the ones obtained with the dual MPC that uses the LQR as a local controller. (C) 2009 Elsevier Ltd. All rights reserved.

Synchronization and Basins of Synchronized in Two-Dimensional Piecewise Maps Via Coupling Three Pieces of One-Dimensional Maps

This paper is devoted to the synchronization of a dynamical system defined by two different coupling versions of two identical piecewise linear bimodal maps. We consider both local and global studies, using different tools as natural transversal Lyapunov exponent, Lyapunov functions, eigenvalues and eigenvectors and numerical simulations. We obtain theoretical results for the existence of synchronization on coupling parameter range. We characterize the synchronization manifold as an attractor and measure the synchronization speed. In one coupling version, we give a necessary and sufficient condition for the synchronization. We study the basins of synchronization and show that, depending upon the type of coupling, they can have very different shapes and are not necessarily constituted by the whole phase space; in some cases, they can be riddled.

An Extension of Estimation of Domain of Attraction for Fractional Order Linear System Subject to Saturation Control

This paper employs the Lyapunov direct method for the stability analysis of fractional order linear systems subject to input saturation. A new stability condition based on saturation function is adopted for estimating the domain of attraction via ellipsoid approach. To further improve this estimation, the auxiliary feedback is also supported by the concept of stability region. The advantages of the proposed method are twofold: (1) it is straightforward to handle the problem both in analysis and design because of using Lyapunov method, (2) the estimation leads to less conservative results. A numerical example illustrates the feasibility of the proposed method.

Possible absence of attraction to odor in Panstrongylus megistus (Hemiptera: Reduviidae) under laboratory conditions

We tested the attraction of Panstrongylus megistus odor under laboratory conditons, between males and females of this species and by individuals of each sex on recently fed virgin couples. We employed a system of choice boxes both with or without aeration over the stimuli in the tested situations. We also observed a clear trend among the insects to remain in the central box where they had been placed in the beginning of the tests.

Drainage Basins of Iowa, March 1, 2000

Map of Drainage Basins of Iowa produced by the Iowa Department of Transportation.

Drainage Basins of Iowa, September 1, 2008

Map of Drainage Basins of Iowa produced by the Iowa Department of Transportation.

Drainage Basins of Iowa, March 1, 2000

Map of Drainage Basins of Iowa produced by the Iowa Department of Transportation.

Synchronization of symmetric chaotic systems

This paper contains a study of the synchronization by homogeneous nonlinear driving of systems that are symmetric in phase space. The main consequence of this symmetry is the ability of the response to synchronize in more than just one way to the driving systems. These different forms of synchronization are to be understood as generalized synchronization states in which the motions of drive and response are in complete correlation, but the phase space distance between them does not converge to zero. In this case the synchronization phenomenon becomes enriched because there is multistability. As a consequence, there appear multiple basins of attraction and special responses to external noise. It is shown, by means of a computer simulation of various nonlinear systems, that: (i) the decay to the generalized synchronization states is exponential, (ii) the basins of attraction are symmetric, usually complicated, frequently fractal, and robust under the changes in the parameters, and (iii) the effect of external noise is to weaken the synchronization, and in some cases to produce jumps between the various synchronization states available

Local optima networks of hard combinatorial landscapes

Combinatorial optimization involves finding an optimal solution in a finite set of options; many everyday life problems are of this kind. However, the number of options grows exponentially with the size of the problem, such that an exhaustive search for the best solution is practically infeasible beyond a certain problem size. When efficient algorithms are not available, a practical approach to obtain an approximate solution to the problem at hand, is to start with an educated guess and gradually refine it until we have a good-enough solution. Roughly speaking, this is how local search heuristics work. These stochastic algorithms navigate the problem search space by iteratively turning the current solution into new candidate solutions, guiding the search towards better solutions. The search performance, therefore, depends on structural aspects of the search space, which in turn depend on the move operator being used to modify solutions. A common way to characterize the search space of a problem is through the study of its fitness landscape, a mathematical object comprising the space of all possible solutions, their value with respect to the optimization objective, and a relationship of neighborhood defined by the move operator. The landscape metaphor is used to explain the search dynamics as a sort of potential function. The concept is indeed similar to that of potential energy surfaces in physical chemistry. Borrowing ideas from that field, we propose to extend to combinatorial landscapes the notion of the inherent network formed by energy minima in energy landscapes. In our case, energy minima are the local optima of the combinatorial problem, and we explore several definitions for the network edges. At first, we perform an exhaustive sampling of local optima basins of attraction, and define weighted transitions between basins by accounting for all the possible ways of crossing the basins frontier via one random move. Then, we reduce the computational burden by only counting the chances of escaping a given basin via random kick moves that start at the local optimum. Finally, we approximate network edges from the search trajectory of simple search heuristics, mining the frequency and inter-arrival time with which the heuristic visits local optima. Through these methodologies, we build a weighted directed graph that provides a synthetic view of the whole landscape, and that we can characterize using the tools of complex networks science. We argue that the network characterization can advance our understanding of the structural and dynamical properties of hard combinatorial landscapes. We apply our approach to prototypical problems such as the Quadratic Assignment Problem, the NK model of rugged landscapes, and the Permutation Flow-shop Scheduling Problem. We show that some network metrics can differentiate problem classes, correlate with problem non-linearity, and predict problem hardness as measured from the performances of trajectory-based local search heuristics.