<p>In this paper, we introduce efficient and simple superconvergent postprocessing techniques for the <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12190_2025_2586_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\(C^0\)</EquationSource> </InlineEquation>- and <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12190_2025_2586_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\(C^1\)</EquationSource> </InlineEquation>-continuous Petrov-Galerkin (CPG) methods applied to second-order Volterra integro-differential equations. These techniques can be applied independently to each local time interval, with the computational cost being negligible compared to that of obtaining the <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12190_2025_2586_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\(C^0\)</EquationSource> </InlineEquation>- and <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12190_2025_2586_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\(C^1\)</EquationSource> </InlineEquation>-CPG approximations. Theoretical analysis begins with the establishment of a priori error estimates for the <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12190_2025_2586_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\(C^0\)</EquationSource> </InlineEquation>- and <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12190_2025_2586_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\(C^1\)</EquationSource> </InlineEquation>-CPG methods, as well as superconvergence estimates at the nodal points. Furthermore, for smooth solutions, we prove that the postprocessing techniques improve the convergence rates of the <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12190_2025_2586_Article_IEq9.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(L^2\)</EquationSource> </InlineEquation>-, <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12190_2025_2586_Article_IEq10.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="23" /> </InlineMediaObject> <EquationSource Format="TEX">\(H^1\)</EquationSource> </InlineEquation>-, and <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12190_2025_2586_Article_IEq11.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="26" /> </InlineMediaObject> <EquationSource Format="TEX">\(L^\infty\)</EquationSource> </InlineEquation>-errors of the <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12190_2025_2586_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\(C^0\)</EquationSource> </InlineEquation>- and <InlineEquation ID="IEq13"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="12190_2025_2586_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="21" /> </InlineMediaObject> <EquationSource Format="TEX">\(C^1\)</EquationSource> </InlineEquation>-CPG methods by one order. Numerical experiments not only verify the theoretical results but also demonstrate the effectiveness of the proposed postprocessing techniques for handling problems with weakly singular solutions.</p>

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

Postprocessing techniques of the \(C^0\)- and \(C^1\)-continuous Petrov-Galerkin methods for second-order Volterra integro-differential equations

  • Zhe Li,
  • Gaoqing He,
  • Lijun Yi

摘要

In this paper, we introduce efficient and simple superconvergent postprocessing techniques for the \(C^0\) - and \(C^1\) -continuous Petrov-Galerkin (CPG) methods applied to second-order Volterra integro-differential equations. These techniques can be applied independently to each local time interval, with the computational cost being negligible compared to that of obtaining the \(C^0\) - and \(C^1\) -CPG approximations. Theoretical analysis begins with the establishment of a priori error estimates for the \(C^0\) - and \(C^1\) -CPG methods, as well as superconvergence estimates at the nodal points. Furthermore, for smooth solutions, we prove that the postprocessing techniques improve the convergence rates of the \(L^2\) -, \(H^1\) -, and \(L^\infty\) -errors of the \(C^0\) - and \(C^1\) -CPG methods by one order. Numerical experiments not only verify the theoretical results but also demonstrate the effectiveness of the proposed postprocessing techniques for handling problems with weakly singular solutions.