An evolutionary algorithm for optimizing local control of chaos is presented. Based on a Lyapunov approach, a linear control law and the state-space region in which this control law is activated are determined. In addition, we study a relation between certain adjustable design parameters and a particular measure of the uncontrolled chaotic attractor in the… (More)
This contribution presents the results of an investigation on deterministic spatiotemporal chaos control by means of evolutionary algorithms. Three evolutionary algorithms are used for chaos control: differential evolution, self-organizing migrating algorithm and genetic algorithm. Models of spatiotemporal chaos, so called coupled map lattices, are used.… (More)
Linear time-invariant networks are modelled by linear differential-algebraic equations with constant coefficients. These equations can be represented by a matrix pencil. Many publications on this subject are restricted to regular matrix pencils. In particular, the influence of the Weierstrass structure of a regular pencil on the poles of its inverse is well… (More)
This paper gives an overview of the formulation and solution of network equations , with emphasis on the historical development of this area. Networks are mathematical models. The three ingredients of network descriptions are discussed. It is shown how the network equations of one-dimensional multi-port networks can be formulated and solved symbolically. If… (More)
The structure at innnity of a matrix pencil can be obtained by rank determination of Toeplitz matrices. We show that the generic rank of these matrices equals the structural rank. Thus the Toeplitz matrix approach is also suited for investigations of structure matrix pencils. Computational results underline the eeciency of this approach .