Preprint
Article

This version is not peer-reviewed.

Generalized Fixed-Point Principles for Integral Equations and Their Quadrature Approximations

Submitted:

16 June 2026

Posted:

17 June 2026

You are already at the latest version

Abstract
We introduce a generalized fixed-point framework based on $d$-$\psi$-$\varepsilon$-contractions and weak $d$-$\psi$-$\varepsilon$-contractions, where the contraction metric and the metric in which the space is complete may be different and the comparison function belongs to the class $\Psi_0(\varepsilon)$. This setting extends several classical fixed-point principles and yields existence, uniqueness, localization, and convergence results for Picard iterations. The theory is applied to nonlinear integral equations and to their quadrature approximations. By introducing suitable invariant sets and a \(\psi\)-\(\varepsilon\)-max inequality, existence and uniqueness results are obtained under assumptions that are substantially different from classical Lipschitz-type conditions. The developed framework is further extended to quadrature integral equations generated by numerical integration formulas. Sufficient conditions are established for the existence and uniqueness of solutions as well as for the convergence of the associated Picard sequences. The theoretical results guarantee convergence of the discrete iterations under appropriate assumptions, thereby providing a direct connection between fixed-point theory and numerical computation. Several examples, including Chandrasekhar-type integral equations and nonlinear weighted integral equations with singular kernels, are presented to illustrate the applicability and effectiveness of the proposed approach. Numerical experiments confirm the theoretical findings and demonstrate the accuracy of the resulting quadrature-Picard schemes.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

Integral equations arise naturally in many branches of mathematics, physics, engineering, astronomy, biology, economics, and applied sciences. Numerous boundary value problems, differential equations, radiative transfer models, population dynamics models, and transport phenomena can be reformulated as integral equations. Consequently, the development of effective theoretical and numerical techniques for establishing the existence, uniqueness, and approximation of their solutions has remained an active area of research.
One of the most powerful tools in the study of nonlinear integral equations is fixed-point theory. In particular, the Banach contraction principle and its numerous extensions provide a unified framework for proving the existence and uniqueness of solutions for a wide range of functional, differential, and integral equations. The fundamental idea is to reformulate the original problem as a fixed-point equation T x = x , and then establish suitable contractive properties of the associated operator T. Classical results typically require the operator to satisfy a global contraction condition on a complete metric space. Although highly successful, these assumptions are often restrictive in applications, especially for nonlinear integral operators that fail to be contractions on the entire space.
To overcome these limitations, various generalizations of contraction mappings have been developed. Such extensions have considerably enlarged the class of operators for which fixed-point methods can be applied.
Motivated by these observations, this paper develops a fixed-point framework based on a class of generalized comparison functions Ψ 0 ( ε ) , where ε ( 0 , + ] . This class extends the classical notion of comparison functions by requiring only the convergence of iterates ψ n ( t ) 0 , t < ε , rather than on the whole positive half-line. This localization leads naturally to the notions of d- ψ - ε -contractions and weak d- ψ - ε -contractions, which generalize several classical fixed-point principles based on comparison functions.
A distinctive feature of the proposed approach is the separation between the metric governing the contraction and the metric governing completeness. More precisely, the contractive condition is formulated with respect to a metric d, whereas convergence is established in a complete metric space ( X * , d * ) . This separation enables the treatment of situations in which the natural contractive metric is not complete or is not suitable for directly proving convergence. As a consequence, the resulting fixed-point theorem provides a flexible framework that is particularly well adapted to nonlinear integral equations.
The abstract theory is subsequently applied to nonlinear Fredholm-type integral equations. By constructing suitable invariant subsets and introducing a ψ - ε -max inequality, existence, uniqueness, localization, and convergence results are obtained under assumptions that differ substantially from classical Lipschitz-type conditions. The developed framework is further illustrated through Chandrasekhar-type equations and several nonlinear weighted integral equations.
Besides the theoretical analysis, numerical approximation of the obtained solutions is also investigated. The integral operators are replaced by suitable quadrature formulas, including Newton–Cotes, Gauss–Legendre, and Gauss–Jacobi rules, leading to quadrature integral equations. Combining these discretizations with Picard iteration produces numerical schemes whose convergence is supported by the underlying fixed-point theory. In this way, the paper establishes a direct connection between analytical existence theory and practical computational methods.
The principal contributions of this paper can be summarized as follows:
1.
Introduction of the generalized class Ψ 0 ( ε ) together with the notions of d- ψ - ε -contractions and weak d- ψ - ε -contractions.
2.
Establishment of a fixed-point theorem in which the contraction metric and the completeness metric are allowed to be different.
3.
Development of existence, uniqueness, localization, and convergence results for nonlinear integral equations under a ψ - ε -max inequality.
4.
Extension of the theory to quadrature integral equations generated by numerical integration rules.
5.
Construction and analysis of Picard-type numerical schemes based on Newton–Cotes and Gaussian quadrature formulas.
6.
Applications to Chandrasekhar-type integral equations and several nonlinear weighted integral equations.
The remainder of the paper is organized as follows. Section 2 contains the necessary preliminaries and auxiliary results which yields generalized fixed-point principles. Section 3 and Section 4 develops the abstract fixed-point framework and establishes the main existence and convergence theorem for nonlinear integral equations and quadrature integral equations, respectively. Section 4 introduces numerical schemes based on Picard iteration and quadrature rules and establishes convergence result and local error estimation of numerical scheme for general quadrature integral equations. Numerical experiments and applications are presented in Section 5. Finally, conclusions and directions for future research are discussed in the last section.

2. A new and significant fixed point theorem

This section presents a new and significant theorem that allows us to resolve integral equations. To prove it, some preliminaries are needed.
Definition 1. 
If d and d * are two metrics on a space X, we say that d * is Cauchy weaker than d, denoted d * d , if every d-Cauchy sequence in ( X , d ) is also a d * -Cauchy sequence in ( X , d * ) . For example, if there exist constants M > 0 and α > 0 such that d * ( x , y ) M ( d ( x , y ) ) α for all x , y X , then d * d . In the case α = 1 , we say that d * is equivalent from above to d.
Example 1. 
Suppose 0 f C [ a , b ] is fixed. Let us introduce a metric on C [ a , b ] by
d f ( x , y ) = max { x f u , y f u } , x y C [ a , b ] , 0 , otherwise ,
which enables us to find the solution of the integral equations in the subsequent sections.
A sequence x n in the metric space ( C [ a , b ] , d f ) is Cauchy if
ε > 0 , N N such that d f ( x n , x m ) = max { x n f u , x m f u } < ε for all m , n N .
Hence, a Cauchy sequence must eventually lie arbitrarily close to f. In particular, this implies x n d f f . Thus, ( C [ a , b ] , d f ) is a complete metric space, and every Cauchy sequence in the topology τ d f converges to f.
The following definition extends several previously introduced notions, see [1,13,18,22].
Definition 2. 
Let ε ( 0 , + ] . Denote by Ψ 0 ( ε ) the family of all non-decreasing functions ψ : [ 0 , ) [ 0 , ) satisfying ψ ( t ) = 0 if and only if t = 0 , and
lim n ψ n ( t ) = 0 for every t < ε ,
where ψ n denotes the n-fold composition of ψ. If ε = + , then every ψ Ψ 0 ( + ) is called a comparison function (see [1]).
Now let ( X , d ) be a metric space and let T : X X be a self-map.
  • If there exist ε > 0 and a function ψ Ψ 0 ( ε ) such that
    d ( T u , T v ) ψ d ( u , v ) for all u , v X with d ( u , v ) < ε ,
    then T is called a d-ψ-ε-contraction.
  • If there exist ε > 0 and a function ψ Ψ 0 ( ε ) such that
    d ( T u , T 2 u ) ψ d ( u , T u ) for all u X with d ( u , T u ) < ε ,
    then T is called a weak d-ψ-ε-contraction.
