Abstract
Many problems in control theory can be studied by obtaining the symmetric solution of linear matrix equations. In this investigation, we deal with the symmetric solutions X, Y and Z of the general Sylvester matrix equations A1XB1+C1YD1+E1ZF1=G1,A2XB2+C2YD2+E2ZF2=G2,⋮⋮⋮⋮AtXBt+CtYDt+EtZFt=Gt.The Lanczos version of biconjugate residual (BCR) algorithm is generalized to compute the symmetric solutions of the general Sylvester matrix equations. The convergence properties of this algorithm are discussed and it is proven that it smoothly converges to the symmetric solutions of the general Sylvester matrix equations in a finite number of iterations in the absence of round-off errors. Finally, the comparative numerical results are carried out to support that the current algorithm may be more efficient than other iterative algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
