An iterative algorithm for generalized periodic multiple coupled Sylvester matrix equations
DOI number:10.1016/j.jfranklin.2021.05.012
Journal:Journal of the Franklin Institute
Key Words:The paper is indicated to constructing a modified conjugate gradient iterative (MCG) algorithm to solve the generalized periodic multiple coupled Sylvester matrix equations. It can be proved that the proposed approach can find the solution within finite iteration steps in the absence of round-off errors. Furthermore, we provide a method for choosing the initial matrices to obtain the least Frobenius norm solution of the system. Some numerical examples are illustrated to show the performance of the proposed approach and its superiority over the existing method CG.
Co-author:Zebin Chen
Indexed by:Journal paper
Correspondence Author:Xuesong Chen
Volume:358
Issue:10
Page Number:5513-5531
Translation or Not:no
Date of Publication:2021-05-17
Included Journals:SCI
Links to published journals:https://doi.org/10.1016/j.jfranklin.2021.05.012