ARSHYN ALTYBAY
4 min
Abstract
This work addresses an inverse reconstruction task for a time-fractional pseudo-parabolic model with a temporally varying coefficient. By imposing Dirichlet boundary conditions, we aim to recover the unknown initial state from observations collected at the final time. From a theoretical perspective, we derive existence and uniqueness results by proving that, under suitable hypotheses, the problem admits a unique solution. Computationally, we introduce a finite-difference discretisation based on a time-stepping strategy and provide a detailed stability and convergence analysis. Leveraging the resulting forward solver, we then formulate an initial-data identification procedure using Tikhonov regularisation. The proposed approach is validated with numerical simulations, and its resilience is assessed via experiments that incorporate perturbations in the final-time measurements.
Alex: The positive A_k locks it down. And stability for noise?
Sam: Yes—reconstructed initial stays bounded by the final data size plus forces, with proportional changes for small input shifts.
Alex: Unique and stable, even with imperfect data. Now, for computation?
Sam: They discretize with graded time steps near zero for memory singularities, L1 weights for the fractional part, and central space differences. The matrix comes from impulse runs, inverted with regularization.
Alex: Forward solver tuned. But inverse stability?
Sam: Coercivity in the L1 memory approximation keeps energy bounded—like friction stopping runaway speed. The matrix is symmetric positive definite, ensuring unique steps and unconditional stability.
Alex: No grid disasters. How do they build the practical inverse?
Sam: Split final state into initial part—via forward runs from basis vectors—and forced part. Tikhonov minimizes mismatch plus penalty on size, solving stably.
Alex: Penalty grounds wild guesses. They verify by re-running forward?
Sam: Yes. Errors drop with finer grids in noise-free tests using known solutions. With one to five percent Gaussian noise, errors scale linearly to about four to eighteen percent, preserving shapes.
Alex: Proportional, no chaos. Robust across memory strengths.
Sam: Plots show tight overlaps for clean data, shape-faithful under noise. Limits include first-order time accuracy and computation scaling with grid size squared, suiting moderate cases.
Alex: A solid package—theory for uniqueness and stability, numerics that handle noise—for diagnosing starts in soil filtration or similar. Thanks for joining us on ResearchPod.