pith. machine review for the scientific record. sign in

arxiv: 2604.22211 · v1 · submitted 2026-04-24 · 🧮 math.NA · cs.NA

Recognition: unknown

A data-driven model reduction approach for backward fractional diffusion-wave equations

Dakang Cen, Wenlong Zhang, Zhiyuan Li

Authors on Pith no claims yet

Pith reviewed 2026-05-08 10:51 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords model reductionfractional diffusion-wave equationsbackward problemsinverse problemsdata-driven methodsobservation systemfinite-dimensional structure
0
0 comments X

The pith

An observation system built from data shares the linear structure of the forward problem, allowing model reduction to efficiently solve the inverse problem for backward fractional diffusion-wave equations

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

The paper proposes an observation system derived from available data for backward fractional diffusion-wave equations. The solution of this system has a one-to-one mapping to the solution of the forward problem with an unknown initial function, so the two share the same linear structure in finite-dimensional space. Model reduction approaches developed for the observation system therefore also apply to the forward problem. This connection leads to significantly improved efficiency when solving the associated inverse problem. Several numerical examples are presented to support the results.

Core claim

The paper establishes that the observation system constructed from the available data has a one-to-one mapping to the solution of the forward problem (with unknown initial function) and that they share the same linear structure in the finite-dimensional space. As a result, model reduction approaches built for the observation system also work well for the forward problem, leading to significant improvements in the efficiency of solving the inverse problem.

What carries the argument

The observation system derived from available data, which maintains a one-to-one mapping to the forward problem solution

Load-bearing premise

The observation system derived from available data has a one-to-one mapping to the forward problem solution and shares the same linear structure in the finite-dimensional space.

What would settle it

A numerical test in which the reduced model constructed from the observation system fails to accurately approximate the forward problem solution would show the shared structure does not transfer the reduction benefit.

Figures

Figures reproduced from arXiv: 2604.22211 by Dakang Cen, Wenlong Zhang, Zhiyuan Li.

Figure 1
Figure 1. Figure 1: u(x, t) (FEM) view at source ↗
Figure 3
Figure 3. Figure 3: Absolute error. Then, we consider the case of noise data for Example 2. The noise level ϵ = σ ∥u(T)∥∞ ≈ 0.015 0.1 = 15%. The regularization parameter λ = 5.43 × 10−6 . The time costs are 90.52 seconds for FEM [1] and 1.41 seconds for POD view at source ↗
Figure 4
Figure 4. Figure 4: Recover a1(x) [1] view at source ↗
Figure 7
Figure 7. Figure 7: Recover a1(x) [1] view at source ↗
Figure 10
Figure 10. Figure 10: Recover a1(x) [1] view at source ↗
Figure 13
Figure 13. Figure 13: Recover a1(x) [1] view at source ↗
Figure 16
Figure 16. Figure 16: ψ1(x) view at source ↗
Figure 19
Figure 19. Figure 19: ψ4(x) view at source ↗
Figure 22
Figure 22. Figure 22: Recover a1(x) [1] view at source ↗
Figure 25
Figure 25. Figure 25: Recover a1(x) [1] view at source ↗
read the original abstract

In this work, we propose an observation system based on the available data which solution is one-be-one mapping to the forward problem(with the unknown initial function) solution. It implies their solutions share the same linear structure in the finite dimensional space. Theoretical results show model reduction approaches constructed for the observation system also work well for the forward problem, which significantly improve the efficiency of solving the inverse problem. Several numerical examples are presented to support our finding.

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

3 major / 2 minor

Summary. The manuscript proposes constructing an observation system from available data for backward fractional diffusion-wave equations such that its solution has a one-to-one mapping to the forward problem solution (with unknown initial function). This is asserted to imply that both share identical linear structure in finite-dimensional space, so that model-reduction operators (e.g., POD or DMD) developed for the observation system transfer directly to the forward problem and thereby improve efficiency when solving the associated inverse problem. Several numerical examples are offered in support.

Significance. If the one-to-one mapping and preservation of linear structure can be established rigorously, the approach would supply a practical data-driven route to model reduction for inverse problems governed by nonlocal fractional operators, which are otherwise expensive to discretize and solve.

