Erik Burman
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
Erik Burman has a total of 145 co-authors. Here are the top co-authors by number of shared publications:
- Peter Hansbo
Department of Mechanical Engineering, Jönköping University, 551 11 Jönköping, Sweden
33 shared publications - Mats G. Larson
Department of Mathematics and Mathematical Statistics, Umeå University, Umeå, Sweden
28 shared publications - Lauri Oksanen
University of Helsinki
22 shared publications Peter Hansbo
17 shared publicationsAlexandre Ern
CERMICS, ENPC, Institut Polytechnique de Paris, 77455 Marne-la-Vallee cedex, France and Inria Paris, 48 rue Barrault 75647 Paris, France
12 shared publications- Johnny Guzmán
Division of Applied Mathematics , Brown University , Box F, 182 George Street , Providence , RI 02912 , USA
12 shared publications
Latest Publications
- 29 October 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM/ASA Journal on Uncertainty Quantification
- Vol. 14 (4) , 1530-1562
Posterior Contraction Rates of Computational Methods for Bayesian Data Assimilation
In this paper, we analyze posterior consistency of a Bayesian data assimilation problem under discretization. We prove convergence rates for the discrete posterior to the ground truth solution under both conforming discretization and finite element discretization (usually nonconforming). The analysis is based on the coupling of asymptotics between the number of samples and the dimension of discrete spaces. In the finite element discretization, tailor-made discrete priors, instead of the discretization of continuous priors, are used to generate posterior contraction.
- 29 October 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM/ASA Journal on Uncertainty Quantification
- Vol. 14 (4) , 1530-1562
Posterior Contraction Rates of Computational Methods for Bayesian Data Assimilation
In this paper, we analyze posterior consistency of a Bayesian data assimilation problem under discretization. We prove convergence rates for the discrete posterior to the ground truth solution under both conforming discretization and finite element discretization (usually nonconforming). The analysis is based on the coupling of asymptotics between the number of samples and the dimension of discrete spaces. In the finite element discretization, tailor-made discrete priors, instead of the discretization of continuous priors, are used to generate posterior contraction.
- 10 June 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (6) , 065004
Primal-dual finite element methods for the direct reconstruction of material coefficients in stationary elliptic problems
We revisit the direct method for reconstructing coefficients in second-order elliptic partial differential equations. Two model problems are considered: first, the reconstruction of the diffusion coefficient in a scalar elliptic problem, and second, the reconstruction of the shear modulus in the elastography problem. To highlight the versatility of the framework, different notions of stability are exploited in the two situations. In the scalar case, the system is interpreted as a hyperbolic transport equation and an inf-sup condition on the discrete level is leveraged for the analysis of the numerical method. We obtain error estimates on the reconstruction coefficient that are suboptimal by half an order, which is known to be sharp on general meshes. In the vector case, the minimization of the residual in dual norm and a stability result on the continuous problem lead to error estimates that are optimal compared to the approximation. For both problems, the theoretical results are illustrated by some numerical examples.
- 10 June 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (6) , 065004
Primal-dual finite element methods for the direct reconstruction of material coefficients in stationary elliptic problems
We revisit the direct method for reconstructing coefficients in second-order elliptic partial differential equations. Two model problems are considered: first, the reconstruction of the diffusion coefficient in a scalar elliptic problem, and second, the reconstruction of the shear modulus in the elastography problem. To highlight the versatility of the framework, different notions of stability are exploited in the two situations. In the scalar case, the system is interpreted as a hyperbolic transport equation and an inf-sup condition on the discrete level is leveraged for the analysis of the numerical method. We obtain error estimates on the reconstruction coefficient that are suboptimal by half an order, which is known to be sharp on general meshes. In the vector case, the minimization of the residual in dual norm and a stability result on the continuous problem lead to error estimates that are optimal compared to the approximation. For both problems, the theoretical results are illustrated by some numerical examples.
- Open Access
- 29 May 2026
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 460
Solving inverse parametrized problems via finite elements and extreme learning networks
- 29 May 2026
- Published by Elsevier in Computer Methods in Applied Mechanics and Engineering
- Vol. 460
Open AccessSolving inverse parametrized problems via finite elements and extreme learning networks
- Open Access
Convergence Analysis for the Recovery of the Friction Threshold in a Scalar Tresca Model
We consider a scalar valued elliptic partial differential equation on a sufficiently smooth domain $Ω$, subject to a regularized Tresca friction-type boundary condition on a subset $Γ$ of $\partial Ω$. The friction threshold, a positive function appearing in this boundary condition, is assumed to be unknown and serves as the coefficient to be recovered in our inverse problem. Assuming that (i) the friction threshold lies in a finite dimensional space with known basis functions, (ii) the right hand sides of the partial differential equation are known, and (iii) the solution to the partial differential equation on some small open subset $ω\subset Ω$ is available, we develop an iterative computational method for the recovery of the friction threshold. This algorithm is simple to implement and is based on piecewise linear finite elements. We show that the proposed algorithm converges in second order to a function $a_h$ and, moreover, that $a_h$ converges in second order in the finite element's mesh size $h$ to the true (unknown) friction threshold. We highlight our theoretical results by simulations that confirm our rates numerically.Open AccessConvergence Analysis for the Recovery of the Friction Threshold in a Scalar Tresca Model
We consider a scalar valued elliptic partial differential equation on a sufficiently smooth domain $Ω$, subject to a regularized Tresca friction-type boundary condition on a subset $Γ$ of $\partial Ω$. The friction threshold, a positive function appearing in this boundary condition, is assumed to be unknown and serves as the coefficient to be recovered in our inverse problem. Assuming that (i) the friction threshold lies in a finite dimensional space with known basis functions, (ii) the right hand sides of the partial differential equation are known, and (iii) the solution to the partial differential equation on some small open subset $ω\subset Ω$ is available, we develop an iterative computational method for the recovery of the friction threshold. This algorithm is simple to implement and is based on piecewise linear finite elements. We show that the proposed algorithm converges in second order to a function $a_h$ and, moreover, that $a_h$ converges in second order in the finite element's mesh size $h$ to the true (unknown) friction threshold. We highlight our theoretical results by simulations that confirm our rates numerically. - 15 January 2026
- Published by American Mathematical Society (AMS) in Mathematics of Computation
On inf-sup stability and optimal convergence of the quasi-reversibility method for unique continuation subject to Poisson’s equation
In this paper, we develop a framework for the discretization of a mixed formulation of quasi-reversibility methods for ill-posed problems with respect to Poisson’s equations. By carefully choosing test and trial spaces, a formulation that is stable in a certain residual norm is obtained. Numerical stability and optimal convergence are established based on the conditional stability property of the problem. Tikhonov regularization is necessary for high-order polynomial approximation, but its weak consistency may be tuned to allow for optimal convergence. For low-order elements, a simple numerical scheme with optimal convergence is obtained without stabilization. We also provide a guideline for feasible pairs of finite element spaces that satisfy suitable stability assumptions. Numerical experiments are provided to illustrate the theoretical results.
- 15 January 2026
- Published by American Mathematical Society (AMS) in Mathematics of Computation
On inf-sup stability and optimal convergence of the quasi-reversibility method for unique continuation subject to Poisson’s equation
In this paper, we develop a framework for the discretization of a mixed formulation of quasi-reversibility methods for ill-posed problems with respect to Poisson’s equations. By carefully choosing test and trial spaces, a formulation that is stable in a certain residual norm is obtained. Numerical stability and optimal convergence are established based on the conditional stability property of the problem. Tikhonov regularization is necessary for high-order polynomial approximation, but its weak consistency may be tuned to allow for optimal convergence. For low-order elements, a simple numerical scheme with optimal convergence is obtained without stabilization. We also provide a guideline for feasible pairs of finite element spaces that satisfy suitable stability assumptions. Numerical experiments are provided to illustrate the theoretical results.
- Open Access
- 27 October 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 102 (4) , 1-9
Correction: Estimates of discrete time derivatives for the parabolic-parabolic Robin-Robin coupling method
- 27 October 2025
- Published by Springer Nature in Numerical Algorithms
- Vol. 102 (4) , 1-9
Open AccessCorrection: Estimates of discrete time derivatives for the parabolic-parabolic Robin-Robin coupling method
- Open Access
Primal-dual finite element methods for the direct reconstruction of material coefficients in stationary elliptic problems
We revisit the direct method for the reconstruction of coefficients in second order elliptic partial differential equations. Two model problems are considered: first the reconstruction of the diffusion coefficient in a scalar elliptic problem and second the reconstruction of the shear modulus in the elastography problem. To highlight the versatility of the framework, different notions of stability are exploited in the two situations. In the scalar case, the system is interpreted as a hyperbolic transport equation and an inf-sup condition on the discrete level is leveraged for the analysis of the numerical method. We obtain error estimates on the reconstruction coefficient that are suboptimal by half an order, which is known to be sharp on general meshes. In the vector case, the minimization of the residual in dual norm and a stability result on the continuous problem lead to error estimates that are optimal compared to the approximation. For both problems, the theoretical results are illustrated by some numerical examples.
Open AccessPrimal-dual finite element methods for the direct reconstruction of material coefficients in stationary elliptic problems
We revisit the direct method for the reconstruction of coefficients in second order elliptic partial differential equations. Two model problems are considered: first the reconstruction of the diffusion coefficient in a scalar elliptic problem and second the reconstruction of the shear modulus in the elastography problem. To highlight the versatility of the framework, different notions of stability are exploited in the two situations. In the scalar case, the system is interpreted as a hyperbolic transport equation and an inf-sup condition on the discrete level is leveraged for the analysis of the numerical method. We obtain error estimates on the reconstruction coefficient that are suboptimal by half an order, which is known to be sharp on general meshes. In the vector case, the minimization of the residual in dual norm and a stability result on the continuous problem lead to error estimates that are optimal compared to the approximation. For both problems, the theoretical results are illustrated by some numerical examples.
- Open Access
Unique continuation for the wave equation: the stability landscape
We consider a unique continuation problem for the wave equation given data in a volumetric subset of the space time domain. In the absence of data on the lateral boundary of the space-time cylinder we prove that the solution can be continued with Hölder stability into a certain proper subset of the space-time domain. Additionally, we show that unique continuation of the solution to the entire space-time cylinder with Lipschitz stability is possible given the knowledge of a suitable finite dimensional space in which the trace of the solution on the lateral boundary is contained. These results allow us to design a finite element method that provably converges to the exact solution at a rate that mirrors the stability properties of the continuous problem.
Open AccessUnique continuation for the wave equation: the stability landscape
We consider a unique continuation problem for the wave equation given data in a volumetric subset of the space time domain. In the absence of data on the lateral boundary of the space-time cylinder we prove that the solution can be continued with Hölder stability into a certain proper subset of the space-time domain. Additionally, we show that unique continuation of the solution to the entire space-time cylinder with Lipschitz stability is possible given the knowledge of a suitable finite dimensional space in which the trace of the solution on the lateral boundary is contained. These results allow us to design a finite element method that provably converges to the exact solution at a rate that mirrors the stability properties of the continuous problem.
- Open Access
- 6 October 2025
- Published by Springer Nature in Numerische Mathematik
- Vol. 157 (6) , 2017-2054
A nonconforming finite element method for data assimilation subject to the transient Stokes problem
In this study, we will consider the unique continuation problem for reconstructing the final state of the transient Stokes problem when the initial data is unknown, but additional data is given in a subdomain in space-time. The backward differentiation method is used to discretise the time derivative and standard nonconforming affine finite element approximation is applied for the discretisation in space. The discrete system is regularized by adding a penalty of the $$H^1$$ -semi-norm of the initial data, scaled with the mesh parameter. The scaling is chosen so that an optimal error estimate holds in $$L^2(T_1,T;H^1(\Omega ))$$ , $$T_1>0$$ . The estimate is derived using the Lipschitz stability of the reconstruction problem and interpolation between discrete spaces. The theory is validated on some numerical examples.- 6 October 2025
- Published by Springer Nature in Numerische Mathematik
- Vol. 157 (6) , 2017-2054
Open AccessA nonconforming finite element method for data assimilation subject to the transient Stokes problem
In this study, we will consider the unique continuation problem for reconstructing the final state of the transient Stokes problem when the initial data is unknown, but additional data is given in a subdomain in space-time. The backward differentiation method is used to discretise the time derivative and standard nonconforming affine finite element approximation is applied for the discretisation in space. The discrete system is regularized by adding a penalty of the $$H^1$$ -semi-norm of the initial data, scaled with the mesh parameter. The scaling is chosen so that an optimal error estimate holds in $$L^2(T_1,T;H^1(\Omega ))$$ , $$T_1>0$$ . The estimate is derived using the Lipschitz stability of the reconstruction problem and interpolation between discrete spaces. The theory is validated on some numerical examples. - 27 September 2025
- Published by World Scientific Pub Co Pte Ltd in Mathematical Models and Methods in Applied Sciences
- Vol. 35 (14) , 2977-3009
A stabilized hybridized Nitsche method for sign-changing elliptic PDEs
In this paper, we present and analyze a stabilized hybridized Nitsche method for elliptic problems with sign-changing coefficients without imposing symmetry assumptions on the mesh around the material interfaces. The use of a stabilized primal-dual formulation allows us to cope with the sign-changing nature of the problem and to prove optimal error estimates under two assumptions on the continuous problem, namely that it admits a unique solution and that the contrast at the sign-changing interface lies outside a certain critical interval. The method can be used on arbitrary shape-regular meshes (fitted to material interfaces) and yields optimal convergence rates for smooth solutions. As an illustration, the method is applied to simulate a realistic acoustic cloaking device.
- 27 September 2025
- Published by World Scientific Pub Co Pte Ltd in Mathematical Models and Methods in Applied Sciences
- Vol. 35 (14) , 2977-3009
A stabilized hybridized Nitsche method for sign-changing elliptic PDEs
In this paper, we present and analyze a stabilized hybridized Nitsche method for elliptic problems with sign-changing coefficients without imposing symmetry assumptions on the mesh around the material interfaces. The use of a stabilized primal-dual formulation allows us to cope with the sign-changing nature of the problem and to prove optimal error estimates under two assumptions on the continuous problem, namely that it admits a unique solution and that the contrast at the sign-changing interface lies outside a certain critical interval. The method can be used on arbitrary shape-regular meshes (fitted to material interfaces) and yields optimal convergence rates for smooth solutions. As an illustration, the method is applied to simulate a realistic acoustic cloaking device.