An incomplete-factorization preconditioning using repeated red-black ordering (Q1203404): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 06:09, 31 January 2024

scientific article
Language Label Description Also known as
English
An incomplete-factorization preconditioning using repeated red-black ordering
scientific article

    Statements

    An incomplete-factorization preconditioning using repeated red-black ordering (English)
    0 references
    0 references
    8 February 1993
    0 references
    To solve a system of linear equations with a weakly dominant \(M\)-matrix \(A\) arising from 5-point discretizations on two-dimensional rectangular grids and locally refined grids, the author presents an incomplete factorization method combined with a particular ordering scheme called repeated red-black ordering. The basic idea is to drop some of the fill- in terms generated by elimination of half the unknowns by one step cyclic reduction applied to the system arising from the standard red-black ordering of \(A\) and to reorder the remaining equations so that the process can be repeated. Results on the existence of the incomplete factorization related to the repeated red-black ordering and on the preconditioning effect are given. In particular, it has been proved that the spectral condition number for the two-dimensional Dirichlet problems for the Poisson equation on the unit square discretized by an \(n\times n\) regular grid does not exceed \(\sqrt{n}\). Numerical results for symmetric and nonsymmetric problems confirm high efficiency of the method presented.
    0 references
    incomplete factorization method
    0 references
    red-black ordering
    0 references
    preconditioning
    0 references
    spectral condition number
    0 references
    Dirichlet problems
    0 references
    Poisson equation
    0 references
    Numerical results
    0 references

    Identifiers

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