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

Due to the versatility as well as its ease of implementation, the Fast Transversal Filters algorithm is attractive for many adaptive filtering applications. However, it is not widely used because of its undesirable tendency to diverge when operating in finite precision arithmetic. To compensate, modifications to the algorithm have been introduced that are either occasional (performed when a predefined condition(s) is violated) or structured as part of the normal update iteration. However, in neither...

The interval eigenproblem in max-min algebra is studied. A classification of interval eigenvectors is introduced and six types of interval eigenvectors are described. Characterization of all six types is given for the case of strictly increasing eigenvectors and Hasse diagram of relations between the types is presented.