A point x 0 X is called a d-ε-initial value for T if
d ( x 0 , T x 0 ) < ε .
In the case ε = + , the restrictions d ( u , v ) < ε and d ( u , T u ) < ε are unnecessary in (2) and (3), respectively, and every point x 0 X is a d-ε-initial value.
Clearly, every d-ψ-ε-contraction is also a weak d-ψ-ε-contraction.
The following lemma shows that every d- ψ - ε -contraction T on X is continuous.
Lemma 1 
(see also [3]).
1.
If ψ Ψ 0 ( ε ) for some 0 < ε + , then ψ ( t ) < t for all 0 < t < ε .
Assume that ( X , d ) is a metric space.
2.
Every d-ψ-ε-contraction self-map T on X is continuous in topology τ d .
3.
Let T be a continuous self-map on X. Then the limit of every convergent Picard sequence in X is a fixed point of T.
Proof. 
1.
Assume that there exists 0 < t < ε such that ψ ( t ) t . Since ψ is nondecreasing, an induction argument yields ψ n ( t ) t > 0 , n N , which contradicts lim n ψ n ( t ) = 0 . Therefore, ψ ( t ) < t for all 0 < t < ε .
2.
Suppose that d ( x n , x ) 0 . Then there exists N N such that d ( x n , x ) < ε , n N . Hence, d ( T x n , T x ) ψ ( d ( x n , x ) ) , n N . Since ψ ( d ( x n , x ) ) 0 , we conclude that d ( T x n , T x ) 0 . Thus, T is continuous.
3.
Let x n be a convergent Picard sequence such that x n x * . Since T is continuous, T x n T x * . On the other hand, since x n + 1 = T x n and x n + 1 x * , it follows that T x * = x * . Therefore, x * is a fixed point of T.
Some elementary properties related to Definition 2 are given below:
Lemma 2. 
1.
If 0 < ε < ε , then Ψ 0 ( ε ) Ψ 0 ( ε ) . Moreover, ψ ( t ) = 1 ε t 2 Ψ 0 ( ε ) Ψ 0 ( ε ) ; hence Ψ 0 ( ε ) Ψ 0 ( ε ) .
2.
If ψ Ψ 0 ( ε ) for some ε > 0 , then L ψ Ψ 0 ( ε ) for all 0 < L 1 .
3.
For ψ λ ( t ) = λ t ( t 0 ) with 0 < λ < 1 , we have ψ λ Ψ 0 ( ε ) for every ε > 0 . If λ 1 , then Lemma 1-1 implies that ψ λ Ψ 0 ( ε ) for any ε > 0 .
4.
If ψ ( t ) = λ t 2 ( t 0 ) with λ > 0 , then ψ Ψ 0 ( ε ) for ε = λ 1 . The given ε is the greatest value for which ψ Ψ 0 ( ε ) .
5.
If ψ ( t ) = λ t α ( t 0 ) with λ > 0 and α > 1 , then ψ Ψ 0 ( ε ) for ε = λ 1 α 1 . The given ε is the greatest value for which ψ Ψ 0 ( ε ) .
6.
Let λ > 0 and 0 < L 1 . If ψ Ψ 0 ( ε ) for some ε > 0 , then ψ ( t ) = L ψ ( λ t ) ( t 0 ) belongs to Ψ 0 ( ε ) with ε = ε λ .
7.
Let λ , L > 0 and α > 1 . For ψ ( t ) = ( λ t ) α , define ψ ( t ) = L ψ ( λ t ) = L 1 α λ t α . Then ψ Ψ 0 ( ε ) with ε = L 1 α 1 λ α α 1 . The given ε is the greatest value for which ψ Ψ 0 ( ε ) .
8.
If ψ ( t ) = ( λ t ) α with λ > 0 and α > 1 , then ψ Ψ 0 ( ε ) for ε = λ α α 1 . Moreover, if ( X , d ) is a metric space such that d ( T u , T v ) λ α d α ( u , v ) , u , v X , then T is a d-ψ-ε-contraction.
9.
If ψ ( t ) = ln ( t + 1 ) ( t 0 ), then ψ Ψ 0 ( ε ) , for all 0 < ε + .
10.
If ψ ( t ) = t ln ( t + 1 ) ( t 0 ), then ψ Ψ 0 ( ε ) , for all 0 < ε + .
Proof. 
Items 1–3 are straightforward. We prove item 5. Items 4–8 are either immediate consequences or can be proved similarly.
The fixed points of ψ are 0 and ε : = λ 1 α 1 . Suppose that 0 < t < ε . Then ψ ( ψ ( t ) ) = λ ( ψ ( t ) ) α = λ ( λ t α ) α = λ 1 + α t α 2 . The inequality ψ ( ψ ( t ) ) < ψ ( t ) is equivalent to λ 1 + α t α 2 < λ t α , which holds if and only if t < λ 1 α 1 = ε .
By induction, ψ n + 1 ( t ) < ψ n ( t ) for all n N and every 0 < t < ε . Hence ψ n ( t ) is decreasing and bounded below by 0, and therefore converges to some limit L.
Since ψ is continuous, Lemma 1-3 implies that L is a fixed point of ψ on [ 0 , ) . Therefore L = 0 for all 0 < t < ε , and consequently ψ Ψ 0 ( ε ) .
If t 0 ε , then ψ n ( t 0 ) t 0 for all n N . Hence lim n ψ n ( t 0 ) t 0 > 0 . This proves that ε is the greatest value such that ψ Ψ 0 ( ε ) .
Items 9 and 10:
Fix t > 0 and define the iterates t 0 = t and t n + 1 = ψ ( t n ) = ln ( 1 + t n ) . Since 0 < ψ ( t ) < t for all t > 0 , and ψ is continuous, the sequence t n is strictly decreasing and converges to the unique fixed point 0. Thus, ψ Ψ 0 ( + ) . Similarly, 10 holds.
In the case of Lemma 2-3, a mapping T satisfying (2) is called a contraction on ( X , d ) .
The following fundamental theorem provides the principal framework for the analysis of the integral equations considered in the subsequent sections. Its main novelty is the decoupling of the contraction structure, described by a metric d on a possibly non-complete space X, from the completeness structure, described by a metric d * on a complete subspace X * X , together with the extension of the theory to the class Ψ 0 ( ε ) , where ε ( 0 , + ] .
Theorem 1. 
Let ( X , d ) be a (not necessarily complete) metric space, and ε ( 0 , + ] .
(I)
Assume that T is a weak d-ψ-ε-contraction on X, where ψ Ψ 0 ( ε ) . Then the Picard sequence x n = T n ( x 0 ) is asymptotically regular for every d-ε-initial value x 0 X .
(II)
Assume that T is a d-ψ-ε-contraction on X, where ψ Ψ 0 ( ε ) . Then the Picard sequence x n = T n ( x 0 ) is a d-Cauchy sequence for every d-ε-initial value x 0 X .
(III)
In addition to part (II), suppose that there exists a subset X * X such that ( X * , d * ) is a complete metric space, T ( X * ) X * , d * d on X * , and T is continuous with respect to d * . Then, for every d-ε-initial value x 0 X * , the Picard sequence x n = T n ( x 0 ) converges to a fixed point u * X * of T with respect to the topology τ d * . Moreover, the fixed point of T is unique in the set
B d , ε ( u * ) : = { v X * : d ( u * , v ) < ε } .
(IV)
In addition to part (III), suppose that d * is equivalent from above to d, that is, there exists a constant M > 0 such that d * M d , and that ψ Ψ 0 ( ε ) satisfies the condition
ψ ( t ) t is non - decreasing on ( 0 , ε ) .
Then the following a posteriori and a priori estimates hold, respectively, for every Picard sequence x n = T n ( x 0 ) generated by a d-ε-initial value x 0 X * satisfying x 0 T x 0 :
d * ( x n , u * ) M d ( x 0 , T x 0 ) d ( x 0 , T x 0 ) ψ ( d ( x 0 , T x 0 ) ) d ( x n , x n + 1 ) ,
d * ( x n , u * ) M d ( x 0 , T x 0 ) d ( x 0 , T x 0 ) ψ ( d ( x 0 , T x 0 ) ) ψ n d ( x 0 , T x 0 ) , n N .
Proof. 
(I)
Consider the Picard sequence x n = T n ( x 0 ) for x 0 X with d ( x 0 , T x 0 ) < ε . From (3) and the non-decreasing property of ψ we obtain
d ( x n , x n + 1 ) = d ( T n x 0 , T n + 1 x 0 ) ψ d ( T n 1 x 0 , T n x 0 ) ψ n d ( x 0 , T x 0 )
for all n N . Hence
lim n d ( x n , x n + 1 ) lim n ψ n d ( x 0 , T x 0 ) = 0 ,
because ψ Ψ 0 ( ε ) and d ( x 0 , T x 0 ) < ε . Thus x n is an asymptotically regular sequence.
(II)
Assume that T is a d- ψ - ε -contraction for some ψ Ψ 0 ( ε ) with ε > 0 (possibly ε = + ). Let x 0 X be a d- ε -initial value, i.e. d ( x 0 , T x 0 ) < ε , and define x n = T n x 0 .
From part (I) we know lim n d ( x n , x n + 1 ) = 0 .
Fix an arbitrary η > 0 . Choose a number δ such that
0 < δ < min { ε , η / 2 } .
Since δ < ε , Lemma 1-1 gives ψ ( δ ) < δ ; thus α : = δ ψ ( δ ) > 0 . Because d ( x n , x n + 1 ) 0 , there exists n 0 N such that
d ( x i + 1 , x i ) < α for all i n 0 .
We claim that d ( x n 0 + k , x n 0 ) < δ for every k N . For k = 1 this follows directly from the choice of n 0 . Assume it holds for some k 1 . Then, using the contraction property (note that d ( x n 0 + k , x n 0 ) < δ < ε ),
d ( x n 0 + k + 1 , x n 0 ) d ( x n 0 + k + 1 , x n 0 + 1 ) + d ( x n 0 + 1 , x n 0 ) ψ d ( x n 0 + k , x n 0 ) + d ( x n 0 + 1 , x n 0 ) < ψ ( δ ) + α = δ .
Thus the claim holds for all k by induction.
Consequently, for all m , n n 0 ,
d ( x m , x n ) d ( x m , x n 0 ) + d ( x n , x n 0 ) < 2 δ η .
Since η > 0 was arbitrary, x n is a d-Cauchy sequence.
(III)
Since d * d , part (II) implies that the Picard sequence x n : = T n ( x 0 ) is also a d * -Cauchy sequence for every d- ε -initial value x 0 X * . Since ( X * , d * ) is complete, there exists u * X * such that
T n ( x 0 ) d * u * , i . e . , lim n d * ( T n ( x 0 ) , u * ) = 0 .
By the continuity of T, it follows that u * is a fixed point of T in X * ; see Lemma 1.
To prove uniqueness, suppose that u * and v * are fixed points of T satisfying 0 < d ( u * , v * ) < ε . Then, by (2) and Lemma 1-1,
0 < d ( u * , v * ) = d ( T u * , T v * ) ψ d ( u * , v * ) < d ( u * , v * ) ,
which is impossible. Therefore, u * is the unique fixed point of T in the ball
B d , ε ( u * ) : = { v X * : d ( u * , v ) < ε } .
(IV)
Assume 0 < d ( x n , x n + 1 ) for all n N . By part (I), d ( x n , x n + 1 ) 0 . Induction using (3) and Lemma 1-1 gives
d ( x n , x n + 1 ) ψ d ( x n 1 , x n ) < d ( x n 1 , x n ) < < d ( x 0 , T x 0 ) < ε
for all n. From the monotonicity condition (4) on ψ ( t ) / t we deduce
d ( x 1 , x 0 ) ψ ( d ( x 1 , x 0 ) ) d ( x 1 , x 0 ) d ( x n , x n + 1 ) ψ ( d ( x n , x n + 1 ) ) d ( x n , x n + 1 ) d ( x n , x n + 1 ) d ( x n + 1 , x n + 2 ) d ( x n , x n + 1 )
for every n N . Using the right-hand inequality and the fact that d * M d , we estimate for any m n :
d * ( x n , x m ) i = n m 1 d * ( x i , x i + 1 ) M i = n m 1 d ( x i , x i + 1 ) M d ( x 1 , x 0 ) d ( x 1 , x 0 ) ψ ( d ( x 1 , x 0 ) ) i = n d ( x i , x i + 1 ) d ( x i + 1 , x i + 2 ) = M d ( x 1 , x 0 ) d ( x 1 , x 0 ) ψ ( d ( x 1 , x 0 ) ) d ( x n , x n + 1 ) lim i d ( x i + 1 , x i + 2 ) = M d ( x 1 , x 0 ) d ( x 1 , x 0 ) ψ ( d ( x 1 , x 0 ) ) d ( x n , x n + 1 ) .
Letting m we obtain the a posteriori estimate (5).
If it is not true that d ( x n , x n + 1 ) > 0 for all n, the non-increasing nature of this sequence guarantees the existence of some N such that d ( x n , x n + 1 ) > 0 for n N and d ( x n , x n + 1 ) = 0 for n > N . Consequently x n = u * for all n > N , and the estimate (5) holds trivially for n > N ; for n N the same reasoning as above applies.
Finally, the a priori estimate (6) follows from the a posteriori estimate (5) together with inequality (7), valid for every d- ε -initial value x 0 X * .
Remark 1. 
1.
The first proof of Theorem 1-(II) was given by Matkowski [18] in the case ε = + ; see also [2]. The preceding proof generalizes this result and establishes the theorem for every ε ( 0 , + ] .
2.
In the preceding theorem we need the following conditions such that all the conclusion of parts (I) to (IV) hold true:
(a)
The space ( X , d ) is a (not necessarily complete) metric space and T be a self map on X.
(b)
The space ( X * , d * ) is a complete metric space for a subset X * X .
(c)
T be invariant under X * , continuous with the metric d * , and T is a d-ψ-ε-contraction on X or X * , where ψ Ψ 0 ( ε ) , for some 0 < ε .
(d)
ψ satisfies (4) and d * M d , where 0 < M .
In the above circumstances we say the pairs ( X * , d * ) ( X , d ) satisfies properties (P) of Theorem 1 for T. We will show that the properties (P) enable us to obtain the solutions of (non-linear) integral equations properly.
3.
In the preceding theorem it can be X = X * . From Lemma 2-3, ψ λ belongs to Ψ 0 ( ε ) , for all 0 < ε , where ψ λ ( t ) = λ t , 0 < λ < 1 , when d * = d be a metric on X, Theorem 1 reduces to Banach contraction principle on the complete metric space ( X , d ) with error estimations (5) and (6), where M = 1 .
4.
The roles of d and d * d are creation Cauchy sequences and convergence of Picard sequences (in a complete metric space ( X * , d * ) ), respectively. In the next sections we see that separating roles of d and d * gives a great significant advantage over Banach contraction principle.
5.
The ψ in the items 3 to 10 of Lemma 2 except 9 are satisfied in condition (4).

3. Applications to the Existence of Solutions of Integral Equations

The next theorem is a straightforward application of Theorem 1 to the existence of solutions of nonlinear integral equations. In the sequel, we denote by ( C ( I ) , · u ) the space of continuous functions endowed with the uniform norm, and by B R ( x 0 ) = x C ( I ) ; x x 0 u < R , the open ball centered at x 0 C ( I ) with radius R > 0 . We also use the uniform metric d u ( x , y ) = x y u , x , y X , where X is a closed subset of ( C ( I ) , · u ) .
Theorem 2. 
Let f C ( I ) and K C ( I × I × R ) . Consider the integral equation
x ( t ) = T x ( t ) : = f ( t ) + a b K ( t , s , x ( s ) ) d s , t I .
(I)
Assume
(i)
There exists 0 < r 0 R 0 such that the following
r 0 T x f u R 0 r 0 T 2 x f u R 0 .
hold, for all x C ( I ) .
(ii)
Put
X * : = { x C ( I ) ;
x u w 0 x f u ,
r 0 T x f u R 0 } ,
in which w 0 is a constant greater than f u + R 0 r 0 , then X * is non-empty and complete subset of ( C ( I ) , · u ) , and T is invariant on X * , that is, T ( X * ) X * .
(iii)
If K satisfies ψ-ε-max-inequality on I × I × R , that is,
sup t I a b max { | K ( t , s , u ) | , | K ( t , s , v ) | } d s max { ψ ( | u | ) , ψ ( | v | ) } , u , v R ,
where ψ Ψ 0 ( ε ) , for some 0 < ε + ,
then the Picard sequence T n ( x 0 ) is a d f -Cauchy sequence in X * , for all d f - ε 0 -initial value x 0 X * , where d f is given by (1).
(II)
If T is continuous with respect to the uniform metric then integral equation (8) has a solution u * X * and it is unique in the set B d f , ε 0 ( u * ) : = { v X * , d f ( u * , v ) < ε 0 } . The Picard sequence x n = T n ( x 0 ) converge to u * X * in the topology d u , for all d f - ε 0 -initial value x 0 X * .
(III)
Moreover, suppose ψ satisfies condition (4) then the following posteriori and the priori estimates
x n u * u 2 d f ( x 0 , x 1 ) d f ( x 0 , x 1 ) ψ ( d f ( x 0 , x 1 ) ) d f ( x n , x n + 1 ) ,
2 d f ( x 0 , x 1 ) d f ( x 0 , x 1 ) ψ ( d f ( x 0 , x 1 ) ) ψ n ( d f ( x 0 , x 1 ) ) , for all n N ,
hold true, for all d f - ε 0 -initial value x 0 X * , respectively, where x n = T n ( x 0 ) and x 1 x 0 .
Proof. 
We shall show the pairs ( X * , d u ) ( X * , d f ) satisfies the properties (P) of Theorem 1 with the uniform metric d u and the metric d f given by (1).
(I)
Put W : = { x C ( I ) , T x satisfies ( 12 ) } , clearly W . Let x W then we get
T x u = sup t I f ( t ) + a b K ( t , s , x ( s ) ) d s f u + R 0 f u + R 0 r 0 T x f u = w 0 T x f u ,
for all x C ( I ) . Thus, T x satisfies (11), which together with (9) implies T ( W ) X * , that is, X * is a non-empty set. Moreover, from (16) together with (9) we get T ( X * ) X * . Since X * is a closed subset of ( C ( I ) , · u ) , we get ( X * , d u ) is a complete metric space. The inequality
d u ( x , y ) = x y u x f u + f y u 2 max { x f u , f y u } = 2 d f ( x , y ) ,
for all x , y X * , implies the uniform metric d u is equivalent from above to the metric d f ( d u M d f , M = 2 ). Finally, from conditions (12) and (13) we show T is a d f - ψ - ε -contraction, where ψ Ψ 0 ( ε ) defined as follows ψ ( t ) = ψ ( w 0 t ) , and ε : = ε w 0 : For all x , y X * , from (11) to (13) and non-decreasing condition of ψ we get
d f ( T x , T y ) = max T x f u , T y f u = max sup t I a b K ( t , s , x ( s ) ) d s , sup t I a b K ( t , s , y ( s ) ) d s = sup t I max a b K ( t , s , x ( s ) ) d s , a b K ( t , s , y ( s ) ) d s sup t I a b max K ( t , s , x ( s ) ) , K ( t , s , y ( s ) ) d s max ψ ( x u ) , ψ ( y u ) max ψ ( w 0 x f u ) , ψ ( w 0 y f u ) = ψ w 0 d f ( x , y ) = ψ ( d f ( x , y ) ) .
Thus, T is a d f - ψ - ε -contraction, see Example 2-6. From parts (I)-(II) of Theorem 1, the part (I) obtains, and from parts (I) to (III) the part (II) obtains. The posteriori and priori estimates (14) and (15) obtain from corresponding estimates (5) and (6), where M = 2 , which prove part (III).
Remark 2. 
(1)
Theorem 2, without any modification, can also be applied to the Volterra integral equation
x ( t ) = T x ( t ) : = f ( t ) + a t K ( t , s , x ( s ) ) d s , t I .
(2)
The subset X * C ( I ) is closed with respect to the metric d u . Hence, ( X * , d u ) is a complete metric space. However, this is not the case for the metric d f defined by (1), since every d f -Cauchy sequence converges to f 0 (see Example 1), while f X * because f does not satisfy condition (11). Therefore, ( X * , d f ) is not a complete metric space.
(3)
The metric d f plays the role of ensuring the Cauchy property of the Picard sequence through the d f -ψ-ε-contraction property, whereas d u is used to guarantee the convergence of the Picard sequence T n ( x 0 ) , since the space X * is complete with respect to d u . The existence of these two different metrics provides greater flexibility in the study of integral equations and extends the applicability of the Banach contraction framework.
(4)
Condition (13), called the ψ-ε-max inequality, is new and, as will be seen in the subsequent sections, provides a suitable alternative to Lipschitz-type conditions.
(5)
Other or additional conditions may be added to (10)–(12) in such a way that X * remains invariant under T. Suppose there exists x 0 X such that
x 0 x C ( I ) x 0 T x .
Define
X * * : = X * { x C ( I ) : x 0 x } .
Clearly, X * * is a closed subset of ( X * , d u ) , T ( X * * ) X * * , and all arguments in the proof of Theorem 2 remain valid on X * * .
For example,
  • If 0 x C ( I ) 0 T x , then condition (10) can be replaced by 0 x C ( I ) , which yields a positive solution.
  • If 0 x C ( I ) 0 T x , then condition (10) can be replaced by 0 x C ( I ) , which yields a negative solution.
  • Suppose that T is a non-decreasing operator, that is, x y T x T y , x , y C ( I ) , and assume that x 0 T x 0 for some x 0 C ( I ) . Then condition (18) holds. Indeed, if x 0 x , then, by the monotonicity of T, x 0 T x 0 T x .
