In this paper, by extending the well-known Jacobi and Gauss–Seidel iterations for Ax = b, we study iterative solutions of matrix equations AXB = F and generalized Sylvester matrix equations AXB + CXD = F (including the Sylvester equation AX + XB = F as a special case), and present a gradient based and a least-squares based iterative algorithms for the solution. It is proved that the iterative s...

This paper is concerned with a relative perturbation theory and its entrywise relatively accurate numerical solutions of an M -matrix Sylvester equation AX + XB = C by which we mean both A and B have positive diagonal entries and nonpositive off-diagonal entries and P = Im⊗A+B⊗ In is a nonsingular M -matrix, and C is entrywise nonnegative. It is proved that small relative perturbations to the e...

The problem of input-output stabilization in a general two-sided model matching setup is studied. As a first step, the problem is reduced to a pair of uncoupled bilateral Diophantine equations over RH. Then, recent results on bilateral Diophantine equation are exploited to obtain a numerically tractable solution given in terms of explicit state-space formulae. The resulting solvability conditio...

The ADI iteration is closely related to the rational Krylov projection methods for constructing low rank approximations to the solution of Sylvester equation. In this paper we show that the ADI and rational Krylov approximations are in fact equivalent when a special choice of shifts are employed in both methods. We will call these shifts pseudo H2-optimal shifts. These shifts are also optimal i...

By using a Sylvester equation based parametrization, the minimum norm robust pole assignment problem for linear time-invariant systems is formulated as an unconstrained minimization problem for a suitably chosen cost function. The derived explicit expression of the gradient of the cost function allows the efficient solution of the minimization problem by using powerful gradient search based min...

The main aim of this paper intends to discuss the solution of fuzzy Sylvester matrix equation AX +XB = C where A = (aij) ∈ Rn×n , B = (bij) ∈ Rm×m are crisp Mmatrices, C = (cij) ∈ Rn×m is fuzzy matrix and X ∈ Rn×m is unknown,by applying a special algorithm based on a class of ABS algorithms called Huang algorithm. At first, we transform this system to an (mn)×(mn) fuzzy system of linear equatio...

The solution to a general Sylvester equation AX−XB = GF ∗ with a low rank righthand side is analyzed quantitatively through Low-rank Alternating-DirectionalImplicit method (LR-ADI) with exact shifts. New bounds and perturbation bounds on X are obtained. A distinguished feature of these bounds is that they reflect the interplay between the eigenvalue decompositions of A and B and the right-hand ...

In this paper, we consider the fuzzy Sylvester matrix equation AX + XB = C, where A ∈ Rn×n and B ∈ Rm×m are crisp M-matrices, C is an n×m fuzzy matrix and X is unknown. We first transform this system to an (mn)× (mn) fuzzy system of linear equations. Then we investigate the existence and uniqueness of a fuzzy solution to this system. We use the accelerated overrelaxation method to compute an ap...

In this paper, we present a method and associated theory for solving the multi-input Sylvester-Observer equation arising in the construction of the Luenberger observer in control theory. The proposed method is a particular generalization of the algorithm described by Datta and Saad in 1991 to the multi-output. We give some theoretical results and present some numerical experiments to show the a...