TY  - JOUR
AB  - In this paper we introduce and analyze an iteratively re-weighted algorithm, that allows to approximate the weak solution of the p-Poisson problem for 1<p2 by iteratively solving a sequence of linear elliptic problems. The algorithm can be interpreted as a relaxed Kaanov iteration, as so-called in the specific literature of the numerical solution of quasi-linear equations. The main contribution of the paper is proving that the algorithm converges at least with an algebraic rate.
DA  - 2020
DO  - 10.1007/s00211-020-01107-1
LA  - eng
M2  - 1
PY  - 2020
SN  - 0029-599X
SP  - 1-34
T2  - Numerische Mathematik
TI  - A Relaxed Kaanov iteration for the p-poisson problem
UR  - https://nbn-resolving.org/urn:nbn:de:0070-pub-29418793
Y2  - 2024-11-25T02:57:54
ER  -