EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Optimal Approximation of Unique Continuation

Erik Burman, Mihai Nechita, Lauri Oksanen

Foundations of Computational Mathematics · 2025-06 · 25 (3) · 1025-1045

DOI: 10.1007/s10208-024-09655-w ↗

Kurz gefasst

Fachartikel in der Zeitschrift Foundations of Computational Mathematics, online erschienen am 20.05.2024. Verfasst von Erik Burman und 2 weiteren Autor:innen. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 49 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Burman, E., Nechita, M., & Oksanen, L. (2025). Optimal Approximation of Unique Continuation. Foundations of Computational Mathematics, 25(3), 1025-1045. https://doi.org/10.1007/s10208-024-09655-w

Vancouver

Burman E, Nechita M, Oksanen L. Optimal Approximation of Unique Continuation. Foundations of Computational Mathematics. 2025;25(3):1025-1045. doi:10.1007/s10208-024-09655-w

BibTeX
@article{Burman2025,
  author = {Burman, Erik and Nechita, Mihai and Oksanen, Lauri},
  title = {Optimal Approximation of Unique Continuation},
  journal = {Foundations of Computational Mathematics},
  year = {2025},
  volume = {25},
  number = {3},
  pages = {1025--1045},
  doi = {10.1007/s10208-024-09655-w}
}
Kostenlos starten →