SearcharxivSearch

arXiv subjects

Gregor Gantner

Publications and source records attributed to Gregor Gantner.

At least 19 recordsLinked to original sources

Space-time finite element interpolation of nonsmooth functions satisfying boundary conditions

We construct Scott-Zhang-type space-time quasi-interpolation operators on tensor- product meshes for parabolic settings. Specifically, these are linear and uniformly bounded projections from the classical parabolic energy space onto a space-time tensor-product finite element space that preserve discrete Dirichlet boundary conditions on the lateral space-time boundary. We apply our operator in the context of space-time first-order system least-squares finite elements for parabolic equations to establish a quasi-optimal method for inhomogeneous Dirichlet boundary conditions.

math.NA

A Double-Adaptivity Solver for Parabolic PDEs

We study minimal residual space-time finite element discretizations of linear parabolic initial value problems in canonical space-time variational form. To deal with the arising dual norm, we introduce the Riesz lift of the residual as an additional variable. Quasi-optimality of the primal variable of the mixed system follows from a uniform inf-sup condition. This condition is known to be satisfied for finite element spaces w.r.t. prismatic partitions of the space-time cylinder that allow for a decomposition into time-slabs. We prove that this condition cannot be expected to hold otherwise. To recover stability for general partitions and the data at hand, we derive an a posteriori condition on the error between the exact Riesz lift of the residual and its Galerkin approximation -- being the secondary variable of our system -- under which the primal variable is quasi-optimal. We derive a posteriori error estimators for both variables, and use them in a double-adaptive loop that alternates test-space with trial-space enrichment. We illustrate our findings with numerical experiments in $1+1$ and $2+1$ dimensions.

math.NA

Optimal complexity of adaptive FEM for second-order linear elliptic PDEs driven by non-residual estimators, Part I: Symmetric PDEs

We consider adaptive finite element methods for symmetric second-order linear elliptic PDEs, where the adaptive algorithm steers the local mesh refinement as well as an iterative algebraic solver. Under abstract assumptions on the underlying a-posteriori error estimator and the solver, we prove that the usual adaptive algorithm leads to unconditional full R-linear convergence, independently of the user-chosen adaptivity parameters. For sufficiently small parameters, this guarantees optimal complexity in the sense that the decay rate of an appropriate quasi-error is optimal with respect to the overall computation cost (and hence time) measured in terms of the usual nonlinear approximation classes. Unlike available results in the literature, the main focus is on the analytical understanding of non-residual estimators like averaging-based estimators as proposed by Zienkiewicz and Zhu or estimators based on equilibrated fluxes.

math.NA

Adaptive space-time BEM for the heat equation with Neumann boundary conditions

We consider the space-time boundary element method (BEM) for the heat equation with prescribed initial and Neumann data. We propose a weighted-residual a posteriori error estimator that is an upper bound for the unknown BEM error. The possibly locally refined meshes are assumed to be parabolically scaled prismatic, i.e., their elements are tensor-products $J\times K$ of elements in time $J$ and space $K$ with $|J| \eqsim \text{diam}(K)^2$. In the considered numerical experiments on two-dimensional domains in space, an adaptive algorithm steered by the derived estimator yields significantly faster convergence compared to uniform refinement, achieving near-optimal rates even in the presence of strong singularities.

math.NA

Quasi-optimal complexity of iterative Galerkin methods driven by an elliptic reconstruction error estimator

We study an iterative Galerkin method for quasilinear elliptic problems in the Browder-Minty setting. The resulting discrete nonlinear systems are solved by linearization via a (damped) Zarantonello iteration. Unlike prior work, adaptive mesh refinement is driven by an elliptic reconstruction error estimator, which is natural in the sense that the a posteriori bounds for the linearization and discretization errors are well separated. For this setting, we present the first comprehensive convergence analysis of the corresponding algorithm. We prove unconditional full R-linear convergence of a suitable quasi-error that combines linearization and discretization errors. For sufficiently small adaptivity parameters, we further establish optimal convergence rates with respect to the number of degrees of freedom and quasi-optimal complexity, i.e., optimal convergence rates with respect to the overall computational cost. Numerical experiments underpin the theoretical findings.

math.NA

On $p$-robust convergence and optimality of adaptive FEM driven by equilibrated-flux estimators

