Relaxed Kacanov scheme for the p-Laplacian with large p

10/12/2022

∙

by   Anna Kh. Balci, et al.

∙

0

∙

share

We introduce a globally convergent relaxed Kacanov 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 rate of convergence is independent of the underlying mesh.