On the convergence of adaptive iterative linearized Galerkin methods

From MaRDI portal
Publication:2201564

DOI10.1007/S10092-020-00368-4zbMATH Open1448.35219arXiv1905.06682OpenAlexW3046972190MaRDI QIDQ2201564FDOQ2201564

Pascal Heid, Thomas P. Wihler

Publication date: 29 September 2020

Published in: Calcolo (Search for Journal in Brave)

Abstract: A wide variety of different (fixed-point) iterative methods for the solution of nonlinear equations exists. In this work we will revisit a unified iteration scheme in Hilbert spaces from our previous work that covers some prominent procedures (including the Zarantonello, Kav{c}anov and Newton iteration methods). In combination with appropriate discretization methods so-called (adaptive) iterative linearized Galerkin (ILG) schemes are obtained. The main purpose of this paper is the derivation of an abstract convergence theory for the unified ILG approach (based on general adaptive Galerkin discretization methods) proposed in our previous work. The theoretical results will be tested and compared for the aforementioned three iterative linearization schemes in the context of adaptive finite element discretizations of strongly monotone stationary conservation laws.


Full work available at URL: https://arxiv.org/abs/1905.06682




Recommendations




Cites Work


Cited In (21)





This page was built for publication: On the convergence of adaptive iterative linearized Galerkin methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201564)