Solving the generalized sylvester matrix equation Σ i=1 p AiXBi + Σ j=1 q CjYDj=E over reflexive and anti-reflexive matrices

2011 ◽  
Vol 9 (1) ◽  
pp. 118-124 ◽  
Author(s):  
Mehdi Dehghan ◽  
Masoud Hajarian
Keyword(s):  
Matrix Equation ◽  
Sylvester Matrix Equation ◽  
Sylvester Matrix ◽  
Generalized Sylvester Matrix Equation

scholarly journals Modified Jacobi-Gradient Iterative Method for Generalized Sylvester Matrix Equation

Symmetry ◽  
2020 ◽  
Vol 12 (11) ◽  
pp. 1831
Author(s):  
Nopparut Sasaki ◽  
Pattrawut Chansangiam
Keyword(s):  
Iterative Method ◽  
Matrix Equation ◽  
Recursive Formula ◽  
Sylvester Matrix Equation ◽  
Hierarchical Identification ◽  
Sylvester Matrix ◽  
Generalized Sylvester Matrix Equation ◽  
Iteration Matrix ◽  
Diagonal Part ◽  
Gradient Based

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.

scholarly journals Gradient Iterative Method with Optimal Convergent Factor for Solving a Generalized Sylvester Matrix Equation with Applications to Diffusion Equations

Symmetry ◽  
2020 ◽  
Vol 12 (10) ◽  
pp. 1732
Author(s):  
Nunthakarn Boonruangkan ◽  
Pattrawut Chansangiam
Keyword(s):  
Spectral Radius ◽  
Matrix Equation ◽  
Iterative Scheme ◽  
Sylvester Matrix Equation ◽  
Initial Value ◽  
Sylvester Matrix ◽  
Generalized Sylvester Matrix Equation ◽  
Iteration Matrix ◽  
Error Estimations ◽  
And Diffusion

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.

Sign in / Sign up

Export Citation Format

Share Document