Loading [MathJax]/jax/output/HTML-CSS/config.js

Optimal approximation of unique continuation

Abstract

We consider numerical approximations of ill-posed elliptic problems with conditional stability. The notion of optimal error estimates is defined including both convergence with respect to discretisation and perturbations in data. The rate of convergence is determined by the conditional stability of the underlying continuous problem and the polynomial order of the approximation space. A proof is given that no approximation can converge at a better rate than that given by the definition without increasing the sensitivity to perturbations, thus justifying the concept. A recently introduced class of primal-dual finite element methods with weakly consistent regularisation is recalled and the associated error estimates are shown to be optimal in the sense of this definition.

Authors

Erik Burman
Department of Mathematics, University College London, London, WC1E 6BT, UK

Mihai Nechita
Tiberiu Popoviciu Institute of Numerical Analysis, Romanian Academy, Cluj-Napoca, Romania
Department of Mathematics, Babeṣ-Bolyai University, Cluj-Napoca, Romania

Lauri Oksanen
Department of Mathematics and Statistics, University of Helsinki, P.O. 68, 00014, Helsinki, Finland

Keywords

Unique continuation; Ill-posed problems; Conditional stability; Approximation methods; Finite element methods; Stabilised methods; Regularisation; Error estimates; Optimality; Optimal convergence

Paper coordinates

E. Burman, M. Nechita, L. Oksanen, Optimal approximation of unique continuation. Found. Comput. Math. (2024). https://doi.org/10.1007/s10208-024-09655-w

PDF

About this paper

Journal

Foundations of Computational Mathematics

Publisher Name
Print ISSN
Online ISSN

google scholar link

2024

Related Posts