The reflexive least squares solutions of the matrix equation \(A_1X_1B_1+A_2X_2B_2+\cdots +A_lX_lB_l=C\) with a submatrix constraint (Q383515): Difference between revisions
From MaRDI portal
Latest revision as of 15:59, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The reflexive least squares solutions of the matrix equation \(A_1X_1B_1+A_2X_2B_2+\cdots +A_lX_lB_l=C\) with a submatrix constraint |
scientific article |
Statements
The reflexive least squares solutions of the matrix equation \(A_1X_1B_1+A_2X_2B_2+\cdots +A_lX_lB_l=C\) with a submatrix constraint (English)
0 references
4 December 2013
0 references
The author presents a stable and efficient algorithm to solve the matrix equation mentioned in the title and shows that the algorithm terminates with finite iteration steps.
0 references
matrix equation
0 references
central principal submatrix
0 references
reflexive solutions
0 references
submatrix constraint
0 references
least squares solution
0 references
algorithm
0 references
iteration
0 references
0 references
0 references
0 references
0 references
0 references
0 references
