Monotone iterations for numerical solutions of nonlinear elliptic partial differential equations (Q1194397)

From MaRDI portal
Revision as of 10:47, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Monotone iterations for numerical solutions of nonlinear elliptic partial differential equations
scientific article

    Statements

    Monotone iterations for numerical solutions of nonlinear elliptic partial differential equations (English)
    0 references
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    The paper is concerned with monotone iteration methods for discretizations of semilinear second-order elliptic boundary value problems. The gradient of the solution \(u\) enters the problem linearly, with coefficient vector \(g(x,u)\). The authors propose a difference scheme depending on the sign behaviour of the components of \(g(x,u)\). The resulting discrete system is suitable for monotone iteration; the existence of upper and lower solutions is assumed. Under additional assumptions, the convergence is shown to be quadratic. Burgers' equation is used to test the method numerically.
    0 references
    quadratic convergence
    0 references
    monotone iteration methods
    0 references
    semilinear second- order elliptic boundary value problems
    0 references
    difference scheme
    0 references
    upper and lower solutions
    0 references
    convergence
    0 references
    Burgers' equation
    0 references
    0 references

    Identifiers

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