In this work, we propose an approach for computing the compromised solution of an LR fuzzy linear system by using of a ranking function when the coefficient matrix is a crisp mn matrix. To do this, we use expected interval to find an LR fuzzy vector, X , such that the vector (AX ) has the least distance from (b) in 1 norm and the 1 cut of X satisfies the crisp linear system AX = b ...

in this paper, we introduce a satisfaction function (sf) to compare interval values on the basis oftseng and klein’s idea. the sf estimates the degree to which arithmetic comparisons between two intervalvalues are satisfied. then, we define two other functions called lower and upper sf based on the sf. weapply these functions in order to present a new interpretation of inequality constraints wi...

This paper provides an effective method to create an abstract simplicial complex homotopy equivalent to a given set S described by non-linear inequalities (polynomial or not). To our knowledge, no other numerical algorithm is able to deal with this type of problem. The proposed approach divides S into subsets that have been proven to be contractible using interval arithmetic. The method is clos...

The article considers the problem of stability interval-defined linear systems based on Hurwitz and Lienard-Shipar interval criteria. Krylov, Leverier, Leverier-Danilevsky algorithms are implemented for automated construction analysis characteristic polynomial. mathematics library was used while developing software. dynamic system described by ordinary differential equations is determined prope...

Keywords: Fractional-order linear systems Interval uncertainty Necessary and sufficient stability condition a b s t r a c t This paper establishes a necessary and sufficient stability condition of fractional-order interval linear systems. It is supposed that the system matrix A is an interval uncertain matrix and fractional commensurate order belongs to 1 ≤ α < 2. Using the existence condition ...

a common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the weierstrass canonical form. the weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. the present ...