Next Article in Journal
Adaptive Ensemble Learning for Financial Time-Series Forecasting: A Hypernetwork-Enhanced Reservoir Computing Framework with Multi-Scale Temporal Modeling
Previous Article in Journal
Failure Cause Analysis Under Progressive Type-II Censoring Using Generalized Linear Exponential Competing Risks Model with Medical and Industrial Applications
Previous Article in Special Issue
A Well-Posed Evolutionary Inclusion in Mechanics
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

New Applications and Improvements of Sinc Functions for Solving a System of Fredholm Integral Equations

by
Saeed Althubiti
1,† and
Abdelaziz Mennouni
2,*,†
1
Department of Mathematics and Statistics, College of Science, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia
2
Department of Mathematics, LTM, University of Batna 2, Mostefa Ben Boulaïd, Fesdis, Batna 05078, Algeria
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Axioms 2025, 14(8), 596; https://doi.org/10.3390/axioms14080596
Submission received: 21 June 2025 / Revised: 24 July 2025 / Accepted: 24 July 2025 / Published: 1 August 2025
(This article belongs to the Special Issue Recent Trends in Numerical Methods for Functional Equations)

Abstract

This study introduces two novel methodologies for solving systems of Fredholm integral equations, with particular emphasis on second-kind equations. The first method integrates the Sinc-collocation technique with a newly developed singular exponential transformation, enhancing convergence behavior and numerical stability. A comprehensive convergence analysis is conducted to support this approach. The second method employs a double exponential transformation, leading to a pair of linear equations whose solvability is established using the double projection method. Rigorous theoretical analysis is presented, including convergence theorems and newly derived error bounds. A system of two Fredholm integral equations is treated as a practical case study. Numerical examples are provided to illustrate the effectiveness and accuracy of the proposed methods, substantiating the theoretical results.
MSC:
45A05; 45B05; 45F05; 45L05

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:
u ( x ) a b k x , t u ( t ) d t = g ( x ) , a x b .
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:
x 1 s + q = 1 r a b Ψ 1 q s , η x q η d η = y 1 s , x 2 s + q = 1 r a b Ψ 2 q s , η x q η d η = y 2 s , x r s + q = 1 r a b Ψ r q s , η x q η d η = y r s .
Specifically, we concentrate on the practical analysis of the following system comprising two coupled Fredholm integral equations:
v ( s ) + a b Ψ s , η u ( η ) d η = f ( s ) , < a s b < , u ( s ) + a b Ψ s , η v ( η ) d η = g ( s ) , < a s b < ,
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 u ( . ) and v ( . ) 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 O ( e π d α N ) and O exp π d N log 2 d N α , respectively. In contrast, the methods presented in this study have improved convergence rates of O ( N e 2 π d α N ) and O ( exp 2 π d N log ( 2 d N / α ) ) , 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.

2. Basic Definitions and Preliminaries

For the reader’s convenience, we collect some known results and useful formulas related to the space of continuous functions, compactness, modes of convergence, and Sinc functions, which will be used throughout this work.

2.1. Space of Continuous Functions and Modes of Convergence

The space X : = C a , b , R consists of continuous functions, a well-known and well-behaved class of functions that avoids many of the technical challenges associated with more irregular functions. Since continuous functions defined on a compact interval, such as a , b , are inherently bounded, it follows naturally that the supremum norm
φ : = sup s a , b φ ( s )
is the most appropriate choice for this space. Here, . is the standard Euclidean norm on R .
A linear operator T from the normed space X into itself is called bounded if there exists a positive number α 0 such that
T φ α 0 φ   for   all   φ X ,
and
T : = sup x 1 T x ,
is the norm of T. We will denote by B ( X ) the space of bounded linear operators from X into itself.
We recall that a subset Ω of a normed space X is called compact if every open covering of Ω contains a finite subcovering.
The operator T is compact if it is bounded, and the set T x : x 1 has compact closure in X . That is, T is called compact if it maps each bounded set in X into a relatively compact set in X .
Let T n B ( X ) be a sequence of bounded linear operators on the space X . Let T B ( X ) .
Consider the following two well-established modes of convergence:
The pointwise convergence, expressed as T n p T , is defined as
T n φ T φ 0   for   every   φ X .
The norm convergence, expressed as T n n T , is given by
T n T 0 .
T n n T implies T n p T . The converse fails in general.

2.2. Sinc-Functions

