Displaying similar documents to “On an algorithm for testing T4 solvability of max-plus interval systems”

Equivalence of compositional expressions and independence relations in compositional models

Francesco M. Malvestuto (2014)

Kybernetika

Similarity:

We generalize Jiroušek’s (right) composition operator in such a way that it can be applied to distribution functions with values in a “semifield“, and introduce (parenthesized) compositional expressions, which in some sense generalize Jiroušek’s “generating sequences” of compositional models. We say that two compositional expressions are equivalent if their evaluations always produce the same results whenever they are defined. Our first result is that a set system is star-like with...

Max-min interval systems of linear equations with bounded solution

Helena Myšková (2012)

Kybernetika

Similarity:

Max-min algebra is an algebraic structure in which classical addition and multiplication are replaced by and , where a b = max { a , b } , a b = min { a , b } . The notation 𝐀 𝐱 = 𝐛 represents an interval system of linear equations, where 𝐀 = [ A ̲ , A ¯ ] , 𝐛 = [ b ̲ , b ¯ ] are given interval matrix and interval vector, respectively, and a solution is from a given interval vector 𝐱 = [ x ̲ , x ¯ ] . We define six types of solvability of max-min interval systems with bounded solution and give necessary and sufficient conditions for them.

Entropy and growth of expanding periodic orbits for one-dimensional maps

A. Katok, A. Mezhirov (1998)

Fundamenta Mathematicae

Similarity:

Let f be a continuous map of the circle S 1 or the interval I into itself, piecewise C 1 , piecewise monotone with finitely many intervals of monotonicity and having positive entropy h. For any ε > 0 we prove the existence of at least e ( h - ε ) n k periodic points of period n k with large derivative along the period, | ( f n k ) ' | > e ( h - ε ) n k for some subsequence n k of natural numbers. For a strictly monotone map f without critical points we show the existence of at least ( 1 - ε ) e h n such points.

A new regular multiplier embedding

Gemayqzel Bouza Allende, Jürgen Guddat (2013)

Kybernetika

Similarity:

Embedding approaches can be used for solving non linear programs P. The idea is to define a one-parametric problem such that for some value of the parameter the corresponding problem is equivalent to P. A particular case is the multipliers embedding, where the solutions of the corresponding parametric problem can be interpreted as the points computed by the multipliers method on P. However, in the known cases, either path-following methods can not be applied or the necessary conditions...