<p>Consider a linear operator equation <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_882_Article_IEq1.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="94" /> </InlineMediaObject> <EquationSource Format="TEX">\(x - Kx = f,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>x</mi> <mo>-</mo> <mi>K</mi> <mi>x</mi> <mo>=</mo> <mi>f</mi> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> where <i>f</i> is given and <i>K</i> is a Fredholm integral operator with a Green’s function type kernel defined on <i>C</i>[0,&#xa0;1]. For <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_882_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="46" /> </InlineMediaObject> <EquationSource Format="TEX">\(r \ge 0,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>r</mi> <mo>≥</mo> <mn>0</mn> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> we employ the interpolatory projection at <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_882_Article_IEq3.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="46" /> </InlineMediaObject> <EquationSource Format="TEX">\(2r + 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>2</mn> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> collocation points (not necessarily Gauss points) onto a space of piecewise polynomials of degree <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_882_Article_IEq4.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="38" /> </InlineMediaObject> <EquationSource Format="TEX">\(\le 2r\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>≤</mo> <mn>2</mn> <mi>r</mi> </mrow> </math></EquationSource> </InlineEquation> with respect to a uniform partition of [0,&#xa0;1]. Previous researchers have established that the iterations in the collocation method and its variants improve the orders of convergence by projection methods in the case of smooth kernels. In this article, we demonstrate the improvement in order of convergence by iterated versions of&#xa0;collocation and modified collocation methods when the kernel is of Green’s function type.</p>

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

A note on improvement by iteration for the approximate solutions of second kind Fredholm integral equations with Green’s kernels

  • Gobinda Rakshit,
  • Shashank K. Shukla,
  • Akshay S. Rane

摘要

Consider a linear operator equation \(x - Kx = f,\) x - K x = f , where f is given and K is a Fredholm integral operator with a Green’s function type kernel defined on C[0, 1]. For \(r \ge 0,\) r 0 , we employ the interpolatory projection at \(2r + 1\) 2 r + 1 collocation points (not necessarily Gauss points) onto a space of piecewise polynomials of degree \(\le 2r\) 2 r with respect to a uniform partition of [0, 1]. Previous researchers have established that the iterations in the collocation method and its variants improve the orders of convergence by projection methods in the case of smooth kernels. In this article, we demonstrate the improvement in order of convergence by iterated versions of collocation and modified collocation methods when the kernel is of Green’s function type.