The Sinc-function is defined on the whole real line as follows:
Sinc ( s ) : = sin ( π s ) π s , s 0 , 1 , s = 0 .
The shifted Sinc-function with evenly spaced nodes is defined by
S ( j , h ) ( s ) : = sin ( π ( s j h ) / h ) π ( s j h ) / h , s j h , 1 , s = j h .
To approximate the solution of (2), we consider two types of variable transformation functions, single and double exponential transformation, respectively. The authors of [13] proposed the double exponential transformation that improves the first one.
Let us consider the following single exponential transformation
S e ( s ) = b a 2 tanh s 2 + b + a 2 , s R ,
and its inverse is described as follows:
S e 1 ( t ) = log t a b t , t ( a , b ) .
Moreover, the double exponential transformation is given by
D e ( s ) = b a 2 tanh π 2 sinh ( s ) + b + a 2 , s R ,
also,
D e 1 ( t ) = log 1 π log t a b t + 1 + 1 π log t a b t 2 , t ( a , b ) .
  • Let X N be the space spanned by the first 2 N + 1 of Sinc-functions.
  • Let π N S e and π N D e be interpolatory projection operators defined from X onto X N as follows:
    π N S e φ ( s ) : = φ ( a ) b s b a + j = N N L φ ( t j S e ) S ( j , h ) ( S e 1 ( s ) ) + φ ( b ) s a b a , a s b ,
    and
    π N D e φ ( s ) : = φ ( a ) b s b a + j = N N L φ ( t j D e ) S ( j , h ) ( D e 1 ( s ) ) + φ ( b ) s a b a , a s b ,
    respectively, where
    L φ ( s ) : = φ ( s ) ( b s ) φ ( a ) + ( s a ) φ ( b ) b a .
    Through the paper, assume that sup N π N S e < and sup N π N D e < . The collocation points t j S e and t j D e are defined as follows:
    t j S e = a j = N 1 , S e ( j h ) j = N N , b j = N + 1 ,
    and
    t j D e = a j = N 1 , D e ( j h ) j = N N , b j = N + 1 .
    Following [4], there exist two constants C 1 , C 2 such that
    u π N S e u C 1 N e π d α N , for   some   positive   constants d and α ,
    and
    u π N D e u C 2 exp π d N log 2 d N α .

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:
x 1 s + q = 1 r a b Ψ 1 q s , η x q η d η = y 1 s , x 2 s + q = 1 r a b Ψ 2 q s , η x q η d η = y 2 s , x r s + q = 1 r a b Ψ r q s , η x q η d η = y r s .
Set
T p q x q s = a b Ψ p q s , η x q η d η , p , q = 1 , 2 , , r ,
and
I r = I O O O I O     O O I r × r , T = T 11 T 12 T 1 r T 21 T 22 T 2 r     T r 1 T r 2 T r r r × r .
The system (5) can be represented as an operator equation in the following manner:
x p s + q = 1 r T p q x q s = y p s , 1 p r .
Or equivalently,
I r + T X = Y ,
which is the matrix form, where
X = x 1 x 2 x r and Y = y 1 y 2 y r .

3.2. Development of the Method

