Asymptotic error analysis for the discrete iterated Galerkin solution of Urysohn integral equations with Green's kernels
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 \geq 1$, a space of piecewise polynomials of degree $\leq 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. A numerical example is given to illustrate this theory.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.