Page 1

Displaying 1 – 5 of 5

Showing per page

Characterizing matrices with 𝐗 -simple image eigenspace in max-min semiring

Ján Plavka, Sergeĭ Sergeev (2016)

Kybernetika

A matrix A is said to have 𝐗 -simple image eigenspace if any eigenvector x belonging to the interval 𝐗 = { x : x ̲ x x ¯ } is the unique solution of the system A y = x in 𝐗 . The main result of this paper is a combinatorial characterization of such matrices in the linear algebra over max-min (fuzzy) semiring. The characterized property is related to and motivated by the general development of tropical linear algebra and interval analysis, as well as the notions of simple image set and weak robustness (or weak stability) that...

Computing the greatest 𝐗 -eigenvector of a matrix in max-min algebra

Ján Plavka (2016)

Kybernetika

A vector x is said to be an eigenvector of a square max-min matrix A if A x = x . An eigenvector x of A is called the greatest 𝐗 -eigenvector of A if x 𝐗 = { x ; x ̲ x x ¯ } and y x for each eigenvector y 𝐗 . A max-min matrix A is called strongly 𝐗 -robust if the orbit x , A x , A 2 x , reaches the greatest 𝐗 -eigenvector with any starting vector of 𝐗 . We suggest an O ( n 3 ) algorithm for computing the greatest 𝐗 -eigenvector of A and study the strong 𝐗 -robustness. The necessary and sufficient conditions for strong 𝐗 -robustness are introduced and an efficient...

Conditional distributivity of overlap functions over uninorms with continuous underlying operators

Hui Liu, Wenle Li (2024)

Kybernetika

The investigations of conditional distributivity are encouraged by distributive logical connectives and their generalizations used in fuzzy set theory and were brought into focus by Klement in the closing session of Linzs 2000. This paper is mainly devoted to characterizing all pairs ( O , F ) of aggregation functions that are satisfying conditional distributivity laws, where O is an overlap function, and F is a continuous t-conorm or a uninorm with continuous underlying operators.

Congruences and homomorphisms on Ω -algebras

Elijah Eghosa Edeghagba, Branimir Šešelja, Andreja Tepavčević (2017)

Kybernetika

The topic of the paper are Ω -algebras, where Ω is a complete lattice. In this research we deal with congruences and homomorphisms. An Ω -algebra is a classical algebra which is not assumed to satisfy particular identities and it is equipped with an Ω -valued equality instead of the ordinary one. Identities are satisfied as lattice theoretic formulas. We introduce Ω -valued congruences, corresponding quotient Ω -algebras and Ω -homomorphisms and we investigate connections among these notions. We prove...

Controllable and tolerable generalized eigenvectors of interval max-plus matrices

Matej Gazda, Ján Plavka (2021)

Kybernetika

By max-plus algebra we mean the set of reals equipped with the operations a b = max { a , b } and a b = a + b for a , b . A vector x is said to be a generalized eigenvector of max-plus matrices A , B ( m , n ) if A x = λ B x for some λ . The investigation of properties of generalized eigenvectors is important for the applications. The values of vector or matrix inputs in practice are usually not exact numbers and they can be rather considered as values in some intervals. In this paper the properties of matrices and vectors with inexact (interval) entries...

Currently displaying 1 – 5 of 5

Page 1