(6)
In practice, the continuity of T with respect to the uniform metric d u , required in Theorem 2-(II), is often guaranteed by assuming that K is uniformly continuous (or Lipschitz-type conditions) on I × I × [ M , M ] for every M > 0 , and that the Picard sequence T n ( x 0 ) is uniformly bounded.
Such boundedness can be ensured by an appropriate choice of X * , for example, by imposing an explicit uniform bound on x u .
Theorem 2 can naturally be extended to weighted kernels of the form K ¯ ( t , s , x ( s ) ) = w ( t , s ) K ( t , s , x ( s ) ) , where usually K is a smooth function and w is an integrable (possibly singular) function with respect to s, such as those considered in Table 1. For instance, we have the following result.
Theorem 3. 
Under the same assumptions as in Theorem 2, all the conclusions remain valid for the fractional integral equation in the Riemann–Liouville sense (see [16]), where the operator T : C ( I ) C ( I ) is defined by
x ( t ) = T x ( t ) = f ( t ) + 1 Γ ( α ) 0 t ( t s ) α 1 K ( t , s , x ( s ) ) d s , t I : = [ 0 , b ] , 0 < α 1 ,
and Γ ( α ) denotes the Gamma function.
Proof. 
The proof is similar to that of Theorem 2. The only difference is in verifying the d f - ψ - ε -contraction condition corresponding to (17), which now becomes
d f ( T x , T y ) = max T x f u , T y f u = 1 Γ ( α ) max sup t I 0 t ( t s ) α 1 K ( t , s , x ( s ) ) d s , sup t I 0 t ( t s ) α 1 K ( t , s , y ( s ) ) d s 1 Γ ( α ) sup t I 0 t ( t s ) α 1 max | K ( t , s , x ( s ) ) | , | K ( t , s , y ( s ) ) | d s sup t I t α α Γ ( α ) max ψ ( x u ) , ψ ( y u ) b α Γ ( α + 1 ) ψ w 0 max x f u , y f u = b α Γ ( α + 1 ) ψ w 0 d f ( x , y ) = ψ ( d f ( x , y ) ) ,
where ψ ( t ) = b α Γ ( α + 1 ) ψ ( w 0 t ) , t 0 .
By a suitable change of variable, the interval [ 0 , b ] can be transformed into an interval [ 0 , b ] such that b Γ ( α + 1 ) 1 α , equivalently, b α Γ ( α + 1 ) 1 . Hence, by Lemma 2-6, ψ Ψ 0 ( ε ) , where ε = ε w 0 . Consequently, T is a d f - ψ - ε -contraction. □
Theorem 4. 
Under the same assumptions as in Theorem 2, all the conclusions remain valid for the s α -fractional integral equation T : C ( I ) C ( I ) defined by
x ( t ) = T x ( t ) = f ( t ) + 0 b s α K ( t , s , x ( s ) ) d s , t I : = [ 0 , b ] , 0 α < 1 .
Proof. 
The proof is similar to those of Theorems 2 and 3. □

3.1. Some Tests and Examples for the Existence of Solutions of Integral Equations

