Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems

From MaRDI portal





The paper deals with simple approximations of a nonsymmetric elliptic equation in the unit square. The iterative methods under consideration are connected with preconditioners taken from incomplete factorizations of the original matrix. Such purely algebraic constructions of model operators are usually sensitive to many factors. Orderings of the unknowns is one of them. Numerical experiments in the paper (for various small parameters) confirm this fact. The authors indicate that the reverse Cuthill-McKee reorderings, typical for direct methods, is one of the best. The number of the unknowns is \(N= 1024\), typically, but several examples with \(N\approx 10^4\) are also outlined.




Cited in
(51)


Describes a project that uses

Uses Software






This page was built for publication: Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4253081)