generalized sylvester matrix equation
Recently Published Documents


TOTAL DOCUMENTS

34
(FIVE YEARS 8)

H-INDEX

8
(FIVE YEARS 1)

2021 ◽  
Vol 7 (4) ◽  
pp. 5029-5048
Author(s):  
Anli Wei ◽  
◽  
Ying Li ◽  
Wenxv Ding ◽  
Jianli Zhao ◽  
...  

<abstract><p>In this paper, we propose an efficient method for some special solutions of the quaternion matrix equation $ AXB+CYD = E $. By integrating real representation of a quaternion matrix with $ \mathcal{H} $-representation, we investigate the minimal norm least squares solution of the previous quaternion matrix equation over different constrained matrices and obtain their expressions. In this way, we first apply $ \mathcal{H} $-representation to solve quaternion matrix equation with special structure, which not only broadens the application scope of $ \mathcal{H} $-representation, but further expands the research idea of solving quaternion matrix equation. The algorithms only include real operations. Consequently, it is very simple and convenient, and it can be applied to all kinds of quaternion matrix equation with similar problems. The numerical example is provided to illustrate the feasibility of our algorithms.</p></abstract>


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Da-Ke Gu ◽  
Da-Wei Zhang ◽  
Yin-Dong Liu

This paper considers the parametric control to the Lorenz system by state feedback. Based on the solutions of the generalized Sylvester matrix equation (GSE), the unified explicit parametric expression of the state feedback gain matrix is proposed. The closed loop of the Lorenz system can be transformed into an arbitrary constant matrix with the desired eigenstructure (eigenvalues and eigenvectors). The freedom provided by the parametric control can be fully used to find a controller to satisfy the robustness criteria. A numerical simulation is developed to illustrate the effectiveness of the proposed approach.


Symmetry ◽  
2020 ◽  
Vol 12 (11) ◽  
pp. 1831
Author(s):  
Nopparut Sasaki ◽  
Pattrawut Chansangiam

We propose a new iterative method for solving a generalized Sylvester matrix equation A1XA2+A3XA4=E with given square matrices A1,A2,A3,A4 and an unknown rectangular matrix X. The method aims to construct a sequence of approximated solutions converging to the exact solution, no matter the initial value is. We decompose the coefficient matrices to be the sum of its diagonal part and others. The recursive formula for the iteration is derived from the gradients of quadratic norm-error functions, together with the hierarchical identification principle. We find equivalent conditions on a convergent factor, relied on eigenvalues of the associated iteration matrix, so that the method is applicable as desired. The convergence rate and error estimation of the method are governed by the spectral norm of the related iteration matrix. Furthermore, we illustrate numerical examples of the proposed method to show its capability and efficacy, compared to recent gradient-based iterative methods.


Symmetry ◽  
2020 ◽  
Vol 12 (10) ◽  
pp. 1732
Author(s):  
Nunthakarn Boonruangkan ◽  
Pattrawut Chansangiam

We introduce a gradient iterative scheme with an optimal convergent factor for solving a generalized Sylvester matrix equation ∑i=1pAiXBi=F, where Ai,Bi and F are conformable rectangular matrices. The iterative scheme is derived from the gradients of the squared norm-errors of the associated subsystems for the equation. The convergence analysis reveals that the sequence of approximated solutions converge to the exact solution for any initial value if and only if the convergent factor is chosen properly in terms of the spectral radius of the associated iteration matrix. We also discuss the convergent rate and error estimations. Moreover, we determine the fastest convergent factor so that the associated iteration matrix has the smallest spectral radius. Furthermore, we provide numerical examples to illustrate the capability and efficiency of this method. Finally, we apply the proposed scheme to discretized equations for boundary value problems involving convection and diffusion.


2019 ◽  
Vol 2019 ◽  
pp. 1-14 ◽  
Author(s):  
Ivan I. Kyrchei

In this paper, we derive explicit determinantal representation formulas of general, Hermitian, and skew-Hermitian solutions to the generalized Sylvester matrix equation involving ⁎-Hermicity AXA⁎+BYB⁎=C over the quaternion skew field within the framework of the theory of noncommutative column-row determinants.


Sign in / Sign up

Export Citation Format

Share Document