11.07.2015 Views

View - Universidad de Almería

View - Universidad de Almería

View - Universidad de Almería

SHOW MORE
SHOW LESS
  • No tags were found...

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

82 Tibor Csen<strong>de</strong>s, Balázs Bánhelyi, and Barnabás GarayH 7 (b)y0.1H 7 (c)O 1E 2H 7 (d)1.0xO 2E 1H 7 (a)Figure 1. Illustration of the H 7 transformation for the classic Hénon parameters A = 1.4 and B = 0.3 togetherwith the chaotic region of two parallelograms. The a, b, c, and d si<strong>de</strong>s of the parallelograms are <strong>de</strong>picted on theupper left picture of Figure 2.Algorithm 1 : The Checking RoutineInputs: – ε: the user set limit size of subintervals,– Q: the argument set to be proved,– O: the aimed set for which T (Q) ⊂ O is to be checked.1. Calculate the initial interval I, that contains the regions of interest2. Push the initial interval into the stack3. while ( the stack is nonempty )4. Pop an interval v out of the stack5. Calculate the width of v6. Determine the wi<strong>de</strong>st coordinate direction7. Calculate the transformed interval w = T (v)8. if v ∩ Q ≠ ∅, and the condition w ⊂ O does not hold, then9. if the width of interval v is less than ε then10. print that the condition is hurt by v and stop11. else bisect v along the wi<strong>de</strong>st si<strong>de</strong>: v = v 1 ∪ v 212. push the subintervals into the stack13. endif14. endif15. end while16. print that the condition is proven and stopWe have proven that this algorithm is capable to provi<strong>de</strong> the positive answer after a finitenumber of steps, and also that the given answer is rigorous in the mathematical sense. Oncewe have a reliable computer procedure to check the conditions of chaotic behavior of a mappingit is straightforward to set up an optimization mo<strong>de</strong>l that transforms the original chaoslocation problem to a global optimization problem.The key question for the successful application of a global optimization algorithm was howto compose the penalty functions. On the basis of earlier experiences collected with similarconstrained problems, we have <strong>de</strong>ci<strong>de</strong>d to add a nonnegative value proportional to how muchthe given condition was hurt, plus a fixed penalty term in case at least one of the constraintswas not satisfied.As an example, consi<strong>de</strong>r the case when one of the conditions for the transformed regionwas hurt, e.g. when (2), i.e. the relationH k (b ∪ c) ⊂ O 1

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!