A new method for the bisymmetric minimum norm solution of the consistent matrix equations \(A_1XB_1 = C_1\), \(A_2XB_2 = C_2\)
From MaRDI portal
Publication:2375407
DOI10.1155/2013/125687zbMath1266.65070OpenAlexW2051918761WikidataQ59001666 ScholiaQ59001666MaRDI QIDQ2375407
Aijing Liu, Xiang-Yun Zhang, Guo-Liang Chen
Publication date: 14 June 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/125687
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
An accelerated cyclic-reduction-based solvent method for solving quadratic eigenvalue problem of gyroscopic systems ⋮ An iterative algorithm to solve the generalized Sylvester tensor equations ⋮ Developing CRS iterative methods for periodic Sylvester matrix equation ⋮ The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint ⋮ An iterative method for obtaining the least squares solutions of quadratic inverse eigenvalue problems over generalized Hamiltonian matrix with submatrix constraints ⋮ An iterative algorithm for robust simulation of the Sylvester matrix differential equations ⋮ SOME ITERATIVE ALGORITHMS FOR POSITIVE DEFINITE SOLUTION TO NONLINEAR MATRIX EQUATIONS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- 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}\)
- A finite iterative method for solving a pair of linear matrix equations \((AXB,CXD)=(E,F)\)
- An iterative method for the bisymmetric solutions of the consistent matrix equationsA1XB1=C1,A2XB2=C2
- Iterative orthogonal direction methods for Hermitian minimum norm solutions of two consistent matrix equations
- Hermitian and Nonnegative Definite Solutions of Linear Matrix Equations
- Bidiagonalization of Matrices and Solution of Linear 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: A new method for the bisymmetric minimum norm solution of the consistent matrix equations \(A_1XB_1 = C_1\), \(A_2XB_2 = C_2\)