An iterative algorithm for the least squares bisymmetric solutions of the matrix equations A₁XB₁=C₁,A₂XB₂=C₂
From MaRDI portal
Publication:970024
DOI10.1016/J.MCM.2009.07.004zbMATH Open1190.65061OpenAlexW2001090660MaRDI QIDQ970024FDOQ970024
Authors: Jing Cai, Guoliang Chen 
Publication date: 8 May 2010
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2009.07.004
Recommendations
- An iterative method for the bisymmetric solutions of the consistent matrix equations \(A_{1}XB_{1}=C_{1}, A_{2}XB_{2}=C_{2}\)
- The least squares bisymmetric solution of a class of matrix equation and its optimal approximation
- An iterative methods for the least squares bisymmetric solution of the matrix equation \(AXB=C\)
- A new method for the bisymmetric minimum norm solution of the consistent matrix equations \(A_1XB_1 = C_1\), \(A_2XB_2 = C_2\)
- The least-squares generalized bisymmetric solutions of the matrix equation \(\sum^l_{i=1}\boldsymbol{A}_i\boldsymbol{X}_i\boldsymbol{B}_i=\boldsymbol{C}\)
iterative algorithmmatrix equationminimum Frobenius norm residual problemnormal equationoptimal approximation solutionleast squares bisymmetric solution
Cites Work
- Computing a nearest symmetric positive semidefinite matrix
- A representation of the general common solution to the matrix equations \(A_1XB_1=C_1\) and \(A_2XB_2=C_2\) with applications
- A pair of simultaneous linear matrix equations \(A_ 1XB_ 1=C_ 1,A_ 2XB_ 2=C_ 2\) and a matrix programming problem
- Practical Optimization
- Iterative orthogonal direction methods for Hermitian minimum norm solutions of two consistent matrix equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- An iterative method for symmetric solutions and optimal approximation solution of the system of matrix equations \(A_{1}XB_{1} = C_{1}, A_{2}XB_{2} = C_{2}\)
- 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
- 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
- Expert systems. The technology of knowledge management and decision making for the 21st century. In 6 vol
- Least squares solutions of matrix equation \(AXB=E\), \(CXD=F\)
- Title not available (Why is that?)
Cited In (28)
- An iterative algorithm for the generalized reflexive solution of the matrix equations \(AXB = E, CXD = F\)
- Title not available (Why is that?)
- A new iterative algorithm for solving a class of matrix nearness problem
- On the least squares generalized Hamiltonian solution of generalized coupled Sylvester-conjugate matrix equations
- A new simultaneous decomposition of a matrix quaternity over an arbitrary division ring with applications
- Iterative solutions to matrix equations of the form \(A_{i}XB_{i}=F_{i}\)
- Finite iterative algorithm for the symmetric periodic least squares solutions of a class of periodic Sylvester matrix equations
- Iterative solution to a system of matrix equations
- A new method for the bisymmetric minimum norm solution of the consistent matrix equations \(A_1XB_1 = C_1\), \(A_2XB_2 = C_2\)
- On ADMM-based methods for solving the nearness symmetric solution of the system of matrix equations \(a_1 Xb_1 = C_1\) and \(a_2 Xb_2 = c_2\)
- Symmetric least squares solution of a class of Sylvester matrix equations via MINIRES algorithm
- An iterative algorithm for solving a class of generalized coupled Sylvester-transpose matrix equations over bisymmetric or skew-anti-symmetric matrices
- The least squares bisymmetric solution of a class of matrix equation and its optimal approximation
- The least-squares generalized bisymmetric solutions of the matrix equation \(\sum^l_{i=1}\boldsymbol{A}_i\boldsymbol{X}_i\boldsymbol{B}_i=\boldsymbol{C}\)
- An efficient method for special least squares solution of the complex matrix equation \((AXB,CXD)=(E,F)\)
- An iterative methods for the least squares bisymmetric solution of the matrix equation \(AXB=C\)
- The modified conjugate gradient methods for solving a class of generalized coupled Sylvester-transpose matrix equations
- Iterative algorithms for the minimum-norm solution and the least-squares solution of the linear matrix equations \(A_1XB_1 + C_1X^TD_1 = M_1, A_2XB_2 + C_2 X^TD_2 = M_2\)
- A new approximation to the solution of the linear matrix equation \(AXB = C\)
- An iterative algorithm for the generalized reflexive solutions of the general coupled matrix equations
- Modified conjugate gradient method for obtaining the minimum-norm solution of the generalized coupled Sylvester-conjugate matrix equations
- ADMM-based methods for nearness skew-symmetric and symmetric solutions of matrix equation \(AXB = C\)
- Structure preserving subspace methods for the general coupled discrete-time periodic matrix equation and its application in antilinear periodic system
- Cyclic and simultaneous iterative methods to matrix equations of the form \(A_iXB_i=F_i\)
- An iterative algorithm for the least squares generalized reflexive solutions of the matrix equations \(AXB = E\), \(CXD = F\)
- The relaxed gradient based iterative algorithm for solving matrix equations \(A_iXB_i=F_i\)
- An equivalence canonical form of a matrix triplet over an arbitrary division ring with applications
- An iterative method for the bisymmetric solutions of the consistent matrix equations \(A_{1}XB_{1}=C_{1}, A_{2}XB_{2}=C_{2}\)
This page was built for publication: An iterative algorithm for the least squares bisymmetric solutions of the matrix equations \(A_{1}XB_{1}=C_{1},A_{2}XB_{2}=C_{2}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970024)
