Matrix renumbering ILU: An effective algebraic multilevel ILU preconditioner for sparse matrices

E. F. F. Botta, F.W. Wubs

    Research output: Contribution to journalArticleAcademicpeer-review

    59 Citations (Scopus)
    293 Downloads (Pure)

    Abstract

    In this paper a multilevel-like ILU preconditioner is introduced. The ILU factorization generates its own ordering during the elimination process. Both ordering and dropping depend on the size of the entries. The method can handle structured and unstructured problems. Results are presented for some important classes of matrices and for several well-known test examples. The results illustrate the effciency of the method and show in several cases near grid independent convergence.
    Original languageEnglish
    Pages (from-to)1007-1026
    Number of pages20
    JournalSIAM Journal on Matrix Analysis and Applications
    Volume20
    Issue number4
    DOIs
    Publication statusPublished - 9-Jul-1999

    Keywords

    • Krylov-subspace methods
    • dropping strategies
    • ILU
    • preconditioning
    • multilevel methods

    Cite this