Abstract
We derive a conjugate-gradient type algorithm to produce approximate least-squares (LS) solutions for an inconsistent generalized Sylvester-transpose matrix equation. The algorithm is always applicable for any given initial matrix and will arrive at an LS solution within finite steps. When the matrix equation has many LS solutions, the algorithm can search for the one with minimal Frobenius-norm. Moreover, given a matrix Y, the algorithm can find a unique LS solution closest to Y. Numerical experiments show the relevance of the algorithm for square/non-square dense/sparse matrices of medium/large sizes. The algorithm works well in both the number of iterations and the computation time, compared to the direct Kronecker linearization and well-known iterative methods.
Funder
National Research Council of Thailand
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference35 articles.
1. A Course in Robust Control Theory: A Convex Approach;Geir,1999
2. A survey of linear singular systems
3. Singular Control Systems;Dai,1989
4. Improving the Efficiency of Matrix Operations in the Numerical Solution of Stiff Ordinary Differential Equations
5. Optimization of Linear Control Systems: Analytical Methods and Computational Algorithms;Aliev,1998
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献