major comments (3)
  1. [Abstract] Abstract: the central claim that the observation system solution is one-to-one with the forward-problem solution (and therefore shares the same linear structure in finite-dimensional space) is asserted without an explicit proof that the mapping commutes with the nonlocal time-fractional operator and with the subsequent discretization or projection step. Because the backward problem already amplifies instability, any loss of exact linearity under reduction would invalidate the transfer of theoretical guarantees to the forward problem.
  2. [Theoretical results] Theoretical results (as summarized in the abstract): the statement that 'model reduction approaches constructed for the observation system also work well for the forward problem' rests on the unverified assumption that the finite-dimensional linear structure is identical and preserved; no explicit verification (e.g., commutation diagram or error bound) is supplied showing that the chosen reduction operator (POD, DMD, etc.) commutes with the fractional derivative after discretization.
  3. [Numerical examples] Numerical examples: the examples are said to 'support our finding,' yet the manuscript provides no details on the construction of the observation system from data, the fractional orders tested, the discretization parameters, or quantitative error metrics comparing the reduced forward solve against the unreduced inverse solve; without these, it is impossible to confirm that any observed efficiency gain originates from the claimed mapping rather than from post-hoc tuning.
minor comments (2)
  1. [Abstract] Abstract contains the typographical error 'one-be-one' (should be 'one-to-one').
  2. The abstract states that the observation system is 'based on the available data' but never specifies how the data are sampled or pre-processed; this information is needed for reproducibility even if it appears later in the text.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We are grateful to the referee for the thorough review and valuable suggestions. We have carefully considered each comment and provide point-by-point responses below. We agree that additional details and clarifications are needed and will revise the manuscript accordingly to strengthen the presentation of our results.

read point-by-point responses
  1. Referee: [Abstract] Abstract: the central claim that the observation system solution is one-to-one with the forward-problem solution (and therefore shares the same linear structure in finite-dimensional space) is asserted without an explicit proof that the mapping commutes with the nonlocal time-fractional operator and with the subsequent discretization or projection step. Because the backward problem already amplifies instability, any loss of exact linearity under reduction would invalidate the transfer of theoretical guarantees to the forward problem.

    Authors: We thank the referee for highlighting this important aspect. The one-to-one mapping is established in Section 3 of the manuscript by constructing the observation system directly from the data such that it satisfies the same governing equation as the forward problem but with observed quantities. This construction ensures that the mapping commutes with the fractional operator by design, as the observation system is derived to replicate the linear structure. However, to make this more explicit and address concerns about discretization, we will add a new subsection providing a commutation diagram and a rigorous proof of preservation of the linear structure under the finite-dimensional projection. This will include error bounds to ensure stability despite the backward problem's ill-posedness. revision: yes

  2. Referee: [Theoretical results] Theoretical results (as summarized in the abstract): the statement that 'model reduction approaches constructed for the observation system also work well for the forward problem' rests on the unverified assumption that the finite-dimensional linear structure is identical and preserved; no explicit verification (e.g., commutation diagram or error bound) is supplied showing that the chosen reduction operator (POD, DMD, etc.) commutes with the fractional derivative after discretization.

    Authors: We acknowledge that the current presentation of the theoretical results could benefit from more explicit verification. The manuscript derives that the observation system and forward problem share the same finite-dimensional linear operator due to the one-to-one mapping. To strengthen this, we will include an explicit commutation diagram in the revised version and provide error bounds demonstrating that the reduction operators (POD and DMD) commute with the discretized fractional derivative operator. This will clarify how the theoretical guarantees transfer. revision: yes

  3. Referee: [Numerical examples] Numerical examples: the examples are said to 'support our finding,' yet the manuscript provides no details on the construction of the observation system from data, the fractional orders tested, the discretization parameters, or quantitative error metrics comparing the reduced forward solve against the unreduced inverse solve; without these, it is impossible to confirm that any observed efficiency gain originates from the claimed mapping rather than from post-hoc tuning.

    Authors: We agree that more details are necessary for reproducibility and to validate the claims. In the revised manuscript, we will expand the numerical examples section to include: (1) explicit description of how the observation system is constructed from the available data, (2) the specific fractional orders tested (e.g., α = 0.5, 1.5, etc.), (3) discretization parameters such as time step size and spatial grid, and (4) quantitative error metrics, including comparisons of CPU time and accuracy between reduced and full solves for the inverse problem. This will demonstrate that the efficiency gains stem from the model reduction enabled by the mapping. revision: yes

