Displaying similar documents to “On the stabilization of internally coupled map lattice systems.”

A note on lattice renormings

Marián J. Fabián, Petr Hájek, Václav Zizler (1997)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

It is shown that every strongly lattice norm on c 0 ( Γ ) can be approximated by C ∞ smooth norms. We also show that there is no lattice and Gâteaux differentiable norm on C 0 [ 0 , ω 1 ] .

Simple environment for developing methods of controlling chaos in spatially distributed systems

Łukasz Korus (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper presents a simple mathematical model called a coupled map lattice (CML). For some range of its parameters, this model generates complex, spatiotemporal behavior which seems to be chaotic. The main purpose of the paper is to provide results of stability analysis and compare them with those obtained from numerical simulation. The indirect Lyapunov method and Lyapunov exponents are used to examine the dependence on initial conditions. The net direction phase is introduced to measure...

Efficiency analysis of control algorithms in spatially distributed systems with chaotic behavior

Łukasz Korus (2014)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper presents results of examination of control algorithms for the purpose of controlling chaos in spatially distributed systems like the coupled map lattice (CML). The mathematical definition of the CML, stability analysis as well as some basic results of numerical simulation exposing complex, spatiotemporal and chaotic behavior of the CML were already presented in another paper. The main purpose of this article is to compare the efficiency of controlling chaos by simple classical...

Classification systems and their lattice

Sándor Radeleczki (2002)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

We define and study classification systems in an arbitrary CJ-generated complete lattice L. Introducing a partial order among the classification systems of L, we obtain a complete lattice denoted by Cls(L). By using the elements of the classification systems, another lattice is also constructed: the box lattice B(L) of L. We show that B(L) is an atomistic complete lattice, moreover Cls(L)=Cls(B(L)). If B(L) is a pseudocomplemented lattice, then every classification system of L is independent...

On extensions of orthosymmetric lattice bimorphisms

Mohamed Ali Toumi (2013)

Mathematica Bohemica

Similarity:

In the paper we prove that every orthosymmetric lattice bilinear map on the cartesian product of a vector lattice with itself can be extended to an orthosymmetric lattice bilinear map on the cartesian product of the Dedekind completion with itself. The main tool used in our proof is the technique associated with extension to a vector subspace generated by adjoining one element. As an application, we prove that if ( A , * ) is a commutative d -algebra and A 𝔡 its Dedekind completion, then, A 𝔡 can...