Performance of ILU factorization preconditioners based on multisplittings (Q1412188)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Performance of ILU factorization preconditioners based on multisplittings
scientific article

    Statements

    Performance of ILU factorization preconditioners based on multisplittings (English)
    0 references
    0 references
    9 November 2003
    0 references
    The author investigates the parallelizability of incomplete LU (ILU) preconditioners for sparse block tridiagonal H matrices. Preconditioned Krylov subspace methods are generally necessary to speed up convergence. But the ILU factorization does not lend itself to parallelization. However, if the multisplitting method converges, then \(P^{-1}\) (with \(PA = I-H\) and an iteration matrix \(H\) with spectral radius less than 1) is a good preconditioner for the Krylov method. Such a preconditioner \(P\) is derived from the multisplitting of the block diagonal H-matrix and it can be used in parallel in the preconditioner solver step to advantage. The convergence of such a scheme is studied, as well as the parallel performance for the ILU preconditioned BiCGSTAB algorithm.
    0 references
    block triangular matrix
    0 references
    preconditioner
    0 references
    linear equation
    0 references
    Krylov subspace method
    0 references
    multisplitting
    0 references
    parallel algorithm
    0 references
    sparse matrix
    0 references
    incomplete LU factorization
    0 references
    convergence
    0 references
    H-matrix
    0 references
    BiCGSTAB algorithm
    0 references
    0 references

    Identifiers

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