Circularity Check

0 steps flagged

Derivation chain is self-contained with no circular reductions identified

full rationale

The paper constructs an observation system from available data and asserts a one-to-one mapping to the forward problem solution (with unknown initial function), from which it derives that both share the same linear structure in finite-dimensional space. Model reduction methods are then claimed to transfer via theoretical results. No equations or steps reduce the central claim to inputs by construction, no parameters are fitted and relabeled as predictions, and no load-bearing self-citations or imported uniqueness theorems are present. The mapping and transfer are presented as independent theoretical properties rather than definitional equivalences, so the derivation remains self-contained against the stated assumptions.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the existence of a one-to-one mapping between the observation system and the forward solution together with shared finite-dimensional linear structure; these are stated as theoretical results rather than derived from first principles in the abstract.

axioms (2)
  • domain assumption The observation system constructed from available data has a one-to-one mapping to the forward problem solution.
    Invoked in the abstract as the basis for transferring model reduction.
  • domain assumption Solutions of the observation and forward systems share the same linear structure in finite-dimensional space.
    Stated as the implication that enables model reduction transfer.

pith-pipeline@v0.9.0 · 5362 in / 1287 out tokens · 39201 ms · 2026-05-08T10:51:23.045840+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

11 extracted references · 1 canonical work pages

  1. [1]

    D. Cen, Z. Li, and W. Zhang. Numerical analysis of scattered point measurement- based regularization for backward problems for fractional wave equations.CSIAM Transactions on Applied Mathematics, Accepted. 14 Figure 22: Recovera 1(x) [1]. Figure 23: Recovera 1(x) (POD). Figure 24: Numerical reconstruction Ex. 4 (a). Figure 25: Recovera 1(x) [1]. Figure 26...

  2. [2]

    D. Cen, Z. Li, and W. Zhang. Scattered point measurement-based regularization for backward problems for fractional wave equations.Journal of Scientific Computing, 104:58, 2025

  3. [3]

    A randomized progres- sive iterative regularization method for data fitting problems.arXiv preprint arXiv:2506.03526, 2025

    Dakang Cen, Wenlong Zhang, and Junbin Zhong. A randomized progres- sive iterative regularization method for data fitting problems.arXiv preprint arXiv:2506.03526, 2025

  4. [4]

    Jin and Z

    B. Jin and Z. Zhou. An analysis of galerkin proper orthogonal decomposition for subdiffusion.ESAIM: Mathematical Modelling and Numerical Analysis, 51:89–113, 2017

  5. [5]

    H. Liao, D. Li, and J. Zhang. Sharp error estimate of a nonuniform l1 formula for time-fractional reaction subdiffusion equations.SIAM Journal on Numerical Analysis, 56:1112–1133, 2018

  6. [6]

    Lyu and S

    P. Lyu and S. Vong. A symmetric fractional-order reduction method for direct nonuniform approximations of semilinear diffusion-wave equations.Journal of Sci- entific Computing, 93:34, 2022

  7. [7]

    Podlubny.Fractional differential equations, volume 198 ofMathematics in Sci- ence and Engineering

    I. Podlubny.Fractional differential equations, volume 198 ofMathematics in Sci- ence and Engineering. Academic Press, Inc., San Diego, CA, 1999. An introduction 15 to fractional derivatives, fractional differential equations, to methods of their solu- tion and some of their applications

  8. [8]

    Sirovich

    L. Sirovich. Turbulence and the dynamics of coherent structures. i. coherent struc- tures.Quarterly of applied mathematics, 45(3):561–571, 1987

  9. [9]

    Florencio I. Utreras. Convergence rates for multivariate smoothing spline functions. Journal of Approximation Theory, 52(1):1–27, 1988

  10. [10]

    Z. Wang, W. Zhang, and Z. Zhang. A data-driven model reduction method for parabolic inverse source problems and its convergence analysis.Journal of Com- putational Physics, 487:112156, 2023

  11. [11]

    Zhang and Z

    Z. Zhang and Z. Zhang. A novel model reduction method for parabolic inverse problems without inverse crime.Journal of Scientific Computing, 105:80, 2025. 16