A solution of two problems related to the matrix equation of Sylvester type is given. In the first problem, the procedures for linear matrix inequalities are used to construct the solution of this equation. In the second problem, when a matrix is given which is not a solution of this equation, it is required to find such solution of the original equation, which most accurately approximates the ...

Abstract. The main contribution of the current paper is to propose a new effective numerical method for solving the first-order linear matrix differential equations. Properties of the Legendre basis operational matrix of integration together with a collocation method are applied to reduce the problem to a coupled linear matrix equations. Afterwards, an iterative algorithm is examined for solvin...

In this paper, a new method based on parametric form for approximate solu-tion of fuzzy linear matrix equations (FLMEs) of the form AX = B; where Ais a crisp matrix, B is a fuzzy number matrix and the unknown matrix X one,is presented. Then a numerical example is presented to illustrate the proposedmodel.

In this paper, we investigate the existence of a positive solution of fully fuzzy linear equation systems. This paper mainly to discuss a new decomposition of a nonsingular fuzzy matrix, the symmetric times triangular (ST) decomposition. By this decomposition, every nonsingular fuzzy matrix can be represented as a product of a fuzzy symmetric matrix S and a fuzzy triangular matrix T.

let $r$ be a ring with unity. the undirected nilpotent graph of $r$, denoted by $gamma_n(r)$, is a graph with vertex set ~$z_n(r)^* = {0neq x in r | xy in n(r) for some y in r^*}$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy in n(r)$, or equivalently, $yx in n(r)$, where $n(r)$ denoted the nilpotent elements of $r$. recently, it has been proved that if $r$ is a left ar...

in this paper, an iterative method is proposed for solving the matrix inverse problem $ax=b$ for hermitian-generalized hamiltonian matrices with a submatrix constraint. by this iterative method, for any initial matrix $a_0$, a solution $a^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...

Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...

The life of a higher, multicellular organism is essentially bound up with the triad represented by capillaries, extracellular matrix or ground substance, and cells. A cell is capable of functioning only in its surrounding milieu: the structured extracellular space. Contrary to views of cellular pathology which currently predominate, it is not conceptually feasible to artificially separate cellu...