an iterative method for the least-squares problems of a general matrix equation subjects to submatrix constraints

Clicks: 10
ID: 246832
2013
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #301 of 357 articles by views in Chemico-biological interactions

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 357 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
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.
Reference Key
dai2013journalan Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Li-fang Dai;Mao-lin Liang;Yong-hong Shen
Journal Chemico-biological interactions
Year 2013
DOI
10.1155/2013/697947
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.