Building on existing $hp$-adaptive algorithms driven by equilibrated-flux estimators from [ESAIM Math. Model. Numer. Anal. 57 (2023), 329--366] and the references therein, we propose a novel $h$-adaptive algorithm for a fixed polynomial degree $p$. We consider a conforming finite element discretization of the Poisson equation in two or three space dimensions. Supposing piecewise polynomial right-hand side of degree $p-1$, we show that the algorithm yields error contraction at each step, with a contraction factor that is independent of $p$ provided that a certain {\sl a posteriori} verifiable criterion is satisfied. We further show that this algorithm converges at optimal algebraic rate $s$ if the D\"orfler marking parameter is chosen below some specified $p$-independent upper threshold. The constants involved here are $p$-robust, although they may depend on the rate $s$. The theoretical results are supported by numerical experiments, in which the {\sl a posteriori} criterion is always satisfied for one or a few local mesh refinement steps by newest-vertex bisection.

math.NA

Boundary elements for clamped Kirchhoff--Love plates

We present a Galerkin boundary element method for clamped Kirchhoff--Love plates with piecewise smooth boundary. It is a direct method based on the representation formula and requires the inversion of the single-layer operator and an application of the double-layer operator to the Dirichlet data. We present trace approximation spaces of arbitrary order, required for both the Dirichlet data and the unknown Neumann trace. Our boundary element method is quasi-optimal with respect to the natural trace norm and achieves optimal convergence order under minimal regularity assumptions. We provide explicit representations of both boundary integral operators and discuss the implementation of the appearing integrals. Numerical experiments for smooth and non-smooth domains confirm predicted convergence rates.

math.NA

Optimal convergence rates of an adaptive finite element method for unbounded domains

We consider linear reaction-diffusion equations posed on unbounded domains, and discretized by adaptive Lagrange finite elements. To obtain finite-dimensional spaces, it is necessary to introduce a truncation boundary, whereby only a bounded computational subdomain is meshed, leading to an approximation of the solution by zero in the remainder of the domain. We propose a residual-based error estimator that accounts for both the standard discretization error as well as the effect of the truncation boundary. This estimator is shown to be reliable and efficient under appropriate assumptions on the triangulation. Based on this estimator, we devise an adaptive algorithm that automatically refines the mesh and pushes the truncation boundary towards infinity. We prove that this algorithm converges and even achieves optimal rates in terms of the number of degrees of freedom. We finally provide numerical examples illustrating our key theoretical findings.

math.NA

Adaptive boundary element methods for regularized combined field integral equations

While the exterior Helmholtz problem with Dirichlet boundary conditions is always well-posed, the associated standard boundary integral equations are not if the squared wavenumber agrees with an eigenvalue of the interior Dirichlet problem. Combined field integral equations are not affected by this spurious resonances but are essentially restricted to sufficiently smooth boundaries. For general Lipschitz domains, the latter integral equations are applicable through suitable regularization. Under fairly general assumptions on the regularizing operator, we propose {\sl a posteriori} computable error estimators for corresponding Galerkin boundary element methods of arbitrary polynomial degree. We show that adaptive mesh-refining algorithms steered by these local estimators converge at optimal algebraic rate with respect to the number of underlying boundary mesh elements. In particular, we consider mixed formulations involving the inverse Laplace--Beltrami as regularizing operator. Numerical examples highlight that in the vicinity of spurious resonances the proposed adaptive algorithm is significantly more performant when applied to the regularized combined field equation rather than the standard one.

math.NA

Aubin--Nitsche-type estimates for space-time FOSLS for parabolic PDEs

We develop Aubin--Nitsche-type estimates for recently proposed first-order system least-squares finite element methods (FOSLS) for the heat equation. Under certain assumptions, which are satisfied if the spatial domain is convex and the heat source and initial datum are sufficiently smooth, we prove that the $L^2$ error of approximations of the scalar field variable converges at a higher rate than the overall error. Furthermore, a higher-order conservation property is shown. In addition, we discuss quasi-optimality in weaker norms. Numerical experiments confirm our theoretical findings.

math.NA

Space-time FEM-BEM couplings for parabolic transmission problems

We develop couplings of a recent space-time first-order system least-squares (FOSLS) method for parabolic problems and space-time boundary element methods (BEM) for the heat equation to numerically solve a parabolic transmission problem on the full space and a finite time interval. In particular, we demonstrate coercivity of the couplings under certain restrictions and validate our theoretical findings by numerical experiments.

math.NA

Optimal convergence rates of an adaptive hybrid FEM-BEM method for full-space linear transmission problems

We consider a hybrid FEM-BEM method to compute approximations of full-space linear elliptic transmission problems. First, we derive a priori and a posteriori error estimates. Then, building on the latter, we present an adaptive algorithm and prove that it converges at optimal rates with respect to the number of mesh elements. Finally, we provide numerical experiments, demonstrating the practical performance of the adaptive algorithm.

