Academic
Publications
An iterative method for the bisymmetric solutions of the consistent matrix equations

An iterative method for the bisymmetric solutions of the consistent matrix equations,10.1080/00207160902722357,International Journal of Computer Mathe

An iterative method for the bisymmetric solutions of the consistent matrix equations  
BibTex | RIS | RefWorks Download
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.
Journal: International Journal of Computer Mathematics - IJCM , vol. 87, no. 12, pp. 2706-2715, 2010
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.