Joscha Gedicke
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
Joscha Gedicke has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Susanne Cecelia Brenner
Louisiana State University, Baton Rouge, USA
5 shared publications - Arbaz Khan
Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee 247667, India
4 shared publications - Carsten Carstensen
Institut für Mathematik, Humboldt-Universität zu Berlin, Berlin, Germany
4 shared publications Carsten Carstensen
3 shared publications- Carsten Carstensen
Department of Mathematics, Humboldt-Universität zu Berlin, Berlin, Germany
3 shared publications - Lorenzo Mascotto
Dipartimento di Matematica e Applicazioni, Università degli Studi di Milano-Bicocca, Milan, Italy
3 shared publications
Latest Publications
- Open Access
- 26 December 2025
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 481
Memory - and compute-optimized geometric multigrid GMGPolar for curvilinear coordinate representations – Applications to fusion plasma
- 26 December 2025
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 481
Open AccessMemory - and compute-optimized geometric multigrid GMGPolar for curvilinear coordinate representations – Applications to fusion plasma
- Open Access
A generalized Hessian-based error estimator for an IPDG formulation of the biharmonic problem in two dimensions
We consider a two dimensional biharmonic problem and its discretization by means of a symmetric interior penalty discontinuous Galerkin method. Based on the "div-div" complex, a novel split of an error measure based on a generalized Hessian into two terms measuring the conformity and nonconformity of the scheme is proven. This splitting is the departing point for the design of a new reliable and efficient error estimator, which does not involve any DG stabilization. Such an error estimator can be bounded from above by the standard DG residual error estimator. Numerical results assess the theoretical predictions, including the efficiency of the proposed estimator.
Open AccessA generalized Hessian-based error estimator for an IPDG formulation of the biharmonic problem in two dimensions
We consider a two dimensional biharmonic problem and its discretization by means of a symmetric interior penalty discontinuous Galerkin method. Based on the "div-div" complex, a novel split of an error measure based on a generalized Hessian into two terms measuring the conformity and nonconformity of the scheme is proven. This splitting is the departing point for the design of a new reliable and efficient error estimator, which does not involve any DG stabilization. Such an error estimator can be bounded from above by the standard DG residual error estimator. Numerical results assess the theoretical predictions, including the efficiency of the proposed estimator.
- 15 February 2023
- Published by Walter de Gruyter GmbH in Computational Methods in Applied Mathematics
- Vol. 23 (3) , 565-589
A Symmetric Interior Penalty Method for an Elliptic Distributed Optimal Control Problem with Pointwise State Constraints
We construct a symmetric interior penalty method for an elliptic distributed optimal control problem with pointwise state constraints on general polygonal domains. The resulting discrete problems are quadratic programs with simple box constraints that can be solved efficiently by a primal-dual active set algorithm. Both theoretical analysis and corroborating numerical results are presented.
- 15 February 2023
- Published by Walter de Gruyter GmbH in Computational Methods in Applied Mathematics
- Vol. 23 (3) , 565-589
A Symmetric Interior Penalty Method for an Elliptic Distributed Optimal Control Problem with Pointwise State Constraints
We construct a symmetric interior penalty method for an elliptic distributed optimal control problem with pointwise state constraints on general polygonal domains. The resulting discrete problems are quadratic programs with simple box constraints that can be solved efficiently by a primal-dual active set algorithm. Both theoretical analysis and corroborating numerical results are presented.
- Open Access
Adaptive virtual element methods with equilibrated fluxes
We present an hp-adaptive virtual element method (VEM) based on the hypercircle method of Prager and Synge for the approximation of solutions to diffusion problems. We introduce a reliable and efficient a posteriori error estimator, which is computed by solving an auxiliary global mixed problem. We show that the mixed VEM satisfies a discrete inf-sup condition, with inf-sup constant independent of the discretization parameters. Furthermore, we construct a stabilization for the mixed VEM, with explicit bounds in terms of the local degree of accuracy of the method. The theoretical results are supported by several numerical experiments, including a comparison with the residual a posteriori error estimator. The numerics exhibit the p-robustness of the proposed error estimator. In addition, we provide a first step towards the localized flux reconstruction in the virtual element framework, which leads to an additional reliable a posteriori error estimator that is computed by solving local (cheap-to-solve and parallelizable) mixed problems. We provide theoretical and numerical evidence that the proposed local error estimator suffers from a lack of efficiency.
Open AccessAdaptive virtual element methods with equilibrated fluxes
We present an hp-adaptive virtual element method (VEM) based on the hypercircle method of Prager and Synge for the approximation of solutions to diffusion problems. We introduce a reliable and efficient a posteriori error estimator, which is computed by solving an auxiliary global mixed problem. We show that the mixed VEM satisfies a discrete inf-sup condition, with inf-sup constant independent of the discretization parameters. Furthermore, we construct a stabilization for the mixed VEM, with explicit bounds in terms of the local degree of accuracy of the method. The theoretical results are supported by several numerical experiments, including a comparison with the residual a posteriori error estimator. The numerics exhibit the p-robustness of the proposed error estimator. In addition, we provide a first step towards the localized flux reconstruction in the virtual element framework, which leads to an additional reliable a posteriori error estimator that is computed by solving local (cheap-to-solve and parallelizable) mixed problems. We provide theoretical and numerical evidence that the proposed local error estimator suffers from a lack of efficiency.
- Open Access
Adaptive virtual elements based on hybridized, reliable, and efficient flux reconstructions
We present two a posteriori error estimators for the virtual element method (VEM) based on global and local flux reconstruction in the spirit of [5]. The proposed error estimators are reliable and efficient for the $h$-, $p$-, and $hp$-versions of the VEM. This solves a partial limitation of our former approach in [6], which was based on solving local nonhybridized mixed problems. Differently from the finite element setting, the proof of the efficiency turns out to be simpler, as the flux reconstruction in the VEM does not require the existence of polynomial, stable, divergence right-inverse operators. Rather, we only need to construct right-inverse operators in virtual element spaces, exploiting only the implicit definition of virtual element functions. The theoretical results are validated by some numerical experiments on a benchmark problem.
Open AccessAdaptive virtual elements based on hybridized, reliable, and efficient flux reconstructions
We present two a posteriori error estimators for the virtual element method (VEM) based on global and local flux reconstruction in the spirit of [5]. The proposed error estimators are reliable and efficient for the $h$-, $p$-, and $hp$-versions of the VEM. This solves a partial limitation of our former approach in [6], which was based on solving local nonhybridized mixed problems. Differently from the finite element setting, the proof of the efficiency turns out to be simpler, as the flux reconstruction in the VEM does not require the existence of polynomial, stable, divergence right-inverse operators. Rather, we only need to construct right-inverse operators in virtual element spaces, exploiting only the implicit definition of virtual element functions. The theoretical results are validated by some numerical experiments on a benchmark problem.
- 1 January 2021
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 59 (4) , 2237-2253
A Polynomial-Degree-Robust A Posteriori Error Estimator for Nédélec Discretizations of Magnetostatic Problems
We present an equilibration-based a posteriori error estimator for Nédélec element discretizations of the magnetostatic problem. The estimator is obtained by adding a gradient correction to the est...
- 1 January 2021
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 59 (4) , 2237-2253
A Polynomial-Degree-Robust A Posteriori Error Estimator for Nédélec Discretizations of Magnetostatic Problems
We present an equilibration-based a posteriori error estimator for Nédélec element discretizations of the magnetostatic problem. The estimator is obtained by adding a gradient correction to the est...
- Open Access
- 26 December 2019
- Published by Springer Nature in Numerische Mathematik
- Vol. 144 (3) , 585-614
Divergence-conforming discontinuous Galerkin finite elements for Stokes eigenvalue problems
In this paper, we present a divergence-conforming discontinuous Galerkin finite element method for Stokes eigenvalue problems. We prove a priori error estimates for the eigenvalue and eigenfunction errors and present a residual based a posteriori error estimator. The a posteriori error estimator is proven to be reliable and (locally) efficient. We finally present some numerical examples that verify the a priori convergence rates and the reliability and efficiency of the residual based a posteriori error estimator.
- 26 December 2019
- Published by Springer Nature in Numerische Mathematik
- Vol. 144 (3) , 585-614
Open AccessDivergence-conforming discontinuous Galerkin finite elements for Stokes eigenvalue problems
In this paper, we present a divergence-conforming discontinuous Galerkin finite element method for Stokes eigenvalue problems. We prove a priori error estimates for the eigenvalue and eigenfunction errors and present a residual based a posteriori error estimator. The a posteriori error estimator is proven to be reliable and (locally) efficient. We finally present some numerical examples that verify the a priori convergence rates and the reliability and efficiency of the residual based a posteriori error estimator.
- Open Access
Benchmark computation of eigenvalues with large defect for non-selfadjoint elliptic differential operators
In this paper we present benchmark problems for non-selfadjoint elliptic eigenvalue problems with large defect and ascent. We describe the derivation of the benchmark problem with a discontinuous coefficient and mixed boundary conditions. Numerical experiments are performed to investigate the convergence of a Galerkin finite element method with respect to the discretization parameters, the regularity of the problem, and the ascent of the eigenvalue. This allows us to verify the sharpness of the theoretical estimates from the literature with respect to these parameters. We provide numerical evidence about the size of the ascent and show that it is important to consider the mean value for the eigenvalue approximation.
Open AccessBenchmark computation of eigenvalues with large defect for non-selfadjoint elliptic differential operators
In this paper we present benchmark problems for non-selfadjoint elliptic eigenvalue problems with large defect and ascent. We describe the derivation of the benchmark problem with a discontinuous coefficient and mixed boundary conditions. Numerical experiments are performed to investigate the convergence of a Galerkin finite element method with respect to the discretization parameters, the regularity of the problem, and the ascent of the eigenvalue. This allows us to verify the sharpness of the theoretical estimates from the literature with respect to these parameters. We provide numerical evidence about the size of the ascent and show that it is important to consider the mean value for the eigenvalue approximation.
- Open Access
- 28 February 2019
- Published by Springer Nature in Numerische Mathematik
- Vol. 142 (2) , 205-234
Residual-based a posteriori error analysis for symmetric mixed Arnold–Winther FEM
- 28 February 2019
- Published by Springer Nature in Numerische Mathematik
- Vol. 142 (2) , 205-234
Open AccessResidual-based a posteriori error analysis for symmetric mixed Arnold–Winther FEM
- Open Access
Robust adaptive hp discontinuous Galerkin finite element methods for the Helmholtz equation
This paper presents an $hp$ a posteriori error analysis for the 2D Helmholtz equation that is robust in the polynomial degree $p$ and the wave number $k$. For the discretization, we consider a discontinuous Galerkin formulation that is unconditionally well posed. The a posteriori error analysis is based on the technique of equilibrated fluxes applied to a shifted Poisson problem, with the error due to the nonconformity of the discretization controlled by a potential reconstruction. We prove that the error estimator is both reliable and efficient, under the condition that the initial mesh size and polynomial degree is chosen such that the discontinuous Galerkin formulation converges, i.e., it is out of the regime of pollution. We confirm the efficiency of an $hp$-adaptive refinement strategy based on the presented robust a posteriori error estimator via several numerical examples.Open AccessRobust adaptive hp discontinuous Galerkin finite element methods for the Helmholtz equation
This paper presents an $hp$ a posteriori error analysis for the 2D Helmholtz equation that is robust in the polynomial degree $p$ and the wave number $k$. For the discretization, we consider a discontinuous Galerkin formulation that is unconditionally well posed. The a posteriori error analysis is based on the technique of equilibrated fluxes applied to a shifted Poisson problem, with the error due to the nonconformity of the discretization controlled by a potential reconstruction. We prove that the error estimator is both reliable and efficient, under the condition that the initial mesh size and polynomial degree is chosen such that the discontinuous Galerkin formulation converges, i.e., it is out of the regime of pollution. We confirm the efficiency of an $hp$-adaptive refinement strategy based on the presented robust a posteriori error estimator via several numerical examples.