论文标题
p-laplacian的放松卡卡诺夫方案，具有大P
Relaxed Kacanov scheme for the p-Laplacian with large p
论文作者
论文摘要
我们引入了一种全球融合的放松卡卡诺夫计划，以将离散最小化器计算到$ p $ - 拉普拉斯问题上，并使用$ 2 \ leq p <\ p <\ infty $。迭代方案很容易实施，因为每个迭代仅来自加权，线性泊松问题的求解。它既不需要额外的线路搜索，也不需要涉及步长长度的未知常数。收敛速率与基础网格无关。
We introduce a globally convergent relaxed Kacanov scheme for the computation of the discrete minimizer to the $p$-Laplace problem with $2 \leq p < \infty$. 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.
