‎the global fom and gmres algorithms are among the effective‎ ‎methods to solve sylvester matrix equations‎. ‎in this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two cg-type algorithms for solving generalized sylvester matrix‎ ‎equations‎. ‎the proposed methods are iterative projection metho...

The linear system of equations Ax = b where A = [aij ] in Cn.n is a crispsingular matrix and the right-hand side is a fuzzy vector is called a singularfuzzy linear system of equations. In this paper, solving singular fuzzy linearsystems of equations using generalized inverses such as Drazin inverse andpseudo-inverse are investigated.

The singularity problem of the solutions of some particular Sylvester equations is studied. As a consequence of this study, a good choice of a Sylvester equation which is associated to a linear continuous time system can be made such that its solution is nonsingular. This solution is then used to solve an eigenstructure assignment problem for this system. From a practical point view, this study...

Using the ranks and Moore-Penrose inverses of involved matrices, in this paper we establish some necessary sufficient solvability conditions for a system Sylvester-type quaternion matrix equations, give an expression general solution to when it is solvable. As application system, consider special symmetry solution, named η-Hermitian equations. Moreover, present algorithm numerical example verif...

This Licentiate Thesis contains contributions in two different subfields of Computing Science: parallel ScaLAPACK-style algorithms for Sylvester-type matrix equations and periodic eigenvalue reordering in a cyclic product of matrices. Sylvester-type matrix equations, like the continuous-time Sylvester equation AX −XB = C, where A of size m×m, B of size n×n and C of size m×n are general matrices...

For when the Sylvester matrix equation has a unique solution, this work provides a closed form solution, which is expressed as a polynomial of known matrices. In the case of non-uniqueness, the solution set of the Sylvester matrix equation is a subset of that of a deduced equation, which is a system of linear algebraic equations. c © 2005 Elsevier Ltd. All rights reserved.

In this paper we introduce some stability criteria for impulsive fuzzy system of differential equations with finite delay in states. Firstly, a new comparison principle for fuzzy differential system compared to crisp ordinary differential equation, based on a notion of upper quasi-monotone nondecreasing, in N dimentional state space is presented. Furthermore, in order to analyze the stability o...

In this paper, the concept of canonical representation is proposed to find fuzzy roots of fuzzy polynomial equations. We transform fuzzy polynomial equations to system of crisp polynomial equations, this transformation is perform by using canonical representation based on three parameters Value, Ambiguity and Fuzziness. 

Descriptor systems consisting of a large number of differential-algebraic equations (DAEs) usually arise from the discretization of partial differential-algebraic equations. This paper presents an efficient algorithm for solving the coupled Sylvester equation that arises in converting a system of linear DAEs to ordinary differential equations. A significant computational advantage is obtained b...