arXiv subjects

Paula Hilbert

Publications and source records attributed to Paula Hilbert.

3 recordsLinked to original sources

arXiv2026

Adaptive finite element methods with optimally preconditioned GMRES guarantee optimal complexity

We analyze optimal complexity of adaptive finite element methods (AFEMs) for general second-order linear elliptic partial differential equations (PDEs) in the Lax-Milgram setting. To this end, we formulate an adaptive algorithm which steers the local mesh-refinement as well as the termination of a generalized minimal residual solver (GMRES) with optimal preconditioner to solve the arising non-symmetric finite element systems. Algorithmic interplay of mesh-refinement and iterative solver is shown to be optimal: A natural and fully computable quasi-error monitoring discretization error and algebraic solver error guarantees unconditional convergence for any choice of adaptivity parameters, i.e., the algorithm cannot fail to converge. This is ensured algorithmically via a novel adaptive feedback-control for the solver-termination parameter that monitors and ensures full R-linear convergence. Finally, the quasi-error even decays with optimal rates with respect to the overall computational complexity if the adaptivity parameters are chosen sufficiently small.

math.NA↗

arXiv2026

Generalized preconditioned conjugate gradients for adaptive FEM with optimal complexity

We consider adaptive finite element methods (AFEMs) with inexact algebraic solvers for second-order symmetric linear elliptic diffusion problems. Optimal complexity of AFEM, i.e., optimal convergence rates with respect to the overall computational cost, hinges on two requirements on the solver. First, each solver step is of linear cost with respect to the number of degrees of freedom. Second, each solver step guarantees uniform contraction of the solver error with respect to the PDE-related energy norm. Both properties must be ensured robustly with respect to the local mesh size h (i.e., h-robustness). While existing literature on geometric multigrid methods (MG) or symmetric additive Schwarz preconditioners for the preconditioned conjugate gradient method (PCG) that are appropriately adapted to adaptive mesh-refinement satisfy these requirements, this paper aims to consider more general solvers. Our main focus is on preconditioners stemming from contractive solvers which need not be symmetrized to be used with Krylov methods and which are not only h-robust but also p-robust, i.e., the contraction constant is independent of the polynomial degree p. In particular, we show that generalized PCG (GPCG) with an h- and p-robust contractive MG as a preconditioner satisfies the requirements for optimal-complexity AFEM and that it numerically outperforms AFEM using MG as a solver. While this is certainly known for (quasi-)uniform meshes, the main contribution of the present work is the rigorous analysis of the interplay of the solver with adaptive mesh-refinement. Numerical experiments underline the theoretical findings.

math.NA↗

arXiv2026

Multigoal-oriented adaptive finite element method with convergence rates

We formulate and analyze a goal-oriented adaptive finite element method for a symmetric linear elliptic partial differential equation (PDE) that can simultaneously deal with multiple linear goal functionals. In each step of the algorithm, only two linear finite element systems have to be solved. Moreover, all finite element solutions are computed with respect to the same discrete space, while the underlying triangulations are adapted to resolve all inherent singularities simultaneously. Unlike available results for such a setting in the literature, we give a thorough convergence analysis and verify that our algorithm guarantees, in an appropriate sense, even optimal convergence rates. Numerical experiments underline the derived theoretical results.

math.NA↗