Some simple criteria for the solvability of block \(2 \times 2\) linear systems (Q2272627)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Some simple criteria for the solvability of block \(2 \times 2\) linear systems
scientific article

    Statements

    Some simple criteria for the solvability of block \(2 \times 2\) linear systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 September 2019
    0 references
    Consider a block matrix system \[\left[ \begin{array} [c]{cc} A & B^{T}\\ B & -D \end{array} \right] \left[ \begin{array} [c]{c} x\\ y \end{array} \right] =\left[ \begin{array} [c]{c} f\\ g \end{array} \right] \] of real matrices where \(A\) and \(D\) are symmetric semipositive square matrices and \(B\) is a rectangular matrix. The authors give some straightforward necessary and sufficient conditions for the existence and uniqueness of solutions to this system of equations. For example, there exists a solution to the system if \(f\) and \(g\) lie in the column spaces of the matrices \(\left[ A~B^{T}\right] \) and \(\left[ B~-D\right] \), respectively (the converse is trivial), and the block matrix is nonsingular if and only if both \(A+BB^{T}\) and \(D+B^{T}B\) are nonsingular.
    0 references
    0 references
    linear systems
    0 references
    saddle point problems
    0 references
    solvability
    0 references

    Identifiers