1
$\begingroup$

How to solve a linear equation involving super matrices: $AX=B$. Is there any pre-existing algorithm?

where $A,X,B$ are super matrices i.e. matrices with elements which are simple matrices. in simplest case say $$A=[ a(i,j)| i,j={1,2}];\ X=[ x(i)| i={1,2} ];\ \ B= [b(i) |i={1,2}] $$ $a(i,j), x(i), b(i)$ are simple matrices of order $n\times n, n\times 1$ and $n\times 1$.

When $n=1$, it degenerates to simple system of linear equation.

Example: Solve for matrices $x,y$: $Ax+By=Q, Cx+Dy=T$

$A,B,C,D$ are matrices of order $n\times n$; $x,y,Q,T$ are of order $n\times 1$

  • 0
    Schur complement defines an accurate way to solve the linear equation involving super matrices. Any other improved version or algorithm will be very conducive.2011-11-02
  • 3
    Please, don't introduce this jargon. It is simply a linear matrix equation. It is usually referred to a block matrix if the entries are themselves matrices. Super and simple matrices are not contributing anything to the nature of the problem.2011-11-02

1 Answers 1