An iterative method for the bisymmetric solutions of the consistent matrix equationsA1XB1=C1,A2XB2=C2

DOI10.1080/00207160902722357zbMath1202.65052OpenAlexW1982346954MaRDI QIDQ3056406

Jing Cai, Guo-Liang Chen, Qing-Bing Liu

Publication date: 12 November 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160902722357

zbMATH Keywords

numerical examplesiterative methodround-off errormatrix equationbisymmetric solutionoptimal approximation solutionsolution with least Frobenius norm

Mathematics Subject Classification ID

Related Items (2)

A new method for the bisymmetric minimum norm solution of the consistent matrix equations \(A_1XB_1 = C_1\), \(A_2XB_2 = C_2\) ⋮ Computing symmetric solutions of general Sylvester matrix equations via Lanczos version of biconjugate residual algorithm

Cites Work

• The matrix equations \(AX=C\), \(XB=D\)
• An efficient algorithm for the least-squares reflexive solution of the matrix equation \(A_{1}XB_{1} = C_{1}, A_{2}XB_{2} = C_{2}\)
• A pair of simultaneous linear matrix equations \(A_ 1XB_ 1=C_ 1,A_ 2XB_ 2=C_ 2\) and a matrix programming problem
• The bisymmetric solutions of the matrix equation \(A_{1}X_{1}B_{1}+A_{2}X_{2}B_{2}+\cdots+A_{l}X_{l}B_{l}=C\) and its optimal approximation
• Computing a nearest symmetric positive semidefinite matrix
• A finite iterative method for solving a pair of linear matrix equations \((AXB,CXD)=(E,F)\)
• The inverse problem of bisymmetric matrices with a submatrix constraint
• Iterative orthogonal direction methods for Hermitian minimum norm solutions of two consistent matrix equations
• Hermitian and Nonnegative Definite Solutions of Linear Matrix Equations
• A representation of the general common solution to the matrix equations \(A_1XB_1=C_1\) and \(A_2XB_2=C_2\) with applications

This page was built for publication: An iterative method for the bisymmetric solutions of the consistent matrix equationsA₁XB₁=C₁,A₂XB₂=C₂