Enhanced block FSAI preconditioning using domain decomposition techniques (Q2870689)

From MaRDI portal





scientific article; zbMATH DE number 6248323
Language Label Description Also known as
English
Enhanced block FSAI preconditioning using domain decomposition techniques
scientific article; zbMATH DE number 6248323

    Statements

    0 references
    0 references
    0 references
    21 January 2014
    0 references
    Krylov subspace methods
    0 references
    preconditioning
    0 references
    factorized sparse approximate inverse
    0 references
    domain decomposition
    0 references
    parallel computing
    0 references
    symmetric positive definite linear systems
    0 references
    Schur complement
    0 references
    numerical result
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references
    Enhanced block FSAI preconditioning using domain decomposition techniques (English)
    0 references
    Adaptive block factorized sparse approximate inverse (FSAI) (ABF) is a novel algebraic preconditioner for the cost-effective parallel solution of symmetric positive definite linear systems. However, a main drawback stems from its reduced scalability, as the iteration count to convergence tends to grow when the number of processors increases. A domain decomposition Schur complement approach can enhance both the ABF performance and scalability. It is demonstrated that the enhanced ABF preconditioner is superior to the native block FSAI, reducing at the same time the construction and communication computational burden. Numerical results from different large size applications show that the proposed algorithm can improve significantly the preconditioner, allowing for its efficient use in massively parallel simulations as well.
    0 references

    Identifiers

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