In this section, several examples are investigated in order to illustrate and validate the existence results established in Theorems 1 and 2.
Example 2 
([24, Chapter 7, Example 2]).
Consider the nonlinear Fredholm integral equation on ( C [ 0 , 1 ] , · u ) given by
x ( t ) = T ( x ) ( t ) = 7 8 t + 1 2 0 1 t s x 2 ( s ) d s , t [ 0 , 1 ] ,
where f ( t ) = 7 8 t and K ( t , s , u ) = t s u 2 .
Wazwaz [24] solved equation (20) analytically (by substituting x ( t ) = a t ) and showed that its exact solutions are x 1 * ( t ) = t and x 2 * ( t ) = 7 t .
Suppose that x C ( I ) and r T x f u = 1 2 0 1 s x 2 ( s ) d s R . Then
T 2 x f u = sup t I 1 2 t 0 1 s ( T x ( s ) ) 2 d s = sup t I 1 2 t 0 1 s 7 8 s + s 2 0 1 s 1 x ( s 1 ) 2 d s 1 2 d s = 1 2 0 1 s 7 8 s + s T x f u 2 d s 1 2 0 1 s 7 8 s + s R 2 d s = ( 8 R + 7 ) 2 512 , 1 2 0 1 s 7 8 s + s r 2 d s = ( 8 r + 7 ) 2 512 .
The inequalities ( 8 R + 7 ) 2 512 R and ( 8 r + 7 ) 2 512 r hold whenever r 1 8 and 1 8 R 49 8 .
Choose r 0 = R 0 = 1 8 (note that any 0 < r 1 8 R 49 8 may also be selected), and define w 0 = f u + R 0 r 0 = 7 8 + 1 8 1 8 = 8 .
Therefore, according to (16), the operator T is invariant on
X * = x C ( I ) : x u 8 x f u , T x f u = 1 2 0 1 s x 2 ( s ) d s = 1 8 .
Next, we verify the max-inequality condition. For all u , v R ,
sup t I 0 1 max { | K ( t , s , u ) | , | K ( t , s , v ) | } d s = sup t I 0 1 max { | t s u 2 | , | t s v 2 | } d s = 1 2 sup t I max { t u 2 , t v 2 } = max { ψ ( | u | ) , ψ ( | v | ) } ,
where ψ ( t ) = λ t 2 , t 0 , λ = 1 2 .
Since ψ Ψ 0 ( 2 ) , we obtain ψ ( t ) = ψ ( w 0 t ) = λ w 0 2 t 2 = 32 t 2 , and hence ε = ε 0 = 1 λ w 0 2 = 1 32 , see Theorem 2-(iii).
Therefore, for every d f -ε-initial value x 0 X * satisfying
d f ( x 0 , T x 0 ) = max { x 0 f u , T x 0 f u } = x 0 f u < 1 32 ,
(the equality follows from T x 0 f u = 1 8 ), the Picard sequence T n ( x 0 ) converges in the topology induced by d u to a fixed point u * X * . Moreover, this fixed point is unique in the ball
B d f , 1 32 ( u * ) : = v X * : d f ( v , u * ) = max { u * f u , v f u } < 1 32 .
Notice that the maximal admissible value of R 0 for defining X * is 49 8 . However,
T x 2 * f u = sup t I 7 8 t + 1 2 0 1 t s ( 7 s ) 2 d s = 56 8 > 49 8 .
Hence condition (12) is not satisfied for x = x 2 * = 7 t , that is, x 2 * X * . Consequently, T n ( x 0 ) x 1 * , for every ε-initial value x 0 X * .
Finally, observe that larger values of R 0 together with smaller values of r 0 may enlarge the set of admissible initial values.
The following show that using Theorem 2, instead of Banach contraction principle gains better results even for a linear integral equation. Also, this example as mentioned in Remark 2-(5) shows inequality (11) in Theorem 2, which is used to define X * , may be changed to a more appropriate condition, see also Section 3.2.
Example 3 
([11]). Consider the Fredholm linear integral equation T on ( C [ 0 , 1 ] , · ) as follows
x ( t ) = T ( x ) ( t ) = 2 t + ρ t 0 1 e s x ( s ) d s , t [ 0 , 1 ] , ρ R { 0 } ,
where f ( t ) = 2 t and K ( t , s , u ) = ρ t e s u .
Equation T 1 Hernández-Verón and Romero [11] demonstrated that T (denoted by T 1 in their paper) is a contraction on C ( I ) if and only if 0 < | ρ | < e e 1 1.5819 , which follows from Banach contraction inequality.
To achieve better results we change inequality (11) and use Theorem 1 directly. Suppose x C ( I ) and r T x f u = | ρ | 0 1 e s x ( s ) d s R . Then
T 2 x f u = | ρ | 0 1 e s T x ( s ) d s = | ρ | 0 1 e s 2 s + | ρ | s 0 1 e s 1 x ( s 1 ) d s 1 d s = | ρ | 0 1 e s 2 s + s T x f u d s | ρ | 0 1 e s s 2 + R d s = | ρ | 2 + R ( 1 2 e 1 ) , | ρ | 0 1 e s s 2 + r d s = | ρ | 2 + r ( 1 2 e 1 ) .
Thus, the inequalities
{ | ρ | ( 2 + R ) e 2 e R , ( 22 ) | ρ | ( 2 + r ) e 2 e r , ( 23 )
must have positive solutions.
The inequalities (22) and (23) hold if | ρ | < e e 2 , with solutions
r 2 | ρ | e 2 e 1 | ρ | e 2 e , R 2 | ρ | e 2 e 1 | ρ | e 2 e .
Let us choose
r 0 = R 0 = 2 | ρ | ( e 2 ) e | ρ | ( e 2 )
(notice that every 0 < r 2 | ρ | ( e 2 ) e | ρ | ( e 2 ) R is allowed).
Define
X * = x C ( I ) ; x u w 0 x f u 2 , T x f u = | ρ | 0 1 e s x ( s ) d s = R 0 ,
where
w 0 = f u + R 0 r 0 2 = 2 + R 0 R 0 2 .
Notice that if x X * , then
T x u = sup t I f ( t ) + ρ t 0 1 e s x ( s ) d s f u + R 0 = f u + R 0 R 0 2 T x f u 2 = w 0 T x f u 2 .
Therefore, from (22)–(24) we obtain T ( X * ) X * .
Also, T is a d f -ψ-ε-contraction on X * , where ψ ( t ) = λ t 2 , t 0 , with λ = | ρ | ( 1 e 1 ) w 0 .
Indeed, for all x , y X * ,
d f ( T x , T y ) = max T x f , T y f = max ρ sup t I t 0 1 e s x ( s ) d s , ρ sup t I t 0 1 e s y ( s ) d s | ρ | 0 1 e s max { | x ( s ) | , | y ( s ) | } d s | ρ | 0 1 e s d s max { x , y } | ρ | ( 1 e 1 ) max { w 0 x f u 2 , w 0 y f u 2 } = | ρ | ( 1 e 1 ) w 0 d f 2 ( x , y ) = ψ ( d f ( x , y ) ) .
Hence, ψ Ψ 0 ( ε ) , where ε = 1 λ , see Lemma 2-4.
Therefore, for every d f -ε-initial value x 0 X * , namely
d f ( x 0 , T x 0 ) = max { x 0 f u , T x 0 f u } < ε ,
the Picard sequence T n ( x 0 ) converges in the topology d u to a fixed point u * X * , and it is unique in the ball
B d f , ε ( u * ) : = v X * ; d f ( v , u * ) = max { u * f u , v f u } < ε .
Thus, for all 0 < | ρ | < e e 2 3.7844 , the assumptions of Theorem 2 hold on X * , which shows that the result of Theorem 1 is stronger than Banach contraction principle (compare with [11]). Numerical experiments also verify this result; see Example 11, where ρ = 7 2 .
Note 3. 
1.
The previous example illustrates that condition (9) is more important than condition (11) in calculation of the upper bound for ρ such that Picard sequences converges. In other words, when applying Theorem 1, condition (9) plays the effective role in determining the admissible upper bound of ρ through an appropriate adjustment of the subset X * C ( I ) , whereas in Banach contraction principle this role is arises entirely from the contraction condition itself.
2.
By selecting larger admissible values for R 0 and smaller admissible values for r 0 , the subset X * can be enlarged in such a way that T ( X * ) X * holds in all examples considered in this paper.
Example 4 
([11]). Consider the Fredholm nonlinear integral equation T on ( C [ 0 , 1 ] , · ) given by
T ( x ) ( t ) = t + ρ t 0 1 e s x ( s ) 2 d s , t [ 0 , 1 ] , ρ R { 0 } ,
where f ( t ) = t and K ( t , s , u ) = ρ t e s u 2 .
Equations T 2 and T 3 Hernández-Verón and Romero [11] considered two cases, denoted by T 2 and T 3 , where ρ = 1 5 and ρ = 1 2 , respectively. They demonstrated that T 2 is a contraction on the closed ball B 2 ( 0 ) ¯ , while for T 3 it is impossible to find a ball B r ( 0 ) ¯ C [ 0 , 1 ] , with r > 0 , such that T 3 is invariant on B r ( 0 ) ¯ , since the inequality 1 e 1 2 r 2 r + 1 0 has no solution.
We show that T satisfies the assumptions of Theorem 2 whenever 0 < | ρ | 1 4 e 1 ( 2 e 5 ) 1.5566 .
Suppose that x C ( I ) and r T x f u R , where T x f u = | ρ | 0 1 e s x ( s ) 2 d s . Then
T 2 x f u = | ρ | 0 1 e s ( T x ( s ) ) 2 d s = | ρ | 0 1 e s s + | ρ | s 0 1 e s 1 x ( s 1 ) 2 d s 1 2 d s = | ρ | 0 1 e s s + s T x f u 2 d s | ρ | 0 1 e s s 2 1 + R 2 d s = | ρ | 1 + R 2 e 1 ( 2 e 5 ) , | ρ | 0 1 e s s 2 1 + r 2 d s = | ρ | 1 + r 2 e 1 ( 2 e 5 ) .
Therefore, the inequalities
{ | ρ | ( 1 + R ) 2 e 1 ( 2 e 5 ) R , ( 25 ) | ρ | ( 1 + r ) 2 e 1 ( 2 e 5 ) r , ( 26 )
must admit positive solutions.
The inequality (25) has a solution whenever Δ = 2 | ρ | e 1 ( 2 e 5 ) 1 2 4 | ρ | e 1 ( 2 e 5 ) 2 = 1 4 e 1 ( 2 e 5 ) | ρ | 0 , that is, 0 < | ρ | 1 4 e 1 ( 2 e 5 ) 1.5566 .
It is sufficient to choose
0 < r 1 2 e 1 ( 2 e 5 ) | ρ | Δ 4 | ρ | e 1 ( 2 e 5 ) R 1 2 e 1 ( 2 e 5 ) | ρ | + Δ 4 | ρ | e 1 ( 2 e 5 ) ,
so that inequalities (25) and (26) hold.
To further illustrate the proof of Theorem 2, we verify directly that T is a d f -ψ-ε-contraction, without using the max-inequality (13). For all x , y X * ,
d f ( T x , T y ) = max { T x f , T y f } = max | ρ | sup t I t 0 1 e s x 2 ( s ) d s , | ρ | sup t I t 0 1 e s y 2 ( s ) d s = | ρ | sup t I t 0 1 e s max { x 2 ( s ) , y 2 ( s ) } d s | ρ | 0 1 e s d s max { x 2 , y 2 } | ρ | ( 1 e 1 ) max { w 0 2 x f u 2 , w 0 2 y f u 2 } = | ρ | ( 1 e 1 ) w 0 2 d f 2 ( x , y ) = ψ ( d f ( x , y ) ) ,
where ψ ( t ) = λ t 2 , t 0 , with λ = | ρ | ( 1 e 1 ) w 0 2 , ε = 1 λ . Hence, ψ Ψ 0 ( ε ) , see Lemma 2-4.
For example, let ρ = 1 2 . Then we may choose r 0 = R 0 = 2.0965 (which lies in the admissible interval), where every 0 < r 2.0965 R 12.3565 is admissible.
We obtain
w 0 = f u + R 0 r 0 1 + 2.0965 2.0965 1.4769 ,
and therefore ε = 1 λ 1.4503 .
Consequently, according to (16), T is invariant on
X * = x C ( I ) ; x u 1.4769 x f u , T x f u = 1 2 0 1 e s x 2 ( s ) d s = 2.0965 .
Hence, for every d f -ε-initial value x 0 X * satisfying
d f ( x 0 , T x 0 ) = max { x 0 f u , T x 0 f u } < 1.4503 ,
the Picard sequence T n ( x 0 ) converges in the topology d u to a fixed point u * X * , and this fixed point is unique in the ball B d f , ε ( u * ) = v X * ; max { u * f u , v f u } < 1.4503 .
Note 4. 
Hernández-Verón and Romero [11] proved that, for T 3 (corresponding to ρ = 0.5 ), the Krasnoselskij iterative method with the ε -initial value x 0 T 3 x 0 ε : = 2 e 5 5 e 0.0321 , converges to the unique fixed point u * B 0.13 ( f ) ¯ . Theorem 1 further shows that the Picard iteration also converges to the same fixed point.
Example 5 
([6,11]). Consider the Fredholm non-linear integral equation T on ( C [ 0 , 1 ] , · u ) defined by
x ( t ) = T ( x ) ( t ) = sin ( π t ) + ρ cos ( π t ) 0 1 sin ( π s ) x ( s ) 3 d s , t [ 0 , 1 ] , ρ R { 0 } ,
where f ( t ) = sin ( π t ) and K ( t , s , u ) = ρ cos ( π t ) sin ( π s ) u 3 .
Suppose that x C ( I ) and
r T x f u = sup t I | ρ | cos ( π t ) 0 1 sin ( π s ) x 3 ( s ) d s = | ρ | 0 1 sin ( π s ) x 3 ( s ) d s R .
Then
T 2 x f u = | ρ | 0 1 sin ( π s ) ( T x ( s ) ) 3 d s = | ρ | 0 1 sin ( π s ) sin ( π s ) + | ρ | cos ( π s ) 0 1 sin ( π s 1 ) x 3 ( s 1 ) d s 1 3 d s = | ρ | 0 1 sin ( π s ) sin ( π s ) + | cos ( π s ) | T x f u 3 d s | ρ | 0 1 sin ( π s ) sin ( π s ) + | cos ( π s ) | R 3 d s = | ρ | 8 π ( 4 R 3 + 3 π R 2 + 12 R + 3 π ) | ρ | 0 1 sin ( π s ) sin ( π s ) + | cos ( π s ) | r 3 d s = | ρ | 8 π ( 4 r 3 + 3 π r 2 + 12 r + 3 π ) .
Therefore, the inequalities
{ | ρ | 8 π ( 4 R 3 + 3 π R 2 + 12 R + 3 π ) R , ( 27 ) | ρ | 8 π ( 4 r 3 + 3 π r 2 + 12 r + 3 π ) r ( 28 )
must admit positive solutions.
Since 4 r 3 + 3 π r 2 + 12 r + 3 π is increasing on [ 0 , + ) , it is sufficient to consider
r 0 3 8 | ρ |
in order for inequality (28) to hold.
Moreover, inequality (27) holds provided that
| ρ | sup R [ 0 , + ) 8 π R 4 R 3 + 3 π R 2 + 12 R + 3 π 0.7420 ,
where the supremum is attained at R 0 0.7763 .
Thus,
w 0 1 + 0.7763 3 8 | ρ |
is obtained for | ρ | 0.7420 , where inequalities (27) and (28) admit the solutions
r 0 = 3 8 | ρ | , R 0 = 0.7763 .
Next, let us investigate the max-inequality condition (13). For all u , v R ,
sup t I 0 1 max { | K ( t , s , u ) | , | K ( t , s , v ) | } d s sup t I 0 1 max { | ρ cos ( π t ) sin ( π s ) u 3 | , | ρ cos ( π t ) sin ( π s ) v 3 | } d s = 2 | ρ | π max { | u | 3 , | v | 3 } = max { ψ ( | u | ) , ψ ( | v | ) } ,
where ψ ( t ) = λ t 3 , λ = 2 | ρ | π , t 0 . By Lemma 2-5, ψ Ψ 0 ( ε ) , ε = λ 1 / 2 = π 2 | ρ | .
Therefore, for every d f -ε-initial value x 0 X * satisfying
d f ( x 0 , T x 0 ) = max { x 0 f u , T x 0 f u } < π 2 | ρ | ,
the Picard sequence T n ( x 0 ) converges in the topology induced by d u to a fixed point u * X * , and this fixed point is unique in the ball
B d f , ε ( u * ) : = v X * : max { u * f u , v f u } < π 2 | ρ | .
Two questions may be asked if condition (I)-(i) of Theorem 2 does not hold: whether Eq. (8) may still have a solution or may fail to have one. The next two examples give positive answers to both questions, respectively.
Example 6. 
Consider Example 3. Suppose u * is a fixed point of T and put a = 0 1 e s u * ( s ) d s . Then from (21) we have u * ( t ) = ( 2 + ρ a ) t . Thus, the solution is of the form x ( t ) = A t , A R . Substituting x ( t ) = A t into (21), the analytical solution is obtained with
A = 2 e e ρ ( e 2 ) , ρ e e 2 .
For ρ = e e 2 , straightforward calculations show that u ( t ) = ( 2 e ) t is a fixed point.
Assume ρ e e 2 . Similar to Example 7, put
L = T x f u = ρ 0 1 e s x ( s ) d s ,
where 0 x C ( I ) . Since K 0 and f 0 , we obtain T x f , T 2 x f 0 , and
T 2 x f u = ρ 0 1 e s T x ( s ) d s = ρ 0 1 e s 2 s + ρ s 0 1 e s 1 x ( s 1 ) d s 1 d s = ρ 0 1 e s 2 s + s T x f u d s = ρ ( 2 + L ) e 2 e .
The inequality
ρ ( 2 + L ) e 2 e L
has no positive solution. Thus, there exists no R > 0 such that inequalities (9) hold.
Example 7. 
Consider the following Fredholm integral equation, which has no solution in C ( I ) (see [19] and [20]):
x ( t ) = T ( x ) ( t ) = t + 0 1 k ( t , s ) x ( s ) d s ,
where
k ( t , s ) = π 2 s ( 1 t ) , s t , π 2 t ( 1 s ) , t s .
Suppose 0 x C ( I ) and put
L = T x f u = sup t I 0 1 k ( t , s ) x ( s ) d s .
Since k 0 and f 0 , we obtain T x f , T 2 x f 0 , and
T 2 x f u = sup t I 0 1 k ( t , s ) T x ( s ) d s = sup t I 0 1 k ( t , s ) s + 0 1 k ( s , s 1 ) x ( s 1 ) d s 1 d s = sup t I 0 1 k ( t , s ) s + T x f u d s = sup t I 0 1 k ( t , s ) ( s + L ) d s = sup t I 0 t π 2 s ( 1 t ) ( s + L ) d s + t 1 π 2 t ( 1 s ) ( s + L ) d s = sup t I π 2 1 6 ( 1 t ) t 2 ( 3 L + 2 t ) + 1 6 t ( t 1 ) 2 ( 2 t + 3 L + 1 ) = sup t I π 2 6 3 L t ( 1 t ) + t ( t + 1 ) ( 1 t ) .
The function t ( t + 1 ) ( 1 t ) = t t 3 attains its maximum at t = 1 / 3 , and its maximum value is 2 3 9 . Hence,
T 2 x f u π 2 6 3 4 L + 2 3 9 .
The inequality
π 2 6 3 4 L + 2 3 9 L
has no positive solution because π 2 8 > 1 . Thus, there exists no R > 0 such that inequalities (9) hold.

3.2. Chandrasekhar problem

The Chandrasekhar problem [7] remains unresolved by analytical methods and therefore provides an important example for the application and investigation of Theorem 1.
Consider the Fredholm non-linear integral equation T on ( C [ 0 , 1 ] , · ) given by
x ( t ) = T x ( t ) = 1 + t x ( t ) 0 1 ψ ( s ) x ( s ) s + t d s , t [ 0 , 1 ] ,
where 0 ψ C [ 0 , 1 ] .
The kernel is not of the form required in Theorem 2, so we apply Theorem 1 directly. Nevertheless, similarly to Theorem 2, it may be possible to establish a more general theorem for kernels of the form
K ( t , s , u , v ) = t u t + s ψ ( s ) v , K C ( I × I × R × R ) .
Let us consider two cases:
  • Case 1:
Suppose ψ is a positive function (the negative case is similar). We can benefit from Remark 2-(5), since T is a non-decreasing functional and
T 1 ( t ) = 1 + t 0 1 ψ ( s ) s + t d s 1 , t [ 0 , 1 ] .
Put
X * * = x C ( I ) : 1 x , x u w x 1 u , r T x 1 u R ,
and similarly to the previous examples calculate the parameters R, r, and w.
Suppose 1 x C ( I ) and
r T x 1 u = sup t I t x ( t ) 0 1 ψ ( s ) x ( s ) s + t d s R .
Let us calculate r and R. Put
I : = 0 1 ψ ( s ) s + 1 d s .
Then
T 2 x 1 = sup t I t T x ( t ) 0 1 ψ ( s ) T x ( s ) s + t d s = sup t I t 1 + t x ( t ) 0 1 ψ ( s ) x ( s ) s + t d s 0 1 ψ ( s ) s + t 1 + s x ( s ) 0 1 ψ ( s 1 ) x ( s 1 ) s 1 + s d s 1 d s = 1 + T x 1 u sup t I t 0 1 ψ ( s ) s + t 1 + s x ( s ) 0 1 ψ ( s 1 ) x ( s 1 ) s 1 + s d s 1 d s ( 1 + R ) 2 I , I .
Thus, the inequalities
( 1 + R ) 2 I R , ( 30 ) I r , ( 31 )
must have positive solutions.
The inequalities (30) and (31) hold provided that
I = 0 1 ψ ( s ) s + 1 d s sup R [ 0 , + ) R ( 1 + R ) 2 = 1 4 ,
where the supremum occurs at R = 1 .
Moreover, the inequalities admit solutions
0 < r I 1 2 I 1 4 I 2 I R 1 2 I + 1 4 I 2 I .
One may choose
r 0 = I , R 0 = 1 2 I 1 4 I 2 I ,
noting that every choice satisfying
0 < r I 1 2 I 1 4 I 2 I R 1 2 I + 1 4 I 2 I
is admissible.
Put
w 0 = 1 + R 0 r 0 .
Then for all x , y X * * we obtain
d f ( T x , T y ) = max { T x 1 u , T y 1 u } max sup t I t | x ( t ) | 0 1 ψ ( s ) x ( s ) s + t d s , sup t I t | y ( t ) | 0 1 ψ ( s ) y ( s ) s + t d s sup t I t 0 1 ψ ( s ) s + t d s max { x 2 , y 2 } 0 1 | ψ ( s ) | s + 1 d s w 0 2 max { x 1 2 , y 1 2 } 1 4 w 0 2 d f 2 ( x , y ) .
Thus, T is a d f - ψ - ε -contraction, where ψ ( t ) = 1 4 w 0 2 t 2 Ψ 0 ( ε ) , ε = 4 w 0 2 , see Lemma 2-4.
  • Case 2:
In physical applications certain restrictions such as 0 1 ψ ( s ) d s 1 2 are necessary (see [9]), but from the viewpoint of pure mathematics such assumptions are not essential. Suppose ψ changes sign, i.e.
ψ ( + ) = max { ψ , 0 } , ψ ( ) = max { ψ , 0 } 0 ,
and both are nonzero. Then ψ = ψ ( + ) ψ ( ) . Put
I ( + ) : = 0 1 ψ ( + ) ( s ) s + 1 d s , I ( ) : = 0 1 ψ ( ) ( s ) s + 1 d s > 0 .
Define
X * * = { x [ a , A ] ; x u w 0 x 1 u , r 0 T x 1 u R 0 } ,
where
[ a , A ] = { x C ( I ) ; a x A } .
Theorem 1 applies provided 0 a A and 0 < r R are chosen so that T ( X * * ) X * * .
Let us first estimate A. If x A , then
T x ( t ) = 1 + t x ( t ) 0 1 ψ ( s ) x ( s ) s + t d s = 1 + t x ( t ) 0 1 ψ ( + ) ( s ) x ( s ) s + t d s t x ( t ) 0 1 ψ ( ) ( s ) x ( s ) s + t d s 1 + A 2 I ( + ) .
Hence T x A admits a solution whenever
1 1 1 4 I ( + ) 2 I ( + ) A 1 + 1 4 I ( + ) 2 I ( + ) ,
which holds under
0 < I ( + ) = 0 1 ψ ( + ) ( s ) s + 1 d s 1 4 .
Next, if a x , then
T x ( t ) = 1 + t x ( t ) 0 1 ψ ( s ) x ( s ) s + t d s = 1 + t x ( t ) 0 1 ψ ( + ) ( s ) x ( s ) s + t d s t x ( t ) 0 1 ψ ( ) ( s ) x ( s ) s + t d s 1 A 2 I ( ) .
Therefore T x a has a solution whenever
0 a 1 A 2 I ( ) < 1 ,
provided
0 < I ( ) = 0 1 ψ ( ) ( s ) s + 1 d s < 1 A 2 .
Thus one may choose
0 < a 1 A 2 I ( ) < 1 ,
and consequently
T ( [ a , A ] ) [ a , A ] .
Now let us determine r 0 , R 0 . Suppose x [ a , A ] and
r T x 1 u = sup t I t x ( t ) 0 1 ψ ( s ) x ( s ) s + t d s R .
Using (38),
T 2 x 1 u = sup t I t T x ( t ) 0 1 ψ ( s ) T x ( s ) s + t d s sup t I t A 0 1 ψ ( + ) ( s ) s + t T x ( s ) d s 0 1 ψ ( ) ( s ) s + t T x ( s ) d s sup t I t A 2 max 0 1 ψ ( + ) ( s ) s + t A d s , 0 1 ψ ( ) ( s ) s + t A d s A 2 max { I ( + ) , I ( ) } .
Hence every
A 2 max { I ( + ) , I ( ) } R
is admissible.
On the other hand, from (36) and (38), we have T x ( t ) a , and therefore
T 2 x 1 u = sup t I t T x ( t ) × 0 1 ψ ( s ) T x ( s ) s + t d s a sup t I t 0 1 ψ ( s ) T x ( s ) s + t d s = a sup t I t × 0 1 ψ ( + ) ( s ) s + t T x ( s ) d s 0 1 ψ ( ) ( s ) s + t T x ( s ) d s sup t I t a × 0 1 a ψ ( + ) ( s ) s + t d s A 0 1 ψ ( ) ( s ) s + t d s a a I ( + ) A I ( ) ,
Now choose a and A such that a I ( + ) A I ( ) > 0 (this is possible by taking a sufficiently large or A sufficiently small while respecting the earlier constraints). Then, for t = 1 , the integrand is non-negative and we obtain the lower bound
T 2 x 1 u a a I ( + ) A I ( ) .
Thus we may set
r 0 : = a a I ( + ) A I ( ) .
Hence every 0 < r r 0 is admissible. Therefore (39) shows that the left-hand side of (9) has solutions whenever (35) and (37) hold.
Finally, choose
w 0 1 + R 0 r 0 .
Then for all x X * * ,
T x u = sup t I 1 + t x ( t ) 0 1 ψ ( s ) x ( s ) s + t d s
1 + R 0 1 + R 0 r 0 sup t I t x ( t ) 0 1 ψ ( s ) x ( s ) s + t d s
= w 0 T x 1 u .
Thus (34)–(40) imply
T ( X * * ) X * * ,
provided (35) and (37) hold.
The proof that T is a d f - ψ - ε -contraction is analogous to Case 1.
Note 5. 
1.
Observe that in Case 2 the condition (9) is obtained after calculating a and A, and the values of r 0 and R 0 depend on a and A, respectively. This method cannot be applied in general. For example, there is no A 0 such that x A T x A in Example 4, since the inequality
1 e 1 2 A 2 A + 1 0
has no solution.
2.
If 0 ψ and ψ u 1 4 ln 2 0.3606 , see [5], then condition (32) holds since
0 1 ψ ( s ) s + 1 d s 1 4 ln 2 0 1 1 s + 1 d s = 1 4 .
3.
If 0 ψ and
ψ 2 = 0 1 ψ ( s ) 2 d s 1 / 2 2 4 0.3535 ,
then Cauchy’s inequality implies
0 1 ψ ( s ) s + 1 d s ψ 2 0 1 1 ( s + 1 ) 2 d s 1 / 2 2 4 · 1 2 = 1 4 ,
which shows that condition (32) differs from the previous case. For example, if ψ ( t ) = 2 t 16 , then
ψ 2 = 4 33 0.348 < 0.3535 , ψ u = 2 .
Substitution: Examples 2) and 4) below are investigated numerically in SubSection 5.1, although the implemented program can also be applied to other cases.
(ψ1)
Consider ψ ( t ) = 3 8 t 2 ( 1 t 2 ) , see [10, Example 2]. Then
ψ u = 3 32 , R 0 = 1 , r 0 = 3 8 0 1 s 2 ( 1 s 2 ) s + 1 d s = 1 32 = 0.03125 .
Hence, w 0 = 2 1 / 32 = 64 , ε = 4 64 2 = 1 1024 . Therefore, for every d f - ε -initial value x 0 X * satisfying
d f ( x 0 , T x 0 ) = max { x 0 1 u , T x 0 1 u } < ε ,
the Picard sequence T n ( x 0 ) converges in the topology d u to a fixed point u * X * , unique in
B d , ε ( u * ) = { v X * ; max { u * 1 u , v 1 u } < ε } .
(ψ2)
Consider ψ ( t ) = 3 32 ( 1 t 2 ) 2 , see [7] and [10, Example 3]. Then ψ u = 3 32 .
(ψ3)
Consider ψ ( t ) = ρ 1 2 t 1 2 + t , ρ 0 . Then ψ u = 3 4 | ρ | . If | ρ | 1 3 ln 2 0.4808 , then the condition of Note 5-2 holds. However, conditions (35) and (37) provide a better estimate. Indeed,
[ 0 , 1 2 ] ( 1 2 s ) ( 1 2 + s ) s + 1 d s 0.0709 ,
hence
I ( + ) = | ρ | [ 0 , 1 2 ] ( 1 2 s ) ( 1 2 + s ) s + 1 d s 0.0709 | ρ | 1 4 ,
which yields | ρ | 3.5260 . Moreover,
1 1 1 4 I ( + ) 2 I ( + ) A .
Choosing the lowest admissible value A = 1 , we obtain
I ( ) = | ρ | [ 1 2 , 1 ] ( 1 2 s ) ( 1 2 + s ) s + 1 d s 0.0907 | ρ | < 1 A 2 = 1 ,
that is, | ρ | 11.0253 . Therefore, Case 2 predicts convergence of the Picard sequence for | ρ | 3.5260 . However, the numerical experiments in SubSection 5.1 show that the Picard sequence associated with the quadrature equation (46), obtained by Newton–Cotes rules, converges for 5 ρ 10.5 , which is considerably larger than the theoretical prediction.
(ψ4)
Consider ψ ( t ) = ρ ( 1 2 t ) ( 1 + t ) , ρ 0 . Then ψ u = 2 | ρ | . Hence, the condition of Note 5-2 holds whenever | ρ | 1 8 ln 2 0.1803 . Again, conditions (35) and (37) yield a better estimate. Since
[ 0 , 1 2 ] ( 1 2 s ) ( 1 + s ) s + 1 d s = 1 4 ,
we obtain
I ( + ) = | ρ | 4 1 4 | ρ | 1 ,
and
1 1 1 4 I ( + ) 2 I ( + ) A .
Taking A = 1 , we get
I ( ) = | ρ | [ 1 2 , 1 ] ( 1 2 s ) ( 1 2 + s ) s + 1 d s = | ρ | 4 < 1 ,
hence | ρ | < 4 . Therefore, Case 2 predicts convergence for | ρ | 1 . Nevertheless, the numerical computations in SubSection 5.1 show that the Picard sequence of the quadrature equation (46), generated by Newton–Cotes rules, converges for 2 ρ 3 , which again exceeds the theoretical estimate.

4. Application to the Existence of Solutions of Quadrature Integral Equations

Suppose that the integral in (8) can be approximated by a quadrature rule of the form
I ( x ) : = a b w ( s ) x ( s ) , d s = I ¯ k ( x , [ a , b ] ) + E ( x , k ) , I ¯ k ( x , [ a , b ] ) : = j = 1 k ω i x ( s j ) ,
where w 0 is a weight function chosen to incorporate possible singularities, so that x becomes sufficiently smooth and can be accurately approximated by polynomials. Notice that, in Newton–Cotes quadrature formulas, the nodes are indexed by j = 0 , , k . Consequently, in (43) the index j starts at 0 and throughout the subsequent formulas, every occurrence of j = 1 k should be replaced by j = 0 k .
The degree of exactness of a quadrature rule is the largest integer p N for which (43) is exact for all polynomials 1 , s , , s p . The remaining parameters are as follows: k h = b a , ω i R , and a s 1 < < s k b , where the nodes are equally spaced for Newton–Cotes formulas (the first index start at s 0 = a ) and generally nonuniform for Gaussian-type quadratures. The integer k is called the order of the quadrature rule. The weights ω i , nodes s i , and error term E ( x , k ) can be computed in advance so that a prescribed degree of exactness is achieved; see [8,12,15].
Quadrature methods include the open and closed Newton–Cotes formulas and Gaussian quadratures such as Gauss–Jacobi, Gauss–Chebyshev, Gauss–Legendre, Gauss–Laguerre, Gauss–Radau, Gauss–Lobatto, Gauss–Log, and others. These methods can be applied to appropriately smooth, weakly singular, logarithmic, and fractional-type integrands; see [8,12,15]. Their main advantage is that the associated error terms are explicitly known and can therefore be incorporated into rigorous estimates.
It is also possible to employ composite (repeated) quadrature formulas, analogous to the composite Newton–Cotes rules; see [15, Subsection 3.2]. Let m N be a multiple of a fixed integer k N , and use the notation i = 0 : k : m for i = 0 , k , 2 k , , m , with i = 0 : k m a i = a 0 + a k + + a m . Then the composite quadrature formula is
I ¯ m , k ( x ) = i = 0 : k m k I ¯ k ( x , [ s i , s i + k ] ) = i = 0 : k m k j = 1 k ω j x ( s i + j ) .
Note 6. 
1.
Table 1 is not exhaustive. It is well known that Gauss quadrature rules have strictly positive weights [12], whereas Newton–Cotes and Gauss–Log rules do not generally guarantee positivity of weights [4]. Asymptotic error estimates of these rules can be found in standard references on numerical integration. Moreover, different quadrature rules may be combined in repeated formulations. For example, to compute
0 1 ( 1 s ) α d s , α > 1 ,
one may apply Gauss–Legendre quadrature on [ 0 , 1 2 ] , where the integrand is smooth, and Gauss–Jacobi quadrature with parameters ( α , 0 ) on [ 1 2 , 1 ] , where the endpoint singularity occurs.
2.
If a repeated formulation uses i = m k subintervals and the corresponding quadrature rules have errors
O ( f 1 ( h 1 ) ) , O ( f 2 ( h 2 ) ) , , O ( f i ( h i ) ) ,
then the overall asymptotic error is
O max 1 j i f j ( h j ) .

4.1. Iterative Schemes Based on Picard Iteration and Quadrature Rules

In this section, we study the quadrature integral equation (46) associated with the weighted integral equation T : C ( I ) C ( I ) of the form
x ( t ) = T x ( t ) : = f ( t ) + a b w ( s ) K ( t , s , x ( s ) ) d s , t I ,
where f C ( I ) , K C ( I × I × R ) , and w 0 is a weight function such as those listed in Table 1. We assume that the integral in (45) can be approximated by a suitable quadrature rule from Table 1.
Using the notation introduced in Section 4, we define the quadrature integral equation
x ( t ) = T m x ( t ) : = f ( t ) + I ¯ m , k ( K ( t , · , x ( · ) ) , I ) = f ( t ) + i = 0 : k m k j = 1 k ω j K ( t , s i + j , x ( s i + j ) ) , t I ,
which is obtained from the weighted integral equation (45) by applying a quadrature rule of order k, where m is a multiple of k.
We shall show that the Picard sequence
x r ( t i ) = T m x r 1 ( t i ) = T m r x 0 ( t i ) , t i I m ,
where
I m : = { s i + j : i = 0 , k , , m k , j = 0 or 1 , , k } ,
denotes the set of quadrature nodes, provides an effective numerical approximation of the quadrature integral equation (46), and consequently of the integral equation (45).
Theorem 5. 
Replace the weighted integral operator T defined by (45) with the quadrature operator T m defined by (46) throughout the statements of Theorem 2. In particular, condition (9) becomes
r 0 T m x f u R 0 r 0 T m 2 x f u R 0 .
Moreover, replace the ψ-ε-max inequality by
sup t , s I max { | K ( t , s , u ) | , | K ( t , s , v ) | } max { ψ ( | u | ) , ψ ( | v | ) } , u , v R ,
where ψ Ψ 0 ( ε ) for some ε ( 0 , + ] .
If ω j 0 for all j = 0 or 1 , , k , then all conclusions of Theorem 2 remain valid for the quadrature integral equation (46). In particular, T m admits a solution
u m * X * : = x C ( I ) : x u w 0 x f u , r 0 T m x f u R 0 ,
which is unique in
B d , ε 0 ( u m * ) : = { v X * : d ( u m * , v ) < ε 0 } .
Furthermore, for every d f - ε 0 -initial value x 0 X * , the Picard sequence T m n ( x 0 ) converges to u m * in the topology induced by d u .
Proof. 
By a change of variables, we may assume that b a 1 . Since the quadrature rule is exact for constants, setting f 1 in (44) gives
i = 0 : k m k j = 1 k ω j = b a 1 .
The proof is analogous to that of Theorem 2. For instance, using (49) and ω j 0 , we obtain
d f ( T m x , T m y ) = max { T m x f u , T m y f u } i = 0 : k m k j = 1 k ω j sup t , s I max { | K ( t , s , x ( s ) ) | , | K ( t , s , y ( s ) ) | } i = 0 : k m k j = 1 k ω j max { ψ ( x u ) , ψ ( y u ) } ψ w 0 max { x f u , y f u } = ψ w 0 d f ( x , y ) = : ψ ( d f ( x , y ) ) .
where ψ Ψ ( ε ) defined as follows ψ ( t ) = ψ ( w 0 t ) , and ε : = ε w 0 , see Lemma 2-6. The remaining assertions follow exactly as in the proof of Theorem 2. □
Note 7. 
1.
Observe that the ψ-ε-max condition (13) is weaker than (49); indeed, (49) (13).
2.
If ψ ( t ) = ( λ t ) α ( α > 1 , λ > 0 ) as in Lemma 2-7, the positivity condition on ω j can be dropped. Using (50) and x u w 0 x f u , we get
d f ( T m x , T m y ) L ψ w 0 d f ( x , y ) , L : = j = 1 k | ω j | .
Define ψ ( t ) : = L ψ ( w 0 t ) = L ( λ w 0 t ) α = ( L 1 / α λ w 0 ) t α . Then ψ Ψ 0 ( ε ) with
ε = 1 ( L 1 / α λ w 0 ) α α 1 = 1 ( L λ α w 0 α ) 1 α 1 .
Thus T m is a d f - ψ -ε-contraction.

4.2. Tests and Examples Concerning the Existence of Solutions for Quadrature Integral Equations

In this section, we present two examples to demonstrate the applicability of Theorems 1 and 5 and to validate the corresponding existence results.
Example 8. 
Consider the crosspounding quadrature integral equations of Example 2:
x ( t ) = T m x ( t ) : = 7 8 t + t 2 i = 0 : k m k j = 1 k ω j s i + j x 2 ( s i + j ) , t I ,
where s r I m , r = 0 or 1 , , m . The similar calculations apply to the quadrature version (Example 2) by replacing the continuous integrals with quadrature sums and using the corresponding discrete bounds. To investigate condition (48) in Theorem 5 two cases may be occur:
  • Case 1 (Quadrature with positive weights):
Suppose that all quadrature weights ω j are nonnegative. Suppose
r T m x 7 8 t u = 1 2 i = 0 : k m k j = 1 k ω j s i + j x 2 ( s i + j ) R .
Then
T m 2 x 7 8 t u = 1 2 7 8 + T m x f u 2 i = 0 : k m j = 1 k ω j s i + j 3 ,
and therefore
1 2 7 8 + r 2 i = 0 : k m j = 1 k ω j s i + j 3 T m 2 x 7 8 t u 1 2 7 8 + R 2 i = 0 : k m j = 1 k ω j s i + j 3 .
Since
lim m i = 0 : k m k j = 1 k ω j s i + j 3 = 0 1 s 3 d s = 1 4 ,
there exists M 0 N such that for all m M 0 ,
1 5 < i = 0 : k m k j = 1 k ω j s i + j 3 < 2 5 .
Consequently, the inequalities
1 10 7 8 + r 2 r , 1 5 7 8 + R 2 R
must hold. Solving them yields
r 0 33 8 65 2 0.09385 , 13 8 7.5 2 R 0 13 8 + 7.5 2 .
Thus condition (48) holds for both T and T m whenever m M 0 . Choosing
r 0 = 33 8 65 2 , R 0 = 13 8 7.5 2 , w 0 = f u + R 0 r 0 0.875 + 0.2556 0.09385 12.05 ,
we conclude, as in Example 2, that T and T m are invariant on
X * * = x C ( I ) : x u w 0 x f u , r 0 1 2 0 1 s x 2 ( s ) d s R 0 .
  • Case 2 (Quadrature rules with possibly negative weights).
For the quadrature integral equation (51) associated with Example 2, the positivity assumption on the quadrature weights is not required. Indeed, by Note 7-2, it is sufficient to consider ψ ( t ) = t 2 , which corresponds to the family ψ ( t ) = ( λ t ) α with λ = 1 and α = 2 . Arguing as in (50), we obtain
d f ( T m x , T m y ) L ψ w 0 d f ( x , y ) , L = i = 0 : k m k j = 0 k | ω j | .
Consequently, ψ ( t ) = L ψ ( w 0 t ) = L ( w 0 t ) 2 belongs to Ψ 0 ( ε ) , where ε is determined by Lemma 2-7. Therefore, T m is a d f - ψ -ε-contraction and all conclusions of Theorem 5 remain valid.
Example 9 (Quadrature Chandrasekhar problem)
Consider the crosspounding quadrature integral equations of Chandrasekhar problem (29) as follows
x ( t ) = T m x ( t ) : = 1 + t x ( t ) i = 0 : k m k j = 1 k ω j ψ ( s i + j ) x ( s i + j ) t + s i + j , t I ,
where w i 0 . Let us consider the Case 2: Suppose ψ be a both positive and negative function and the restrictions (35) and (37) hold. Put I m ( + ) : = i = 0 : k m k j = 1 k ω j ψ ( + ) ( s i + j ) 1 + s i + j , I m ( ) : = i = 0 : k m k j = 1 k ω j ψ ( ) ( s i + j ) 1 + s i + j . Treats similar as Chandrasekhar problem Case 2 and define X m * * as (33), i.e.,
X m * * = x [ a m , A m ] , x u w 0 ( m ) x 1 u , r 0 ( m ) T m x 1 u R 0 ( m ) .
It can be apply Theorem 1 if real numbers 0 a m A m and 0 < R 0 ( m ) , r 0 ( m ) , w 0 ( m ) are found such that T m become invariant on X * * . Let us calculate A m 0 : If 0 x A m , we get
T x ( t ) = 1 + t x ( t ) i = 0 : k m k j = 1 k ω j ψ ( s i + j ) x ( s i + j ) t + s i + j = 1 + t x ( t ) i = 0 : k m k j = 1 k ω j ψ ( + ) ( s i + j ) x ( s i + j ) t + s i + j t x ( t ) i = 0 : k m k j = 1 k ω j ψ ( ) ( s i + j ) x ( s i + j ) t + s i + j 1 + A m 2 I m ( + ) ,
for all t > 0 . The inequality T x A m has a solution 1 1 1 4 I m ( + ) 2 I m ( + ) A m 1 + 1 4 I m ( + ) 2 I m ( + ) if the restriction
0 < I m ( + ) = i = 0 : k m k j = 1 k ω j ψ ( + ) ( s i + j ) 1 + s i + j 1 4 ,
holds. Let us calculate a m 0 : If a m x , we get
T m x ( t ) = 1 + t x ( t ) i = 0 : k m k j = 1 k ω j ψ ( s i + j ) x ( s i + j ) t + s i + j = 1 + t x ( t ) i = 0 : k m k j = 1 k ω j ψ ( + ) ( s i + j ) x ( s i + j ) t + s i + j t x ( t ) i = 0 : k m k j = 1 k ω j ψ ( ) ( s i + j ) x ( s i + j ) t + s i + j 1 A m 2 I m ( ) ,
for all t I . The inequality T m x a m has a solution 0 a m 1 A m 2 I m ( ) < 1 if the restriction
0 < I m ( ) = i = 0 : k m k j = 1 k ω j ψ ( ) ( s i + j ) 1 + s i + j < 1 A m 2 ,
holds. If (57) holds then we can select 0 < a m 1 A m 2 I ( ) < 1 . So far we have shown
T m ( [ a m , A m ] ) T m ( [ a m , A m ] ) .
Let us calculate 0 < r 0 ( m ) R 0 ( m ) : Suppose
r ( m ) T m x 1 u = sup t I t x ( t ) i = 0 : k m k j = 1 k ω j ψ ( s i + j ) x ( s i + j ) t + s i + j R ( m ) .
From (56) to (58) we get T m x ( t ) a m , for all t I , and From (59) we get
T m 2 x 1 u = sup t I t T m x ( t ) i = 0 : k m k j = 1 k ω j ψ ( s i + j ) T m x ( s i + j ) t + s i + j sup t I t A m x ( t ) i = 0 : k m k j = 1 k ω j ψ ( + ) ( s i + j ) x ( s i + j ) t + s i + j i = 0 : k m k j = 1 k ω j ψ ( ) ( s i + j ) x ( s i + j ) t + s i + j T m x ( s i + j ) A m 2 max i = 0 : k m k j = 1 k ω j ψ ( ) ( s i + j ) x ( s i + j ) t + s i + j , i = 0 : k m k j = 1 k ω j ψ ( + ) ( s i + j ) x ( s i + j ) t + s i + j = A m 2 max { I m ( + ) , I m ( ) } .
Thus, the right hand side of condition (48) has solutions has a solution max { I m ( + ) , I m ( ) } A m R 0 ( m ) .
Also, from (56) to (58) we get T m x ( t ) a for all t I , and
T m 2 x 1 u = sup t I t T m x ( t ) i = 0 : k m k j = 1 k ω j ψ ( s i + j ) T m x ( s i + j ) t + s i + j a m sup t I t i = 0 : k m k j = 1 k ω j ψ ( s i + j ) T m x ( s i + j ) t + s i + j = a m sup t I t i = 0 : k m k j = 1 k ω j ψ ( + ) ( s i + j ) T m x ( s i + j ) t + s i + j i = 0 : k m k j = 1 k ω j ψ ( ) ( s i + j ) T m x ( s i + j ) t + s i + j a m sup t I t a m i = 0 : k m k j = 1 k ω j ψ ( + ) ( s i + j ) t + s i + j A m i = 0 : k m k j = 1 k ω j ψ ( ) ( s i + j ) t + s i + j a m I m ( + ) A m I m ( ) .
Put r 0 ( m ) : = a m a m I m ( + ) A m I m ( ) 0 , if a m I m ( + ) = A m I m ( ) then by choosing another allowed choice of a m or A m we get r 0 ( m ) > 0 . Thus, (60) shows the left hand side of condition (48) has solutions. Then similar to proof of Theorem 2 consider w 0 ( m ) 1 + R 0 ( m ) r 0 ( m ) , we get
T m x u = sup t I 1 + t x ( t ) i = 0 : k m k j = 1 k ω j ψ ( s i + j ) x ( s i + j ) t + s i + j ( 1 + R 0 ( m ) ) 1 + R 0 ( m ) r 0 ( m ) sup t I t x ( t ) i = 0 : k m k j = 1 k ω j ψ ( s i + j ) x ( s i + j ) t + s i + j = w 0 ( m ) T m x 1 u ,
for all x X m * * . The relations (54) to (61) show that T ( X m * * ) X m * * , where the restrictions (55) and (57) hold.
To showing T is a d f -ψ-ε-contraction treat as Chandrasekhar problem.

5. Numerical Solution of Integral Equations via the Picard Scheme

The existence and convergence results established in the preceding sections not only guarantee the solvability of a broad class of nonlinear Fredholm integral equations, but also provide a rigorous basis for their numerical treatment. In many important problems, including equations for which no explicit analytical solution is known, quadrature methods offer a natural way to approximate the underlying integral operator.
In this section, we combine Picard iteration with quadrature rules to construct convergent numerical schemes for nonlinear integral equations. Theorems 6–8 establish conditions ensuring that the discrete Picard sequence converges to a solution of the corresponding quadrature integral equation and approximates a solution of the original continuous problem. The results provide a direct link between the fixed-point theory developed earlier and practical computational methods.
Theorem 6. 
Let T , T m : X X , for all m M 0 N , be self-mappings. Suppose the pair ( X * , d * ) satisfies properties (P) of Theorem 1 for each T and T m (with the same ψ Ψ 0 ( ε ) and the same ε). In particular, whenever condition (4) is satisfied, the a priori and a posteriori error estimates of Theorem 1 are available.
Let u * and u m * be the unique fixed points of T and T m in X * , respectively (their existence follows from Theorem 1). If the sequence T m converges point-wise to T on ( X * , d * ) , i.e.
lim m d * ( T m x , T x ) = 0 x X * ,
then u m * d * u * . Moreover, for every d-ε-initial value x 0 X * (with x 0 T x 0 ), the following a posteriori and a priori estimates hold:
d * ( x r , m , u * ) M d ( x 0 , T x 0 ) d ( x 0 , T x 0 ) ψ ( d ( x 0 , T x 0 ) ) d ( x r , x r + 1 ) + M d ( x 0 , T m x 0 ) d ( x 0 , T m x 0 ) ψ ( d ( x 0 , T m x 0 ) ) d ( x r , m , x r + 1 , m ) + d * ( T m r x 0 , T r x 0 ) ,
d * ( x r , m , u * ) M d ( x 0 , T x 0 ) d ( x 0 , T x 0 ) ψ ( d ( x 0 , T x 0 ) ) ψ r ( d ( x 0 , T x 1 ) ) + M d ( x 0 , T m x 0 ) d ( x 0 , T m x 0 ) ψ ( d ( x 0 , T m x 0 ) ) ψ r ( d ( x 0 , T m x 0 ) ) + d * ( T m r x 0 , T r x 0 ) ,
where x r = T r x 0 , x r , m = T m r x 0 , and d * M d .
Proof. 
We first prove by induction on r that
lim m d * ( T m r x , T r x ) = 0 x X * , r N .
For r = 1 this is exactly the point-wise convergence of T m to T. Assume (64) holds for some r 1 . Then
d * ( T m r + 1 x , T r + 1 x ) d * ( T m r + 1 x , T m r ( T x ) ) + d * ( T m r ( T x ) , T r + 1 x ) M d ( T m r + 1 x , T m r ( T x ) ) + d * ( T m r ( T x ) , T r ( T x ) ) M ψ d ( T m r x , T r x ) + d * ( T m r ( T x ) , T r ( T x ) ) .
Since ψ ( t ) < t and d ( T m r x , T r x ) 0 , the first term tends to 0. The second term tends to 0 by the induction hypothesis applied to the point T x . Thus (64) holds for r + 1 , completing the induction.
Now let x 0 X * be a d- ε -initial value. Using the a priori estimate from Theorem 1-(IV) we have
d * ( T m r x 0 , u m * ) M d ( x 0 , T m x 0 ) d ( x 0 , T m x 0 ) ψ ( d ( x 0 , T m x 0 ) ) ψ r ( d ( x 0 , T m x 0 ) ) ,
and similarly for T and u * . Then
d * ( u m * , u * ) d * ( T m r x 0 , u m * ) + d * ( T m r x 0 , T r x 0 ) + d * ( T r x 0 , u * ) M d ( x 0 , T m x 0 ) d ( x 0 , T m x 0 ) ψ ( d ( x 0 , T m x 0 ) ) ψ r ( d ( x 0 , T m x 0 ) ) + d * ( T m r x 0 , T r x 0 ) + M d ( x 0 , T x 0 ) d ( x 0 , T x 0 ) ψ ( d ( x 0 , T x 0 ) ) ψ r ( d ( x 0 , T x 0 ) ) .
Because ψ Ψ 0 ( ε ) , we have ψ r ( d ( x 0 , T x 0 ) ) 0 and ψ r ( d ( x 0 , T m x 0 ) ) 0 as r , uniformly in m (since d ( x 0 , T m x 0 ) < ε ). Moreover, by (56) with r fixed, d * ( T m r x 0 , T r x 0 ) 0 as m . Therefore, given any ϵ > 0 , we can first choose r so large that the two ψ r terms are less than ϵ / 3 , and then choose m sufficiently large so that the middle term is also less than ϵ / 3 . This yields d * ( u m * , u * ) < ϵ for all large m, i.e. u m * d * u * .
The posteriori estimate (62) follows from the triangle inequality and the corresponding estimates for T and T m :
d * ( x r , m , u * ) d * ( x r , m , u m * ) + d * ( u m * , u * ) + d * ( u * , x r ) M d ( x 0 , T m x 0 ) d ( x 0 , T m x 0 ) ψ ( d ( x 0 , T m x 0 ) ) d ( x r , m , x r + 1 , m ) + d * ( T m r x 0 , T r x 0 ) + M d ( x 0 , T x 0 ) d ( x 0 , T x 0 ) ψ ( d ( x 0 , T x 0 ) ) d ( x r , x r + 1 ) .
The a priori estimate (63) is obtained by replacing d ( x r , m , x r + 1 , m ) and d ( x r , x r + 1 ) by the bounds ψ r ( d ( x 0 , T m x 0 ) ) and ψ r ( d ( x 0 , T x 0 ) ) (see inequality (7) of Theorem 1). This completes the proof. □
Theorem 7. 
Let T , T m : X X , for all m M 0 N , be self-mappings given by (45) and (46), respectively. Suppose w i 0 for all i = 0 , , k . Then T m converges pointwise to T on ( C ( I ) , · u ) . Consequently, all conclusions of Theorem 6 hold.
Proof. 
Set f 1 in (44); then i = 0 : k m k j = 0 k w j = b a . Let δ = k b a m , where k is fixed and m is a multiple of k (so we have m k repeated subintervals). For any x C ( I ) ,
T m x T x u = sup t I i = 0 : k m k j = 0 k ω j K ( t , s i + j , x ( s i + j ) ) a b K ( t , s , x ( s ) ) d s = 1 b a sup t I i = 0 : k m k j = 0 k ω j a b K ( t , s i + j , x ( s i + j ) ) d s i = 0 : k m k j = 0 k ω j a b K ( t , s , x ( s ) ) d s 1 b a i = 0 : k m k j = 0 k ω j sup t I a b K ( t , s i + j , x ( s i + j ) ) K ( t , s , x ( s ) ) d s 1 b a i = 0 : k m k j = 0 k ω j ω δ ( K , I ) = ω δ ( K , I ) ,
where
ω δ ( K , I ) = sup t I , s , s I , | s s | δ u , u [ min ( x ) , max ( x ) ] K ( t , s , u ) K ( t , s , u )
is the modulus of continuity of K with respect to its second variable (and implicitly the third, because u , u vary continuously as x is continuous). Here min ( x ) = inf t I x ( t ) and max ( x ) = sup t I x ( t ) . As m , δ 0 , and since K is uniformly continuous on the compact set I × I × [ min ( x ) , max ( x ) ] , we obtain lim δ 0 ω δ ( K , I ) = 0 . Hence T m x T x u 0 for every x C ( I ) , i.e., T m T pointwise. □
Theorem 8 
(Local error estimation of numerical scheme (46) and (47)). With the same assumptions as in Theorem 5, suppose f and K ( t , · , · ) are smooth functions on I × R for all t I m . If a repeated quadrature rule has asymptotic error of order p > 0 , i.e.
i = 0 : k m k j = 1 k ω j φ ( s i + j ) a b w ( s ) φ ( s ) d s = O h p
for every smooth function φ, where h = ( b a ) / m and p is the order of the quadrature rule, then the convergence of the Picard sequence T m n ( x 0 ) satisfies the following estimate
| x r , m ( t ) u * ( t ) | 2 d f ( x 0 , T x 0 ) d f ( x 0 , T x 0 ) ψ ( d f ( x 0 , T x 0 ) ) ψ r ( d f ( x 0 , T x 0 ) ) + 2 d f ( x 0 , T m x 0 ) d f ( x 0 , T m x 0 ) ψ ( d f ( x 0 , T m x 0 ) ) ψ r ( d f ( x 0 , T m x 0 ) ) + O h p ,
for all d f - ε 0 -initial values x 0 X * and all t I m . Here u * is a fixed point of T given by (45), x r , m = T m r x 0 , r N , m M 0 , and h = b a m .
Proof. 
Choose an initial value x 0 X * that is smooth (such an element exists because smooth functions are dense in C ( I ) and the set X * is non-empty). By the smoothness assumption on K ( t , · , · ) , each iterate T m r ( x 0 ) ( t ) is smooth on I × R . The local quadrature error at the first step is
E local 1 ( t ) = | T m ( x 0 ) ( t ) T ( x 0 ) ( t ) | = i = 0 : k m k j = 1 k ω j K ( t , s i + j , x 0 ( s i + j ) ) a b w ( s ) K ( t , s , x 0 ( s ) ) d s .
By the assumed order of the quadrature rule, this error is O ( h p ) uniformly in t I . Inductively, for any r 1 ,
E local r ( t ) = | T m r ( x 0 ) ( t ) T r ( x 0 ) ( t ) | = i , j ω j K ( t , s i + j , T r 1 x 0 ( s i + j ) ) a b w ( s ) K ( t , s , T r 1 x 0 ( s ) ) d s
is also O ( h p ) , because T r 1 x 0 is smooth and the quadrature rule converges with the same order for all smooth integrands.
Now apply the a priori estimates from Theorem 1-(IV) (with M = 2 since d u 2 d f ). For the exact operator T,
| T r x 0 ( t ) u * ( t ) | d u ( T r x 0 , u * ) 2 d f ( x 0 , T x 0 ) d f ( x 0 , T x 0 ) ψ ( d f ( x 0 , T x 0 ) ) ψ r ( d f ( x 0 , T x 0 ) ) ,
and analogously for T m ,
| T m r x 0 ( t ) u m * ( t ) | 2 d f ( x 0 , T m x 0 ) d f ( x 0 , T m x 0 ) ψ ( d f ( x 0 , T m x 0 ) ) ψ r ( d f ( x 0 , T m x 0 ) ) .
Using the triangle inequality,
| x r , m ( t ) u * ( t ) | | T m r x 0 ( t ) u m * ( t ) | + | T m r x 0 ( t ) T r x 0 ( t ) | + | T r x 0 ( t ) u * ( t ) | 2 d f ( x 0 , T m x 0 ) d f ( x 0 , T m x 0 ) ψ ( d f ( x 0 , T m x 0 ) ) ψ r ( d f ( x 0 , T m x 0 ) ) + O ( h p ) + 2 d f ( x 0 , T x 0 ) d f ( x 0 , T x 0 ) ψ ( d f ( x 0 , T x 0 ) ) ψ r ( d f ( x 0 , T x 0 ) ) .
This is exactly estimate (65). □
Note 8. 
The first two terms in (65) correspond to the convergence of the Picard sequences for T and T m , respectively, while the third term is the quadrature error. For sufficiently large r, the first two terms become negligible (since ψ r ( d f ( · , · ) ) 0 ), so the overall error is dominated by the quadrature error O ( h p ) . Hence, in practice, the convergence rate is essentially the same as that of the underlying quadrature rule.
Example 10. 
Consider Chandrasekhar integral equation T given by (29) and its quadrature integral equation T m given by (52). If the conditions lim m + I m + = I + and lim m + I m = I hold then R m R and r m r and by choosing R m R and r m r it may assume X * * = X m * * given by (33) and (53), for all large enough m N , and all the Theorems of this Section can be apply on X * * , see also Note 3-2. For instance, these conditions hold for all (ψ1) to (ψ4).

5.1. Numerical investigation of Picard sequence and quadrature integration rules

Let us examine some experimental examples to support the theoretical results of previous sections for Fredholm integral equations. The numerical solution is computed using the Picard sequence (47). We employed two termination criteria: max t i I m | x r + 1 ( t i ) x r ( t i ) | < 10 100 and a maximum of 200 iterations. In some examples the first criterion terminated the process, while in others the second one was used. The implementation codes are publicly available and can be accessed through the links provided in the Availability of data and materials section.
Example 11. 
We use two quadrature rules to validate the theoretical results for Example 3 with ρ = 3.5 . The exact solution of integral equation (21) is obtained by substituting x ( t ) = a t , which yields a = 2 + a ρ ( 1 2 e 1 ) , hence a = 2 e e ρ ( e 2 ) = 4 e 9 e 14 1.0390 (see Example 6). Since the problem is smooth, appropriate quadrature rules are Newton–Cotes and Gauss–Legendre.
Figure 1 and Table 2 compare the errors obtained for different values of m and quadrature orders k. The results for Newton–Cotes and Gauss–Legendre rules were obtained using the first and second termination criteria, respectively.
Note 9. 
In Example 11, numerical experiments based on the Newton–Cotes and Gauss–Legendre quadrature rules indicate that the Picard sequence converges only for | ρ | 3.7 and for 45 ρ 3.7 , respectively. In particular, the Gauss–Legendre discretization exhibits convergence for a significantly wider range of negative values of ρ than that guaranteed by Theorem 1; namely, convergence is observed throughout the interval 45 ρ 3.7 , whereas the theorem predicts only the range | ρ | e e 2 for the integral equation (21). However, no convergence is observed for ρ 3.7 .
Example 12. 
We apply the Gauss–Jacobi quadrature rule to solve the nonlinear s α -weighted integral equation
x ( t ) = T x ( t ) = ( 1 ρ ) t 1 4 ρ cos ( t + 1 ) cos t + ρ 0 1 s 1 2 sin ( t + s ) + 2 s t 1 4 x 2 ( s ) , d s , t I : = [ 0 , 1 ] ,
whose exact solution is x ( t ) = t 1 / 4 .
Using the transformation s = 1 ξ 2 , we obtain
0 1 s α f ( s ) , d s = 1 1 2 ( α + 1 ) ( 1 ξ ) α f 1 ξ 2 d ξ .
Therefore, the Gauss–Jacobi rule can be applied by replacing the standard nodes and weights according to
s i = 1 ξ i 2 , ω i * = 2 ( α + 1 ) ω i .
In the implementation, the Gauss–Jacobi nodes and weights are computed by the eigenvalue method, which is both efficient and highly accurate.
The results are summarized in Figure 2 and Figure 3. In the first experiment, the Gauss–Jacobi rule with parameters α = 1 2 , β = 0 and orders k = 10 , 100 , 1000 is applied on the whole interval [ 0 , 1 ] . In the second experiment, the interval is divided into two subintervals. Since the integrand is singular only on the first subinterval, the Gauss–Jacobi rule is employed on [ 0 , 1 2 ] , whereas the Gauss–Legendre rule is used on [ 1 2 , 1 ] . Because both quadrature formulas have comparable accuracy, the resulting errors are very similar, thereby confirming Note 6-2.
The same approach can be applied to the Riemann–Liouville-type integral equation
x ( t ) = T x ( t ) = 2 e 2 Γ ( 2 5 ) e t + 1 t + 1 2 Γ ( 2 5 ) 0 1 e , s t ( 1 s ) 2 5 x 14 5 ( s ) , d s , t I : = [ 0 , 1 ] ,
whose exact solution is x ( t ) = 1 t .
Using the transformation s = ξ + 1 2 , we obtain
0 1 ( 1 s ) α f ( s ) , d s = 1 1 2 ( α + 1 ) ( 1 ξ ) α f ξ + 1 2 d ξ .
Hence, the Gauss–Jacobi rule can be implemented with the modified nodes and weights
s i = 1 + ξ i 2 , ω i * = 2 ( α + 1 ) ω i .
Figure 4 presents the corresponding errors for k = 50 , 500 , 5000 . The computation with k = 5000 required approximately 448 seconds of CPU time.
Example 13. 
We employ two quadrature rules to investigate Chandrasekhar’s problem corresponding to cases 2) and 4) of SubSection 3.2. Since the exact solution satisfies x ( 0 ) = 1 , the iterative scheme (47) is initialized with x ( 0 ) = 1 . Consequently, quadrature formulas whose first node is located at t = 0 , such as the Newton–Cotes rules, can be used without difficulty.
  • Results for case 2).
