The least squares bisymmetric solution of a class of matrix equation and its optimal approximation
From MaRDI portal
Publication:3513316
Recommendations
- 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}\)
- An iterative methods for the least squares bisymmetric solution of the matrix equation AXB=C
- 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 iterative method for the bisymmetric solutions of the consistent matrix equations \(A_{1}XB_{1}=C_{1}, A_{2}XB_{2}=C_{2}\)
- Least-squares solutions of the matrix equation A^TXA=B over bisymmetric matrices and its optimal approximation
Cited in
(16)- 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 least squares anti-bisymmetric solution and the optimal approximation solution for Sylvester equation
- The generalized bisymmetric (bi-skew-symmetric) solutions of a class of matrix equations and its least squares problem
- Least squares solutions of quadratic inverse eigenvalue problem with partially bisymmetric matrices under prescribed submatrix constraints
- A new method for the bisymmetric minimum norm solution of the consistent matrix equations \(A_1XB_1 = C_1\), \(A_2XB_2 = C_2\)
- Least squares solutions to \(AX = B\) for bisymmetric matrices under a central principal submatrix constraint and the optimal approximation
- Least squares solutions of bilinear equations
- 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}\)
- Least squares (P,Q)-orthogonal symmetric solutions of the matrix equation and its optimal approximation
- scientific article; zbMATH DE number 5524430 (Why is no real title available?)
- An iterative methods for the least squares bisymmetric solution of the matrix equation AXB=C
- scientific article; zbMATH DE number 5639871 (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\)
- Least‐squares partially bisymmetric solutions of coupled Sylvester matrix equations accompanied by a prescribed submatrix constraint
- Solving bisymmetric solution of a class of matrix equations based on linear saturated system model neural network
- 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 least squares bisymmetric solution of a class of matrix equation and its optimal approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3513316)
