Analysis approximate factorization in iteration methods (Q1294522)

From MaRDI portal
Revision as of 21:16, 28 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Analysis approximate factorization in iteration methods
scientific article

    Statements

    Analysis approximate factorization in iteration methods (English)
    0 references
    0 references
    0 references
    0 references
    28 February 2000
    0 references
    The article is concerned with stiff systems of ordinary differential equations arising from spiritual discretization of time- and space-dependent partial differential equations. Since numerical solvers for corresponding initial value problems must necessarily be implicit for stability reasons, a large system of equations has to be solved in each time step. For the solution of the linear systems occurring in a corresponding Newton iteration, the authors propose a parallel iterative solver based on an approximate factorization of the matrix. In particular, convergence and stability regions are derived.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    iterative methods
    0 references
    parallel computation
    0 references
    stiff systems
    0 references
    Newton iteration
    0 references
    factorization
    0 references
    convergence
    0 references
    stability regions
    0 references
    0 references