Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6892243 | Computers & Mathematics with Applications | 2018 | 19 Pages |
Abstract
This paper introduces another version of biconjugate residual method (BCR) for solving the generalized coupled Sylvester matrix equations over centrosymmetric or anti-centrosymmetric matrix. We prove this version of BCR algorithm can find the centrosymmetric solution group of the generalized coupled matrix equations for any initial matrix group within finite steps in the absence of round-off errors. Furthermore, a method is provided for choosing the initial matrices to obtain the least norm solution of the problem. At last, some numerical examples are provided to illustrate the efficiency and validity of methods we have proposed.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Chang-Qing Lv, Chang-Feng Ma,