Vectorization of some block preconditioning conjugate gradient methods (Q749152)

From MaRDI portal
Revision as of 02:08, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Vectorization of some block preconditioning conjugate gradient methods
scientific article

    Statements

    Vectorization of some block preconditioning conjugate gradient methods (English)
    0 references
    0 references
    1990
    0 references
    Although the preconditioned conjugate gradient methods are effective for solving the linear systems arising from discretization of elliptic partial differential equations, the solution of the linear system \(Mr=s\), \(M=LD^{-1}L^ T\), where D, L are, respectively, diagonal and bidiagonal block matrices, to get the preconditioned residual, is a quite difficult task when using vector processors. A modified algorithm leading to better performances is discussed. Three numerical tests carried out on a single processor of a CRAY X-MP/48 are presented as a numerical evidence.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    vectorization
    0 references
    block preconditioning
    0 references
    preconditioned conjugate gradient methods
    0 references
    vector processors
    0 references
    numerical tests
    0 references