A New Method for the Bisymmetric Minimum Norm Solution of the Consistent Matrix Equations A1XB1=C1, A2XB2=C2

We propose a new iterative method to find the bisymmetric minimum norm solution of a pair of consistent matrix equations A1XB1=C1, A2XB2=C2. The algorithm can obtain the bisymmetric solution with minimum Frobenius norm in finite iteration steps in the absence of round-off errors. Our algorithm is fa...

Full description

Saved in:
Bibliographic Details
Main Authors: Aijing Liu, Guoliang Chen, Xiangyun Zhang
Format: Article
Language:English
Published: Wiley 2013-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2013/125687
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832545522002427904
author Aijing Liu
Guoliang Chen
Xiangyun Zhang
author_facet Aijing Liu
Guoliang Chen
Xiangyun Zhang
author_sort Aijing Liu
collection DOAJ
description We propose a new iterative method to find the bisymmetric minimum norm solution of a pair of consistent matrix equations A1XB1=C1, A2XB2=C2. The algorithm can obtain the bisymmetric solution with minimum Frobenius norm in finite iteration steps in the absence of round-off errors. Our algorithm is faster and more stable than Algorithm 2.1 by Cai et al. (2010).
format Article
id doaj-art-93ec6893f2f64a7b9532e24133cad1d3
institution Kabale University
issn 1110-757X
1687-0042
language English
publishDate 2013-01-01
publisher Wiley
record_format Article
series Journal of Applied Mathematics
spelling doaj-art-93ec6893f2f64a7b9532e24133cad1d32025-02-03T07:25:33ZengWileyJournal of Applied Mathematics1110-757X1687-00422013-01-01201310.1155/2013/125687125687A New Method for the Bisymmetric Minimum Norm Solution of the Consistent Matrix Equations A1XB1=C1, A2XB2=C2Aijing Liu0Guoliang Chen1Xiangyun Zhang2Department of Mathematics, East China Normal University, Shanghai 200241, ChinaDepartment of Mathematics, East China Normal University, Shanghai 200241, ChinaDepartment of Mathematics, East China Normal University, Shanghai 200241, ChinaWe propose a new iterative method to find the bisymmetric minimum norm solution of a pair of consistent matrix equations A1XB1=C1, A2XB2=C2. The algorithm can obtain the bisymmetric solution with minimum Frobenius norm in finite iteration steps in the absence of round-off errors. Our algorithm is faster and more stable than Algorithm 2.1 by Cai et al. (2010).http://dx.doi.org/10.1155/2013/125687
spellingShingle Aijing Liu
Guoliang Chen
Xiangyun Zhang
A New Method for the Bisymmetric Minimum Norm Solution of the Consistent Matrix Equations A1XB1=C1, A2XB2=C2
Journal of Applied Mathematics
title A New Method for the Bisymmetric Minimum Norm Solution of the Consistent Matrix Equations A1XB1=C1, A2XB2=C2
title_full A New Method for the Bisymmetric Minimum Norm Solution of the Consistent Matrix Equations A1XB1=C1, A2XB2=C2
title_fullStr A New Method for the Bisymmetric Minimum Norm Solution of the Consistent Matrix Equations A1XB1=C1, A2XB2=C2
title_full_unstemmed A New Method for the Bisymmetric Minimum Norm Solution of the Consistent Matrix Equations A1XB1=C1, A2XB2=C2
title_short A New Method for the Bisymmetric Minimum Norm Solution of the Consistent Matrix Equations A1XB1=C1, A2XB2=C2
title_sort new method for the bisymmetric minimum norm solution of the consistent matrix equations a1xb1 c1 a2xb2 c2
url http://dx.doi.org/10.1155/2013/125687
work_keys_str_mv AT aijingliu anewmethodforthebisymmetricminimumnormsolutionoftheconsistentmatrixequationsa1xb1c1a2xb2c2
AT guoliangchen anewmethodforthebisymmetricminimumnormsolutionoftheconsistentmatrixequationsa1xb1c1a2xb2c2
AT xiangyunzhang anewmethodforthebisymmetricminimumnormsolutionoftheconsistentmatrixequationsa1xb1c1a2xb2c2
AT aijingliu newmethodforthebisymmetricminimumnormsolutionoftheconsistentmatrixequationsa1xb1c1a2xb2c2
AT guoliangchen newmethodforthebisymmetricminimumnormsolutionoftheconsistentmatrixequationsa1xb1c1a2xb2c2
AT xiangyunzhang newmethodforthebisymmetricminimumnormsolutionoftheconsistentmatrixequationsa1xb1c1a2xb2c2