An Iterative Method for the Least‐Squares Problems of a General Matrix Equation Subjects to Submatrix Constraints

Li-fang Dai, Mao-lin Liang and Yong-hong Shen

Journal of Applied Mathematics, 2013, vol. 2013, issue 1

Abstract: An iterative algorithm is proposed for solving the least‐squares problem of a general matrix equation ∑i=1t MiZiNi=F, where Zi (i = 1,2, …, t) are to be determined centro‐symmetric matrices with given central principal submatrices. For any initial iterative matrices, we show that the least‐squares solution can be derived by this method within finite iteration steps in the absence of roundoff errors. Meanwhile, the unique optimal approximation solution pair for given matrices Z~i can also be obtained by the least‐norm least‐squares solution of matrix equation ∑i=1t MiZ-iNi=F-, in which Z-i=Zi-Z~i, F-=F-∑i=1t MiZ~iNi. The given numerical examples illustrate the efficiency of this algorithm.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2013/697947

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2013:y:2013:i:1:n:697947

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().