1. Introduction
The study of numerical solutions for integral equations has recently gained significant attention due to their wide application in modeling complex phenomena across various scientific and engineering fields. These equations are frequently encountered in viscoelasticity, fluid dynamics, electrodynamics, unstable aerodynamics, and thermoplastic processes. Among the numerous numerical techniques available, the Sinc method has emerged as a compelling and versatile approach to addressing these problems. Its remarkable accuracy and exponential convergence, particularly for issues involving singularities or defined on unbounded domains, make it highly effective for solving a diverse range of integral and differential equations. In particular, Sinc-based collocation and Galerkin methods have been successfully applied to manage high-order partial integro-differential equations.
The work presented in [
1] aims to enhance certain aspects of the Sinc-Nyström method for solving Volterra integro-differential equations. The authors offer two main theoretical contributions: an analysis of the regularity of the solution and an examination of the convergence rate of the method. In [
2], a comprehensive overview of various Sinc-based numerical methods is provided, emphasizing their applicability to computational problems. More recently, Rashidinia and Zarebnia introduced a Sinc-collocation method specifically designed for a certain class of problems [
3]. Unlike traditional approaches, this method does not require smoothness at the endpoints and is based on the Sinc approximation framework. The authors assert that this technique can achieve exponential convergence, a claim that is supported by numerical experiments under specific conditions. Additionally, the study in [
4] presents two improved variants of the Sinc-collocation method for solving Fredholm integral equations of the second kind, which can be expressed as:
The authors discussed enhancements to the Sinc-collocation method initially proposed by Rashidinia and Zarebnia in 2005. They introduced two refined versions of this method.
First Improvement: This version builds upon the original scheme to enhance its practicality and theoretical soundness. The authors provided rigorous proof that the convergence rate of this modified approach is exponential, consistent with previous findings in [
3].
Second Improvement: In this version, the tanh transformation used in the original scheme is replaced with the double exponential transformation. The authors demonstrated that this change significantly improves the convergence rate.
The paper [
5] explores the origins and development of the double exponential transformation in numerical integration. This transformation was initially introduced by H. Takahashi and Mori in 1974. In [
6], the authors present a novel numerical approach for solving linear integral equations. They employ the Sinc collocation method, enhanced by the double exponential (DE) transformation. This method is applied to Volterra integral equations of both the first and second kinds, as well as to Fredholm integral equations of the second kind. For the Volterra equations, the authors utilize a numerical indefinite integration formula developed by Muhammad and Mori, which incorporates the DE transformation into the Sinc expansion of the integrand.
In [
7], a Sinc-Galerkin method is examined and analyzed for solving a fourth-order partial integro-differential equation with a weakly singular kernel. The time derivative and Riemann–Liouville fractional integral terms are approximated using the Crank–Nicolson method and the trapezoidal convolution quadrature rule. A fully discrete scheme is then constructed via the Sinc-Galerkin spatial approximation. The process is shown to achieve exponential convergence in the appropriate function space. Similarly, in [
8], the authors develop a Sinc-Galerkin method for a fourth-order partial integro-differential equation with a weakly singular kernel. They employ the Crank–Nicolson method and the trapezoidal convolution quadrature rule to discretize the temporal terms and formulate a fully discrete scheme using the Sinc-Galerkin approach. Study [
9] provides a comprehensive treatment of the Sinc-Galerkin method for solving time-dependent partial differential equations. In [
10], two numerical methods are proposed for solving nonlinear Fredholm integral equations of the second kind. These approaches combine the Sinc approximation with single exponential (SE) and double exponential (DE) transformations. To solve the resulting nonlinear systems, the authors apply a Sinc collocation method in conjunction with a Newton iterative process and present a detailed error analysis for both techniques.
Systems of linear integral equations are fundamental tools in applied mathematics and physics, as they frequently arise in the modeling and analysis of complex phenomena. These systems commonly appear when reformulating boundary value problems, particularly in domains comprising multiple subregions or interfaces (see [
11]). In such contexts, solving the integral system provides valuable insights into the behavior of the original physical problem. For example, ref. [
12] introduces several numerical methods based on piecewise polynomials for solving systems of linear Fredholm integral equations of the second kind.
Despite this progress, systems involving multiple coupled unknown functions appearing both inside and outside the integral terms pose distinct analytical and computational challenges that are not sufficiently addressed in the current literature. In particular, existing Sinc-based methods often exhibit the following limitations:
A lack of rigorous convergence analysis when extended to coupled systems;
The absence of optimized transformation strategies (e.g., SE or DE mappings) to improve computational efficiency,
Unclear definitions of function spaces and operator frameworks, which limit the theoretical robustness and general applicability of their results.
Motivated by these applications, this work aims to address the aforementioned limitations by focusing on the numerical solution of coupled systems of Fredholm integral equations of the second kind:
Specifically, we concentrate on the practical analysis of the following system comprising two coupled Fredholm integral equations:
which arises in various applied contexts, including composite media modeling and interface problems in mathematical physics. In the system of Fredholm integral equations of the second kind, the unknown functions
and
appear both inside and outside the integral sign. The existing literature on systems of Fredholm integral equations covers a wider range of cases than the type discussed in this paper. However, the type examined here is particularly relevant for practical applications. By focusing on this form, we can conduct a detailed analysis and explore its real-world applications.
Sinc-collocation methods have proven to be effective tools for numerically solving differential and integral equations. In this paper, we introduce two enhanced variants of the Sinc-collocation method, each aimed at improving convergence and computational performance. The first method utilizes a single exponential (SE) transformation, while the second employs a double exponential (DE) transformation. The novelty of our contribution lies in the development of two enhanced Sinc-collocation methods, based on the single exponential (SE) and double exponential (DE) transformations, designed specifically for this class of coupled problems.
Our key theoretical contributions are as follows:
We derive rigorous error bounds and establish improved convergence rates for both SE- and DE-based Sinc methods, demonstrating sharper asymptotic behavior compared to classical results.
We develop a comprehensive functional-analytic framework that includes the precise definition of vector function spaces, operators, and the conditions necessary for ensuring convergence.
We validate our theoretical results through extensive numerical experiments, which confirm the improved accuracy and computational efficiency of the proposed methods.
A significant contribution of this work lies in the enhanced convergence behavior of the proposed techniques. Classical SE and DE Sinc-collocation methods typically achieve convergence rates of and , respectively. In contrast, the methods presented in this study have improved convergence rates of and , which are better than the classical methods. Our improvements seek to enhance these rates, leading to better computational efficiency and reliability.
The organization of this paper is as follows: in
Section 2, we establish some basic definitions and preliminaries. In
Section 3, we introduce the collocation methods and analyze their convergence. We will also prove the associated theorems, offering new and improved estimates for the rates of convergence.
Section 4 discusses the numerical results. Finally, we present our conclusions in
Section 5.
3. System of Linear Fredholm Integral Equations of the Second Kind
3.1. Generalized Case
We examine the system of linear Fredholm integral equations of the second kind, given by the following form:
Set
and
The system (5) can be represented as an operator equation in the following manner:
Or equivalently,
which is the matrix form, where
3.2. Development of the Method
In this section, we consider the approximate operators
We note that
Let
be the solution of the system
Or equivalently,
where
Also, let
be the solution of the system
That is to say,
with
In order to prove the existence of the operators
and
, we will use the
-convergence introduced in [
14].
We recall that the approximate operator is -convergent to the operator if and only if
- S1.
;
- S2.
.
Also, the approximate operator is -convergent to the operator if and only if
- D1.
The sequence is bounded;
- D2.
Lemma 1 and 2 establish that the conditions S1 and D1 ensuring -convergence of the approximate operators and to are satisfied.
Lemma 1. The following estimate holds: Proof. In fact, we have
Hence,
and hence
But
Consequently, the desired result is achieved through above estimation. □
Lemma 2. The following estimate holds: Proof. Analogously to the proof of Lemma 1, we obtain
Consequently,
Thus,
But
Hence, the result follows. □
To prove that the conditions S2 and D2 for the -convergence of the approximate operators and to are satisfied, we need the following results:
Theorem 1. The following estimate holds:for the positive constant . Proof. For all
,
So,
Thus, by (
3), we obtain the desired result. □
Theorem 2. The following estimate holds:for the positive constant . Proof. Similarly to the proof of Theorem 1, we obtain
Consequently, by (
4), we obtain the desired result. □
Corollary 1. The following estimate holds:for the positive constant . Proof. Theorem 1 gives
Consequently, by (
3), we obtain the desired result. □
Corollary 2. The following estimate holds:for the positive constant . Proof. Theorem 2 gives
Consequently, by (
4), we obtain the desired result. □
Corollary 3. The following estimate holds:for the positive constant . Proof. Theorem 1 gives
Consequently, by (
3), we obtain the desired result. □
Corollary 4. The following estimate holds:for the positive constant . Proof. Theorem 2 gives
Consequently, by (
4), we obtain the desired result. □
From the above analysis, we conclude that conditions S2 and D2 governing the -convergence of the approximate operators and to are satisfied. This conclusion is substantiated by the results presented below:
Proof. Since
and since
we obtain the desired result. □
Proof. As both conditions
and
hold, we arrive at the desired result. □
Consequently, we conclude that the sequences and converge to in the -sense.
Proposition 1. For N large enough, the operators and are invertible, and the constantsandare finite. Proof. Since the operators
are invertible and the approximate operators
and
converge to
in
-sense, it follows that the inverse operators
and
exist and are uniformly bounded for
N large enough, (see [
14]). □
The Sinc-collocation method via single exponential transformation leads to the following linear system:
Once this linear system is solved, the approximate solution is given by
Also, the Sinc-collocation method via double exponential transformation leads to the following linear system:
Once this linear system is solved, the approximate solution is given by
3.3. Convergence Analysis
The convergence order of the proposed method is established in the following Theorem.
Theorem 3. The following estimates hold:where is some finite positive constant. Proof. We have
Since
and by using Theorem (1), we obtain the desired result. □
Theorem 4. The following estimates hold:where is some finite positive constant. Proof. As above, we obtain
Since
and by using Theorem (2), we obtain the desired result. □
3.4. System of Two Fredholm Integral Equations
For given real functions
, consider the system of two Fredholm integral Equation (
2). Letting
system (
2) reads as
To simplify the above problem, we can reduce it to a system of two separate equations. To this end, we follow [
15] in letting
So,
Substituting these into (
2), we obtain
By adding Equations (
6) and (7) together, and by subtracting (
6) from (7), we obtain the following equivalent system:
System (
8) can be rewritten in operator form as follows:
Recall that for each
, the compactness of the Fredholm operator
from
X into itself confirms that the solution
of the problem (
8) is unique.
In this section, we consider the approximate operators:
We note that
Let
be the solution of the system
and let
be the solution of the system
We use the same analysis presented in the previous section to prove the existence of the operators , , , and . To this end, we employ the concept of -convergence.
That is to say,
- S1.
;
- S2.
.
Also, the approximate operator is -convergent to the operator ; that is to say,
- D1.
The sequence is bounded;
- D2.
For
N large enough, the operators
and
are invertible, and the constants
and
are finite. That is, the inverse operators
and
exist and are uniformly bounded for
N large enough.
Also, for
N large enough, the operators
and
are invertible, and the constants
and
are finite. That is, the inverse operators
and
exist and are uniformly bounded for
N large enough.
The Sinc-collocation method via single exponential transformation leads to the following linear systems:
and
Once these linear systems are solved, the approximate solutions are given by
Hence
and
Also, the Sinc-collocation method via double exponential transformation leads to the following linear systems:
and
Once these linear systems are solved, the approximate solutions are given by
Hence
and
Here, the convergence analysis of the proposed method for this practical case is presented in the following theorems, using the same approach as in the previous section.
Theorem 5. Assume that . The following estimates hold:where and are some finite positive constants. Theorem 6. Assume that . The following estimates hold:where and are some finite positive constants. 3.5. Appendix: Application to a Fredholm Integro-Differential Equation
To enhance the originality of our method, we examine in this appendix an application to the following Fredholm integro-differential equation:
Define
as follows:
Equation (
9) reads as
or equivalently,
where
and
In this section, we consider the approximate operators:
We note that
Let
be the solution of the equation
and let
be the solution of the equation
To establish the existence of the operators
and
, we rely on the same analytical framework presented in the previous section, employing the notion of
-convergence.
In other words,
- S1.
;
- S2.
.
Also, the approximate operator is -convergent to the operator ; that is to say,
- D1.
The sequence is bounded;
- D2.
For sufficiently large
N, the operator
is invertible, and the constant
is finite. That is, the inverse operator
exists and is uniformly bounded for large
N. Similarly, for sufficiently large
N the operator
is invertible, and the constant is also finite. Hence, the inverse operator
exists and is uniformly bounded for large
N.
The Sinc-collocation method, employing the single exponential transformation, leads to the following linear system:
After solving this system, the approximate solution is constructed as follows:
Similarly, the Sinc-collocation method based on the double exponential transformation yields the following linear system:
Upon solving this linear system, the approximate solution can be expressed as:
The convergence analysis of the proposed method for this practical case is carried out using the same approach as in the previous section.
4. Discussion of Numerical Results
Fredholm systems are not only of theoretical interest but also play a crucial role in various applied sciences. In electromagnetic theory, for example, boundary integral formulations used to analyze wave scattering phenomena often reduce to Fredholm integral equations of the first kind. Likewise, in the study of viscoelastic materials, models incorporating memory effects typically involve integral operators that fit within the Fredholm framework. These real-world occurrences highlight the importance of developing robust analytical and numerical tools for such systems, reinforcing the practical motivation behind the present study.
In this section, numerical comparisons between the SE-Sinc-collocation and DE-Sinc-collocation methods and the two provided methods are presented. The computation was performed on Sony PC (Sony, Tokyo, Japan) with 2.13GHz Intel(R) Core(TM)2 Duo with 4GB memory, running Microsoft Windows 7 version 6.1.7601. The Maple 17 programming language was used to implement the computational programs. We conduct numerical tests to clarify the theoretical results obtained in the previous section.
Letting
We note that
and
represent the rates of convergence obtained in [
3], while
and
represent the rates of convergence achieved by our methods. We compare these rates in the following table for various values of
,
,
d, and
N. The numerical results demonstrate that
is better than
, and
is better than
. Comparison between rates of convergence is given in
Table 1 for
and
.
In
Figure 1, we present convergence plots illustrating the rates reported in
Table 1.
Figure 2 shows a comparison between the numerical solutions
and
and their exact counterparts
and
for
. Convergence plots corresponding to the results in
Table 2 and
Table 3 are displayed in
Figure 3. In
Figure 4, we compare the convergence behavior in Example 1 for the single-exponential and double-exponential approximations.
Figure 5 and
Figure 6 present convergence plots corresponding to the rates reported in
Table 4 and
Table 5, respectively. Finally,
Figure 7 visualizes the convergence behavior of the single and double exponential methods based on the results in
Table 6 and
Table 7.
Example 1. Table 2 and Table 3 displayed the absolute errors as a function of N, respectively. First, let us investigate the system of integral Equation (2), where is such that the precise solution isThe kernel is given byThe method’s rate of convergence is presented in Table 2 and Table 3. The outcomes validated the convergence characteristics that had been previously shown. To compare our current approaches with those published in the literature for solving Fredholm integral equations of the second kind, specifically the methods described in [
4,
16], we note that our approaches are particularly valuable for certain cases of these equations.
Example 2 ([
4])
. In this Example, we consider the following Fredholm integral equation:Let and denote the maximum absolute errors introduced at the respective collocation points as presented in [4]. Meanwhile, and indicate the maximum absolute errors generated by our methods. We compare these rates for various values of ρ, α, d, and N in the following table. The numerical results demonstrate that outperforms , and surpasses . A comparison of the rates of convergence is provided in Table 5 for and . Example 3 ([
16])
. In [16], the author employed the composite Trapezoidal rule to approximate the solution of the Fredholm integral equation of the second kind of the form:with the exact solutionIn this example, we will solve the above model problem that has a smooth exact solution.Table 5 presents the comparison results for Example 4, where we evaluate the errors , , and at selected points s. Specifically, we report the errors between the exact solution and the approximations , , and at the points for . Example 4. Let us investigate the system of two integral Equation (2), where is such that and the exact solution isThe kernel is given byThe numerical results for this example are presented in Table 6 and Table 7. Example 5 ([
17])
. The authors of [17] employed a collocation-based Chebyshev method to approximate the solution of the Fredholm integral equation of the second kind of the form:with the exact solutionThe numerical results for this Example are presented in Table 8.