For EDITORS

For READERS

All Issues

Vol.15, 2025
Vol.14, 2024
Vol.10, 2020
Vol.9, 2019
Vol.8, 2018
Vol.7, 2017
Vol.6, 2016
Vol.5, 2015
Vol.4, 2014
Vol.3, 2013
Vol.2, 2012
Vol.1, 2011
Volume 14, Number 4, 2024, Pages -                                                                DOI:10.11948/JAAC-2023-0106
A new BCR method for coupled operator equations with submatrix constraint
Wenling Wang,Caiqin Song,Wenli Wang
Keywords:Operator matrix equations, BCR algorithm, Least-norm constraint solutions, Submatrix constraint
Abstract:
      In the present work, a new biconjugate residual algorithm (BCR) is proposed in order to compute the constraint solution of the coupled operator equations, in which the constraint solution include symmetric solution, reflective solution, centrosymmetric solution and anti-centrosymmetric solution as special cases. When the studied coupled operator equations are consistent, it is proved that constraint solution can be convergent to the exact solutions if giving any initial complex matrices or real matrices. In addition, when the studied coupled operator equations are not consistent, the least norm constraint solution above can also be computed by selecting any initial matrices. Finally, some numerical examples are provided for illustrating the effectiveness and superiority of new proposed method.
PDF      Download reader