Relaxed Kacanov scheme for the p-Laplacian with large p
Numerical Analysis
2022-10-13 v1 Numerical Analysis
Abstract
We introduce a globally convergent relaxed Kacanov scheme for the computation of the discrete minimizer to the -Laplace problem with . 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.
Keywords
Cite
@article{arxiv.2210.06402,
title = {Relaxed Kacanov scheme for the p-Laplacian with large p},
author = {Anna Kh. Balci and Lars Diening and Johannes Storn},
journal= {arXiv preprint arXiv:2210.06402},
year = {2022}
}