5 citations · 12 across the 9 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.NA2023★ 3 cited
Optimal complexity of goal-oriented adaptive FEM for nonsymmetric linear elliptic PDEs
Philipp Bringmann, Maximilian Brunner, Dirk Praetorius +1
We analyze a goal-oriented adaptive algorithm that aims to efficiently compute the quantity of interest with a linear goal functional and the solution to…
math.NA2023★ 4 cited
On full linear convergence and optimal complexity of adaptive FEM with inexact solver
Philipp Bringmann, Michael Feischl, Ani Miraci +2
The ultimate goal of any numerical scheme for partial differential equations (PDEs) is to compute an approximation of user-prescribed accuracy at quasi-minimal computational time.…
math.NA2023
Scaling-robust built-in a posteriori error estimation for discontinuous least-squares finite element methods
Philipp Bringmann
A convincing feature of least-squares finite element methods is the built-in a posteriori error estimator for any conforming discretization. In order to generalize this property to…