Block elimination with one refinement solves bordered linear systems accurately (Q915359)

From MaRDI portal
Revision as of 10:53, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Block elimination with one refinement solves bordered linear systems accurately
scientific article

    Statements

    Block elimination with one refinement solves bordered linear systems accurately (English)
    0 references
    0 references
    1990
    0 references
    Linear systems with an \((n+1)\times (n+1)\) matrix of the form \(\begin{pmatrix} A & b \\ c & d\end{pmatrix} \) are studied with \(A\) being an \(n\times n\)-matrix. Equations with this matrix may be solved by using a black box solver for \(A\) twice. If \(A\) is not a well-conditioned matrix, then only approximate solvers will be available. It turns out that one step of iterative refinement is sufficient, if the approximate inverse \(A^{-1}\) is good from the viewpoint of backward error analysis.
    0 references
    block elimination
    0 references
    bordered linear systems
    0 references
    black box solver
    0 references
    iterative refinement
    0 references
    approximate inverse
    0 references
    backward error analysis
    0 references
    0 references
    0 references

    Identifiers