Search arXiv⌕ Search

arXiv · 2610.39750

A Transfer Principle for Elliptic Carleman Estimates: Application to Discrete Calderón Stability

Abstract

We develop a transfer principle that lifts continuous elliptic Carleman estimates to mesh-uniform estimates for conforming Galerkin discretizations. The main difficulties are twofold: discrete states generally lack the \(H^2\)-regularity required by the continuous estimate, and the Carleman parameter \(s\) must be controlled relative to the mesh size \(h\). We overcome both by introducing a shifted continuous problem whose Galerkin solution is exactly the conforming reconstruction of a prescribed discrete state. Weighted approximation then transfers the inequality back to the original discrete operator without adding stabilization, and yields the range \(s\le ch^{-4/5}\) for radial weights. We verify the framework for piecewise affine finite elements with consistent or lumped mass on fitted, uniformly shape-regular meshes, and for standard Cartesian finite differences through their finite-element realization. As an application, we study the discrete Calderón problem for bounded complex Schrödinger potentials in dimension \(d\ge3\). Assuming agreement in a fixed connected boundary neighborhood and uniform stability of the discrete Dirichlet problems, we obtain stability from Dirichlet inputs and variational flux observations on independently prescribed, possibly disjoint boundary patches. The resulting estimate in \(H^{-r}\), \(r>d/2\), retains the single logarithmic data term and the \(O(h^{1/2})\) mesh remainder of the full-data estimate.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qi Lü, Yu Wang. 2026-10-29. A Transfer Principle for Elliptic Carleman Estimates: Application to Discrete Calderón Stability. https://arxiv.org/abs/2610.39750

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A continuous scale space of diffeomorphisms

In this paper, we define and study a nested family of reproducing kernel Hilbert spaces of vector fields that is indexed by a range of scales, from which we construct a reproducing kernel Hilbert space of scale-dependent vector fields. We provide a characterization of the reproducing kernel of that space, with numerical approximations ensuring quick evaluations when this kernel does not have a closed form. We then introduce a multiscale version of the large deformation diffeomorphic metric mapping (LDDMM) problem and prove the existence of solutions. Finally, we provide numerical experiments performing landmark matching using multiscale LDDMM.

math.NA↗

Hierarchical Matrices with Tucker Blocks: Construction and Forward Evaluation

In this paper, we introduce hierarchical matrices with Tucker blocks (HMTB) for data-sparse approximation of matrices arising from nonoscillatory and mildly oscillatory kernels. Building on the hierarchical matrix framework, HMTB matrices replace conventional low-rank blocks with Tucker representations. Using high-dimensional interpolation and tensor compression and contractions, we develop algorithms for constructing HMTB matrices and performing matrix-vector multiplication. For an $N \times N$ matrix, these algorithms have linear and quasi-linear complexities in $N$, respectively. Numerical comparisons with an interpolation-based $\mathcal{H}$-matrix implementation demonstrate storage savings and, in several cases, reduced construction times, while maintaining competitive forward-evaluation costs. The framework is also applicable to quasi-uniform grids.

math.NA↗

Data-driven model order reduction for wave propagation in materials with damage and nonlinearities

In this work, we consider wave propagation in materials characterized by nonlinear properties or damage. To accelerate the simulations of the resulting high-dimensional problems, we apply model order reduction methods. Depending on the knowledge of the underlying equations and the availability of their discrete operators, intrusive methods (here projection-based approaches based on proper orthogonal decomposition (POD)) or non-instrusive methods (here data-driven approaches including dynamic mode decomposition (DMD) and operator inference (OpInf)) can be used. We recall the theoretical foundations of the methods and apply them to the problem of wave propagation. In three different numerical examples, we evaluate the performance of the reduction techniques.

math.NA↗