math.NA

Inexpensive polynomial-degree-robust equilibrated flux a posteriori estimates for isogeometric analysis

We consider isogeometric discretizations of the Poisson model problem, focusing on high polynomial degrees and strong hierarchical refinements. We derive a posteriori error estimates by equilibrated fluxes, i.e., vector-valued mapped piecewise polynomials lying in the $\boldsymbol{H}({\rm div})$ space which appropriately approximate the desired divergence constraint. Our estimates are constant-free in the leading term, locally efficient, and robust with respect to the polynomial degree. They are also robust with respect to the number of hanging nodes arising in adaptive mesh refinement employing hierarchical B-splines. Two partitions of unity are designed, one with larger supports corresponding to the mapped splines, and one with small supports corresponding to mapped piecewise multilinear finite element hat basis functions. The equilibration is only performed on the small supports, avoiding the higher computational price of equilibration on the large supports or even the solution of a global system. Thus, the derived estimates are also as inexpensive as possible. An abstract framework for such a setting is developed, whose application to a specific situation only requests a verification of a few clearly identified assumptions. Numerical experiments illustrate the theoretical developments.

math.NA

Improved rates for a space-time FOSLS of parabolic PDEs

We consider the first-order system space-time formulation of the heat equation introduced in [Bochev, Gunzburger, Springer, New York (2009)], and analyzed in [F\"uhrer, Karkulik, Comput. Math. Appl. 92 (2021)] and [Gantner, Stevenson, ESAIM Math. Model. Numer. Anal.} 55 (2021)], with solution components $(u_1,{\bf u}_2)=(u,-\nabla_{\bf x} u)$. The corresponding operator is boundedly invertible between a Hilbert space $U$ and a Cartesian product of $L_2$-type spaces, which facilitates easy first-order system least-squares (FOSLS) discretizations. Besides $L_2$-norms of $\nabla_{\bf x} u_1$ and ${\bf u}_2$, the (graph) norm of $U$ contains the $L_2$-norm of $\partial_t u_1 +{\rm div}_{\bf x} {\bf u}_2$. When applying standard finite elements w.r.t. simplicial partitions of the space-time cylinder, estimates of the approximation error w.r.t. the latter norm require higher-order smoothness of ${\bf u}_2$. In experiments for both uniform and adaptively refined partitions, this manifested itself in disappointingly low convergence rates for non-smooth solutions $u$. In this paper, we construct finite element spaces w.r.t. prismatic partitions. They come with a quasi-interpolant that satisfies a near commuting diagram in the sense that, apart from some harmless term, the aforementioned error depends exclusively on the smoothness of $\partial_t u_1 +{\rm div}_{\bf x} {\bf u}_2$, i.e., of the forcing term $f=(\partial_t-\Delta_x)u$. Numerical results show significantly improved convergence rates.

math.NA

Applications of a space-time FOSLS formulation for parabolic PDEs

In this work, we show that the space-time first-order system least-squares (FOSLS) formulation [F\"uhrer, Karkulik, Comput. Math. Appl. 92 (2021)] for the heat equation and its recent generalization [Gantner, Stevenson, ESAIM Math. Model. Numer. Anal. 55 (2021)] to arbitrary second-order parabolic PDEs can be used to efficiently solve parameter-dependent problems, optimal control problems, and problems on time-dependent spatial domains.

math.NA

Adaptive BEM for elliptic PDE systems, part II: Isogeometric analysis with hierarchical B-splines for weakly-singular integral equations

We formulate and analyze an adaptive algorithm for isogeometric analysis with hierarchical B-splines for weakly-singular boundary integral equations. We prove that the employed weighted-residual error estimator is reliable and converges at optimal algebraic rate. Numerical experiments with isogeometric boundary elements for the 3D Poisson problem confirm the theoretical results, which also cover general elliptic systems like linear elasticity.

math.NA

A well-posed First Order System Least Squares formulation of the instationary Stokes equations

In this paper, a well-posed simultaneous space-time First Order System Least Squares formulation is constructed of the instationary incompressible Stokes equations with slip boundary conditions. As a consequence of this well-posedness, the minimization over any conforming triple of finite element spaces for velocities, pressure and stress tensor gives a quasi-best approximation from that triple. The formulation is practical in the sense that all norms in the least squares functional can be efficiently evaluated. Being of least squares type, the formulation comes with an efficient and reliable a posteriori error estimator. In addition, a priori error estimates are derived, and numerical results are presented.

math.NA