hp-Robust multigrid solver on locally refined meshes for FEM discretizations of symmetric elliptic PDEs

DOI10.1051/M2AN/2023104MaRDI QIDQ6128501zbMATH OpenOpenAlexFDO

Authors Michael Innerberger, Ani Miraçi, Dirk Praetorius

Publication date 15 April 2024

Published in ESAIM: Mathematical Modelling and Numerical Analysis (Search for Journal in Brave)

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

zbMATH Keywords

\textit{hp}-robustnessadaptive finite element methodlocal multigridstable decomposition

Mathematics Subject Classification ID

Second-order elliptic equations (35J15) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Error bounds for boundary value problems involving PDEs (65N15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Complexity and performance of numerical algorithms (65Y20)

Abstract: In this work, we formulate and analyze a geometric multigrid method for the iterative solution of the discrete systems arising from the finite element discretization of symmetric second-order linear elliptic diffusion problems. We show that the iterative solver contracts the algebraic error robustly with respect to the polynomial degree $pge1$ and the (local) mesh size $h$. We further prove that the built-in algebraic error estimator which comes with the solver is $hp$-robustly equivalent to the algebraic error. The application of the solver within the framework of adaptive finite element methods with quasi-optimal computational cost is outlined. Numerical experiments confirm the theoretical findings.

Recommendations

• A-posteriori-steered \(p\)-robust multigrid with optimal step-sizes and adaptive number of smoothing steps
• A Multilevel Algebraic Error Estimator and the Corresponding Iterative Solver with p-Robust Behavior
• Multigrid algorithms for hp-discontinuous Galerkin discretizations of elliptic problems
• Multigrid algorithms for \(hp\)-version interior penalty discontinuous Galerkin methods on polygonal and polyhedral meshes
• The hp-multigrid method applied to hp-adaptive refinement of triangular grids

Cited in

(5)

• Cost-optimal adaptive FEM for semilinear elliptic PDEs
• Optimal cost of (goal-oriented) adaptive FEM for general second-order linear elliptic PDEs
• Optimal complexity of goal-oriented adaptive FEM for nonsymmetric linear elliptic PDEs
• Cost-optimal adaptive FEM with linearization and algebraic solver for semilinear elliptic PDEs
• On full linear convergence and optimal complexity of adaptive FEM with inexact solver

This page was built for publication: hp-Robust multigrid solver on locally refined meshes for FEM discretizations of symmetric elliptic PDEs

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