scholarly journals On the Parametric Solution to the Second-Order Sylvester Matrix EquationEVF2−AVF−CV=BW

2007 ◽  
Vol 2007 ◽  
pp. 1-16 ◽  
Author(s):  
Wang Guo-Sheng ◽  
Lv Qiang ◽  
Duan Guang-Ren
Keyword(s):  
Control Systems ◽  
Matrix Equation ◽  
Second Order ◽  
Diagonal Form ◽  
Sylvester Matrix Equation ◽  
Parametric Solution ◽  
Design Problems ◽  
Analysis And Design ◽  
Sylvester Matrix ◽  
The Matrix

This paper considers the solution to a class of the second-order Sylvester matrix equationEVF2−AVF−CV=BW. Under the controllability of the matrix triple(E,A,B), a complete, general, and explicit parametric solution to the second-order Sylvester matrix equation, with the matrixFin a diagonal form, is proposed. The results provide great convenience to the analysis of the solution to the second-order Sylvester matrix equation, and can perform important functions in many analysis and design problems in control systems theory. As a demonstration, an illustrative example is given to show the effectiveness of the proposed solution.

scholarly journals On Solvability of the Matrix Equation AX – XB = C over Integer Rings

2019 ◽  
pp. 55-58
Author(s):  
Volodymyr Prokip
Keyword(s):  
Matrix Equation ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Sylvester Matrix Equation ◽  
Sylvester Matrix ◽  
The Matrix ◽  
Integer Rings ◽  
Necessary And Sufficient

In this communication we present conditions ofsolvability of Sylvester matrix equation AX – XB = C over integerdomains. The necessary and sufficient conditions of solvability ofSylvester equation in term of columns equivalence of matricesconstructed in a certain way by using the coefficients of thisequation are proposed

scholarly journals Convergence analysis of gradient-based iterative algorithms for a class of rectangular Sylvester matrix equations based on Banach contraction principle

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Adisorn Kittisopaporn ◽  
Pattrawut Chansangiam ◽  
Wicharn Lewkeeratiyutkul
Keyword(s):  
Spectral Radius ◽  
Matrix Equation ◽  
Iterative Algorithms ◽  
Banach Contraction Principle ◽  
Contraction Principle ◽  
Convergence Factor ◽  
Sylvester Matrix ◽  
Iteration Matrix ◽  
Banach Contraction ◽  
The Matrix

AbstractWe derive an iterative procedure for solving a generalized Sylvester matrix equation $AXB+CXD = E$ A X B + C X D = E , where $A,B,C,D,E$ A , B , C , D , E are conforming rectangular matrices. Our algorithm is based on gradients and hierarchical identification principle. We convert the matrix iteration process to a first-order linear difference vector equation with matrix coefficient. The Banach contraction principle reveals that the sequence of approximated solutions converges to the exact solution for any initial matrix if and only if the convergence factor belongs to an open interval. The contraction principle also gives the convergence rate and the error analysis, governed by the spectral radius of the associated iteration matrix. We obtain the fastest convergence factor so that the spectral radius of the iteration matrix is minimized. In particular, we obtain iterative algorithms for the matrix equation $AXB=C$ A X B = C , the Sylvester equation, and the Kalman–Yakubovich equation. We give numerical experiments of the proposed algorithm to illustrate its applicability, effectiveness, and efficiency.

scholarly journals Classification and approximation of solutions to Sylvester matrix equation

Filomat ◽  
2019 ◽  
Vol 33 (13) ◽  
pp. 4261-4280 ◽  
Author(s):  
Bogdan Djordjevic ◽  
Nebojsa Dincic
Keyword(s):  
Least Squares ◽  
Matrix Equation ◽  
Infinitely Many Solutions ◽  
Sylvester Matrix Equation ◽  
Minimal Norm ◽  
Sylvester Matrix

In this paperwesolve Sylvester matrix equation with infinitely-many solutions and conduct their classification. If the conditions for their existence are not met, we provide a way for their approximation by least-squares minimal-norm method.

Sign in / Sign up

Export Citation Format

Share Document