Searcharxiv⌕ Search

arXiv · 2610.02983

From Continuous to Fully Discrete Carleman Estimates: A Transfer Principle for Parabolic Schemes

Abstract

Direct approaches to discrete parabolic Carleman estimates often rely on weighted identities tailored to the discrete operator. We prove an abstract transfer theorem that derives such estimates for fully discrete backward Euler schemes with conforming spatial reconstructions from a continuous Carleman inequality together with suitable weighted approximation and compatibility properties. For a class of time-independent positive self-adjoint operators, the key construction assigns to each discrete state a shifted continuous auxiliary problem whose discrete solution is exactly the prescribed state. Weighted space-time error estimates, uniform over the full discrete load space, then transfer the inequality while preserving the residual and observation terms of the original scheme. This separates the PDE-specific Carleman analysis from the numerical verification required for each discretization. We verify the hypotheses for the heat equation discretized by consistent-mass $P_1$ finite elements on locally graded meshes in two and three dimensions and by standard Cartesian finite differences in any fixed dimension. For the heat equation, the transferred estimate is valid for Carleman parameters up to the scale $\min\{h^{-4/5},(δt)^{-2/5}\}$. For bounded real-valued space-time potentials, the resulting estimates yield relaxed observability and approximate null controls with uniformly bounded cost and exponentially small terminal errors under independent spatial and temporal refinement; weak accumulation points of the reconstructed controls are continuous null controls.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qi Lü, Yu Wang. 2026-10-02. From Continuous to Fully Discrete Carleman Estimates: A Transfer Principle for Parabolic Schemes. https://arxiv.org/abs/2610.02983

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

KEEP EXPLORING

Related papers

A theory of meta-factorization

Meta-factorization asks how different factors and transforms describe the same matrix and how a factor can be replaced while preserving that matrix. Projector and reconstruction equations give a common description. For $A=FGH^*$ with outer factors of full column rank $k$, $Y^*F=H^*X=I_k$ certifies generally oblique projectors. Exact reconstruction requires their ranges to contain the column spaces of $A$ and $A^*$. Two design matrices parametrize every certifying pair; the core is unique and nonsingular at $k=\operatorname{rank}(A)$. Detailed constructions recover SVD, column-pivoted QR, UTV, generalized Nystrom, CUR and classical pseudoinverse formulas with their structural hypotheses. The framework makes factor replacement testable from stored factors. For a supplied candidate $\check F$ and transform $\check Y^*$, with $H$ of full column rank, $\check G=(\check Y^*F)G$ preserves $A$ exactly when $[F-\check F(\check Y^*F)]G=0$. Test, repair and exact factored residual require no access to $A$. With the pseudoinverse as transform, the updated product is a closest reconstruction within the candidate's column space in every unitarily invariant norm. We characterize the accepted subspaces under the stated inverse and rank conditions and extend replacement to different stored widths. Nonsingular generalized right-hand sides change certifying coordinates; finite-order choices yield potent operators and periodic reconstruction. Classical Fourier components test preservation of the core at every step, including singular cores. The contribution is a common description with explicit replacement and reconstruction consequences. Numerical acceptance, conditioning and candidate selection require further analysis.

math.NA↗

Stochastic Quadrature Rules for Solving PDEs using Neural Networks

We examine the challenges associated with numerical integration when applying Neural Networks to solve Partial Differential Equations (PDEs). We specifically investigate the Deep Ritz Method (DRM), chosen for its practical applicability and known sensitivity to integration inaccuracies. Our research demonstrates that both standard deterministic integration techniques and biased stochastic quadrature methods can lead to incorrect solutions. In contrast, employing high-order, unbiased stochastic quadrature rules defined on integration meshes in low dimensions is shown to significantly enhance convergence rates at a comparable computational expense with respect to low-order methods like Monte Carlo. Additionally, we introduce novel stochastic quadrature approaches designed for triangular and tetrahedral mesh elements, offering increased adaptability for handling complex geometric domains. We highlight that the variance inherent in the stochastic gradient acts as a bottleneck for convergence. Furthermore, we observe that for gradient-based optimisation, the crucial factor is the accurate integration of the gradient, rather than just minimizing the quadrature error of the loss function itself.

math.NA↗

A Stochastic Genetic Interacting Particle Method for Reaction-Diffusion-Advection Equations

We develop and analyze a stochastic genetic interacting particle method (SGIP) for reaction-diffusion-advection (RDA) equations. The SGIP method employs operator splitting to approximate the advection-diffusion and reaction processes, treating the former using particle drift-diffusion and the latter via exact or implicit integration of reaction dynamics over bins, where particle density is estimated using a histogram. A key innovation is the incorporation of adaptive resampling to close the loop of particle and density field description of solutions, mimicking the selection mechanism in genetics. Resampling is also crucial for maintaining long-term stability by redistributing particles in accordance with the evolving density field. We provide a comprehensive error analysis and establish convergence bounds under appropriate regularity assumptions. Numerical experiments in one to three space dimensions demonstrate the method's effectiveness across various reaction types (Fisher-Kolmogorov-Petrovsky-Piskunov (FKPP), cubic, Arrhenius) and flow configurations (shear, cellular, cat's eye, Arnold-Beltrami-Childress (ABC) flows), showing excellent agreement with the finite difference method (FDM) while offering computational advantages for complex flow geometries and higher-dimensional problems.

math.NA↗