An advantage of the Newton–Cotes family is that rules of different orders employ the same prescribed nodes, making their numerical solutions directly comparable. Table 3 presents the solutions obtained by Simpson’s rule, Boole’s rule, and the Newton–Cotes rule with k = 10 , together with the results reported in [7,10].
The agreement among all methods is excellent. To compare quadrature rules of different orders, let
e m k , k ( s ) = NS k ( s ) NS k ( s ) , s I m ,
where NS k denotes the numerical solution generated by (46)–(47) using a quadrature rule of order k. Figure 5 displays the differences between the solutions obtained with Simpson’s rule ( k = 2 ), Boole’s rule ( k = 4 ), and the Newton–Cotes rule ( k = 10 ). The largest discrepancies occur near the singular point t = 0 , while the differences become considerably smaller away from the singularity.
The Gauss–Legendre rule was also implemented with orders k = 4 , 5 , and 10. Unlike Newton–Cotes formulas, Gauss–Legendre rules employ different quadrature nodes for different values of k. Therefore, their solutions cannot be compared pointwise in the same manner as in Figure 5. Instead, the computed solutions are plotted together in Figure 6 to illustrate their overall agreement.
  • Results for case 4) with ρ = 2 .
Figure 7 (left and right) shows the pointwise differences between the solutions obtained by Simpson’s rule and the Newton–Cotes rule ( k = 10 ), and between Boole’s rule and the Newton–Cotes rule ( k = 10 ), respectively. As in the previous case, the largest local errors occur near the singular point t = 0 .
Since Gauss–Legendre rules of different orders use distinct (non-equally spaced) quadrature nodes, a direct pointwise comparison is again impossible. Therefore, the corresponding numerical solutions are displayed together in Figure 8.

