<p>This paper investigates the problem of recovering source terms in abstract initial value problems (IVP) commonly used to model various scientific phenomena in physics, chemistry, economics, and other fields. We consider source terms of the form <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41_2025_10184_Article_IEq1.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="77" /> </InlineMediaObject> <EquationSource Format="TEX">\(F=h+\eta \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>F</mi> <mo>=</mo> <mi>h</mi> <mo>+</mo> <mi>η</mi> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41_2025_10184_Article_IEq2.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\(\eta \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>η</mi> </math></EquationSource> </InlineEquation> is a Lipschitz continuous background source. The primary objective is to estimate the unknown parameters of non-instantaneous sources <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41_2025_10184_Article_IEq3.gif" Format="GIF" Height="43" Rendition="HTML" Resolution="72" Type="Linedraw" Width="213" /> </InlineMediaObject> <EquationSource Format="TEX">\(h(t)=\sum \limits _{j=0}^M h_je^{-\rho _j(t-t_j)}\chi _{[t_j,\infty )}(t)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>h</mi> <mrow> <mo stretchy="false">(</mo> <mi>t</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <munderover> <mo movablelimits="false">∑</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>0</mn> </mrow> <mi>M</mi> </munderover> <msub> <mi>h</mi> <mi>j</mi> </msub> <msup> <mi>e</mi> <mrow> <mo>-</mo> <msub> <mi>ρ</mi> <mi>j</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>t</mi> <mo>-</mo> <msub> <mi>t</mi> <mi>j</mi> </msub> <mo stretchy="false">)</mo> </mrow> </mrow> </msup> <msub> <mi>χ</mi> <mrow> <mo stretchy="false">[</mo> <msub> <mi>t</mi> <mi>j</mi> </msub> <mo>,</mo> <mi>∞</mi> <mo stretchy="false">)</mo> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>t</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, such as the decay rates, initial intensities and activation times. We present two novel recovery algorithms that employ distinct sampling methods of the solution of the IVP. Algorithm 1 combines discrete and weighted average measurements, whereas Algorithm 2 uses a different variant of weighted average measurements. We analyze the performance of these algorithms, providing upper bounds on the recovery errors of the model parameters. Our focus is on the structure of the dynamical samples used by the algorithms and on the error guarantees they yield.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Reconstruction Algorithms for Source Term Recovery from Dynamical Samples in Catalyst Models

  • Akram Aldroubi,
  • Le Gong,
  • Ilya Krishtal,
  • Brendan Miller,
  • Sumati Thareja

摘要

This paper investigates the problem of recovering source terms in abstract initial value problems (IVP) commonly used to model various scientific phenomena in physics, chemistry, economics, and other fields. We consider source terms of the form \(F=h+\eta \) F = h + η , where \(\eta \) η is a Lipschitz continuous background source. The primary objective is to estimate the unknown parameters of non-instantaneous sources \(h(t)=\sum \limits _{j=0}^M h_je^{-\rho _j(t-t_j)}\chi _{[t_j,\infty )}(t)\) h ( t ) = j = 0 M h j e - ρ j ( t - t j ) χ [ t j , ) ( t ) , such as the decay rates, initial intensities and activation times. We present two novel recovery algorithms that employ distinct sampling methods of the solution of the IVP. Algorithm 1 combines discrete and weighted average measurements, whereas Algorithm 2 uses a different variant of weighted average measurements. We analyze the performance of these algorithms, providing upper bounds on the recovery errors of the model parameters. Our focus is on the structure of the dynamical samples used by the algorithms and on the error guarantees they yield.