Johannes Pfefferer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Johannes Pfefferer has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Thomas Apel
Institute for Mathematics and Computer-Based Simulation Universität der Bundeswehr München Werner-Heisenberg-Weg 39 85577 Neubiberg Germany
11 shared publications - Max Winkler
Faculty of Mathematics, TU Chemnitz, Chemnitz, Germany
7 shared publications - Arnd Rösch
Fakultät für Mathematik, Universtät Duisburg-Essen, Essen, Germany
5 shared publications - Boris Vexler
Department of Mathematics School of Computation, Information and Technology Technical University of Munich Boltzmannstr. 3 Garching b. 85748 Munich Germany
4 shared publications - Harbir Antil
George Mason University
4 shared publications - Sergejs Rogovs
Institute for Applied Mathematics and Scientific Computing, Department of Aerospace Engineering, Universität der Bundeswehr München, Neubiberg, Germany
4 shared publications
Latest Publications
- Open Access
- 11 September 2025
- Published by Springer Nature in Numerische Mathematik
- p. 1-38
Numerical analysis for Dirichlet optimal control problems on convex polyhedral domains
In this paper error analysis for finite element discretizations of Dirichlet boundary control problems is developed. For the first time, optimal discretization error estimates are established in the case of three dimensional polyhedral and convex domains. The convergence rates solely depend on the size of largest interior edge angle. These results are comparable to those for the two dimensional case. However, the approaches from the two dimensional setting are not directly extendable such that new techniques have to be used. The theoretical results are confirmed by numerical experiments.
- 11 September 2025
- Published by Springer Nature in Numerische Mathematik
- p. 1-38
Open AccessNumerical analysis for Dirichlet optimal control problems on convex polyhedral domains
In this paper error analysis for finite element discretizations of Dirichlet boundary control problems is developed. For the first time, optimal discretization error estimates are established in the case of three dimensional polyhedral and convex domains. The convergence rates solely depend on the size of largest interior edge angle. These results are comparable to those for the two dimensional case. However, the approaches from the two dimensional setting are not directly extendable such that new techniques have to be used. The theoretical results are confirmed by numerical experiments.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematical Control and Related Fields
- Vol. 15 (4) , 1575-1601
Numerical analysis for Neumann optimal control problems on convex polyhedral domains
This paper is concerned with finite element error estimates for Neumann boundary control problems posed on convex and three dimensional polyhedral domains. Different discretization concepts are considered and optimal discretization error estimates are established for each. In particular, for a full discretization with piecewise linear and globally continuous functions for the control and standard linear finite elements for the state optimal convergence rates for the controls are proven which solely depend on the largest interior edge angle. To be more precise, below the critical edge angle of $ 2\pi/3 $, a convergence rate of two (times a log-factor) can be achieved for the discrete controls in the $ L^2 $-norm on the boundary. For larger interior edge angles the convergence rates are reduced depending on the size of these angles, which is due the impact of singular (domain dependent) terms in the solution. The results are comparable to those for the two dimensional case. However, new techniques in this context are used to prove the estimates on the boundary which also extend to the two dimensional case. Moreover, it is shown that the discrete states converge with a rate of two in the $ L^2 $-norm in the domain independent of the interior edge angles, i.e. for any convex and three dimensional polyhedral domain. It is remarkable that this not only holds for a full discretization using piecewise linear and globally continuous functions for the control, but also for a full discretization using piecewise constant functions for the control, where the discrete controls only converge with a rate of one in the $ L^2 $-norm on the boundary at best. At the end, the theoretical results are confirmed by several numerical experiments.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematical Control and Related Fields
- Vol. 15 (4) , 1575-1601
Numerical analysis for Neumann optimal control problems on convex polyhedral domains
This paper is concerned with finite element error estimates for Neumann boundary control problems posed on convex and three dimensional polyhedral domains. Different discretization concepts are considered and optimal discretization error estimates are established for each. In particular, for a full discretization with piecewise linear and globally continuous functions for the control and standard linear finite elements for the state optimal convergence rates for the controls are proven which solely depend on the largest interior edge angle. To be more precise, below the critical edge angle of $ 2\pi/3 $, a convergence rate of two (times a log-factor) can be achieved for the discrete controls in the $ L^2 $-norm on the boundary. For larger interior edge angles the convergence rates are reduced depending on the size of these angles, which is due the impact of singular (domain dependent) terms in the solution. The results are comparable to those for the two dimensional case. However, new techniques in this context are used to prove the estimates on the boundary which also extend to the two dimensional case. Moreover, it is shown that the discrete states converge with a rate of two in the $ L^2 $-norm in the domain independent of the interior edge angles, i.e. for any convex and three dimensional polyhedral domain. It is remarkable that this not only holds for a full discretization using piecewise linear and globally continuous functions for the control, but also for a full discretization using piecewise constant functions for the control, where the discrete controls only converge with a rate of one in the $ L^2 $-norm on the boundary at best. At the end, the theoretical results are confirmed by several numerical experiments.- Open Access
Numerical Analysis for Neumann Optimal Control Problems on Convex Polyhedral Domains
This paper is concerned with finite element error estimates for Neumann boundary control problems posed on convex and polyhedral domains. Different discretization concepts are considered and for each optimal discretization error estimates are established. In particular, for a full discretization with piecewise linear and globally continuous functions for the control and standard linear finite elements for the state optimal convergence rates for the controls are proven which solely depend on the largest interior edge angle. To be more precise, below the critical edge angle of $2π/3$, a convergence rate of two (times a log-factor) can be achieved for the discrete controls in the $L^2$-norm on the boundary. For larger interior edge angles the convergence rates are reduced depending on their size, which is due the impact of singular (domain dependent) terms in the solution. The results are comparable to those for the two dimensional case. However, new techniques in this context are used to prove the estimates on the boundary which also extend to the two dimensional case. Moreover, it is shown that the discrete states converge with a rate of two in the $L^2$-norm in the domain independent of the interior edge angles, i.e. for any convex and polyhedral domain. It is remarkable that this not only holds for a full discretization using piecewise linear and globally continuous functions for the control, but also for a full discretization using piecewise constant functions for the control, where the discrete controls only converge with a rate of one in the $L^2$-norm on the boundary at best. At the end, the theoretical results are confirmed by several numerical experiments.Open AccessNumerical Analysis for Neumann Optimal Control Problems on Convex Polyhedral Domains
This paper is concerned with finite element error estimates for Neumann boundary control problems posed on convex and polyhedral domains. Different discretization concepts are considered and for each optimal discretization error estimates are established. In particular, for a full discretization with piecewise linear and globally continuous functions for the control and standard linear finite elements for the state optimal convergence rates for the controls are proven which solely depend on the largest interior edge angle. To be more precise, below the critical edge angle of $2π/3$, a convergence rate of two (times a log-factor) can be achieved for the discrete controls in the $L^2$-norm on the boundary. For larger interior edge angles the convergence rates are reduced depending on their size, which is due the impact of singular (domain dependent) terms in the solution. The results are comparable to those for the two dimensional case. However, new techniques in this context are used to prove the estimates on the boundary which also extend to the two dimensional case. Moreover, it is shown that the discrete states converge with a rate of two in the $L^2$-norm in the domain independent of the interior edge angles, i.e. for any convex and polyhedral domain. It is remarkable that this not only holds for a full discretization using piecewise linear and globally continuous functions for the control, but also for a full discretization using piecewise constant functions for the control, where the discrete controls only converge with a rate of one in the $L^2$-norm on the boundary at best. At the end, the theoretical results are confirmed by several numerical experiments. - Open Access
Numerical Analysis for Dirichlet Optimal Control Problems on Convex Polyhedral Domains
In this paper error analysis for finite element discretizations of Dirichlet boundary control problems is developed. For the first time, optimal discretization error estimates are established in the case of three dimensional polyhedral and convex domains. The convergence rates solely depend on the size of largest interior edge angle. These results are comparable to those for the two dimensional case. However, the approaches from the two dimensional setting are not directly extendable such that new techniques have to be used. The theoretical results are confirmed by numerical experiments.
Open AccessNumerical Analysis for Dirichlet Optimal Control Problems on Convex Polyhedral Domains
In this paper error analysis for finite element discretizations of Dirichlet boundary control problems is developed. For the first time, optimal discretization error estimates are established in the case of three dimensional polyhedral and convex domains. The convergence rates solely depend on the size of largest interior edge angle. These results are comparable to those for the two dimensional case. However, the approaches from the two dimensional setting are not directly extendable such that new techniques have to be used. The theoretical results are confirmed by numerical experiments.
- 11 November 2022
- Published by Walter de Gruyter GmbH in Computational Methods in Applied Mathematics
- Vol. 23 (4) , 1007-1021
Finite Element Approximations for PDEs with Irregular Dirichlet Boundary Data on Boundary Concentrated Meshes
This paper is concerned with finite element error estimates for second order elliptic PDEs with inhomogeneous Dirichlet boundary data in convex polygonal domains. The Dirichlet boundary data are assumed to be irregular such that the solution of the PDE does not belong to but only to for some . As a consequence, a discretization of the PDE with linear finite elements exhibits a reduced convergence rate in and . In order to restore the best possible convergence rate we propose and analyze in detail the usage of boundary concentrated meshes. These meshes are gradually refined towards the whole boundary. The corresponding grading parameter does not only depend on the regularity of the Dirichlet boundary data and their discrete implementation but also on the norm, which is used to measure the error. In numerical experiments we confirm our theoretical results.- 11 November 2022
- Published by Walter de Gruyter GmbH in Computational Methods in Applied Mathematics
- Vol. 23 (4) , 1007-1021
Finite Element Approximations for PDEs with Irregular Dirichlet Boundary Data on Boundary Concentrated Meshes
This paper is concerned with finite element error estimates for second order elliptic PDEs with inhomogeneous Dirichlet boundary data in convex polygonal domains. The Dirichlet boundary data are assumed to be irregular such that the solution of the PDE does not belong to but only to for some . As a consequence, a discretization of the PDE with linear finite elements exhibits a reduced convergence rate in and . In order to restore the best possible convergence rate we propose and analyze in detail the usage of boundary concentrated meshes. These meshes are gradually refined towards the whole boundary. The corresponding grading parameter does not only depend on the regularity of the Dirichlet boundary data and their discrete implementation but also on the norm, which is used to measure the error. In numerical experiments we confirm our theoretical results.- 1 January 2021
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 59 (2) , 1161-1187
Risk-Averse Control of Fractional Diffusion with Uncertain Exponent
In this paper, we introduce and analyze a new class of optimal control problems constrained by elliptic equations with uncertain fractional exponents. We utilize risk measures to formulate the resu...
- 1 January 2021
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 59 (2) , 1161-1187
Risk-Averse Control of Fractional Diffusion with Uncertain Exponent
In this paper, we introduce and analyze a new class of optimal control problems constrained by elliptic equations with uncertain fractional exponents. We utilize risk measures to formulate the resu...
- 18 October 2019
- Published by Springer Nature in Numerische Mathematik
- Vol. 144 (1) , 133-156
Finite element error estimates in $L^2$ for regularized discrete approximations to the obstacle problem- 18 October 2019
- Published by Springer Nature in Numerische Mathematik
- Vol. 144 (1) , 133-156
Finite element error estimates in $L^2$ for regularized discrete approximations to the obstacle problem- 28 June 2019
- Published by Springer Nature
- p. 1-16
Superconvergent Graded Meshes for an Elliptic Dirichlet Control Problem
- 28 June 2019
- Published by Springer Nature
- p. 1-16
Superconvergent Graded Meshes for an Elliptic Dirichlet Control Problem
- 1 January 2019
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 57 (5) , 2043-2073
Finite Element Error Estimates for Normal Derivatives on Boundary Concentrated Meshes
This paper is concerned with approximations and related discretization error estimates for the normal derivatives of solutions of linear elliptic partial differential equations. In order to illustr...
- 1 January 2019
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 57 (5) , 2043-2073
Finite Element Error Estimates for Normal Derivatives on Boundary Concentrated Meshes
This paper is concerned with approximations and related discretization error estimates for the normal derivatives of solutions of linear elliptic partial differential equations. In order to illustr...
- 14 December 2018
- Published by Oxford University Press (OUP) in IMA Journal of Numerical Analysis
- Vol. 40 (1) , 474-497
Maximum norm error estimates for Neumann boundary value problems on graded meshes
This paper deals with a priori pointwise error estimates for the finite element solution of boundary value problems with Neumann boundary conditions in polygonal domains. Due to the corners of the domain, the convergence rate of the numerical solutions can be lower than in the case of smooth domains. As a remedy, the use of local mesh refinement near the corners is considered. In order to prove quasi-optimal a priori error estimates, regularity results in weighted Sobolev spaces are exploited. This is the first work on the Neumann boundary value problem where both the regularity of the data is exactly specified and the sharp convergence order $h^{2} \lvert \ln h \rvert $ in the case of piecewise linear finite element approximations is obtained. As an extension we show the same rate for the approximate solution of a semilinear boundary value problem. The proof relies in this case on the supercloseness between the Ritz projection to the continuous solution and the finite element solution.- 14 December 2018
- Published by Oxford University Press (OUP) in IMA Journal of Numerical Analysis
- Vol. 40 (1) , 474-497
Maximum norm error estimates for Neumann boundary value problems on graded meshes
This paper deals with a priori pointwise error estimates for the finite element solution of boundary value problems with Neumann boundary conditions in polygonal domains. Due to the corners of the domain, the convergence rate of the numerical solutions can be lower than in the case of smooth domains. As a remedy, the use of local mesh refinement near the corners is considered. In order to prove quasi-optimal a priori error estimates, regularity results in weighted Sobolev spaces are exploited. This is the first work on the Neumann boundary value problem where both the regularity of the data is exactly specified and the sharp convergence order $h^{2} \lvert \ln h \rvert $ in the case of piecewise linear finite element approximations is obtained. As an extension we show the same rate for the approximate solution of a semilinear boundary value problem. The proof relies in this case on the supercloseness between the Ritz projection to the continuous solution and the finite element solution.