Journal
NUMERICAL ALGORITHMS
Volume 73, Issue 3, Pages 591-609Publisher
SPRINGER
DOI: 10.1007/s11075-016-0109-8
Keywords
Symmetric solution group; Generalized CD algorithm; General coupled matrix equations
Categories
Funding
- Iran National Science Foundation (INSF)
Ask authors/readers for more resources
Symmetric solutions of the linear matrix equations have wide applications in both mechanical and electrical engineering. In this work, an analytic study of the generalized conjugate direction (CD) algorithm for finding the symmetric solution group (X (1),X (2),...,X (m) ) of the general coupled matrix equations Sigma(m)(j=1) A(ij) X-j B-ij = C-i, i = 1, 2, ..., n, is performed. We show that the generalized CD algorithm can compute the (least Frobenius norm) symmetric solution group of the general coupled matrix equations for any (special) initial symmetric matrix group within a finite number of iterations in the absence of round-off errors. In order to illustrate the effectiveness of the generalized CD algorithm, two numerical examples are finally given.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available