In this section, we consider the approximate operators
T N S e : = T π N S e , and T N D e : = T π N D e .
We note that
( T p q , N S e x q ) ( s ) = a b Ψ p q s , η ( π N S e x q ) ( η ) d η , a < s < b , ( T p q , N D e x q ) ( s ) = a b Ψ p q s , η ( π N D e x q ) ( η ) d η , a < s < b .
Let X N S e = x 1 , N S e , x 2 , N S e , x r , N S e T be the solution of the system
x p , N S e s + q = 1 r T p q π N S e x q , N S e s = y p s , 1 p r .
Or equivalently,
I r + T N S e X N S e = Y ,
where
T N S e = T 11 π N S e T 12 π N S e T 1 r π N S e T 21 π N S e T 22 π N S e T 2 r π N S e     T r 1 π N S e T r 2 π N S e T r r π N S e r × r .
Also, let X N D e = x 1 , N D e , x 2 , N D e , x r , N D e T be the solution of the system
x p , N D e s + q = 1 r T p q π N D e x q , N D e s = y p s , 1 p r .
That is to say,
I r + T N D e X N D e = Y ,
with
T N D e = T 11 π N D e T 12 π N D e T 1 r π N D e T 21 π N D e T 22 π N D e T 2 r π N D e     T r 1 π N D e T r 2 π N D e T r r π N D e r × r .
In order to prove the existence of the operators I + T N S e 1 and I + T N D e 1 , we will use the ν -convergence introduced in [14].
We recall that the approximate operator T N S e is ν -convergent to the operator T if and only if
S1. 
T N S e < γ 1 < , for   the   positive   constant γ 1 ;
S2. 
T N S e T T N S e 0 and T N S e T T 0 as N .
Also, the approximate operator T N D e is ν -convergent to the operator T if and only if
D1. 
The sequence T N D e N 1 is bounded;
D2. 
T N D e T T N D e 0 and T N D e T T 0 as N .
Lemma 1 and 2 establish that the conditions S1 and D1 ensuring ν -convergence of the approximate operators T N S e and T N D e to T are satisfied.
Lemma 1.
The following estimate holds:
T N S e b a sup N π N S e B ( X , X ) max 1 p r q = 1 r max a s b a b Ψ p q , s η 2 d η .
Proof. 
In fact, we have
T p q , N S e φ ( s ) = a b Ψ p q s , η ( π N S e φ ) ( η ) d η , for   all φ X a b Ψ p q , s η 2 d η a b ( π N S e φ ) ( η ) 2 d η , a s b b a π N S e B ( X , X ) max a s b a b Ψ p q , s η 2 d η φ .
Hence,
T p q , N S e φ b a sup N π N S e B ( X , X ) max a s b a b Ψ p q , s η 2 d η φ < ,
and hence
T p q , N S e b a sup N π N S e B ( X , X ) max a s b a b Ψ p q , s η 2 d η .
But
T N S e = max 1 p r q = 1 r T p q , N S e .
Consequently, the desired result is achieved through above estimation.    □
Lemma 2.
The following estimate holds:
T N D e b a sup N π N D e B ( X , X ) max 1 p r q = 1 r max a s b a b Ψ p q , s η 2 d η .
Proof. 
Analogously to the proof of Lemma 1, we obtain
T p q , N D e φ ( s ) b a π N D e B ( X , X ) max a s b a b Ψ p q , s η 2 d η φ .
Consequently,
T p q , N D e φ b a sup N π N D e B ( X , X ) max a s b a b Ψ p q , s η 2 d η φ < .
Thus,
T p q , N D e b a sup N π N D e B ( X , X ) max a s b a b Ψ p q , s η 2 d η .
But
T N D e = max 1 p r q = 1 r T p q , N D e .
Hence, the result follows.    □
To prove that the conditions S2 and D2 for the ν -convergence of the approximate operators T N S e and T N D e to T are satisfied, we need the following results:
Theorem 1.
The following estimate holds:
T p q ( I π N S e ) φ α 0 ( b a ) N e 2 π d α N ,
for the positive constant α 0 .
Proof. 
For all φ X ,
T p q ( I π N S e ) φ ( s ) = a b Ψ p q s , η ( ( I π N S e ) φ ) ( η ) d η , a s b = ( I π N S e ) φ , Ψ p q , s = ( I π N S e ) φ , ( I π N S e ) Ψ p q , s a b ( I π N S e ) φ ( η ) 2 d η a b ( I π N S e ) Ψ p q , s ( η ) 2 d η ( I π N S e ) φ 2 ( I π N S e ) Ψ p q , s 2 .
So,
T p q ( I π N S e ) φ ( I π N S e ) φ 2 ( I π N S e ) Ψ p q , s 2 ( b a ) ( I π N S e ) φ ( I π N S e ) Ψ p q , s .
Thus, by (3), we obtain the desired result.    □
Theorem 2.
The following estimate holds:
T p q ( I π N D e ) φ α 1 ( b a ) exp 2 π d N log ( 2 d N / α ) ,
for the positive constant α 1 .
Proof. 
Similarly to the proof of Theorem 1, we obtain
T p q ( I π N D e ) φ ( b a ) ( I π N D e ) φ ( I π N D e ) Ψ p q , s .
Consequently, by (4), we obtain the desired result.    □
Corollary 1.
The following estimate holds:
T p q ( I π N S e ) T p q φ α 2 ( b a ) N e 2 π d α N ,
for the positive constant α 2 .
Proof. 
Theorem 1 gives
T p q ( I π N S e ) T p q φ ( b a ) ( I π N S e ) T p q φ ( I π N S e ) Ψ p q , s .
Consequently, by (3), we obtain the desired result.    □
Corollary 2.
The following estimate holds:
T p q ( I π N D e ) T p q φ α 3 ( b a ) exp 2 π d N log ( 2 d N / α ) ,
for the positive constant α 3 .
Proof. 
Theorem 2 gives
T p q ( I π N D e ) T p q φ ( b a ) ( I π N D e ) T p q φ ( I π N D e ) Ψ p q , s .
Consequently, by (4), we obtain the desired result.    □
Corollary 3.
The following estimate holds:
T p q ( I π N S e ) T p q π N S e φ α 4 ( b a ) N e 2 π d α N ,
for the positive constant α 4 .
Proof. 
Theorem 1 gives
T p q ( I π N S e ) T p q π N S e φ ( b a ) ( I π N S e ) T p q π N S e φ ( I π N S e ) Ψ p q , s .
Consequently, by (3), we obtain the desired result.    □
Corollary 4.
The following estimate holds:
T p q ( I π N D e ) T p q π N D e φ α 5 ( b a ) exp 2 π d N log ( 2 d N / α ) ,
for the positive constant α 5 .
Proof. 
Theorem 2 gives
T p q ( I π N D e ) T p q π N D e φ ( b a ) ( I π N D e ) T p q π N D e φ ( I π N D e ) Ψ p q , s .
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 T N S e and T N D e to T are satisfied. This conclusion is substantiated by the results presented below:
Corollary 5.
We have
T N S e T T N S e 0 ,
and
T N S e T T 0 .
Proof. 
Since
T N S e T T N S e = max 1 p r q = 1 r T p q , N S e T p q T p q , N S e ,
and since
T N S e T T = max 1 p r q = 1 r T p q , N S e T p q T p q ,
we obtain the desired result. □
Corollary 6.
We have
T N D e T T N D e 0 ,
and
T N D e T T 0 .
Proof. 
As both conditions
T N D e T T N D e = max 1 p r q = 1 r T p q , N D e T p q T p q , N D e ,
and
T N D e T T = max 1 p r q = 1 r T p q , N D e T p q T p q ,
hold, we arrive at the desired result. □
Consequently, we conclude that the sequences T N S e and T N D e converge to T in the ν -sense.
Proposition 1.
For N large enough, the operators I r + T N S e and I r + T N D e are invertible, and the constants
β S e : = sup N I r + T N S e 1
and
γ D e : = sup N I r + T N D e 1
are finite.
Proof. 
Since the operators I r + T are invertible and the approximate operators T N S e and T N D e converge to T in ν -sense, it follows that the inverse operators I r + T N S e 1 and I r + T N D e 1 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:
I r + T N S e X N S e ( t i S e ) = Y ( t i S e ) , i = N 1 , , N + 1 .
Once this linear system is solved, the approximate solution is given by
X N S e = Y T π N S e X N S e .
Also, the Sinc-collocation method via double exponential transformation leads to the following linear system:
I r + T N D e X N D e ( t i D e ) = Y ( t i D e ) , i = N 1 , , N + 1 .
Once this linear system is solved, the approximate solution is given by
X N D e = Y T π N D e X N D e .

