Conditioning analysis of modified block incomplete factorizations (Q1176529)

From MaRDI portal
Revision as of 09:52, 15 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Conditioning analysis of modified block incomplete factorizations
scientific article

    Statements

    Conditioning analysis of modified block incomplete factorizations (English)
    0 references
    0 references
    25 June 1992
    0 references
    The paper brings new and better results in the conditioning analysis of modified block incomplete factorizations of Stieltjes matrices, whose definition is extended to cover the singular case. For a Stieltjes (\(n\times n\))-matrix \(A\) and a partition \(\pi\) of the set \(\{1,2,..,n\}\) an algorithm is presented for computing a modified incomplete factorization \(B=U^ tP^ +U\), where \(P\) is \(\pi\)-diagonal and \(U\) is \(\pi\)-upper triangular. The main theorem gives the conditions under which \(N(B)\subseteq N(A)\) and an upper bound for the eigenvalues of \(B^ +A\). This result is then applied to a system matrix \(A\) associated with a two- dimensional elliptic partial differential equation of the form \(- \nabla[a\nabla u]+cu=f\) with mixed boundary conditions, and it is shown that the spectral condition number is bounded by \(N\), the number of gridpoints in the \(y\)-direction.
    0 references
    0 references
    conditioning
    0 references
    block incomplete factorizations
    0 references
    Stieltjes matrices
    0 references
    algorithm
    0 references
    spectral condition number
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references