# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
The general coupled matrix equations over generalized bisymmetric matrices. (English) Zbl 1187.65042

Authors’ abstract: By extending the idea of the conjugate gradient (CG) method, we construct an iterative method to solve the general coupled matrix equations

$\sum _{j=1}^{p}{A}_{ij}{X}_{j}{B}_{ij}={M}_{i},\phantom{\rule{1.em}{0ex}}i=1,2,\cdots ,p,$

(including the generalized (coupled) Lyapunov and Sylvester matrix equations as special cases) over generalized bisymmetric matrix group $\left({X}_{1},{X}_{2},\cdots ,{X}_{p}\right)$. By using the iterative method, the solvability of the general coupled matrix equations over the generalized bisymmetric matrix group can be determined in the absence of roundoff errors. When the general coupled matrix equations are consistent over generalized bisymmetric matrices, a generalized bisymmetric solution group can be obtained within finite iteration steps in the absence of roundoff errors.

The least Frobenius norm generalized bisymmetric solution group of the general coupled matrix equations can be derived when an appropriate initial iterative matrix group is chosen. In addition, the optimal approximation generalized bisymmetric solution group to a given matrix group $\left(\stackrel{^}{{X}_{1}},\stackrel{^}{{X}_{2}},\cdots ,\stackrel{^}{{X}_{p}}\right)$ in Frobenius norm can be obtained by finding the least Frobenius norm generalized bisymmetric solution group of new general coupled matrix equations. The numerical results indicate that the iterative method works quite well in practice.

##### MSC:
 65F30 Other matrix algorithms 15A24 Matrix equations and identities 65F10 Iterative methods for linear systems