Some complex quaternionic equations in the type AX - XB = C are investigated. For convenience, these equations were called generalized Sylvester-quaternion equations, which include the Sylvester equation as special cases. By the real matrix representations of complex quaternions, the necessary and sufficient conditions for the solvability and the general expressions of the solutions are obtained.

In the literature, several numerical methods are proposed for solvingnth-order fuzzy linear differential equations. However, till now there areonly two analytical methods for the same. In this paper, the fuzzy Kolmogorov'sdifferential equations, obtained with the help of fuzzy Markov modelof piston manufacturing system, are solved by one of these analytical methodsand illustrated that the obtai...

in this paper, we investigate the general fuzzy linear system of equations.  the  main aim of this paper is based on the embedding approach. we find the necessary and sufficient conditions for the existence of fuzzy solution of the mentioned systems.  finally, numerical examples are presented to more illustration of the proposed model.

Sylvester equations play a central role in many areas of applied mathematics and in particular in systems and control theory. Here we will show how low-rank solutions for stable Sylvester equations can be computed based on the matrix sign function method. We discuss applications in model reduction as well as in observer design. Numerical experiments demonstrate the efficiency of the proposed me...

We prove Roth-type theorems for systems of matrix equations including an arbitrary mix of Sylvester and ⋆-Sylvester equations, in which the transpose or conjugate transpose of the unknown matrices also appear. In full generality, we derive consistency conditions by proving that such a system has a solution if and only if the associated set of 2× 2 block matrix representations of the equations a...

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 methods onto matrix Kr...