Convergence of ADGI methods for solving systems of linear matrix equations. Issue 4 (2014)

• Record Type: Journal Article
• Authors: Masoud Hajarian
• Is Part Of: Engineering computations. Volume 31:Issue 4(2014)
• Page Start: 681
• Page End: 690
• Publication Date: 2014
• Subjects: Computer-aided engineering -- Periodicals; Computer graphics -- Periodicals; 620.00285
• DOI: 10.1108/EC-04-2011-0039
• Languages: English
• ISSNs: 0264-4401

Abstract

<abstract> <title> <x xml:space="preserve"> Abstract </x> </title> <p> <bold>Purpose</bold> – The linear matrix equations have wide applications in engineering, physics, economics and statistics. The purpose of this paper is to introduce iterative methods for solving the systems of linear matrix equations. <bold>Design/methodology/approach</bold> – According to the hierarchical identification principle, the authors construct alternating direction gradient‐based iterative (ADGI) methods to solve systems of linear matrix equations. <bold>Findings</bold> – The authors propose efficient ADGI methods to solve the systems of linear matrix equations. It is proven that the ADGI methods consistently converge to the solution for any initial matrix. Moreover, the constructed methods are extended for finding the reflexive solution to the systems of linear matrix equations. <bold>Originality/value</bold> – This paper proposes efficient iterative methods without computing any matrix inverses, vec operator and Kronecker product for finding the solution of the systems of linear matrix equations.</p> </abstract>