Journal
JOURNAL OF APPLIED MATHEMATICS AND COMPUTING
Volume 58, Issue 1-2, Pages 545-566Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s12190-017-1156-6
Keywords
Generalized Sylvester-conjugate matrix equations; Real inner; Least Frobenius norm solution
Categories
Funding
- NSFC [11501246]
Ask authors/readers for more resources
This paper aims to extend the conjugate gradient least squares method to solve the least squares problem of the generalized Sylvester-conjugate matrix equation. For any initial values, the proposed iterative method can obtain the least squares Frobenius norm solution within finite iteration steps in the absence of roundoff errors. Finally, two numerical examples are given to show the efficiency of the presented iterative method. And it's also proved that our proposed iterative algorithm is better than the existing LSQR iterative algorithm.
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