Displaying similar documents to “Tolerance problems for generalized eigenvectors of interval fuzzy matrices”

Controllable and tolerable generalized eigenvectors of interval max-plus matrices

Matej Gazda, Ján Plavka (2021)

Kybernetika

Similarity:

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)...

Hydrological applications of a model-based approach to fuzzy set membership functions

Chleboun, Jan, Runcziková, Judita

Similarity:

Since the common approach to defining membership functions of fuzzy numbers is rather subjective, another, more objective method is proposed. It is applicable in situations where two models, say M 1 and M 2 , share the same uncertain input parameter p . Model M 1 is used to assess the fuzziness of p , whereas the goal is to assess the fuzziness of the p -dependent output of model M 2 . Simple examples are presented to illustrate the proposed approach.

-simplicity of interval max-min matrices

Ján Plavka, Štefan Berežný (2018)

Kybernetika

Similarity:

A matrix A is said to have 𝐗 -simple image eigenspace if any eigenvector x belonging to the interval 𝐗 = { x : x ̲ x x ¯ } containing a constant vector is the unique solution of the system A y = x in 𝐗 . The main result of this paper is an extension of 𝐗 -simplicity to interval max-min matrix 𝐀 = { A : A ̲ A A ¯ } distinguishing two possibilities, that at least one matrix or all matrices from a given interval have 𝐗 -simple image eigenspace. 𝐗 -simplicity of interval matrices in max-min algebra are studied and equivalent conditions for...

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

Ján Plavka (2016)

Kybernetika

Similarity:

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...

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

Ján Plavka, Sergeĭ Sergeev (2016)

Kybernetika

Similarity:

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)...

Comparison between two types of large sample covariance matrices

Guangming Pan (2014)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

Let { X i j } , i , j = , be a double array of independent and identically distributed (i.i.d.) real random variables with E X 11 = μ , E | X 11 - μ | 2 = 1 and E | X 11 | 4 l t ; . Consider sample covariance matrices (with/without empirical centering) 𝒮 = 1 n j = 1 n ( 𝐬 j - 𝐬 ¯ ) ( 𝐬 j - 𝐬 ¯ ) T and 𝐒 = 1 n j = 1 n 𝐬 j 𝐬 j T , where 𝐬 ¯ = 1 n j = 1 n 𝐬 j and 𝐬 j = 𝐓 n 1 / 2 ( X 1 j , ... , X p j ) T with ( 𝐓 n 1 / 2 ) 2 = 𝐓 n , non-random symmetric non-negative definite matrix. It is proved that central limit theorems of eigenvalue statistics of 𝒮 and 𝐒 are different as n with p / n approaching a positive constant. Moreover, it is also proved that such a different behavior is not observed in the...

On the T -conditionality of T -power based implications

Zuming Peng (2022)

Kybernetika

Similarity:

It is well known that, in forward inference in fuzzy logic, the generalized modus ponens is guaranteed by a functional inequality called the law of T -conditionality. In this paper, the T -conditionality for T -power based implications is deeply studied and the concise necessary and sufficient conditions for a power based implication I T being T -conditional are obtained. Moreover, the sufficient conditions under which a power based implication I T is T * -conditional are discussed, this discussions...

( 0 , 1 ) -matrices, discrepancy and preservers

LeRoy B. Beasley (2019)

Czechoslovak Mathematical Journal

Similarity:

Let m and n be positive integers, and let R = ( r 1 , ... , r m ) and S = ( s 1 , ... , s n ) be nonnegative integral vectors. Let A ( R , S ) be the set of all m × n ( 0 , 1 ) -matrices with row sum vector R and column vector S . Let R and S be nonincreasing, and let F ( R ) be the m × n ( 0 , 1 ) -matrix, where for each i , the i th row of F ( R , S ) consists of r i 1’s followed by ( n - r i ) 0’s. Let A A ( R , S ) . The discrepancy of A, disc ( A ) , is the number of positions in which F ( R ) has a 1 and A has a 0. In this paper we investigate linear operators mapping m × n matrices over...

L -fuzzy ideal degrees in effect algebras

Xiaowei Wei, Fu Gui Shi (2022)

Kybernetika

Similarity:

In this paper, considering L being a completely distributive lattice, we first introduce the concept of L -fuzzy ideal degrees in an effect algebra E , in symbol 𝔇 e i . Further, we characterize L -fuzzy ideal degrees by cut sets. Then it is shown that an L -fuzzy subset A in E is an L -fuzzy ideal if and only if 𝔇 e i ( A ) = , which can be seen as a generalization of fuzzy ideals. Later, we discuss the relations between L -fuzzy ideals and cut sets ( L β -nested sets and L α -nested sets). Finally, we obtain that...

Generalized convexities related to aggregation operators of fuzzy sets

Susana Díaz, Esteban Induráin, Vladimír Janiš, Juan Vicente Llinares, Susana Montes (2017)

Kybernetika

Similarity:

We analyze the existence of fuzzy sets of a universe that are convex with respect to certain particular classes of fusion operators that merge two fuzzy sets. In addition, we study aggregation operators that preserve various classes of generalized convexity on fuzzy sets. We focus our study on fuzzy subsets of the real line, so that given a mapping F : [ 0 , 1 ] × [ 0 , 1 ] [ 0 , 1 ] , a fuzzy subset, say X , of the real line is said to be F -convex if for any x , y , z such that x y z , it holds that μ X ( y ) F ( μ X ( x ) , μ X ( z ) ) , where μ X : [ 0 , 1 ] stands here for the...

Linear preservers of rc-majorization on matrices

Mohammad Soleymani (2024)

Czechoslovak Mathematical Journal

Similarity:

Let A , B be n × m matrices. The concept of matrix majorization means the j th column of A is majorized by the j th column of B and this is done for all j by a doubly stochastic matrix D . We define rc-majorization that extended matrix majorization to columns and rows of matrices. Also, the linear preservers of rc-majorization will be characterized.

Distance matrices perturbed by Laplacians

Balaji Ramamurthy, Ravindra Bhalchandra Bapat, Shivani Goel (2020)

Applications of Mathematics

Similarity:

Let T be a tree with n vertices. To each edge of T we assign a weight which is a positive definite matrix of some fixed order, say, s . Let D i j denote the sum of all the weights lying in the path connecting the vertices i and j of T . We now say that D i j is the distance between i and j . Define D : = [ D i j ] , where D i i is the s × s null matrix and for i j , D i j is the distance between i and j . Let G be an arbitrary connected weighted graph with n vertices, where each weight is a positive definite matrix of order...

Some properties of generalized distance eigenvalues of graphs

Yuzheng Ma, Yan Ling Shao (2024)

Czechoslovak Mathematical Journal

Similarity:

Let G be a simple connected graph with vertex set V ( G ) = { v 1 , v 2 , , v n } and edge set E ( G ) , and let d v i be the degree of the vertex v i . Let D ( G ) be the distance matrix and let T r ( G ) be the diagonal matrix of the vertex transmissions of G . The generalized distance matrix of G is defined as D α ( G ) = α T r ( G ) + ( 1 - α ) D ( G ) , where 0 α 1 . Let λ 1 ( D α ( G ) ) λ 2 ( D α ( G ) ) ... λ n ( D α ( G ) ) be the generalized distance eigenvalues of G , and let k be an integer with 1 k n . We denote by S k ( D α ( G ) ) = λ 1 ( D α ( G ) ) + λ 2 ( D α ( G ) ) + ... + λ k ( D α ( G ) ) the sum of the k largest generalized distance eigenvalues. The generalized distance spread of a graph G is defined as D α S ( G ) = λ 1 ( D α ( G ) ) - λ n ( D α ( G ) ) ....

On row-sum majorization

Farzaneh Akbarzadeh, Ali Armandnejad (2019)

Czechoslovak Mathematical Journal

Similarity:

Let 𝕄 n , m be the set of all n × m real or complex matrices. For A , B 𝕄 n , m , we say that A is row-sum majorized by B (written as A rs B ) if R ( A ) R ( B ) , where R ( A ) is the row sum vector of A and is the classical majorization on n . In the present paper, the structure of all linear operators T : 𝕄 n , m 𝕄 n , m preserving or strongly preserving row-sum majorization is characterized. Also we consider the concepts of even and circulant majorization on n and then find the linear preservers of row-sum majorization of these relations on 𝕄 n , m . ...