Monotone iteration descretization algorithm for BVP's (Q1114359)

From MaRDI portal
Revision as of 08:36, 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 iteration descretization algorithm for BVP's
scientific article

    Statements

    Monotone iteration descretization algorithm for BVP's (English)
    0 references
    0 references
    1989
    0 references
    This paper deals with the following weakly nonlinear boundary value problem \(-u''+g(x,u(x))=0,\) \(u(a)=u(b)=0.\) By means of available estimations lower and upper solutions are generated. Authors replace the optimization by implementable estimations and propose a monotone iteration technique for the finite-dimensional problem in such a way that enclosures are obtained in each iteration step of the method. Finally, numerical realizations are given using interval arithmetic.
    0 references
    weakly nonlinear
    0 references
    lower and upper solutions
    0 references
    monotone iteration
    0 references
    interval arithmetic
    0 references
    0 references
    0 references

    Identifiers

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