arXiv subjects

Roland Becker

Publications and source records attributed to Roland Becker.

11 recordsLinked to original sources

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↗

arXiv2025

Dual Weighted Residual-driven adaptive mesh refinement to enhance biomechanical simulations

This chapter describes how a posteriori error estimates targeting a user-defined quantity of interest, using the Dual Weighted Residual (DWR) technique, can be easily applied for biomechanical simulations in current engineering practice. The proposed method considers a very general setting that encompasses complex geometries, model non-linearities (hyperelasticity, fluid-structure interaction) and multi-goal oriented techniques. The developments are substantiated with some numerical tests.

math.NA↗

arXiv2024

Mapped coercivity for the stationary Navier-Stokes equations and their finite element approximations

This paper addresses the challenge of proving the existence of solutions for nonlinear equations in Banach spaces, focusing on the Navier-Stokes equations and discretizations of thom. Traditional methods, such as monotonicity-based approaches and fixed-point theorems, often face limitations in handling general nonlinear operators or finite element discretizations. A novel concept, mapped coercivity, provides a unifying framework to analyze nonlinear operators through a continuous mapping. We apply these ideas to saddle-point problems in Banach spaces, emphasizing both infinite-dimensional formulations and finite element discretizations. Our analysis includes stabilization techniques to restore coercivity in finite-dimensional settings, ensuring stability and existence of solutions. For linear problems, we explore the relationship between the inf-sup condition and mapped coercivity, using the Stokes equation as a case study. For nonlinear saddle-point systems, we extend the framework to mapped coercivity via surjective mappings, enabling concise proofs of existence of solutions for various stabilized Navier-Stokes finite element methods. These include Brezzi-Pitk\"aranta, a simple variant, and local projection stabilization (LPS) techniques, with extensions to convection-dominant flows. The proposed methodology offers a robust tool for analyzing nonlinear PDEs and their discretizations, bypassing traditional decompositions and providing a foundation for future developments in computational fluid dynamics.

math.NA↗

arXiv2024

A short perspective on a posteriori error control and adaptive discretizations

Error control by means of a posteriori error estimators or indica-tors and adaptive discretizations, such as adaptive mesh refinement, have emerged in the late seventies. Since then, numerous theoretical developments and improvements have been made, as well as the first attempts to introduce them into real-life industrial applications. The present introductory chapter provides an overview of the subject, highlights some of the achievements to date and discusses possible perspectives.

math.NA↗

arXiv2023

The concept of mapped coercivity for nonlinear operators in Banach spaces

We provide a concise proof of existence for nonlinear operator equations in separable Banach spaces. Notably, the operator is not assumed to be monotone. Instead, our main hypotheses consist of a continuity assumption and a generalized coercivity property. Mapped coercivity is a generalization of the usual coercivity property for nonlinear operators. In the case of linear operators, we recover linear coercivity and the traditional inf-sup condition. To illustrate the applicability of this general concept, we apply it to semi-linear elliptic problems and the Navier-Stokes equations.

math.AP↗

arXiv2022

Cost-optimal adaptive iterative linearized FEM for semilinear elliptic PDEs

We consider scalar semilinear elliptic PDEs where the nonlinearity is strongly monotone, but only locally Lipschitz continuous. We formulate an adaptive iterative linearized finite element method (AILFEM) which steers the local mesh refinement as well as the iterative linearization of the arising nonlinear discrete equations. To this end, we employ a damped Zarantonello iteration so that, in each step of the algorithm, only a linear Poisson-type equation has to be solved. We prove that the proposed AILFEM strategy guarantees convergence with optimal rates, where rates are understood with respect to the overall computational complexity (i.e., the computational time). Moreover, we formulate and test an adaptive algorithm where also the damping parameter of the Zarantonello iteration is adaptively adjusted. Numerical experiments underline the theoretical findings.

math.NA↗

arXiv2021

Goal-oriented adaptive finite element method for semilinear elliptic PDEs

We formulate and analyze a goal-oriented adaptive finite element method (GOAFEM) for a semilinear elliptic PDE and a linear goal functional. The strategy involves the finite element solution of a linearized dual problem, where the linearization is part of the adaptive strategy. Linear convergence and optimal algebraic convergence rates are shown.

math.NA↗

arXiv2021

Adaptive FEM for parameter-errors in elliptic linear-quadratic parameter estimation problems

We consider an elliptic linear-quadratic parameter estimation problem with a finite number of parameters. A novel a priori bound for the parameter error is proved and, based on this bound, an adaptive finite element method driven by an a posteriori error estimator is presented. Unlike prior results in the literature, our estimator, which is composed of standard energy error residual estimators for the state equation and suitable co-state problems, reflects the faster convergence of the parameter error compared to the (co)-state variables. We show optimal convergence rates of our method; in particular and unlike prior works, we prove that the estimator decreases with a rate that is the sum of the best approximation rates of the state and co-state variables. Experiments confirm that our method matches the convergence rate of the parameter error.

math.NA↗

arXiv2021

Goal-oriented adaptive finite element methods with optimal computational complexity

We consider a linear symmetric and elliptic PDE and a linear goal functional. We design and analyze a goal-oriented adaptive finite element method, which steers the adaptive mesh-refinement as well as the approximate solution of the arising linear systems by means of a contractive iterative solver like the optimally preconditioned conjugate gradient method or geometric multigrid. We prove linear convergence of the proposed adaptive algorithm with optimal algebraic rates. Unlike prior work, we do not only consider rates with respect to the number of degrees of freedom but even prove optimal complexity, i.e., optimal convergence rates with respect to the total computational cost.

math.NA↗

arXiv2020

Optimal convergence rates for goal-oriented FEM with quadratic goal functional

We consider a linear elliptic PDE and a quadratic goal functional. The goal-oriented adaptive FEM algorithm (GOAFEM) solves the primal as well as a dual problem, where the goal functional is always linearized around the discrete primal solution at hand. We show that the marking strategy proposed in [Feischl et al, SIAM J. Numer. Anal., 54 (2016)] for a linear goal functional is also optimal for quadratic goal functionals, i.e., GOAFEM leads to linear convergence with optimal convergence rates.

math.NA↗

arXiv2015

Finite element formulation of general boundary conditions for incompressible flows

We study the finite element formulation of general boundary conditions for incompressible flow problems. Distinguishing between the contributions from the inviscid and viscid parts of the equations, we use Nitsche's method to develop a discrete weighted weak formulation valid for all values of the viscosity parameter, including the limit case of the Euler equations. In order to control the discrete kinetic energy, additional consistent terms are introduced. We treat the limit case as a (degenerate) system of hyperbolic equations, using a balanced spectral decomposition of the flux Jacobian matrix, in analogy with compressible flows. Then, following the theory of Friedrich's systems, the natural characteristic boundary condition is generalized to the considered physical boundary conditions. Several numerical experiments, including standard benchmarks for viscous flows as well as inviscid flows are presented.

math.NA↗