Richardson extrapolation for the discrete iterated modified projection solution
Gobinda Rakshit, Rekha P. Kulkarni

TL;DR
This paper develops an asymptotic expansion for the discrete iterated modified projection solution of Urysohn integral equations and employs Richardson extrapolation to enhance convergence order, ensuring numerical quadrature preserves the continuous case's convergence rate.
Contribution
It introduces an asymptotic expansion for the discrete iterated modified projection solution and applies Richardson extrapolation to improve convergence order in numerical solutions.
Findings
Richardson extrapolation effectively increases convergence order.
A suitable numerical quadrature preserves the continuous case's convergence rate.
Asymptotic expansion provides insights into the discrete solution's behavior.
Abstract
Approximate solutions of Urysohn integral equations using projection methods involve integrals which need to be evaluated using a numerical quadrature formula. It gives rise to the discrete versions of the projection methods. For a space of piece-wise polynomials of degree with respect to an uniform partition is chosen to be the approximating space and the projection is chosen to be the interpolatory projection at Gauss points. Asymptotic expansion for the iterated modified projection solution is available in literature. In this paper, we obtain an asymptotic expansion for the discrete iterated modified projection solution and use Richardson extrapolation to improve the order of convergence. Our results indicate a choice of a numerical quadrature which preserves the order of convergence in the continuous case.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Richardson extrapolation for the discrete iterated modified projection solution
Rekha P. KULKARNI and Gobinda RAKSHIT Department of Mathematics, I.I.T. Bombay, Powai, Mumbai 400076, India, [email protected], [email protected]
Abstract
Approximate solutions of Urysohn integral equations using projection methods involve integrals which need to be evaluated using a numerical quadrature formula. It gives rise to the discrete versions of the projection methods. For a space of piecewise polynomials of degree with respect to an uniform partition is chosen to be the approximating space and the projection is chosen to be the interpolatory projection at Gauss points. Asymptotic expansion for the iterated modified projection solution is available in literature. In this paper, we obtain an asymptotic expansion for the discrete iterated modified projection solution and use Richardson extrapolation to improve the order of convergence. Our results indicate a choice of a numerical quadrature which preserves the order of convergence in the continuous case. Numerical results are given for a specific example.
Key Words : Urysohn integral operator, Interpolatory projection, Gauss points, Nyström Approximation, Richardson extrapolation.
AMS subject classification : 45G10, 65J15, 65R20
1 Introduction
Let and consider the following Urysohn integral operator
[TABLE]
where is a continuous real valued function defined on Then is a compact operator from to Assume that for
[TABLE]
has a unique solution
We are interested in computable approximate solutions of the above equation. We consider some projection methods associated with a sequence of interpolatory projections converging to the Identity operator pointwise.
For let denote the space of piecewise polynomials of degree with respect to a uniform partition of with subintervals. Let denote the mesh of the partition and let be the interpolation operator at Gauss points. In Grammont et al [5] the following modified projection method is investigated:
[TABLE]
where
[TABLE]
The iterated modified projection solution is defined as
[TABLE]
If and then the following orders of convergence are proved in Grammont et al [5]:
[TABLE]
Under the assumption of and the following asymptotic series expansion is obtained in Kulkarni-Nidhin [6] :
[TABLE]
where the function is independent of
In practice, it is necessary to replace all the integrals by a numerical quadrature formula, giving rise to the discrete versions of the above methods.
We choose a composite numerical quadrature formula with a degree of precision and with respect to a uniform partition of with subintervals. Let denote the mesh of this fine partition. Then the Nyström operator is obtained by replacing the integral in the definition (1.1) of and the discrete version of the operator defined in (1.3) is obtained on replacing by and is denoted by The Nyström solution is denoted by and it satisfies
[TABLE]
The discrete modified projection and the discrete iterated modified projection solutions are denoted respectively by and and are defined as
[TABLE]
In Kulkarni-Rakshit [7] the following estimates are proved:
If then
[TABLE]
If then
[TABLE]
In this paper we show that if
[TABLE]
then in fact
[TABLE]
where the term is independent of If we choose and such that then using the Richardson extrapolation, an estimate of of the order of could be obtained.
The proof of (1.4) is based on an asymptotic expansion for the term where denotes the Fréchet derivative of at and is a smooth function. This is obtained by using the Euler-MacLaurin formula. The main difficulty in proving (1.7) is that a discrete version of the Euler-MacLaurin formula is not available which is needed for obtaining an asymptotic expansion for We prove (1.7) using a different approach.
The paper is arranged as follows. In Section 2 we define discrete versions of the modified projection method and of its iterated version. Section 3 is devoted to the asymptotic series expansions for and for terms involving higher order Fréchet derivatives of the operator at In Section 4 we prove our main result, that is, the expansion (1.7). Numerical results are given in Section 5.
2 Discrete Projection Methods
In the discrete projection methods, all the integrals are replaced by a numerical quadrature formula. We first define a numerical quadrature formula and the Nyström operator which approximates Let and consider the following uniform partition of
[TABLE]
Let
[TABLE]
Consider a basic quadrature rule
[TABLE]
and let
[TABLE]
A composite integration rule with respect to the partition (2.1) is then defined as
[TABLE]
For let
[TABLE]
The error in the numerical quadrature is assumed to be of the following form: There is a positive integer such that if then
[TABLE]
where denotes th derivative of and is a constant independent of
Assume that and that Then it follows that We also assume throughout that is a bounded linear operator from to itself.
We replace the integral in (1.1) by the numerical quadrature formula (2.2) and define the Nyström operator as
[TABLE]
Then since and it follows that
[TABLE]
In the Nyström method, (1.2) is approximated by
[TABLE]
Fix and define
[TABLE]
Then for sufficiently large, the equation (2.5) has a unique solution in and
[TABLE]
Note that the Fréchet derivative of is given by
[TABLE]
If and then from (2.3),
[TABLE]
where and is a constant independent of
We now define the interpolatory projection at Gauss points. Let and consider the following uniform partition of
[TABLE]
Define
[TABLE]
For a positive integer let
[TABLE]
Let denote the Gauss-Legendre zeros of order in The collocation nodes are chosen as follows:
[TABLE]
Define the interpolation operator as
[TABLE]
Using the Hahn-Banach extension theorem as in Atkinson et al [3], can be extended to Note that for as As a consequence,
[TABLE]
Also, if then
[TABLE]
where is a constant independent of Throughout this paper we choose and for some Then It follows from (2.6), (2.8) and (2.9) that
[TABLE]
Hence it follows that
[TABLE]
The discrete modified projection operator is defined by replacing with in (1.3) as follows:
[TABLE]
Discrete Modified Projection Method: For and big enough,
[TABLE]
has a unique solution in a
The Discrete Iterated Modified Projection solution is defined as
[TABLE]
3 Asymptotic Series Expansions
By assumption, is invertible. Let
[TABLE]
We quote the following asymptotic series expansions from Kulkarni-Nidhin [6].
If and then
[TABLE]
[TABLE]
where for
[TABLE]
[TABLE]
[TABLE]
with
[TABLE]
Note that the coefficients are independant of Also,
[TABLE]
where
[TABLE]
and
[TABLE]
Let and The Fréchet derivatives of are as follows:
[TABLE]
We introduce the following notations:
[TABLE]
Using the Mean Value Theorem, it can be seen that
[TABLE]
We now prove asymptotic series expansions for the first three Fréchet derivatives of the Nyström operator at
Proposition 3.1*.*
If and then
[TABLE]
[TABLE]
[TABLE]
Proof.
We write
[TABLE]
Since and from the estimate (2.7) we obtain,
[TABLE]
Since it follows from (3.1) that
[TABLE]
Since by (2.6), we obtain
[TABLE]
Using the estimate (3.3), we thus obtain
[TABLE]
This completes the proof of (3.4). The proofs of (3.5) and (3.6) are similar. ∎
4 Discrete Iterated Modified Projection method
In this section we prove our main result about the asymptotic series expansion for the discrete iterated modified projection solution
Using the generalised Taylor series expansion, we obtain
[TABLE]
where
[TABLE]
It follows that
[TABLE]
If then using (1.5) we deduce that
[TABLE]
Our aim is to obtain an asymptotic series expansion for the first term on the right hand side of the above equation.
We first prove the following preliminary results which are needed later on.
Lemma 4.1*.*
If then for and for
[TABLE]
[TABLE]
and
[TABLE]
Proof.
Note that for and for
[TABLE]
and for
[TABLE]
Hence, for
[TABLE]
From the estimate (2.9),
[TABLE]
By taking the supremum over the set we obtain (4.2).
We recall the following result from Kulkarni-Rakshit [7]: If then
[TABLE]
where
[TABLE]
and is a constant independent of Since it follows that
[TABLE]
By taking the supremum over the set we obtain (4.3).
In order to prove (4.4), we recall the following estimate from Kulkarni-Rakshit [7]: If then
[TABLE]
Then for
[TABLE]
The estimate (4.4) then follows by taking the supremum over the set
∎
From Proposition 4.2 of Kulkarni-Rakshit [7] we recall that for all big enough,
is invertible and that where is a constant independent of It can be easily checked that
[TABLE]
Let We write
[TABLE]
We obtain an asymptotic expansion for the first term on the right hand side of (4.6) and show that the second and the third terms are of the order of The following two lemmas are needed to obtain the results for the first term.
From now onwards we assume that
[TABLE]
Lemma 4.2*.*
If then
[TABLE]
and
[TABLE]
Proof.
Using the resolvent identity, we write
[TABLE]
Let
[TABLE]
From (2.6), (4.3) and (4.5), it follows that
[TABLE]
Note that
[TABLE]
Consider the first term
[TABLE]
Note that from (3.2) and (3.4),
[TABLE]
On the other hand,
[TABLE]
From Kulkarni-Rakshit [7, Proposition 2.3], we have
[TABLE]
Combining the above estimate with the estimates (2.6), (2.10), (3.3) and (4.2), we obtain
[TABLE]
Thus,
[TABLE]
Using the estimate (4.9), it then follows that the second term of (4.10) is of the order of We write the third term of (4.10) as
[TABLE]
From (2.7), for
[TABLE]
It follows that
[TABLE]
whereas as in Lemma 4.1, it can be proved that
[TABLE]
Thus the third term of (4.10) is of the order of
Hence
[TABLE]
which proves (4.7). The proof of (4.8) is similar. ∎
Lemma 4.3*.*
If then
[TABLE]
Proof.
Let
[TABLE]
Then using (2.10) and (4.3), we obtain
[TABLE]
As in Lemma 4.2, we write
[TABLE]
Note that
[TABLE]
Using the asymptotic expansions (3.2) and (3.6) we obtain
[TABLE]
If then and if then Hence it follows that
[TABLE]
On the other hand, using (2.7), (2.10), (3.3) and (4.2) we obtain
[TABLE]
Sine it follows that
[TABLE]
Using the estimates (3.3) and (4.12), we see that
[TABLE]
We write the third term of (4.13) as
[TABLE]
From (2.10), (4.2) and (4.11), it follows that the above term is of the order of Thus,
[TABLE]
Since it follows from (4.13) - (4.17) that
[TABLE]
This completes the proof. ∎
We now obtain the asymptotic expansion for the first term of (4.6).
Proposition 4.4*.*
If then
[TABLE]
Proof.
Note that
[TABLE]
By Taylor’s theorem,
[TABLE]
where Hence
[TABLE]
Using (2.10) and (4.3) we deduce that
[TABLE]
Using the above estimate, Lemma 4.2 and Lemma 4.3, we obtain
[TABLE]
which completes the proof. ∎
We quote the following result from Kulkarni-Rakshit [7, Proposition 4.6]:
[TABLE]
It follows that the second term on the right hand side of (4.6) is of the order of
We now want obtain the order of convergence of the third term on the right hand side of (4.6). For this purpose we first prove the following result.
Lemma 4.5*.*
If then
[TABLE]
[TABLE]
Proof.
Note that
[TABLE]
where Hence
[TABLE]
Recall from (4.5) that
[TABLE]
and it can be checked that
[TABLE]
Thus,
[TABLE]
On the other hand, since and from (2.6) and (4.4),
[TABLE]
The estimate (4.18) then follows from (4.20), (4.21) and (4.22).
In order to prove (4.19), recall that
[TABLE]
Hence
[TABLE]
The result (4.19) follows from (2.10), (3.3), (4.3) and (4.4). ∎
We now obtain the order of convergence of the third term in (4.6).
Proposition 4.6*.*
If then
[TABLE]
Proof.
Note that
[TABLE]
By Taylor’s theorem,
[TABLE]
where Hence from (1.5), (2.10) and (4.3), we obtain
[TABLE]
Note that
[TABLE]
By (4.3) and (4.17), the first term on the right hand side of the above equation is of the order of By (4.18) of Lemma 4.5, the second term is of the order of By (4.19) of Lemma 4.5 and by (1.5), the third term is of the order of It follows that
[TABLE]
The required result follows from (4.23) and the above estimate. ∎
We now prove our main result.
Theorem 4.7**.**
*If then *
[TABLE]
Proof.
Recall from (4.1) that
[TABLE]
Recall from (4.6) that
[TABLE]
Thus, by Proposition 4.4, estimate (4.17) and Proposition 4.6, we obtain
[TABLE]
and the proof is complete. ∎
We can now apply one step of Richardson extrapolation and obtain approximations of of higher order. Define
[TABLE]
Then we have the following result.
Corollary 1**.**
Under the assumptions of Theorem 4.7,
[TABLE]
If we choose and such that then
[TABLE]
5 Numerical Results
In this section we quote the results from Kulkarni-Nidhin [6] to illustrate the improvement of orders of convergence by the Richardson extrapolation obtained in (4.25).
Consider
[TABLE]
where is so chosen that is a solution of (5.1).
We consider the following uniform partition of
[TABLE]
For let be the space of piecewise polynomials of degree with respect to the partition (5.2). The collocation points are chosen to be Gauss points in each subinterval.
If is the space of piecewise constant functions, then we choose the composite 2 point Gaussian quadrature with respect to the uniform partition of with intervals. The computations are done for and Thus,
[TABLE]
and the conditions of Theorem 4.7 are satisfied.
If is the space of piecewise linear functions, then we chose the composite 2 point Gaussian quadrature with respect to the uniform partition of with intervals. Thus,
[TABLE]
and the conditions of Theorem 4.7 are satisfied.
Table 4.4, Interpolation at Midpoints:
[TABLE]
Table 4.6, Interpolation at Gauss 2 points:
[TABLE]
The expected orders of convergence from (1.5), (1.7) and (4.24) are as follows:
Discrete Modified Projection Solution:
Discrete Iterated Modified Projection Solution: \delta^{IM}=4r,\;\;\
Extrapolated Solution:
It is clear from the above tables that the computed orders of convergence match well with the theoretical orders of convergence and that the extrapolated solution improves upon the discrete iterated modified projection solution.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] K. E. ATKINSON, The Numerical Solutions of Integral Equations of the Second Kind, Cambridge University Press, Cambridge, U.K., 1997.
- 2[2] K. E. ATKINSON and J. FLORES, The discrete collocation method for nonlinear integral equations, IMA J. of Numerical Analysis, 13 (1993), 195 - 213.
- 3[3] K. ATKINSON, I. GRAHAM and I. SLOAN, Piecewise continuous collocation for Integral Equations, SIAM J. of Numerical Analysis, 20 (1983), pp. 172-186.
- 4[4] K. E. ATKINSON and F. A. POTRA, Projection and iterated projection methods for nonlinear integral equations, SIAM J. Numer. Anal., 24 (1987), 1352 - 1373.
- 5[5] L. GRAMMONT, R. P. KULKARNI and P. VASCONCELOS, Modified projection and the iterated modified projection methods for nonlinear integral equations, J. Integral Equations Appl. Volume 25, (2013), 481-516.
- 6[6] R. P. KULKARNI and T. J. NIDHIN, Asymptotic error analysis of projection and modified projection methods for non-linear integral equations, J. Integral Equations Appl., Volume 27 (2015), 67-101.
- 7[7] R. P. KULKARNI and G. RAKSHIT, Discrete modified projection method for Urysohn integral equations with smooth kernels, Applied Numerical Mathematics, 126 (2018), 180-198.
