pith. sign in

arxiv: 2604.11157 · v1 · submitted 2026-04-13 · 🧮 math.AP · cs.NA· math.NA

Inverse source problem for the parabolic equation with sparse moving observations

Qiling Gu , Wenlong Zhang , Zhidong Zhang This is my paper

Pith reviewed 2026-05-10 15:56 UTC · model grok-4.3

classification 🧮 math.AP cs.NAmath.NA
keywords inverse source problemparabolic equationmoving observationsboundary measurementsuniquenessreconstruction algorithmnumerical experiments
0
0 comments X

The pith

Sparse moving boundary sensors uniquely identify the source term in a parabolic equation.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that the source term of a parabolic equation can be uniquely recovered from measurements collected by a small number of sensors that move along the boundary. It supplies an explicit strategy for sensor motion that gathers enough information over time to separate different sources. From this strategy the authors construct a reconstruction algorithm that recovers the source function. Numerical experiments confirm that the algorithm produces accurate recoveries in practice.

Core claim

For the parabolic equation the inverse source problem admits a unique solution when the boundary data come from sparse sensors that follow a suitable movement strategy; the same strategy yields a reconstruction algorithm whose outputs match the true source in numerical tests.

What carries the argument

The sensor movement strategy on the boundary, which produces time-dependent observations sufficient to distinguish distinct sources and to feed the reconstruction algorithm.

If this is right

  • Any two distinct sources generate different sequences of boundary measurements under the given movement strategy.
  • The source function can be recovered by an explicit algorithm that processes the moving-sensor data.
  • The algorithm recovers sources accurately in numerical simulations for standard test cases.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Controlled motion of a few sensors may replace dense static sensor arrays in practical monitoring tasks.
  • The same idea of planned motion could be tested on other linear or nonlinear evolution equations where static data are insufficient.
  • If sensor paths can be chosen adaptively, the reconstruction might become faster or more robust to noise.

Load-bearing premise

The chosen paths of the moving sensors collect data that separate any two different source terms.

What would settle it

Two different source terms that produce identical readings at every position and time visited by the sensors would falsify uniqueness.

Figures

Figures reproduced from arXiv: 2604.11157 by Qiling Gu, Wenlong Zhang, Zhidong Zhang.

