arrow
Volume 17, Issue 1
Asymptotic Error Analysis for the Discrete Iterated Galerkin Solution of Urysohn Integral Equations with Green’s Kernels

Gobinda Rakshit

Adv. Appl. Math. Mech., 17 (2025), pp. 175-206.

Published online: 2024-12

Export citation
  • Abstract

Consider a Urysohn integral equation $x−\mathcal{K}(x)= f,$ where $f$ and the integral operator $\mathcal{K}$ with kernel of the type of Green’s function are given. In the computation of approximate solutions of the given integral equation by Galerkin method, all the integrals are needed to be evaluated by some numerical integration formula. This gives rise to the discrete version of the Galerkin method. For $r≥1,$ a space of piecewise polynomials of degree $≤ r−1$ with respect to a uniform partition is chosen to be the approximating space. For the appropriate choice of a numerical integration formula, an asymptotic series expansion of the discrete iterated Galerkin solution is obtained at the above partition points. Richardson extrapolation is used to improve the order of convergence. Using this method we can restore the rate of convergence when the error is measured in the continuous case. Numerical examples are given to illustrate this theory.

  • AMS Subject Headings

45G10, 65B05, 65J15, 65R20

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{AAMM-17-175, author = {Rakshit , Gobinda}, title = {Asymptotic Error Analysis for the Discrete Iterated Galerkin Solution of Urysohn Integral Equations with Green’s Kernels}, journal = {Advances in Applied Mathematics and Mechanics}, year = {2024}, volume = {17}, number = {1}, pages = {175--206}, abstract = {

Consider a Urysohn integral equation $x−\mathcal{K}(x)= f,$ where $f$ and the integral operator $\mathcal{K}$ with kernel of the type of Green’s function are given. In the computation of approximate solutions of the given integral equation by Galerkin method, all the integrals are needed to be evaluated by some numerical integration formula. This gives rise to the discrete version of the Galerkin method. For $r≥1,$ a space of piecewise polynomials of degree $≤ r−1$ with respect to a uniform partition is chosen to be the approximating space. For the appropriate choice of a numerical integration formula, an asymptotic series expansion of the discrete iterated Galerkin solution is obtained at the above partition points. Richardson extrapolation is used to improve the order of convergence. Using this method we can restore the rate of convergence when the error is measured in the continuous case. Numerical examples are given to illustrate this theory.

}, issn = {2075-1354}, doi = {https://doi.org/10.4208/aamm.OA-2023-0004}, url = {http://global-sci.org/intro/article_detail/aamm/23598.html} }
TY - JOUR T1 - Asymptotic Error Analysis for the Discrete Iterated Galerkin Solution of Urysohn Integral Equations with Green’s Kernels AU - Rakshit , Gobinda JO - Advances in Applied Mathematics and Mechanics VL - 1 SP - 175 EP - 206 PY - 2024 DA - 2024/12 SN - 17 DO - http://doi.org/10.4208/aamm.OA-2023-0004 UR - https://global-sci.org/intro/article_detail/aamm/23598.html KW - Urysohn integral equation, Green’s kernel, iterated Galerkin method, Nyström approximation, Richardson extrapolation. AB -

Consider a Urysohn integral equation $x−\mathcal{K}(x)= f,$ where $f$ and the integral operator $\mathcal{K}$ with kernel of the type of Green’s function are given. In the computation of approximate solutions of the given integral equation by Galerkin method, all the integrals are needed to be evaluated by some numerical integration formula. This gives rise to the discrete version of the Galerkin method. For $r≥1,$ a space of piecewise polynomials of degree $≤ r−1$ with respect to a uniform partition is chosen to be the approximating space. For the appropriate choice of a numerical integration formula, an asymptotic series expansion of the discrete iterated Galerkin solution is obtained at the above partition points. Richardson extrapolation is used to improve the order of convergence. Using this method we can restore the rate of convergence when the error is measured in the continuous case. Numerical examples are given to illustrate this theory.

Rakshit , Gobinda. (2024). Asymptotic Error Analysis for the Discrete Iterated Galerkin Solution of Urysohn Integral Equations with Green’s Kernels. Advances in Applied Mathematics and Mechanics. 17 (1). 175-206. doi:10.4208/aamm.OA-2023-0004
Copy to clipboard
The citation has been copied to your clipboard