RELAXED KAČANOV SCHEME FOR THE p-LAPLACIAN WITH LARGE EXPONENT.

We introduce a novel relaxed Kačanov scheme for the computation of the discrete minimizer to the p-Laplace problem with 2 ≤ p <∞. The iterative scheme is easy to implement since each iterate results only from the solve of a weighted, linear Poisson problem. It neither requires an additional line search nor involves unknown constants for the step length. The scheme converges globally, and its rate of convergence is independent of the underlying mesh under certain regularity assumptions on the (discrete) solution. [ABSTRACT FROM AUTHOR]