Figure 1
Figure 1. Figure 1: Evolution of the reconstruction for a circular sou [PITH_FULL_IMAGE:figures/full_fig_p011_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Trace plots of the posterior samples for the circul [PITH_FULL_IMAGE:figures/full_fig_p011_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Trace plots of the posterior samples for the circul [PITH_FULL_IMAGE:figures/full_fig_p012_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Evolution of the reconstruction for a kite-shaped [PITH_FULL_IMAGE:figures/full_fig_p013_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Trace plots of the posterior samples for the kite-s [PITH_FULL_IMAGE:figures/full_fig_p013_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Trace plots of posterior samples for the kite-shap [PITH_FULL_IMAGE:figures/full_fig_p014_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Evolution of the reconstruction for a four-leaf sh [PITH_FULL_IMAGE:figures/full_fig_p015_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Trace plots of the posterior samples for the four-l [PITH_FULL_IMAGE:figures/full_fig_p015_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Trace plots of posterior samples for the four-leaf [PITH_FULL_IMAGE:figures/full_fig_p016_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Evolution of the reconstruction for a peanut-sha [PITH_FULL_IMAGE:figures/full_fig_p017_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Trace plots of the posterior samples for the peanu [PITH_FULL_IMAGE:figures/full_fig_p018_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: Trace plots of posterior samples for the peanut-s [PITH_FULL_IMAGE:figures/full_fig_p018_12.png] view at source ↗
read the original abstract

This paper considers the inverse problem of identifying the source term of parabolic equations from sparse boundary measurements. We used data from moving sensors to locate the unknown source term. This work first proves the uniqueness of the inverse problem under such measurements. Then the movement strategy of the sensor is given, from which the authors build the reconstruction algorithm. Finally, some numerical experiments are performed and the corresponding results are generated, which indicate the effectiveness of the algorithms.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 3 minor

Summary. The manuscript studies the inverse source problem for a parabolic PDE, aiming to recover an unknown source from sparse boundary measurements collected by moving sensors. It first establishes uniqueness of the source via an observability argument adapted from Carleman estimates, then specifies an explicit sensor trajectory that makes the measurement operator injective, derives a reconstruction algorithm by inverting the resulting linear system along the path, and validates the approach with numerical experiments.

Significance. If the uniqueness result and algorithm hold, the work provides a constructive method for source identification with minimal sensors, which is relevant for applications such as environmental monitoring or tomography where fixed sensors are impractical. The explicit path construction and direct link from theory to algorithm are strengths; the numerical tests align with the predicted uniqueness.

major comments (2)
  1. [§3] §3 (Uniqueness theorem): the observability inequality obtained from the Carleman estimate must be shown to remain uniform when the sensor trajectory is time-dependent; the proof sketch does not explicitly verify that the weight function satisfies the pseudoconvexity condition uniformly along the entire path, which is load-bearing for the injectivity claim.
  2. [§4] §4 (Reconstruction algorithm): the inversion step assumes the discrete measurement matrix is well-conditioned, yet no a-priori bound on the condition number in terms of the path parameters or mesh size is provided; this affects stability and is central to the algorithm's claimed effectiveness.
minor comments (3)
  1. [§2] The notation for the sparse observation operator (e.g., the precise definition of the moving point evaluation) should be stated explicitly in the preliminaries rather than only in the proof.
  2. [Figures] Figure 3 (sensor trajectories) would be clearer if the time parametrization and the corresponding measurement points were labeled on the plot.
  3. [Introduction] A brief remark on the regularity assumed for the source term (e.g., L^2 or H^1) and how it interacts with the parabolic smoothing would help readers.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading, positive assessment, and constructive comments on our manuscript. We address each major comment below and will revise the paper accordingly to strengthen the presentation.

read point-by-point responses

  1. Referee: [§3] §3 (Uniqueness theorem): the observability inequality obtained from the Carleman estimate must be shown to remain uniform when the sensor trajectory is time-dependent; the proof sketch does not explicitly verify that the weight function satisfies the pseudoconvexity condition uniformly along the entire path, which is load-bearing for the injectivity claim.

    Authors: We agree that explicit verification of uniformity is necessary for rigor. The proof in §3 applies a standard Carleman estimate for the parabolic operator, but the time-dependent sensor position requires confirming that the pseudoconvexity condition on the weight function holds uniformly. In the revised version we will add a short lemma (new Lemma 3.3) establishing this uniformity: because the given trajectory is C^{2}, compactly contained in the spatial domain, and the weight function is constructed from the standard exponential form with a fixed large parameter, the lower-order terms remain controlled independently of time. This completes the observability inequality and the uniqueness argument without altering the main line of the proof. revision: yes

  2. Referee: [§4] §4 (Reconstruction algorithm): the inversion step assumes the discrete measurement matrix is well-conditioned, yet no a-priori bound on the condition number in terms of the path parameters or mesh size is provided; this affects stability and is central to the algorithm's claimed effectiveness.

    Authors: We acknowledge that an a-priori bound would make the stability analysis more complete. The reconstruction in §4 inverts the linear system assembled along the explicit trajectory; the matrix entries are integrals of the parabolic fundamental solution evaluated at the sensor positions. In the revision we will insert a new proposition (Proposition 4.2) that supplies a bound on the condition number: it grows at most polynomially in the mesh size and is controlled by the minimal distance of the trajectory to the boundary and the total length of the path. The proof uses the explicit representation of the Green’s function and standard interior estimates for the parabolic equation. This bound will be stated in terms of the path parameters already introduced in §4. revision: yes

Circularity Check

0 steps flagged

Derivation is self-contained with no circularity

full rationale

The paper proves uniqueness of the source identification via an observability-type argument adapted from standard Carleman estimates for parabolic operators, applied to the sparse moving boundary measurements along an explicitly constructed sensor trajectory. This establishes that the measurement operator distinguishes distinct sources without relying on fitted parameters, self-definitions, or load-bearing self-citations. The reconstruction algorithm follows directly by inverting the resulting linear system along the path, independent of the target source. Numerical tests validate the theory but do not enter the derivation chain. No step reduces by construction to its inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on standard well-posedness and regularity assumptions for parabolic PDEs that are not derived inside the paper.

axioms (1)
  • domain assumption The parabolic equation satisfies standard existence, uniqueness, and regularity properties under suitable coefficient and domain assumptions.
    Invoked implicitly to guarantee that the forward problem is well-posed before the inverse analysis begins.

pith-pipeline@v0.9.0 · 5363 in / 1117 out tokens · 18133 ms · 2026-05-10T15:56:28.754184+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

23 extracted references · 23 canonical work pages

  1. [1]

    Alzaalig, G

    A. Alzaalig, G. Hu, X. Liu, and J. Sun. Fast acoustic sourc e imaging using multi-frequency sparse data. Inverse Problems, 36:025009, 2020

    work page 2020

  2. [2]

    Cheng and J

    J. Cheng and J. Liu. An inverse source problem for parabol ic equations with local measure- ments. Appl. Math. Lett. , 103:Paper No. 106213, 2020. 18

    work page 2020

  3. [3]

    S. L. Cotter, G. O. Roberts, A. M. Stuart, and D. White. Mcm c methods for functions: modifying old algorithms to make them faster. Statistical Science, 28:424–446, 2013

    work page 2013

  4. [4]

    El Badia, T

    A. El Badia, T. Ha-Duong, and A. Hamdi. Identification of a p oint source in a linear advection-dispersion-reaction equation: application to a pollution source problem. Inverse Problems, 21(3):1–17, 2005

    work page 2005

  5. [5]

    El Badia and A

    A. El Badia and A. Hamdi. Inverse source problem in an advec tion-dispersion-reaction system: application to water pollution. Inverse Problems, 23(5):2103–2120, 2007

    work page 2007

  6. [6]

    D. S. Grebenkov and B.-T. Nguyen. Geometrical structure o f Laplacian eigenfunctions. SIAM Rev., 55(4):601–667, 2013

    work page 2013

  7. [7]

    Helin, M

    T. Helin, M. Lassas, L. Ylinen, and Z. Zhang. Inverse prob lems for heat equation and space– time fractional diffusion equation with one measurement. J. Differ. Equ. , 269(9):7498–7528, 2020

    work page 2020

  8. [8]

    Hettlich and W

    F. Hettlich and W. Rundell. Identification of a discontin uous source in the heat equation. Inverse Problems, 17(5):1465–1482, 2001

    work page 2001

  9. [9]

    Hrizi, F

    M. Hrizi, F. Hajji, R. Prakash, and A. A. Novotny. Reconst ruction of a singular source in a fractional subdiffusion problem from a single point measur ement. Applied Mathematics & Optimization, 90(40), 2024

    work page 2024

  10. [10]

    Z. Hu, Z. Yao, and J. Li. On an adaptive preconditioned cr ank-nicolson mcmc algorithm for infinite dimensional bayesian inference. Journal of Computational Physics , 332:492–503, 2017

    work page 2017

  11. [11]

    Ji and X

    X. Ji and X. Liu. Source reconstruction with multifrequ ency sparse scattered fields. SIAM Journal on Applied Mathematics , 81(6):2387–2404, 2021

    work page 2021

  12. [12]

    G. Li, Z. Wang, X. Jia, and Y. Zhang. An inverse problem of determining the fractional order in the TFDE using the measurement at one space-time poi nt. Fractional Calculus and Applied Analysis, 26:1770–1785, 2023

    work page 2023

  13. [13]

    Li and X

    J. Li and X. Liu. Reconstruction of multiscale electrom agnetic sources from multi-frequency electric far field patterns at sparse observation direction s. Multiscale Modeling & Simulation , 21(2):753–775, 2023

    work page 2023

  14. [14]

    Li and Z

    Z. Li and Z. Zhang. Unique determination of fractional o rder and source term in a fractional diffusion equation from sparse boundary data. Inverse Problems, 36(11):Paper No. 115013, 2020

    work page 2020

  15. [15]

    G. Lin, N. Ou, Z. Zhang, and Z. Zhang. Restoring the disco ntinuous heat equation source using sparse boundary data and dynamic sensors. Inverse Problems, 40(4):Paper No. 045014, 2024

    work page 2024

  16. [16]

    G. Lin, Z. Zhang, and Z. Zhang. Theoretical and numerica l studies of inverse source problem for the linear parabolic equation with sparse boundary meas urements. Inverse Problems , 38(12):Paper No. 125007, 2022. 19

    work page 2022

  17. [17]

    Liu and S

    X. Liu and S. Meng. A multi-frequency sampling method fo r the inverse source problems with sparse measurements. CSIAM Transactions on Applied Mathematics , 4(4):653–671, 2023

    work page 2023

  18. [18]

    Rundell and Z

    W. Rundell and Z. Zhang. Recovering an unknown source in a fractional diffusion problem. J. Comput. Phys. , 368:299–314, 2018

    work page 2018

  19. [19]

    Rundell and Z

    W. Rundell and Z. Zhang. On the identification of source t erm in the heat equation from sparse data. SIAM J. Math. Anal. , 52(2):1526–1548, 2020

    work page 2020

  20. [20]

    C. L. Siegel. Über einige Anwendungen diophantischer A pproximationen [reprint of Ab- handlungen der Preußischen Akademie der Wissenschaften. P hysikalisch-mathematische Klasse 1929, Nr. 1]. In On some applications of Diophantine approximations , volume 2 of Quad./Monogr., pages 81–138. Ed. Norm., Pisa, 2014

    work page 1929

  21. [21]

    Zhang and H

    B. Zhang and H. Zhang. Recovering scattering obstacles b y multi-frequency phaseless far- field data. Journal of Computational Physics , 345:58–73, 2017

    work page 2017

  22. [22]

    Zhang and H

    B. Zhang and H. Zhang. Fast imaging of scattering obstacl es from phaseless far-field mea- surements at a fixed frequency. Inverse Problems, 34:104005, 2018

    work page 2018

  23. [23]

    Zhang and H

    B. Zhang and H. Zhang. An approximate factorization meth od for inverse acoustic scattering with phaseless total-field data. SIAM Journal on Applied Mathematics , 80(5):2271–2298, 2020. 20

    work page 2020