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.

Authors

Institutions

Publication Details

Journal
Mathematics of Computation
Published
2026-01-15
DOI
https://doi.org/10.1090/mcom/4162
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On inf-sup stability and optimal convergence of the quasi-reversibility method for unique continuation subject to Poisson’s equation

Erik Burman, Mingfei Lu
Mathematics of Computation
Advanced Numerical Methods in Computational Mathematics
article

On inf-sup stability and optimal convergence of the quasi-reversibility method for unique continuation subject to Poisson’s equation

Erik Burman, Mingfei Lu
article en

Abstract

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.

Mathematics of Computation
University College London (GB)
Openalex Percentile: Top 86%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

On inf-sup stability and optimal convergence of the quasi-reversibility method for unique continuation subject to Poisson’s equation — Erik Burman, Mingfei Lu · Mathematics of Computation (2026) | TGRS Research Map | TGRS