6. Conclusions and Future Research Directions

We established existence, uniqueness, localization, and convergence results for a broad class of nonlinear integral equations. The proposed framework allows the construction of invariant sets that are adapted to the structure of the problem and can be applied even in cases where classical contraction principles are not directly applicable. Several examples, including Chandrasekhar-type equations, illustrate the effectiveness of the obtained theoretical results.
The numerical experiments performed with Newton–Cotes, Gauss–Legendre, and Gauss–Jacobi rules demonstrate the practical applicability of the method and show good agreement with available exact or previously reported solutions.
The numerical investigations also reveal that, in several cases, the observed convergence region of the Picard sequence is significantly larger than that predicted by the theoretical estimates. This suggests that the sufficient conditions established in the present work are not optimal and that further refinements may be possible. Consequently, the proposed framework opens several directions for future research, including the study of alternative iterative schemes, sharper localization conditions, multiple-solution phenomena, and the extension of the theory to other classes of functional, fractional, and Volterra-type integral equations. The results presented in this paper open several directions for further investigation. The following list is not exhaustive, but it highlights some potential avenues for future research.
1.
Theorem 1 may have applications beyond integral equations, including matrix equations, equilibrium problems, optimization, and mathematical economics, in a manner analogous to the broad applicability of the Banach contraction principle, see [14].
2.
Theorem 1 may be extended in the spirit of classical fixed-point theory. In particular, it would be interesting to investigate whether analogues of celebrated results such as Caristi’s fixed-point theorem, Ekeland’s variational principle, and related equivalence theorems can be established within the present framework. Similar extensions may also be considered in generalized metric spaces and other metric-like structures.
3.
The Picard iteration method developed in this paper provides a mechanism for obtaining a fixed point of the operator T. However, as observed in Example 3, Theorem 2 guarantees the existence of solutions only for | ρ | < e e 2 , which already improves the corresponding result obtained via the Banach contraction principle in [11]. On the other hand, numerical experiments indicate that the Picard sequences associated with the quadrature integral equation (38) diverge when ρ 3.7 , for both Newton–Cotes and Gauss–Legendre quadrature rules.
This naturally leads to the following questions:
(a)
Can the Picard iteration be modified, for example by employing Krasnoselskiĭ-, Mann-, Ishikawa-, Newton-type, or other iterative schemes, to obtain convergence to additional solutions of the underlying functional equation?
(b)
Is condition (9) essential? More precisely, can alternative invariant-set conditions or modified forms of the ψ - ε -max-inequality (13) be used to establish the existence of further solutions that are not captured by the present approach?
4.
In connection with the previous question, it remains unclear whether the Chandrasekhar problem admits multiple solutions. If multiple solutions exist, it would be important to develop analytical and numerical techniques capable of detecting and approximating them.
5.
The extension of the present theory to Volterra integral equations and related classes of functional equations deserves further investigation. In particular, the development of efficient numerical algorithms (e.g., [17,21,23]) and convergence analyses for such problems would be of significant interest.
6.
A systematic study of numerical integration schemes associated with the proposed framework would also be worthwhile. This includes a comparison of various quadrature rules, error estimates, computational efficiency, and stability properties for different classes of integral equations.
7.
Further applications to other nonlinear integral equations, integro-differential equations, fractional integral equations, and related problems may provide additional insight into the scope and limitations of the proposed fixed-point framework.

