<p>This work is concerned with a class of Volterra functional integro-differential equations. Based on the <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11075_2025_2221_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\(\theta\)</EquationSource> </InlineEquation>-invariant mesh, the multistep collocation schemes are constructed. Then the optimal global and local superconvergence orders of the proposed method are detailedly analyzed. It turns out that for a set of suitable chosen collocation parameters, the convergence orders of <i>d</i>-step and <i>n</i>-point collocation method may reach <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11075_2025_2221_Article_IEq2.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="44" /> </InlineMediaObject> <EquationSource Format="TEX">\(n+d\)</EquationSource> </InlineEquation> in global and <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11075_2025_2221_Article_IEq3.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="77" /> </InlineMediaObject> <EquationSource Format="TEX">\(2n+d-1\)</EquationSource> </InlineEquation> at the mesh points, which are much higher than the classical one-step collocation method. Additionally, compared with existing works, no extra starting procedure is needed for the proposed multistep collocation method. Several illustrative numerical tests are provided to support the theoretical results in the final section.</p>

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

Multistep collocation methods for Volterra integro-differential equations with delay terms

  • Wanyuan Ming,
  • Huoying Liu,
  • Longbin Zhao

摘要

This work is concerned with a class of Volterra functional integro-differential equations. Based on the \(\theta\) -invariant mesh, the multistep collocation schemes are constructed. Then the optimal global and local superconvergence orders of the proposed method are detailedly analyzed. It turns out that for a set of suitable chosen collocation parameters, the convergence orders of d-step and n-point collocation method may reach \(n+d\) in global and \(2n+d-1\) at the mesh points, which are much higher than the classical one-step collocation method. Additionally, compared with existing works, no extra starting procedure is needed for the proposed multistep collocation method. Several illustrative numerical tests are provided to support the theoretical results in the final section.