Matrix GPBiCG algorithms for solving the general coupled matrix equations
Masoud Hajarian · IET Control Theory and Applications · 2014
Linear matrix equations have important applications in control and system theory. In the study, we apply Kronecker product and vectorisation operator to extend the generalised product bi‐conjugate gradient (GPBiCG) algorithms for solving the general coupled matrix equations ∑ l j =1 ( A ) i , 1 , j X 1 B i , 1, j + A i , 2, j X 2 B i, 2, j +…+ A i,l,j X i,l,j ) = D i for i = 1,2,…, l (including the (coupled) Sylvester, the second‐order Sylvester and coupled Markovian jump Lyapunov matrix equations). We propose four effective matrix algorithms for finding solutions of the matrix equations. Numerical examples and comparison with other well‐known algorithms demonstrate the effectiveness of the proposed matrix algorithms.