Name
Title | ||
|---|---|---|
An iterative method for the bisymmetric solutions of the consistent matrix equations A1XB1=C1, A2XB2=C2 |
Abstract | ||
|---|---|---|
In this paper, an iterative method is presented for finding the bisymmetric solutions of a pair of consistent matrix equations A1XB1=C1, A2XB2=C2, by which a bisymmetric solution can be obtained in finite iteration steps in the absence of round-off errors. Moreover, the solution with least Frobenius norm can be obtained by choosing a special kind of initial matrix. In the solution set of the matrix equations, the optimal approximation bisymmetric solution to a given matrix can also be derived by this iterative method. The efficiency of the proposed algorithm is shown by some numerical examples. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1080/00207160902722357 | Int. J. Comput. Math. |
Keywords | DocType | Volume |
matrix equation,optimal approximation bisymmetric solution,bisymmetric solution,Frobenius norm,numerical example,consistent matrix equation,initial matrix,proposed algorithm,iterative method,finite iteration step | Journal | 87 |
Issue | ISSN | Citations |
12 | 0020-7160 | 1 |
PageRank | References | Authors |
0.35 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jing Cai | 1 | 1 | 0.35 |
| Guo-Liang Chen | 2 | 106 | 17.84 |
| Qingbing Liu | 3 | 5 | 2.58 |