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

03/30/2020
by   Roland Becker, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/13/2021

Goal-oriented adaptive finite element method for semilinear elliptic PDEs

We formulate and analyze a goal-oriented adaptive finite element method ...
research
01/13/2022

Non-simplicial Delaunay meshing via approximation by radical partitions

We consider the construction of a polyhedral Delaunay partition as a lim...
research
08/19/2022

Goal-oriented adaptive multilevel stochastic Galerkin FEM

This paper is concerned with the numerical approximation of quantities o...
research
02/21/2020

Source Conditions for non-quadratic Tikhonov Regularisation

In this paper we consider convex Tikhonov regularisation for the solutio...
research
06/20/2014

Towards A Deeper Geometric, Analytic and Algorithmic Understanding of Margins

Given a matrix A, a linear feasibility problem (of which linear classifi...
research
02/06/2023

Contact problems in porous media

The Biot problem of poroelasticity is extended by Signorini contact cond...
research
01/24/2019

SAGA with Arbitrary Sampling

We study the problem of minimizing the average of a very large number of...

Please sign up or login with your details

Forgot password? Click here to reset