Gleichmäßig einschließende Diskretisierungsverfahren für schwach nichtlineare Randwertaufgaben. (Uniformly enclosing discretization methods for weakly nonlinear boundary value problems) (Q1090083)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Gleichmäßig einschließende Diskretisierungsverfahren für schwach nichtlineare Randwertaufgaben. (Uniformly enclosing discretization methods for weakly nonlinear boundary value problems)
scientific article

    Statements

    Gleichmäßig einschließende Diskretisierungsverfahren für schwach nichtlineare Randwertaufgaben. (Uniformly enclosing discretization methods for weakly nonlinear boundary value problems) (English)
    0 references
    0 references
    1986
    0 references
    Consider a boundary value problem -ü\(+g(t,u)=0\), \(u(0)=u(1)=0\) with g monotone increasing in u. The authors replace in the corresponding weak problem (\D{u},\D{v})\(+(g(\cdot,u),v)=0\), \(v\in H_ 0^ 1\) the nonlinearity \(u\to g(\cdot,u)\) by a piecewise polynomial approximation P(u). They show that the resulting problem (\D{u},\D{v})\(+(Pu,v)=0\) can be viewed as finite dimensional and that its solution constitutes pointwise upper or lower bounds for the solution of the original problem. Here they need appropriate assumptions on the operator P. With two different replacements of this type upper and lower bounds are constructed. In a special case a procedure to solve the discrete equations is given. The paper ends with three numerical examples.
    0 references
    0 references
    weakly nonlinear boundary value problems
    0 references
    upper and lower discretizations
    0 references
    two-sided bounds
    0 references
    weak maximum principle
    0 references
    upper and lower bounds
    0 references
    numerical examples
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references