The bisymmetric solutions of the matrix equation A₁X₁B₁+A₂X₂B₂++A_lX_lB_l=C and its optimal approximation
The authors propose an iterative method for finding the bisymmetric solutions of the matrix equation \(A_1X_1B_1+A_2X_2B_2+\cdots +A_lX_lB_l=C~(*)\) where \([X_1,\dots ,X_l]\) is a real matrix group. (A square matrix is bisymmetric if it is symmetric w.r.t. both the diagonal and the antidiagonal.) The method gives also the answer to the question whether equation \((*)\) is consistent or not. When it is, then for any initial bisymmetric matrix group \([X_1^{(0)},\ldots ,X_l^{(0)}]\) a solution is obtained within finitely many iteration steps in the absence of roundoff errors, and the choice of a special initial matrix group allows one to find the least norm bisymmetric solution group (LNBSG). The optimal approximation bisymmetric solution group to a given group \([\bar{X}_1,\dots ,\bar{X}_l]\) in the Frobenius norm is obtained by finding the LNBSG of equation \((*)\) with right-hand side \(C-A_1\bar{X}_1B_1-\cdots -A_l\bar{X}_lB_l\).
- The generalized bisymmetric solutions of the matrix equation \(A_{1} X_{1} B_{1} + A_{2} X_{2} B_{2} + \dots + A_{l} X_{l} B_{l} = C\) and its optimal approximation
- 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 bisymmetric solution of matrix equation AX=B over a matrix inequality constraint
- Least-squares solutions of the matrix equation A^TXA=B over bisymmetric matrices and its optimal approximation
- scientific article; zbMATH DE number 5524430
- scientific article; zbMATH DE number 3951889 (Why is no real title available?)
- scientific article; zbMATH DE number 1546511 (Why is no real title available?)
- scientific article; zbMATH DE number 2146949 (Why is no real title available?)
- scientific article; zbMATH DE number 7652085 (Why is no real title available?)
- Inverse eigenvalue problem in structural design
- Least Squares Solution of Matrix Equation AXB^* + CYD^* = E
- On the symmetric solutions of linear matrix equations
- Optimization Procedure to Correct Stiffness and Flexibility Matrices Using Vibration Tests
- Singular value and generalized singular value decompositions and the solution of linear matrix equations
- The inverse problem of bisymmetric matrices with a submatrix constraint
- Weighted least squares solutions to general coupled Sylvester matrix equations
- The generalized bisymmetric solutions of the matrix equation \(A_{1} X_{1} B_{1} + A_{2} X_{2} B_{2} + \dots + A_{l} X_{l} B_{l} = C\) and its optimal approximation
- The generalized bisymmetric (bi-skew-symmetric) solutions of a class of matrix equations and its least squares problem
- A numerical method on the mixed solution of matrix equation \(\sum_{i = 1}^t A_i X_i B_i = E\) with sub-matrix constraints and its application
- LSMR iterative method for general coupled matrix equations
- The generalized QMRCGSTAB algorithm for solving Sylvester-transpose 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\)
- The bisymmetric solutions of the matrix equation A^TXA= B
- The anti-bisymmetric matrices optimal approximation solution of matrix equation AX=B
- An iterative method for the bisymmetric solutions of the consistent matrix equations \(A_{1}XB_{1}=C_{1}, A_{2}XB_{2}=C_{2}\)
- scientific article; zbMATH DE number 5524430 (Why is no real title available?)
- Least-squares solutions of the matrix equation A^TXA=B over bisymmetric matrices and its optimal approximation
- scientific article; zbMATH DE number 5639871 (Why is no real title available?)
- The common bisymmetric nonnegative definite solutions with extreme ranks and inertias to a pair of matrix equations
- Inertias and ranks of some Hermitian matrix functions with applications
- scientific article; zbMATH DE number 1475200 (Why is no real title available?)
- scientific article; zbMATH DE number 2146949 (Why is no real title available?)
- An efficient algorithm for the submatrix constraint of the matrix equation \(A_1 X_1 B_1+A_2 X_2 B_2+{\cdots}+A_l X_l B_l =C\)
- Numerical algorithms for solving the least squares symmetric problem of matrix equation \(AXB + CXD = E\)
- Finite iterative algorithm for solving coupled Lyapunov equations appearing in continuous-time Markov jump linear systems
- The bisymmetric solution of matrix equation AX=B over a matrix inequality constraint
- 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}\)
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q996312)
