An efficient algorithm for the submatrix constraint of the matrix equation<i>A</i><sub>1</sub><i>X</i><sub>1</sub><i>B</i><sub>1</sub>+<i>A</i><sub>2</sub><i>X</i><sub>2</sub><i>B</i><sub>2</sub>+···+<i>A</i><sub><i>l</i></sub><i>X</i><sub><i>l</i></sub><i>B</i><sub><i>l</i></sub>=<i>C</i> (Q4903514)
From MaRDI portal
scientific article; zbMATH DE number 6127855
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for the submatrix constraint of the matrix equation<i>A</i><sub>1</sub><i>X</i><sub>1</sub><i>B</i><sub>1</sub>+<i>A</i><sub>2</sub><i>X</i><sub>2</sub><i>B</i><sub>2</sub>+···+<i>A</i><sub><i>l</i></sub><i>X</i><sub><i>l</i></sub><i>B</i><sub><i>l</i></sub>=<i>C</i> |
scientific article; zbMATH DE number 6127855 |
Statements
An efficient algorithm for the submatrix constraint of the matrix equation<i>A</i><sub>1</sub><i>X</i><sub>1</sub><i>B</i><sub>1</sub>+<i>A</i><sub>2</sub><i>X</i><sub>2</sub><i>B</i><sub>2</sub>+···+<i>A</i><sub><i>l</i></sub><i>X</i><sub><i>l</i></sub><i>B</i><sub><i>l</i></sub>=<i>C</i> (English)
0 references
22 January 2013
0 references
algorithm
0 references
matrix equation
0 references
central principal submatrix
0 references
bisymmetric matrix
0 references
least-squares solution
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
