EUVIMEDEUVIMED entdecken
Crossref

Unconditional full linear convergence and optimal complexity of adaptive iteratively linearized FEM for nonlinear PDEs

Ani Miraçi, Dirk Praetorius, Julian Streitberger

Mathematics of Computation · 16.10.2025 · 96 (363) · 1-23

DOI: 10.1090/mcom/4135 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics of Computation, online erschienen am 16.10.2025. Verfasst von Ani Miraçi und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 34 Literaturangaben. Gefördert von: Austrian Science Fund.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We propose an adaptive iteratively linearized finite element method (AILFEM) in the context of strongly monotone nonlinear operators with energy structure in Hilbert spaces. The approach combines adaptive mesh-refinement with an energy-contractive linearization scheme (e.g., the Kačanov method) and a norm-contractive algebraic solver (e.g., an optimal geometric multigrid method). Crucially, a novel parameter-free algebraic stopping criterion is designed and we prove that it leads to a uniformly bounded number of algebraic solver steps. Unlike available results requiring sufficiently small adaptivity parameters to ensure even plain convergence, the new AILFEM algorithm guarantees full R-linear convergence for arbitrary adaptivity parameters. Thus, unconditional convergence is guaranteed. Moreover, for sufficiently small adaptive mesh-refinement parameter θ \theta and linearization-stopping parameter λ l i n \lambda _{\mathrm {lin}} , the new adaptive algorithm guarantees optimal complexity, i.e., optimal convergence rates with respect to the overall computational cost and hence time.

Förderung

  • Austrian Science Fund

Zitieren

APA

Miraçi, A., Praetorius, D., & Streitberger, J. (2025). Unconditional full linear convergence and optimal complexity of adaptive iteratively linearized FEM for nonlinear PDEs. Mathematics of Computation, 96(363), 1-23. https://doi.org/10.1090/mcom/4135

Vancouver

Miraçi A, Praetorius D, Streitberger J. Unconditional full linear convergence and optimal complexity of adaptive iteratively linearized FEM for nonlinear PDEs. Mathematics of Computation. 2025;96(363):1-23. doi:10.1090/mcom/4135

BibTeX
@article{Mirai2025,
  author = {Miraçi, Ani and Praetorius, Dirk and Streitberger, Julian},
  title = {Unconditional full linear convergence and optimal complexity of adaptive iteratively linearized FEM for nonlinear PDEs},
  journal = {Mathematics of Computation},
  year = {2025},
  volume = {96},
  number = {363},
  pages = {1--23},
  doi = {10.1090/mcom/4135}
}
Kostenlos starten →