English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we consider the numerical solution for the discretization of semilinear elliptic complementarity problems. A monotone algorithm is established based on the upper and lower solutions of the problem. It is proved that iterates, generated by the algorithm, are a pair of upper and lower solution iterates and converge monotonically from above and below, respectively, to the solution of the problem. Moreover, we investigate the convergence rate for the monotone algorithm and prove quadratic convergence of the algorithm. The monotone and quadratic convergence results are also extended to the discrete problems of the two-sided obstacle problems with a semilinear elliptic operator. We also present some simple numerical experiments.

Quadratic convergence of monotone iterates for semilinear elliptic obstacle problems