Author Contributions

All authors contributed equally. All authors read and approved the final manuscript.

Funding

No funding was used in this study.

Data Availability Statement

The Matlab codes are available at https://github.com/Sadra9853/Examples-of-Article_Quadrature-rules.git. No data were used to support this study.

Conflicts of Interest

The authors declare no conflicts of interest related to this study.

References

  1. Agarwal, R. P.; Karapı nar, E.; O’Regan, D.; Roldán-López-de Hierro, A. F. Fixed point theory in metric type spaces; Springer: Cham, 2015; ISBN 978-3-319-24080-0; 978-3-319-24082-4. [Google Scholar] [CrossRef]
  2. Almezel, S.; Ansari, Q. H.; Khamsi, M. A. (Eds.) Topics in fixed point theory; Springer: Cham, 2014; ISBN 978-3-319-01585-9; 978-3-319-01586-6. [Google Scholar] [CrossRef]
  3. Arandelović, I. D.; Kečkić, D. J. Symmetric spaces approach to some fixed point results. Nonlinear Anal. 2012, 75(13), 5157–5168. [Google Scholar] [CrossRef]
  4. Atkinson, K. E. An introduction to numerical analysis, second edition; John Wiley & Sons, Inc., New York, 1989; ISBN 0-471-62489-6. [Google Scholar]
  5. Bellour, A.; O’Regan, D.; Taoudi, M.-A. On the existence of integrable solutions for a nonlinear quadratic integral equation. J. Appl. Math. Comput. 2014, 46(1-2), 67–77. [Google Scholar] [CrossRef]
  6. Biazar, J.; Ghazvini, H. Numerical solution for special non-linear Fredholm integral equation by HPM. Appl. Math. Comput. 2008, 195(2), 681–687. [Google Scholar] [CrossRef]
  7. Chandrasekhar, S. Radiative transfer; Dover Publications, Inc.: New York, 1960. [Google Scholar]
  8. Davis, P. J.; Rabinowitz, P. Methods of numerical integration; Corrected reprint of the second (1984) edition; Dover Publications, Inc.: Mineola, NY, 2007; ISBN 978-0-486-45339-2; 0-486-45339-1. [Google Scholar]
  9. Fox, C. A solution of Chandrasekhar’s integral equation. Trans. Amer. Math. Soc. 1961, 99, 285–291. [Google Scholar] [CrossRef]
  10. Hernández-Verón, M. A.; Martínez, E. Iterative schemes for solving the Chandrasekhar H-equation using the Bernstein polynomials. J. Comput. Appl. Math. 2022, 404, 113391. [Google Scholar] [CrossRef]
  11. Hernández-Verón, M. A.; Romero, N. On the existence and uniqueness of fixed points in Banach spaces using the Krasnoselskij iterative method. Carpathian J. Math. 2025, 41(1), 95–106. [Google Scholar]
  12. Isaacson, E.; Keller, H. B. MR0201039 (34 #924)Analysis of numerical methods; Corrected reprint of the 1966 original; Dover Publications, Inc.: New York; Wiley, New York, 1994; ISBN 0-486-68029-0. [Google Scholar]
  13. Jachymski, J.; Matkowski, J.; Świa̧tkowski, T. Nonlinear contractions on semimetric spaces. J. Appl. Anal. 1995, 1(2), 125–134 1869-6082. [Google Scholar] [CrossRef]
  14. Jachymski, J.; Jóźwik, I.; Terepeta, M. g. The Banach fixed point theorem: selected topics from its hundred-year history. Rev. R. Acad. Cienc. Exactas Fís. Nat. Ser. A Mat. RACSAM 2024, 118, 140. [Google Scholar] [CrossRef]
  15. Kythe, P. K.; Schäferkotter, M. R. Handbook of computational methods for integration; Chapman & Hall/CRC: Boca Raton, FL, 2005; ISBN 1-58488-428-2. [Google Scholar]
  16. Li, C.; Cai, M. Theory and numerical approximations of fractional integrals and derivatives; Society for Industrial and Applied Mathematics (SIAM): Philadelphia, PA, 2020; ISBN 978-1-611975-87-1. [Google Scholar]
  17. Li, C.; Chen, A.; Ye, J. Numerical approaches to fractional calculus and fractional ordinary differential equation. J. Comput. Phys. 2011, 230(9), 3352–3368. [Google Scholar] [CrossRef]
  18. Matkowski, J. Integrable solutions of functional equations. Diss. Math. (Rozprawy Mat.) 1975, 127, 68. [Google Scholar]
  19. Morocsanu, G. Functional analysis for the applied sciences. In Universitext; Springer: Cham, 2019; ISBN 978-3-030-27152-7; 978-3-030-27153-4. [Google Scholar] [CrossRef]
  20. Golshan, H. Mottaghi. An existence result for implicit functional equations. Authorea Prepr. 2023. [Google Scholar] [CrossRef] [PubMed]
  21. Golshan, H. Mottaghi. Numerical solution of nonlinear m-dimensional Fredholm integral equations using iterative Newton-Cotes rules. J. Comput. Appl. Math. 2024, 448 11 Paper No. 115917. [Google Scholar] [CrossRef]
  22. Golshan, H. Mottaghi. Simulation functions on metric fixed point theory. J. Inequal. Appl. 2025, 17, 45. [Google Scholar] [CrossRef]
  23. Golshan, H. Mottaghi. A new approach based on supplementary Newton-Cotes rules to solve Volterra integral equations. Math. Methods Appl. Sci. 2026, 49(7), 7018–7036. [Google Scholar] [CrossRef]
  24. Wazwaz, A.-M. A first course in integral equations, second edition; World Scientific Publishing Co. Pte. Ltd.: Hackensack, NJ, 2015; ISBN 978-981-4675-11-6; 978-981-4675-12-3. [Google Scholar]
Figure 1. Plots of e 20 ( s ) , s I 20 , for Newton–Cotes and Gauss–Legendre rules with k = 4 , 10 and m = 20
Figure 1. Plots of e 20 ( s ) , s I 20 , for Newton–Cotes and Gauss–Legendre rules with k = 4 , 10 and m = 20
Preprints 218913 g001
Figure 2. Plots of e n ( s ) , s I m , for m = k = 10 , 100 , 1000 ; non-repeated Gauss–Jacobi rule.
Figure 2. Plots of e n ( s ) , s I m , for m = k = 10 , 100 , 1000 ; non-repeated Gauss–Jacobi rule.
Preprints 218913 g002
Figure 3. Plots of e n ( s ) , s I m , for k = 10 , 100 , 1000 and m = 2 k ; repeated formulation with Gauss–Jacobi rule on [ 0 , 1 2 ] and Gauss–Legendre rule on [ 1 2 , 1 ] .
Figure 3. Plots of e n ( s ) , s I m , for k = 10 , 100 , 1000 and m = 2 k ; repeated formulation with Gauss–Jacobi rule on [ 0 , 1 2 ] and Gauss–Legendre rule on [ 1 2 , 1 ] .
Preprints 218913 g003
Figure 4. Plots of e n ( s ) , s I m , for m = k = 50 , 500 , 5000 .
Figure 4. Plots of e n ( s ) , s I m , for m = k = 50 , 500 , 5000 .
Preprints 218913 g004
Figure 5. Plots of e 20 2 , 10 ( s ) and e 20 4 , 10 ( s ) , s I 20 , obtained using Newton–Cotes rules.
Figure 5. Plots of e 20 2 , 10 ( s ) and e 20 4 , 10 ( s ) , s I 20 , obtained using Newton–Cotes rules.
Preprints 218913 g005
Figure 6. Numerical solutions obtained by Boole’s rule ( k = 4 ) and Gauss–Legendre rules ( k = 4 , 5 , 10 ), with n = 20 .
Figure 6. Numerical solutions obtained by Boole’s rule ( k = 4 ) and Gauss–Legendre rules ( k = 4 , 5 , 10 ), with n = 20 .
Preprints 218913 g006
Figure 7. Plots of e 20 2 , 10 ( s ) and e 20 4 , 10 ( s ) , s I 20 , obtained using Newton–Cotes rules.
Figure 7. Plots of e 20 2 , 10 ( s ) and e 20 4 , 10 ( s ) , s I 20 , obtained using Newton–Cotes rules.
Preprints 218913 g007
Figure 8. Numerical solutions obtained by Boole’s rule ( k = 4 ) and Gauss–Legendre rules ( k = 4 , 5 , 10 ), with n = 20 .
Figure 8. Numerical solutions obtained by Boole’s rule ( k = 4 ) and Gauss–Legendre rules ( k = 4 , 5 , 10 ), with n = 20 .
Preprints 218913 g008
Table 1. Some quadrature rules
Table 1. Some quadrature rules
Method Interval Weight w ( s ) Exactness
Newton–Cotes [ a , b ] 1 n
Gauss–Jacobi [ 1 , 1 ] ( 1 s ) α ( 1 + s ) β , α , β > 1 2 n 1
Gauss–Legendre [ 1 , 1 ] 1 2 n 1
Gauss–Chebyshev [ 1 , 1 ] ( 1 s 2 ) 1 / 2 2 n 1
Gauss–Radau [ 1 , 1 ] 1 2 n 2
Gauss–Lobatto [ 1 , 1 ] 1 2 n 3
Gauss–Log [ 0 , 1 ] ln ( s )
Gauss– s α [ 0 , 1 ] s α , 0 < α < 1 2 n 1
Table 2. Error values for Boole, Newton–Cotes, and Gauss–Legendre rules
Table 2. Error values for Boole, Newton–Cotes, and Gauss–Legendre rules
m Boole ( k = 4 ) Newton–Cotes ( k = 10 ) Gauss–Legendre ( k = 4 ) Gauss–Legendre ( k = 10 )
20 2.6797e-10 4.7910e-11 1.3101e-14 3.3307e-16
40 5.1353e-11 4.7910e-11 3.3307e-16 4.4409e-16
Table 3. Comparison of solutions obtained from different methods
Table 3. Comparison of solutions obtained from different methods
Nodes ( n = 20 , h = 0.05 ) Simpson ( k = 2 ) Boole ( k = 4 ) Newton-Cotes ( k = 10 ) H 2 ( s ) IS [10] H 2 ( s ) Adomian [10] Chandra-sekhar [7]
0.00 1.00000 1.00000 1.00000 1.00000 1.00000 1.00000
0.05 1.01148 1.01146 1.01143 1.01140 1.01120 1.01145
0.10 1.01725 1.01724 1.01724 1.01723 1.01688 1.01724
0.15 1.02134 1.02133 1.02133 1.02133 1.02088 1.02134
0.20 1.02448 1.02448 1.02448 1.02448 1.02393 1.02448
0.25 1.02700 1.02700 1.02700 1.02700 1.02639 1.02700
0.30 1.02908 1.02908 1.02909 1.02908 1.02841 1.02909
0.35 1.03085 1.03085 1.03085 1.03085 1.03012 1.03085
0.40 1.03236 1.03236 1.03236 1.03236 1.03159 1.03236
0.45 1.03367 1.03367 1.03367 1.03368 1.03287 1.03368
0.50 1.03483 1.03483 1.03483 1.03483 1.03399 1.03483
0.55 1.03586 1.03586 1.03586 1.03586 1.03499 1.03586
0.60 1.03678 1.03678 1.03678 1.03678 1.03588 1.03679
0.65 1.03761 1.03761 1.03761 1.03761 1.03668 1.03761
0.70 1.03836 1.03836 1.03836 1.03836 1.03741 1.03836
0.75 1.03904 1.03904 1.03904 1.03904 1.03807 1.03904
0.80 1.03966 1.03966 1.03966 1.03966 1.03867 1.03966
0.85 1.04023 1.04023 1.04023 1.04024 1.03923 1.04024
0.90 1.04076 1.04076 1.04076 1.04076 1.03974 1.04076
0.95 1.04125 1.04125 1.04125 1.04125 1.04021 1.04125
1.00 1.04170 1.04170 1.04170 1.04170 1.04065 1.04170
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2026 MDPI (Basel, Switzerland) unless otherwise stated

Accessibility

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings