A Relaxed Kačanov Iteration for the $p$-Poisson Problem
Diening L, Fornasier M, Wank M (2017)
arXiv:1702.03844.
Preprint | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Diening, LarsUniBi 
;
Fornasier, Massimo;
Wank, Maximilian
;
Fornasier, Massimo;
Wank, MaximilianEinrichtung
Abstract / Bemerkung
In this paper, we introduce an iterative linearization scheme that allows to
approximate the weak solution of the $p$-Poisson problem
\begin{align*}
-\operatorname{div}(|\nabla u|^{p-2}\nabla u) &= f\quad\text{in }\Omega,
u&= 0\quad\text{on}\partial\Omega
\end{align*} for $1 < p \leq 2$. The algorithm can be interpreted as a
relaxed Ka\v{c}anov iteration. We prove that the algorithm converges at least
with an algebraic rate.
Erscheinungsjahr
2017
Zeitschriftentitel
arXiv:1702.03844
Page URI
https://pub.uni-bielefeld.de/record/2913416
Zitieren
Diening L, Fornasier M, Wank M. A Relaxed Kačanov Iteration for the $p$-Poisson Problem. arXiv:1702.03844. 2017.
Diening, L., Fornasier, M., & Wank, M. (2017). A Relaxed Kačanov Iteration for the $p$-Poisson Problem. arXiv:1702.03844
Diening, Lars, Fornasier, Massimo, and Wank, Maximilian. 2017. “A Relaxed Kačanov Iteration for the $p$-Poisson Problem”. arXiv:1702.03844.
Diening, L., Fornasier, M., and Wank, M. (2017). A Relaxed Kačanov Iteration for the $p$-Poisson Problem. arXiv:1702.03844.
Diening, L., Fornasier, M., & Wank, M., 2017. A Relaxed Kačanov Iteration for the $p$-Poisson Problem. arXiv:1702.03844.
L. Diening, M. Fornasier, and M. Wank, “A Relaxed Kačanov Iteration for the $p$-Poisson Problem”, arXiv:1702.03844, 2017.
Diening, L., Fornasier, M., Wank, M.: A Relaxed Kačanov Iteration for the $p$-Poisson Problem. arXiv:1702.03844. (2017).
Diening, Lars, Fornasier, Massimo, and Wank, Maximilian. “A Relaxed Kačanov Iteration for the $p$-Poisson Problem”. arXiv:1702.03844 (2017).
arXiv: 
Google Scholar