3.3. Convergence Analysis

The convergence order of the proposed method is established in the following Theorem.
Theorem 3.
The following estimates hold:
X X N S e β 0 ( b a ) N e 2 π d α N ,
where β 0 is some finite positive constant.
Proof. 
We have
X N S e X = ( I r + T N S e ) 1 Y ( I r + T ) 1 Y = ( I r + T N ) 1 ( T T N S e ) X = ( I r + T N ) 1 T ( I r π N S e ) X .
Since
sup N ( I r + T N S e ) 1 < ,
and by using Theorem (1), we obtain the desired result. □
Theorem 4.
The following estimates hold:
X X N D e β 1 ( b a ) exp 2 π d N log ( 2 d N / α ) ,
where β 1 is some finite positive constant.
Proof. 
As above, we obtain
X N D e X = ( I r + T N ) 1 T ( I r π N D e ) X .
Since
sup N ( I r + T N D e ) 1 < ,
and by using Theorem (2), we obtain the desired result. □

3.4. System of Two Fredholm Integral Equations

For given real functions f , g , consider the system of two Fredholm integral Equation (2). Letting
K φ ( s ) : = a b Ψ s , η φ ( η ) d η , a < s < b ,
system (2) reads as
v + K u = f , u + K v = g .
To simplify the above problem, we can reduce it to a system of two separate equations. To this end, we follow [15] in letting
ϑ : = u v , F : = g + f ;
θ : = u + v , G : = g f .
So,
u = θ + ϑ 2 , f = F G 2 ;
v = θ ϑ 2 , g = F + G 2 .
Substituting these into (2), we obtain
θ ϑ ( s ) + a b Ψ s , η θ + ϑ ( η ) d η = F G ( s ) ,
θ + ϑ ( s ) + a b Ψ s , η θ ϑ ( η ) d η = F + G ( s ) .
By adding Equations (6) and (7) together, and by subtracting (6) from (7), we obtain the following equivalent system:
θ ( s ) + a b Ψ s , η θ ( η ) d η = F ( s ) , a s b , ϑ ( s ) a b Ψ s , η ϑ ( η ) d η = G ( s ) , a s b .
System (8) can be rewritten in operator form as follows:
θ + K θ = F , ϑ K ϑ = G ,
Recall that for each f , g X 2 , the compactness of the Fredholm operator K from X into itself confirms that the solution ϑ , θ X 2 of the problem (8) is unique.
In this section, we consider the approximate operators:
K N S e : = K π N S e , and K N D e : = K π N D e .
We note that
( K N S e φ ) ( s ) = a b Ψ s , η ( π N S e φ ) ( η ) d η , a < s < b , ( K N D e φ ) ( s ) = a b Ψ s , η ( π N D e φ ) ( η ) d η , a < s < b ,
Let θ N S e , ϑ N S e be the solution of the system
( I + K N S e ) θ N S e = F , ( I K N S e ) ϑ N S e = G ,
and let θ N D e , ϑ N D e be the solution of the system
( I + K N D e ) θ N D e = F , ( I K N D e ) ϑ N D e = G .
We use the same analysis presented in the previous section to prove the existence of the operators I K N S e 1 , I + K N S e 1 , I K N D e 1 , and I + K N D e 1 . To this end, we employ the concept of ν -convergence.
That is to say,
S1. 
K N S e < γ 1 < , for   the   positive   constant γ 1 ;
S2. 
K N S e K K N S e 0 and K N S e K K 0 as N .
Also, the approximate operator K N D e is ν -convergent to the operator K ; that is to say,
D1. 
The sequence K N D e N 1 is bounded;
D2. 
K N D e K K N D e 0 and K N D e K K 0 as N .
For N large enough, the operators I K N S e and I + K N S e are invertible, and the constants
β S e : = sup N I K N S e 1
and
γ S e : = sup N I + K N S e 1
are finite. That is, the inverse operators ( I K N S e ) 1 and ( I + K N S e ) 1 exist and are uniformly bounded for N large enough.
Also, for N large enough, the operators I K N D e and I + K N D e are invertible, and the constants
β D e : = sup N I K N D e 1
and
γ D e : = sup N I + K N D e 1
are finite. That is, the inverse operators ( I K N D e ) 1 and ( I + K N D e ) 1 exist and are uniformly bounded for N large enough.
The Sinc-collocation method via single exponential transformation leads to the following linear systems:
( I + K N S e ) θ N ( t i S e ) = F ( t i S e ) , i = N 1 , , N + 1
and
( I K N S e ) ϑ N ( t i S e ) = G ( t i S e ) , i = N 1 , , N + 1 .
Once these linear systems are solved, the approximate solutions are given by
θ N S e = F K π N S e θ N S e , ϑ N S e = G + K π N S e ϑ N S e .
Hence
θ N S e ( s ) = θ N ( a ) b s b a + j = N N L Ψ s , t j S e θ ( t j S e ) S ( j , h ) ( S e 1 ( s ) ) + θ N ( b ) s a b a ,
and
ϑ N S e ( s ) = ϑ N ( a ) b s b a + j = N N L Ψ s , t j S e ϑ ( t j S e ) S ( j , h ) ( S e 1 ( s ) ) + ϑ N ( b ) s a b a .
Also, the Sinc-collocation method via double exponential transformation leads to the following linear systems:
( I + K N D e ) θ N ( t i D e ) = F ( t i D e ) , i = N 1 , , N + 1
and
( I K N D e ) ϑ N ( t i D e ) = G ( t i D e ) , i = N 1 , , N + 1 .
Once these linear systems are solved, the approximate solutions are given by
θ N D e = F K π N D e θ N D e ϑ N D e = G + K π N D e ϑ N D e .
Hence
θ N D e ( s ) = θ N ( a ) b s b a + j = N N L Ψ s , t j S e θ ( t j D e ) S ( j , h ) ( D e 1 ( s ) ) + θ N ( b ) s a b a ,
and
ϑ N D e ( s ) = ϑ N ( a ) b s b a + j = N N L Ψ s , t j D e ϑ ( t j D e ) S ( j , h ) ( D e 1 ( s ) ) + ϑ N ( b ) s a b a .
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 F , G X . The following estimates hold:
θ θ N S e β 2 ( b a ) N e 2 π d α N , ϑ ϑ N S e β 3 ( b a ) N e 2 π d α N ,
where β 0 and β 1 are some finite positive constants.
Theorem 6.
Assume that F , G X . The following estimates hold:
θ θ N D e β 4 ( b a ) exp 2 π d N log ( 2 d N / α ) , ϑ ϑ N D e β 5 ( b a ) exp 2 π d N log ( 2 d N / α ) ,
where β 4 and β 5 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:
φ ( m ) ( s ) + a b Ψ ( s , η ) φ ( η ) d η = g ( s ) , a s b , φ ( a ) = a 0 , φ ( a ) = a 1 , , φ ( m 1 ) ( a ) = a m 1 .
Define D m : D X as follows:
D m φ = φ ( m ) .
D = { φ X : φ ( m ) X , φ ( a ) = a 0 , φ ( a ) = a 1 , , φ ( m 1 ) ( a ) = a m 1 } .
Equation (9) reads as
D m φ + K φ = g ,
or equivalently,
φ + V m K φ = g m ,
where
V m φ ( s ) : = D m 1 φ ( s ) = a s a s a s φ ( τ 1 ) d τ 1 d τ m = 1 ( m 1 ) ! a s ( s τ ) m 1 φ ( τ ) d τ ,
and
g m : = V m g j = 0 m 1 a j j ! ( s a ) j .
In this section, we consider the approximate operators:
V N m , S e : = V m K π N S e , and V N m , D e : = V m K π N D e .
We note that
( V N m , S e φ ) ( s ) = 1 ( m 1 ) ! a s ( s τ ) m 1 ( π N S e φ ) ( τ ) d τ , ( V N m , D e φ ) ( s ) = 1 ( m 1 ) ! a s ( s τ ) m 1 ( π N D e φ ) ( τ ) d τ .
Let φ N m , S e be the solution of the equation
( I + V N m , S e ) φ N m , S e = g m ,
and let φ N m , D e be the solution of the equation
( I + V N m , D e ) φ N m , D e = g m .
To establish the existence of the operators I + V N m , S e 1 and I + V N m , D e 1 , we rely on the same analytical framework presented in the previous section, employing the notion of ν -convergence.
In other words,
S1. 
V N m , S e < γ 2 < , for   the   positive   constant γ 2 ;
S2. 
V N m , S e V m K V N m , S e 0 and V N m , S e V m K V m K 0 as N .
Also, the approximate operator V N m , D e is ν -convergent to the operator V m K ; that is to say,
D1. 
The sequence V N m , D e N 1 is bounded;
D2. 
V N m , D e V m K V N m , D e 0 and V N m , D e V m K V m K 0 as N .
For sufficiently large N, the operator I + V N m , S e is invertible, and the constant
γ m , S e : = sup N I + V N m , S e 1
is finite. That is, the inverse operator I + V N m , S e 1 exists and is uniformly bounded for large N. Similarly, for sufficiently large N the operator I + V N m , D e 1 is invertible, and the constant is also finite. Hence, the inverse operator I + V N m , D e 1 exists and is uniformly bounded for large N.
The Sinc-collocation method, employing the single exponential transformation, leads to the following linear system:
( I + V N m , S e ) φ N m , S e ( t i S e ) = g m ( t i S e ) , i = N 1 , , N + 1 ,
After solving this system, the approximate solution is constructed as follows:
φ N m , S e = g m V N m , S e φ N m , S e .
Similarly, the Sinc-collocation method based on the double exponential transformation yields the following linear system:
( I + V N m , D e ) φ N m , D e ( t i D e ) = g m ( t i D e ) , i = N 1 , , N + 1 .
Upon solving this linear system, the approximate solution can be expressed as:
φ N m , D e = g m V N m , D e φ N m , D e .
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
E 1 , N : = O ( N e π d α N ) , E 2 , N : = O ( exp π d N log 2 d N α ) , E 3 , N : = O ( N e 2 π d α N ) , E 4 , N : = O ( exp 2 π d N log ( 2 d N / α ) .
We note that E 1 , N and E 2 , N represent the rates of convergence obtained in [3], while E 3 , N and E 4 , N 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 E 3 , N is better than E 1 , N , and E 4 , N is better than E 2 , N . Comparison between rates of convergence is given in Table 1 for d = 3.14 2 and α = 1 .
In Figure 1, we present convergence plots illustrating the rates reported in Table 1. Figure 2 shows a comparison between the numerical solutions ϑ N S e and θ N S e and their exact counterparts ϑ ( s ) = e 2 s and θ ( s ) = e s for N = 10 . 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 ( f , g ) is such that the precise solution is
u ( s ) = e s + e 2 s 2 , v ( s ) = e s e 2 s 2 .
The kernel is given by
Ψ s , η = s η .
The 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.
u ( s ) + λ a b Ψ s , η u ( η ) d η = f ( s ) , a s b ,
Example 2
([4]). In this Example, we consider the following Fredholm integral equation:
u ( s ) 0 1 3 η 6 s 2 u ( η ) d η = 1 4 s , 0 s 1 ,
Let E N S e and E N D e denote the maximum absolute errors introduced at the respective collocation points as presented in [4]. Meanwhile, E ˜ N S e and E ˜ N D e 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 E ˜ N S e outperforms E N S e , and E ˜ N D e surpasses E N D e . A comparison of the rates of convergence is provided in Table 5 for d = 3.14 2 and α = 1 .
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:
u ( s ) 1 2 0 1 ( s η ) e s η u ( η ) d η = e s 1 2 + 1 2 e ( s 1 ) .
with the exact solution
u ( s ) = e s .
In 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 u ( s ) u N ( s ) , u ( s ) u N S e ( s ) , and u ( s ) u N D e ( s ) at selected points s. Specifically, we report the errors between the exact solution u ( s ) and the approximations u N ( s ) , u N S e ( s ) , and u N D e ( s ) at the points s = 0 , 0.25 , 0.5 , 0.75 , a n d 1 for n = 5 .
Example 4.
Let us investigate the system of two integral Equation (2), where ( f , g ) is such that [ a , b ] = [ 0 , π 3 ] and the exact solution is
u ( s ) = s , v ( s ) = 2 s .
The kernel is given by
Ψ s , η = ( s η 2 ) ( 4 / 5 ) .
The 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:
φ s 1 1 e 2 s 5 3 η φ η d η = e 2 s 1 3 e 1 3 + 3 e 1 3 ,
with the exact solution
φ ( s ) = e 2 s .
The numerical results for this Example are presented in Table 8.

5. Conclusions

This study analyzes the convergence of Sinc-collocation methods, which utilize a double projection scheme with a novel process, to approximate solutions for a system of second-kind Fredholm integral equations. We assess the convergence of the Sinc-collocation method through a single exponential transformation. Additionally, our analysis includes a demonstration of the convergence of the Sinc-collocation method using a double exponential transformation. A system of linear equations is considered, and we present solutions based on a twofold projection scheme. This study features a comprehensive convergence analysis and discusses relevant theorems, along with the provision of additional error bounds. Numerical examples are included to illustrate the theoretical results and to demonstrate the effectiveness of our methods. We can extend this work to integral equations with nonsmooth exact solutions; Volterra integro-differential equations; and the nonlinear case.

Author Contributions

Conceptualization, S.A. and A.M.; Methodology, S.A. and A.M.; Software, S.A. and A.M.; Validation, S.A. and A.M.; Formal analysis, S.A. and A.M.; Investigation, S.A. and A.M.; Resources, S.A. and A.M.; Data curation, S.A. and A.M.; Writing—original draft, S.A. and A.M.; Writing—review & editing, S.A. and A.M.; Visualization, S.A. and A.M.; Supervision, S.A. and A.M.; Project administration, S.A. and A.M.; Funding acquisition, S.A. and A.M. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Acknowledgments

The authors would like to acknowledge Deanship of Graduate Studies and Scientific Research, Taif University for funding this work.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Zarebnia, M. Sinc-numerical solution for the Volterra integro-differential equation. Commun. Nonlinear Sci. Numer. Simul. 2010, 15, 700–706. [Google Scholar] [CrossRef]
  2. Stenger, F. Summary of Sinc-numerical methods. J. Comput. Appl. Math. 2000, 121, 379–420. [Google Scholar] [CrossRef]
  3. Rashidinia, J.; Zarebnia, M. Numerical solution of linear integral equations by using Sinc-collocation method. Appl. Math. Comput. 2005, 168, 806–822. [Google Scholar] [CrossRef]
  4. Okayama, T.; Matsuo, T.; Sugihara, M. Improvement of a Sinc-collocation method for Fredholm integral equations of the second kind. BIT Numer. Math. 2011, 51, 339–366. [Google Scholar] [CrossRef]
  5. Masatake, M. Discovery of the Double Exponential Transformation and Its Developments. Publ. Res. Inst. Math. Sci. 2005, 41, 897–935. [Google Scholar] [CrossRef]
  6. Muhammad, M.; Nurmuhammad, A.; Mori, M.; Sugihara, M. Numerical solution of integral equations by means of the sinc collocation method based on the double exponential transformation. J. Comput. Appl. Math. 2005, 177, 269–286. [Google Scholar] [CrossRef]
  7. Qiu, W.; Xu, D.; Guo, J. Numerical solution of the fourth-order partial integro-differential equation with multi-term kernels by the Sinc-collocation method based on the double exponential transformation. Appl. Math. Comput. 2021, 392, 125693. [Google Scholar] [CrossRef]
  8. Qiu, W.; Xu, D.; Guo, J. The Crank-Nicolson-type Sinc-Galerkin method for the fourth-order partial integro-differential equation with a weakly singular kernel. Appl. Numer. Math. 2021, 159, 239–258. [Google Scholar] [CrossRef]
  9. Lund, J.; Bowers, K.L. Sinc-Methods for Quadrature and Differential Equations; SIAM: Philadelphia, PA, USA, 1992. [Google Scholar]
  10. Maleknejad, K.; Nedaiasl, K. Application of Sinc-collocation method for solving a class of nonlinear Fredholm integral equations. Comput. Math. Appl. 2011, 62, 3292–3303. [Google Scholar] [CrossRef]
  11. De Bonis, M.C.; Laurita, C. Numerical treatment of second kind Fredholm integral equations systems on bounded intervals. J. Comput. Appl. Math. 2008, 217, 64–87. [Google Scholar] [CrossRef]
  12. Chakraborty, S.; Kant, K.; Nelakanti, G. Approximation methods for system of linear Fredholm integral equations of second kind. Appl. Math. Comput. 2021, 403, 126173. [Google Scholar] [CrossRef]
  13. Muhammad, M.; Mori, M. Double exponential formulas for numerical indefinite integration. J. Comput. Appl. Math. 2003, 161, 431–448. [Google Scholar] [CrossRef]
  14. Ahues, M.; Largillier, A.; Limaye, B.V. Spectral Computations for Bounded Operators; Chapman and Hall/CRC: New York, NY, USA, 2011. [Google Scholar]
  15. Mennouni, A. A new efficient strategy for solving the system of Cauchy integral equations via two projection methods. Transylv. J. Math. Mech. 2022, 14, 63–71. [Google Scholar]
  16. Kress, R. Numerical Analysis; Springer: Berlin/Heidelberg, Germany, 1998. [Google Scholar]
  17. Danaei, R.; Molaei, H.; Khazili, M. Solving Fredholm integral equations using with Chebyshev polynomials. Int. J. Innovative Sci. Eng. Technol. 2015, 2, 297–300. [Google Scholar]
Figure 1. Convergence plots illustrating the rates of convergence presented in Table 1 [3].
Figure 1. Convergence plots illustrating the rates of convergence presented in Table 1 [3].
Axioms 14 00596 g001
Figure 2. Comparison of ϑ N S e with ϑ ( s ) = e 2 s (left) and θ N S e with θ ( s ) = e s (right), for N = 10 .
Figure 2. Comparison of ϑ N S e with ϑ ( s ) = e 2 s (left) and θ N S e with θ ( s ) = e s (right), for N = 10 .
Axioms 14 00596 g002
Figure 3. Convergence plots corresponding to Table 2 (left) and Table 3 (right).
Figure 3. Convergence plots corresponding to Table 2 (left) and Table 3 (right).
Axioms 14 00596 g003
Figure 4. Comparison of the convergence behavior in Example 1 for the single-exponential (left) and double-exponential (right) approximations.
Figure 4. Comparison of the convergence behavior in Example 1 for the single-exponential (left) and double-exponential (right) approximations.
Axioms 14 00596 g004
Figure 5. Convergence plots’ corresponding comparison between rates of convergence presented in Table 4 [4].
Figure 5. Convergence plots’ corresponding comparison between rates of convergence presented in Table 4 [4].
Axioms 14 00596 g005
Figure 6. Convergence plots’ corresponding comparison between rates of convergence presented in Table 5.
Figure 6. Convergence plots’ corresponding comparison between rates of convergence presented in Table 5.
Axioms 14 00596 g006
Figure 7. Convergence plots corresponding to the single and double exponential results presented in Table 6 and Table 7.
Figure 7. Convergence plots corresponding to the single and double exponential results presented in Table 6 and Table 7.
Axioms 14 00596 g007
Table 1. Comparison between rates of convergence.
Table 1. Comparison between rates of convergence.
N E 1 , N E 3 , N E 2 , N E 4 , N
51.55871 × 10−22.42956 × 10−41.28975 × 10−41.66343 × 10−8
102.81803 × 10−31.55871 × 10−66.10004 × 10−73.72142 × 10−13
157.12040 × 10−45.07003 × 10−74.56248 × 10−92.081201 × 10−17
202.17310 × 10−44.72286 × 10−84.48499 × 10−112.01151 × 10−21
257.52300 × 10−55.65952 × 10−95.32390 × 10−132.83411 × 10−25
302.85572 × 10−58.15433 × 10−107.28106 × 10−155.30191 × 10−29
Table 2. Improved single exponential approximation for Example 1.
Table 2. Improved single exponential approximation for Example 1.
N ϑ ϑ N S e θ θ N S e
59.365 × 10−48.759 × 10−4
105.365 × 10−67.254 × 10−6
157.265 × 10−75.687 × 10−7
205.982 × 10−84.325 × 10−8
Table 3. Improved double exponential approximation for Example 1.
Table 3. Improved double exponential approximation for Example 1.
N ϑ ϑ N D e θ θ N D e
58.365 × 10−89.789 × 10−8
104.125 × 10−134.265 × 10−13
156.351 × 10−176.354 × 10−17
208.298 × 10−216.187 × 10−21
Table 4. Comparison results for Example 2.
Table 4. Comparison results for Example 2.
N E N S e E N D e E ˜ N S e E ˜ N D e
56.21548 × 10−41.37362 × 10−32.38777 × 10−49.89875 × 10−7
105.07910 × 10−64.92750 × 10−71.92754 × 10−78.62578 × 10−12
151.06313 × 10−71.59098 × 10−106.38425 × 10−86.25487 × 10−15
203.77483 × 10−95.55627 × 10−147.62548 × 10−106.32565 × 10−20
251.90739 × 10−101.72236 × 10−165.75261 × 10−114.25142 × 10−24
301.24724 × 10−111.77636 × 10−166.23687 × 10−125.32154 × 10−28
Table 5. Comparison results for Example 3.
Table 5. Comparison results for Example 3.
s u ( s ) u N ( s ) u ( s ) u N S e ( s ) u ( s ) u N D e ( s )
0.001.788 × 10−32.125 × 10−46.859 × 10−7
0.252.224 × 10−33.254 × 10−45.476 × 10−7
0.502.711 × 10−31.847 × 10−47.162 × 10−7
0.753.261 × 10−34.298 × 10−46.354 × 10−7
1.003.882 × 10−31.651 × 10−46.235 × 10−7
Table 6. Improved single exponential results for Example 4.
Table 6. Improved single exponential results for Example 4.
s ϑ ( s ) ϑ N S e ( s ) θ ( s ) θ N S e ( s )
000
0.256.72663 × 10−68.62145 × 10−6
0.58.40647 × 10−69.16232 × 10−6
0.753.00578 × 10−65.36214 × 10−6
Table 7. Improved double exponential results for Example 4.
Table 7. Improved double exponential results for Example 4.
s ϑ ( s ) ϑ N S e ( s ) θ ( s ) θ N S e ( s )
000
0.258.26541 × 10−114.26514 × 10−11
0.57.62547 × 10−117.26547 × 10−11
0.752.32564 × 10−115.62545 × 10−11
Table 8. Comparison results for Example 5.
Table 8. Comparison results for Example 5.
s φ ( s ) φ N ( s ) φ ( s ) φ N S e ( s ) φ ( s ) φ N D e ( s )
0.01.0000 × 10−53.546 × 10−79.612 × 10−9
0.25.0000 × 10−67.241 × 10−77.143 × 10−9
0.41.0000 × 10−64.292 × 10−75.214 × 10−9
0.61.0000 × 10−62.137 × 10−71.714 × 10−9
0.81.0000 × 10−63.825 × 10−76.251 × 10−9
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.

Share and Cite

MDPI and ACS Style

Althubiti, S.; Mennouni, A. New Applications and Improvements of Sinc Functions for Solving a System of Fredholm Integral Equations. Axioms 2025, 14, 596. https://doi.org/10.3390/axioms14080596

AMA Style

Althubiti S, Mennouni A. New Applications and Improvements of Sinc Functions for Solving a System of Fredholm Integral Equations. Axioms. 2025; 14(8):596. https://doi.org/10.3390/axioms14080596

Chicago/Turabian Style

Althubiti, Saeed, and Abdelaziz Mennouni. 2025. "New Applications and Improvements of Sinc Functions for Solving a System of Fredholm Integral Equations" Axioms 14, no. 8: 596. https://doi.org/10.3390/axioms14080596

APA Style

Althubiti, S., & Mennouni, A. (2025). New Applications and Improvements of Sinc Functions for Solving a System of Fredholm Integral Equations. Axioms, 14(8), 596. https://doi.org/10.3390/axioms14080596

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop