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...

We investigate the factored ADI iteration for large and sparse Sylvester equations. A novel low-rank expression for the associated Sylvester residual is established which enables cheap computations of the residual norm along the iteration, and which yields a reformulated factored ADI iteration. The application to generalized Sylvester equations is considered as well. We also discuss the efficie...

In this paper, We present the generalizations of the LSMR and NSCG methods for solving matrix equations. First, based on the LSMR algorithm, the Bl-LSMR and Gl-LSMR algorithms are derived by minimizing the Frobenius norm of residual matrix of normal equation. In addition, by extending the idea of LSMR algorithm, we also present the LSMR-M algorithm for solving the general coupled matrix equatio...

Reduced-order observer design has a long history spanning decades and involving various researchers in the control systems society. The first results on this problem were presented by Luenberger [1]. Thereafter, several papers have been presented examining the problems from different perspectives. One of these approaches is the Sylvester equation approach. This technique aeals mainly with the c...

In this paper, we present an iterative algorithm for solving the following coupled Sylvester-transpose matrix equations q ∑ j=1 ( AijXjBij + CijX j Dij ) = Fi, i = 1, 2, . . . , p, over the generalized centro-symmetric matrix group (X1, X2, . . . , Xq). The solvability of the problem can be determined by the proposed algorithm, automatically. If the coupled Sylvester-transpose matrix equations ...

A spectral method for solving linear partial differential equations (PDEs) with variable coefficients and general boundary conditions defined on rectangular domains is described, based on separable representations of partial differential operators and the one-dimensional ultraspherical spectral method. If a partial differential operator is of splitting rank 2, such as the operator associated wi...