Abstract
A new numerical method for solving Volterra linear convolution integral equations (CVIEs) of the second kind is presented in this work. This new approach uses first-order infinite impulse response digital filters method (IIRFM). Three convolutive kernels were analyzed, the unit kernel and two singular kernels: the logarithmic and generalized Abel kernels. The IIRFM is based on the combined use of the Laplace transformation, a first-order decomposition, and a bilinear transformation. This approach often leads to simple analytical expressions of the approximate solutions, enabling efficient numerical calculation, even using single-precision floating-point numbers. When compared with the method of homotopic perturbations with Laplace transformation (HPM-L), the IIRFM approach does not present, in linear cases, the convergence difficulties inherent to iterative approaches. Unlike most solution methods based on the Laplace transform, the IIRFM has the dual advantage of not requiring the calculation of the Laplace transform of the source function, and of not requiring the systematic calculation of inverse Laplace transforms.
Keywords:
linear Volterra integral equations; unit, logarithmic, and generalized Abel kernels; infinite impulse response filters (IIR); homotopic perturbation method (HPM) MSC:
45D02
1. Introduction
In the present work, a new method is presented for the numerical solution of the convolutive Volterra integral equations (CVIEs) of the second kind, written in the following form:
where is the kernel of the integral equation; is a source function assumed to be continuous; are parameters; is a non-linear operator of the desired solution . These integral equations are used in a wide variety of scientific areas, such as point mechanics (Abel’s problem), fluid mechanics (water waves scattering, [1]), electrochemistry (voltammetry, [2]), as well as heat transfer (see Section 4).
The linear situation, which is the only one studied in this first paper, corresponds to , in which case we find Volterra’s linear integral equations of the second type, defined, for and [3], by:
The present paper studies a particularly important class of Volterra integral equations of the second type, which involves convolutional kernels, depending only upon the difference , and written in the general form . Three kinds of convolution kernels are studied in the present work: the unit kernel ; generalized Abel’s kernel with and logarithmic kernel . The last two convolution kernels share the property of being singular at .
Note that using the generalized Abel kernel in Volterra’s integral Equation (2) leads to the generalized Abel integral equation of the second kind, as follows:
A general analytical solution exists in closed form for Abel’s integral equation, involving the calculation (explicit or numerical) of an integral and a series of functions (see [4] (p. 142)):
where is the Euler gamma function. Result (4) will provide analytical reference solutions for some of the numerical results that will be calculated in this work.
Several approaches based on the Laplace transformation have already been proposed to solve analytically or numerically Volterra (CVIE) or Abel (CAIE) second-kind linear convolution integral equations. In [5,6], the Homotopic Perturbation Method (HPM) and the Laplace transformation were used to numerically determine the solution of various convolution Abel integral equations of the second kind. In [7], systems of coupled convolutive Abel integral equations have been solved numerically using the homotopic analysis method (HAM) introduced by Lio [8,9], coupled with the Laplace transformation. In [10], Bairwa et al. used the q-homotopic analysis and Laplace transformation method (q-HATM) to numerically solve various CAIEs.
All these approaches generally assume that there is an analytical expression for the source function . There are, however, situations where it is not possible to obtain this expression; for example, when is a noisy signal or the result of an experimental measurement. In such cases, the IIR filters method presented here can be very useful for determining the numerical solution of the linear convolution Volterra equations.
The main objective of the present study is therefore to apply the first-order infinite impulse response filters method (IIRFM) proposed by Heyd et al. [11,12] to numerically solve linear Volterra convolutive integral equations of the second kind. The use of infinite impulse response (IIR) digital filters is usually limited to linear time-invariant systems (LTISs), whose dynamics are described by linear ordinary differential equations with constant coefficients, or equivalently by Laplace transfer functions expressed as polynomial fractions. The results presented in this paper make it possible, for the first time, to extend the field of application of IIR filters to linear systems described by Volterra convolutive integral equations of the second kind, which are involved in a wide range of scientific fields, including heat transfer, for example.
This new approach has the great advantage of being non-iterative, which means it has none of the convergence problems inherent in iterative methods. In addition, for some Volterra integral equations, the IIRFM can lead to an analytical expression of the approximate numerical solution, making the calculation very efficient compared with iterative numerical methods.
The results obtained with the IIRFM are compared in this paper with those provided by other numerical approaches, including the homotopic perturbation method with Laplace transformation (HPM-L), the Daubechies wavelet method of Mouley et al. [13], and the polynomial approximation method of Singha et al. [14].
Several new results have been obtained in this work using the IIRFM, such as a very efficient numerical calculation of the function when (see Section 3.2.1) and this even using single-precision floating-point numbers. This new approach to calculating the function could be very usefully incorporated into the free codes currently available, Python, Julia, Octave, and Scilab.
The remainder of this paper is organized as follows. The foundations of the IIRFM and HPM-L methods are outlined in Section 2. The mechanism of the IIRFM is illustrated in Section 3 by numerically solving various linear CVIEs of the second kind. The results obtained by the IIRFM are also compared with those provided by different numerical approaches. Finally, two examples of linear CVIEs used in heat transfers are solved in Section 4 using the IIRFM method.
2. IIRFM and HPM-L Numerical Methods
The two numerical approaches used in this work to solve the integral Equation (2) are outlined in this paragraph, and the main steps involved in their implementation are recalled or introduced here.
2.1. First-Order IIR Filters Method (IIRFM)
The IIRFM consists of numerically solving Equation (2) in discrete time, using sufficiently precise recurrence relations, which are deduced from successive applications of the Laplace transformation, a first-order partial fractions decomposition and of a bilinear transformation.
This method is particularly well suited to solving convolutional linear integral equations (CVIEs), but also ordinary differential equations (ODEs), integro-differential equations (IDEs), and parabolic partial differential equations (PDEs). Each of these differential or integral problems is assumed to be linear and to have constant coefficients.
2.1.1. Principle of the IIRFM Method
The IIRFM consists schematically of replacing each of the differential or integral problems mentioned above, by a set of M independent, first-order, exact, or approximate ordinary differential problems.
Let be a differential (or integral), linear and invariant problem of the previously mentioned kinds. Let be the excitation (or source function) and the response (or solution) of the problem to the excitation , for a set of constant coefficients (see Figure 1).
Figure 1.
Differential or integral, linear, and invariant problems. (a) Schematic representation in direct space. (b) Schematic representation in Laplace space.
Let us symbolically denote the equation that governs the dynamics of in direct space (see Figure 1a). To simplify the presentation, we assume at this stage that the initial condition on is null: . Since the functional relationship is linear and has constant coefficients, the Laplace transformation can be applied to it. This gives the algebraic relationship , which governs the dynamics of in the Laplace space, where is the Laplace transfer function of the system (see Figure 1b), with and .
To transform the equation into M independent, linear, first-order ODEs with constant coefficients, the function , with as a constant, is first approximated by a rational fraction of the following form:
where is a set of constant real coefficients, determined by interpolation (by least squares or Chebyshev for example) or approximation (of Padé for example) of the function. Note that the value of the constant depends on the problem under consideration. In the case of linear convolutional Volterra integral equations of the second kind (CVIE), which will be examined in detail later in this work, the value is chosen.
The rational fraction is then decomposed, by partial fractions decomposition, in the usual form, as follows:
where and , , , , , , are real constants. Note that it is assumed here that the multiplicity of each pole is unity. This property is usually guaranteed by the fact that the poles are approximated and are calculated numerically here. Finally, each second-order transfer function is decomposed into single complex elements, in the following form:
where and are the complex conjugate roots (with ) of the polynomial equation . The real constants and are and , respectively. The previous results can be combined by writing as a combination of M first-order transfer functions with complex coefficients, as follows:
where . Finally, the exact transfer function of the system is replaced by a transfer function written in the following form:
This is a founding result of the IIRFM. Note that in certain situations, the transfer function may coincide with the exact transfer function (see for example Section 3.1).
Using result (9), the approximate solution can be expressed in the Laplace space as
which can also be written as , with
which are the approximate partial solutions of the problem in the Laplace space.
The approximate solution of the problem in the direct space remains to be determined. Several approaches are possible (without being exhaustive):
- It is possible to consider that each first-order partial transfer function corresponds to the Laplace transform of a first-order linear ODE with constant coefficients and zero initial condition, for :where . The partial solutions are obtained by applying the method of variation of constants, givingDepending on the expression of , the M convolutional integrals figuring in (13) will be calculated analytically or numerically.
- Noting that , the result (13) can be found directly by applying the convolution theorem.
- Finally, it is also possible to transform ordinary differential Equation (12) into partial recurrence relations by applying a bilinear transformation [12] to each partial transfer function . It follows that the partial solution verifies the following recurrence relation for , , and :where is the calculation step.
This latter approach will be discussed in detail in the remainder of this paper, which focuses on the numerical solution of linear convolutional Volterra integral equations of the second type (CVIE), for which it is recalled that .
2.1.2. Application of the IIRFM to the Case of Second-Kind CVIEs
The different steps of the IIRFM are schematically as follows:
- Step 1.
- The Laplace transformation () is applied to Equation (1):with and . Using the convolution theorem, the Laplace transform of the previous integral can be written as follows:where and , of which the analytical expression is usually unknown.This gives the following expression for :Let us write and . Three of the following situations are possible:
- (a)
- and : this is the linear situation, for which the Volterra problem of the second kind can be described as a linear dynamics system with Laplace transfer function .With the exception of the special case of the unit kernel , note that the transfer function does not have the usual form of a quotient of polynomials in s, as it is usually the case for LTIS. Several examples of linear situations are presented in Section 3.
- (b)
- and : the result is a purely non-linear situation. To solve the problem numerically, the expression of the Laplace transform must be specified. Various approaches can be considered for this purpose, such as the Adomian polynomials method [15,16].
- (c)
- and : this is a hybrid situation, in which the IIRFM numerical solution uses both the Laplace transfer function and the Adomian polynomials approach.We now explain the next steps of the IIRFM, but only in the case of the linear situation ( and ).
- Step 2.
- To solve the linear Volterra problem using the transfer function , it is first rewritten as a linear combination of first-order transfer functions (first-order partial fractions decomposition, noted FOD):with . This particular expression (other expressions are possible) of the transfer function is the founding point of the IIRFM applied to second-kind CVIEs. By introducing partial transfer functions , we can rewrite Equation (18) as with . With these notations, can still be written as:Depending on the convolution kernel considered, Equation (18) can be an exact form (see Section 3.1) or an approximation of (see Section 3.2, Section 3.3 and Section 4). In the latter case, coefficients and are determined by rational interpolation of the function . We will come back to this point later.The choice of (18) ensures that the approximate form tends to be 1 for , as does the exact form for the convolution kernels considered in this study, unit, generalized Abel, and logarithmic. This also reduces the interpolation interval to a set of s values close to 0, as will be shown later.The solution obtained by the IIRFM is now denoted by .
- Step 3.
- A bilinear transformation ([12]) is applied to the transfer function , where is a uniform time step (or sampling period) and z is the complex number introduced in the definition of the z-transform (noted here ) of a discrete-time signal : , with . After a few algebraic manipulations, we obtain the following z transfer function:with , , , and .The z-transform obtained by the IIRFM satisfies the following relations:where is the z-transform of the source function . The solution can be further decomposed into a sum of partial solutions, as follows: with .
- Step 4.
- The solution is calculated in the discrete time space using recurrence relations deduced from transfer function (20). In order not to unnecessarily complicate the theoretical developments in this paragraph, it is assumed here that the function is zero at the initial instant, which also imposes a zero initial condition for the solution: . The case of a non-zero initial condition will be considered later in this work (see Section “Exponential Source Term ”). The discrete-time solution at time is denoted by .Using time-shifting properties and linearity of the z-transform, the following partial recurrence relations are obtained:Note that the second recurrence relation of (22) leads to the following explicit expression for the partial solution :This is a particularly important result of this study. Depending on the expression of the source term , the expression of Equation (23) can be further simplified, as will be seen with some of the examples to be studied in Section 3.The complete solution provided at time by the IIRFM is therefore of the following general form:In the most general case, the calculation of involves two sums, with a total of terms. As a result, calculation times can become significant as k increases. However, these calculation times can be significantly reduced when an explicit expression of exists. In this case, the numerical solution can be written asand then the calculation only involves a single sum of M terms, which significantly reduces computation times.
Equations (24) and (25) are the key results of the IIRFM applied to the numerical solution of linear CVIEs of the second kind. In contrast to the method of homotopic perturbations with Laplace transformation (HPM-L), which will be presented in the following paragraph, it is not necessary with the IIRFM to calculate the Laplace transform of the source function in order to numerically solve the problem under consideration. This is a considerable advantage of the IIRFM, as there are situations where the calculation of is not possible. This is the case, for example, if includes a random component (like noise) or is the result of experimental measurements.
The block diagram shown in Figure 2 summarizes the main steps of the IIRFM as applied to the numerical solution of linear CVIEs of the second kind.
Figure 2.
Main steps of the IIRFM, as applied to the numerical solution of linear CVIEs ( and ) of the second kind, with LT: Laplace transform; FOD: first-order partial fractions decomposition; BLT: bilinear transformation; IIRFM: final result of the IIRFM method.
2.2. Homotopic Peturbation Method with Laplace Transform (HPM-L)
In what follows, some of the results obtained by the IIRFM will be compared, among others, with the results provided by the homotopic perturbation method with Laplace transformation (HPM-L), an approach that also relies on an initial application of the Laplace transformation to Equation (2). We therefore recall the main results that define this method in the linear case only ( and ).
The homotopic perturbation method (HPM) was introduced by He [17,18,19] to solve ordinary differential equations (ODEs) or partial differential equations (PDEs), whether linear or non-linear. This method can also be applied to the case of linear CVIEs of type (2) and to ordinary integro-differential equations. In the present case, the HPM approach consists first of constructing a homotopy associated with Equation (2), where is an embedded parameter and v is an approximate solution to Equation (2). The homotopy is constructed in such a way that at the limit where , the solution v of the homotopic equation converges to the solution u of the problem under consideration. The method of homotopic perturbations with Laplace transform (HPM-L) used in this work consists of using the Laplace integral transformation in the homotopy construction process. It is possible to construct directly from the Laplace transform of a differential Equation [20], which is generally well suited to the case of non-steady PDEs. In the case of EDOs and CVIEs, it is generally preferable to rewrite the equations using the direct and inverse Laplace transformations [21,22]:
By noting , the Laplace transform of (2) can be written in the following form:
It remains to apply the inverse Laplace transformation to algebraic Equation (27), which leads to the following statement for :
Finally, from (28) the following homotopy can be constructed:
which verifies the following relations:
The second equation in (30) shows that the solution to the homotopic equation is indeed the solution to the initial problem (2). To solve this homotopic equation, the perturbation method is generally used, which consists of writing the solution of (29) as a series expansion of the embedded parameter p, as follows:
Assuming that series (31) is convergent, we then have the following result:
Two situations can be encountered:
- converges to a closed form, in which case the homotopic perturbation method leads to an analytic solution of Equation (2);
- There is no known closed form of , in which case the series is generally truncated at the first terms and the solution of the problem is written in the following approximate form:
It is the last situation that is of particular interest in the present work, because even if series (32) is convergent, the value of the parameter can considerably influence the speed of convergence of . Situations may therefore arise where the number of terms to be considered may become numerically prohibitive, making the HPM-L method imprecise, inoperative, or very difficult to implement.
The functions are obtained by incorporating Equation (31) into the homotopic equation . Using the linearity of the Laplace transformation, the following recurrence relation of the given problem is obtained as follows:
By identifying the different powers of p, we deduce the equations verified by the following functions:
In the following section, the IIRFM and HPM-L methods are used to numerically solve various linear CVIEs of the second kind.
3. Linear Convolutive Volterra Integral Equations of the Second Kind
Several linear examples ( and ) that allow one to compare the relative accuracies and efficiencies of the HPM-L and IIRFM numerical methods (see Section 3.1) are presented in this paragraph. The IIRFM is also compared with other recent numerical approaches (see Section 3.2.3 and Section 3.2.4).
3.1. Unit Kernel
To obtain an analytical solution of the linear Volterra integral equation with unit kernel , we derive Equation (3) with respect to t, and then integrate the resulting ordinary equation using the variation of constants method. After integration by parts, we obtain the following expression for the solution :
This equation is of the form of Equation (4), with .
3.1.1. Monomial Source Term
We first consider a monomial source term , which leads to a relatively simple analytical expression for the solution, denoted here by :
where is the incomplete gamma function and . For and , Equation (37) admits the following Maclaurin series expansion:
Note that in the special case where , the analytical solution is given by the following expression, deduced from (37):
whose limit for tends to when .
Numerical Solution by the IIRFM
The application of the IIRFM presented in Section 2.1, leads in the present case to the following relations, with and :
For the case , one finds , in which case it is possible to analytically invert the Laplace transform (40), giving back the analytical result (37).
Rather than an analytical solution, we are looking here for a numerical solution, designated by , deduced from relation (40). To this end, the bilinear transformation is applied to the Laplace transfer function , without having to calculate the Laplace transform of the source function . The application of the bilinear transformation leads to the following z-transfer function:
Using time-shifting properties and linearity of the z-transform, we obtain the recurrence relation satisfied by the solution at the following discrete time :
where and is the sample period, satisfying .
In the specific case considered in this paragraph, can be assimilated to . It is then possible to derive an approximate explicit expression of , which will be denoted by
where ; is the polylogarithm function and is the Lerch transcendent function. These two functions are analytically extended for .
Exact Solution by Homotopic Perturbation Method with Laplace Transformation (HPM-L)
The application of the HPM-L method presented in Section 2.2 leads in the present case to the following relationships, deduced from results (35) and from the Laplace transform :
The solution obtained by the HPM-L method is therefore written here, according to relation (32)
Since , we find analytical result (37).
Approximate Numerical Solutions for
The approximate numerical solutions obtained by the HPM-L and IIRFM methods, respectively, are now compared in the case where .
The HPM-L approximate numerical solution is obtained by truncating (44) at rank . Table 1 shows the absolute errors obtained when , between the analytical value and the approximation , for different values of , when the parameter takes the values and .
Table 1.
Influence of parameter on absolute error committed at with the HPM-L method, when , and for different values of . Numbers in parentheses indicate multiplying powers of ten.
For , and , the results gathered in Table 1 show that the absolute error is less than 0.01 for the respective truncation orders , and 32. These results (as well as all the other results gathered in Table 1) show the influence of the value of on the speed of convergence of the HPM-L method. In particular, the larger the value of , the slower the convergence of the HPM-L method here. Figure 3a,b shows the evolution of the approximate solution as a function of t, for and, respectively, for and , for different values of . The numerical results (dashed curves) provided by the HPM-L method are compared with the analytical solutions (solid curves) and . These figures clearly show that the number of terms, required to obtain an approximate solution converging to the analytical solution , increases with the value of . From a numerical point of view, this can be a definite handicap for the HPM-L approach, especially when there is no closed form of the solution.
Figure 3.
Dashed lines show the evolution of as a function of t for , different values of , and different values of : (a) and ; (b) and .
We are now looking for the numerical solution at , using the IIRFM. In the case of a unit kernel and for , result (43) takes on the following expression, valid whatever the sign of :
This is a particularly simple expression, whose accuracy depends, for a given value of , on the choice of the value of . Note that when , which is consistent with the exact result of (39). Table 2 gathers the absolute errors obtained when , between the analytical value and the approximate result , for different values of , when takes the values , and .
Table 2.
Influence of on absolute error at using IIRFM, when , and different values of . Numbers in parentheses indicate multiplying powers of ten.
The analysis of the results gathered in Table 2 shows that the IIRFM leads to highly accurate results for negative values of , even for sampling periods as large as . This is a very interesting result. As Equation (45) is simpler than Equation (39), which includes the incomplete gamma special function, it is also easier to implement numerically, and poses no particular convergence problems.
Figure 4 shows the variations of relative errors as a function of t, where (NM) stands for “numerical method”, with NM≡HPM-L or IIRFM. The value of is negative here and equals . The calculation step is the same for both numerical approaches and is equal to . For , we can clearly see from Figure 4 that the IIRFM performs significantly better than the HPM-L method as t deviates from zero.
Figure 4.
Relative errors as a function of t, when , , and : (a) with and ; (b) with .
Since has the same form as the Maclaurin series expansion (38), the approximate solution provided by the HPM-L method is very accurate in the vicinity of , as shown in Figure 4a, even for small values of . In contrast, as soon as t deviates from the origin, the number of terms required to obtain a precise numerical value must increase accordingly, which can prove to be a problem from the point of view of numerical calculation (particularly in terms of calculation time). The numerical behavior of the IIRFM is very different from that of the HPM-L method. Indeed, as shown in Figure 4b, the accuracy of (45) increases with when .
Figure 5 shows the variations in the relative errors and as a function of t, when the parameter is positive and equal to , with all other quantities having the same values as those used for Figure 4. Even though the accuracy of the IIRFM decreases this time as deviates from the origin, it remains more accurate than the HPM-L method.
Figure 5.
Relative errors as a function of t, when , , and : (a) with and ; (b) with .
The order of accuracy n of the IIRFM approximation can be evaluated by computing the absolute value of the difference , as a function of the sampling period . Using the expressions (39) and (45), we obtain
Figure 6 shows the evolution of as a function of , when and . It can be seen from Figure 6 that the IIRFM approach is a second-order accuracy method in the present case.
Figure 6.
Absolute error as a function of , when , , , and .
In conclusion, it should be noted that, whatever the sign of , the accuracy of the IIRFM can be improved by reducing . This is not the case with the results obtained by the HPM-L method, whose accuracy is independent of .
3.1.2. Exponential Source Term
As a preamble to this paragraph, it should be noted that it is not necessary for the initial condition on the solution to be null in order to apply the IIRFM in the case of the unit kernel.
The developments of the previous paragraph are repeated, but this time in the case of a source term of exponential form. In this case, there is also an analytical solution of Equation (3), which is
The most general case, where , is considered in the following. For , Equation (47) admits a Maclaurin series expansion of the following form to order m:
Numerical Solution by the IIRFM
Since the transfer function associated with Equation (3) is independent of the source function , the numerical solution of the present problem still verifies recurrence relation (42). Equating the difference with the function , it is also possible to find here an approximate explicit expression for the series , an expression which is denoted by , as follows:
where , and , with . Note that here .
Solution by the HPM-L Method
The application of the HPM-L method leads to the following relationships:
The solution obtained by the HPM-L method is therefore written here, according to equations (32) and (50):
An approximate form of the solution, denoted by , is obtained by truncating series (51) at a rank .
Numerical Results and Discussion
Figure 7a represents the numerical results obtained by the HPM-L (result (51)) and IIRFM (result (49)) methods, for , , , and , using the semi-logarithmic representation. It can be seen that relatively high truncation orders have to be used for the numerical solution provided by the HPM-L method to converge to the exact solution (47) with acceptable accuracy over the entire interval . In contrast, it is observed that the numerical solution provides a very accurate approximation of the exact solution over the entire interval , even for a time step as large as .
Figure 7.
IIRFM and HPM-L numerical results when , , , and , and 20: (a) and (b) .
The observations made in the previous discussion for are even more evident when the value is chosen. As shown in Figure 7b, convergence of the HPM-L method is slow in the case where . In the present case, no finite value of could be found that allows the series to converge to the exact solution on the interval without using a convergence acceleration procedure. In contrast, we can observe that the IIRFM approach again gives a very accurate numerical approximation on , whatever the value of . It was also observed that the HPM-L method became unusable here from a numerical point when .
In the present case, the IIRFM approach was found to be a first-order accuracy method.
3.2. Abel’s Kernel (with )
In the case of Abel’s kernel, one obtains , and the transfer function is then given by
The results of Section 2 are applied here to the case , for different source terms and different values of the parameter . Only the IIRFM approach is developed in detail in this section. To differentiate the results of this paragraph from those obtained in the previous paragraph for , we now agree to index all useful functions by the value of .
In the present case, the Laplace transfer function of Abel’s problem is given, from Equation (17), by
In contrast to the case where studied in Section 3.1, there is no exact expression here for in the form of a quotient of polynomials in s. To apply the IIRFM in the present case, the function needs to be approximated by a rational fraction as accurate as possible. Several approaches make obtaining this approximation possible. In [23], an approximation of the transfer function was obtained using the least-squares method, while in [11,24] the rational fraction was constructed using Padé approximants. The second approach generally allows the construction of a very precise rational fraction, but mainly in the vicinity of a given point of the Laplace space. In order to obtain an accurate description over an extended domain of the Laplace space, and thus over an extended domain of the direct time space, a Chebyshev rational interpolation of the function , has been carried out here over a suitably chosen interpolation interval . The interval is adjusted to obtain the best possible numerical resolution of Equation (3) over the entire time domain. This makes it possible to predict, with comparable accuracies, the behaviors of the solution of Equation (3) at both long and short times.
3.2.1. IIRFM Approach When and
Situations where are first considered. In this case, the denominator of the exact transfer function has no root with a positive real part, and therefore, has no discontinuity for . The function is approximated in this case by a rational fraction noted as in the following form:
The coefficients of the rational approximation are determined using a Chebyshev rational interpolation [12] of the function , on the interpolation interval , using a interpolation grid of the Gauss–Chebyshev type (composed of the zeros of first kind Chebyshev polynomials), as follows:
First-order partial fraction decomposition of (54) leads to writing the approximate transfer function as a linear combination of first-order transfer functions of type (18), as follows:
where the coefficients are expressed as functions of the coefficients .
As an example, an approximate expression of has been calculated as (56) for , with and . The coefficient values obtained in this case are gathered in Table 3.
Table 3.
Coefficient values obtained by Chebyshev rational interpolation on when , , and . Numbers in parentheses indicate multiplying powers of ten.
The relative error obtained when is shown as an insert to Figure 8. It can be seen that the rational approximation proposed here is very accurate over the domain and remains highly accurate for . This accuracy could be further improved by increasing the value of M, within the limits of stability of the transfer function .
Figure 8.
Exact transfer function and its Chebyshev rational approximation calculated using the interpolation interval . The insert shows the relative error committed on the rational approximation for .
Monomial Source Term
In the case of a monomial source term, induces . Unlike the case of the unit kernel studied in Section 3.1, there is no simple expression here for the analytical solution when . Only the case admits a relatively simple analytical solution, noted , which will be used here to test the operation of the IIRFM approach as follows:
where is the error function. The numerical solution provided by the IIRFM is given by Equation (25), for which we can propose the following explicit expression when :
where it is recalled that and . The values of coefficients are given in Table 3 when .
Figure 9a shows the variations of given by (57) when and given by (58), as functions of t, when , , and .
The curves shown in Figure 9 were plotted using a Python code (version 3.8.5) calling on the numpy and scipy.special libraries, using single-precision floating-point numbers. In Figure 9a, expansion of the domain corresponding to the interval reveals anomalous discontinuities in the graphical representation of the analytical solution (57), whereas the numerical solution (Equation (58), dashed curve) provided by the IIRFM is continuous, as expected. Note that these discontinuities are also found in the graphical representation (see Figure 9b) of the function , defined by:
The same numerical problem is observed with the free codes octave-8.4.0, scilab-2023.0.0 and julia-1.10.4 and other proprietary softwares used with single-precision floating-point numbers. The reason for this anomalous behavior lies in the internal evaluation of the function when , as shown by Figure 9b. The Julia-1.10.4 code of Listing 1 graphically illustrates the pathological behavior of the function .
| Listing 1. Julia-1.10.4 code illustrating the pathological behavior of . |
| using SpecialFunctions, Plots function gL(t; La = -1.5) return 1 + erf(La*(pi*t)^0.5) end plot(t->gL(t, La = -1.5), 4.4, 5.5) |
The IIRFM approach introduced in this work can be exploited to propose an approximation to the function that exhibits smooth numerical behavior in single precision, for any value of and for any value of , whether positive or negative. To this end, the function is first rewritten using expression (57):
By replacing the function by its IIRFM approximation (58), we finally obtain an approximate form of the function , noted here as :
where . Figure 9b shows the quality of the IIRFM approximation (60) for the function.
The present approach therefore provides an efficient numerical approximation of the function, which does not suffer in single precision from the anomalous discontinuities present in various free or proprietary codes.
Sinusoidal Source Term
This is another source term that ensures a zero initial condition. An analytical expression of the solution also exists here:
where FC and FS are the Fresnel integrals, defined by and . The function with pathological numerical behavior in single precision is again found here. It has also been possible to determine here an explicit expression for the IIRFM numerical solution, as follows:
with given by
where and have the same expressions as in previous examples.
Figure 10a compares the plots obtained using analytical (61) and numerical IIRFM (62) solutions. The problem of artificial discontinuities in the graphical representation of the analytical solution, due to the presence of the function in (61), is very pronounced here in the vicinity of . These defects are not present in the plot obtained by the IIRFM (dashed line), which here gives better numerical results in single precision than using the analytical expression.
Exponential Source Term
For this last example, the case of a non-zero initial condition is considered, since here . Using Equation (4), it is possible to find an analytical solution to the problem (3) when and , whose expression is as follows:
where is the Dawson function and is the imaginary error function, with . The presence of the function in the analytical expression of the solution leads, as shown in Figure 10b, to considerable difficulties in graphically representing the function given by Equation (64) in single precision.
When , applying the IIRFM to numerically solve Equation (3) assumes the initial condition on the solution to be null. If and the initial condition is non-zero but finite, then we introduce the auxiliary functions and , which satisfy the following auxiliary integral equations:
with . The solution sought is written as , which satisfies Equation (3), with the initial condition . Two important special cases should be noted: firstly, in the case where , the result is , and the situation with zero initial condition studied in the previous paragraphs is retrieved. On the other hand, when , in this case results in .
The calculation of by the IIRFM has already been described in previous paragraphs, with . General result (24) is still applicable and it is also possible to find here an explicit expression of the IIRFM numerical solution for , which holds for , as follows:
There remains the need to explain the calculation of . Since the source term is constant here, the auxiliary solution can always be written as , where the function is independent of the expression of the source term considered in the integral Equation (3). This means that there is only one possible function for a given set of parameters . More precisely, the function is given by the following inverse Laplace transform:
Depending on the value taken by , different approaches can be adopted to calculate . In the case of the present paragraph where , the inverse Laplace transform (67) can be computed explicitly and leads to the following analytical expression of :
Finally, the IIRFM solution of the initial problem is written here for and :
where is given by (66). This expression of involves the function , whose anomalous numerical behavior in single precision has been highlighted in the previous paragraphs for . Equation (69) is therefore acceptable as long as . When , we recommend not using the analytical expression of the function , but rather resorting to the following numerical form:
Result (60) finally allows to write in a fully numerical form:
where is given by (66) and is given by (58). This result is particularly interesting, since it holds (for the Abelian kernel ) whatever the value of and whatever the expression of , provided that is finite. Note that this result does not involve any numerical inversion of Laplace transforms, and that it generalizes the IIRFM for solving Abel integral equations of the second kind for , to the case of non-zero but finite initial conditions.
Constant Term Source
In the present case, we consider and , leading to the following expressions for the auxiliary functions and :
The analytical solution of the problem is deduced from the developments of Section “Exponential Source Term ”:
The expression for the IIRFM solution is deduced from Section “Exponential Source Term ” for the present case, as follows:
3.2.2. IIRFM Approach When and
When , the denominator of the Laplace transfer function admits a positive root , whose expression is . The transfer function in this case presents a singularity at . To allow a precise determination of the coefficients and of Equation (18), despite the singularity at , we first calculate a Chebyshev rational interpolation (denoted by ) of the function . This interpolation is written as
The following approximate form of the transfer function is deduced:
with , , and for . Further developments are strictly identical to those exposed in the previous paragraphs for and will therefore not be repeated here. Note also that all the results established in Section “Exponential Source Term ” remain applicable here, but with .
As an example, let us consider the case where , , for which it is found that . The rational approximation (75) has in this case been calculated over the interpolation interval , for . Figure 11a shows the analytical (64) and numerical IIRFM (71) solutions in the present case, for and . Figure 11b shows the relative error in %, as a function of t. The correspondence between analytical and IIRFM resolutions is excellent, even for the low M value considered here.
Figure 11.
IIRFM solution of Equation (3), for , , , and . (a) Changes in analytical and numerical solutions as a function of t. (b) Relative error in %.
3.2.3. Comparison of the IIRFM with the Mouley et al. [13] Approach
In this section, the IIRFM is applied to the numerical solution of two second-kind Abel linear integral equations, which Mouley et al. have studied using a recent numerical method based on an approximation involving Daubechies wavelets [13]. The accuracy of the results provided by the two methods is compared on two examples, for different orders of approximation (see Table 4 and Table 5).
First Example
Consider the following Abel integral equation of the second kind (there is a typographical error in the paper by Mouley et al. where is found in place of ):
which admits as analytical solution the function . This is a convolutive integral equation of the form (3), with , , , and . The developments of Section 3.2.1 are therefore directly applicable to the numerical solution of this integral equation using the IIRFM method.
Table 4 gathers the absolute errors committed using the Mouley et al. method and absolute errors committed using the IIRFM (with and ), for different values of , different resolutions j, and for different approximation orders M.
Table 4.
Absolute errors in the numerical resolution of (77) using the Mouley et al. [13] and IIRFM methods (with and ).
Table 4.
Absolute errors in the numerical resolution of (77) using the Mouley et al. [13] and IIRFM methods (with and ).
| Exact Values | |||||||
|---|---|---|---|---|---|---|---|
| 117 | 1 | 0 | 1 | 0 | 0 | ||
| 37 | 1 | 0 | 2 | 0 | 0 | ||
| 22 | 0 | 0 | 12 | 0 | 0 | ||
| 16 | 0 | 0 | 3 | 1 | 0 | ||
| 12 | 0 | 0 | 23 | 1 | 0 | ||
| 10 | 0 | 0 | 37 | 1 | 0 | ||
| 8 | 0 | 0 | 21 | 1 | 0 | ||
It can be seen from these results that the accuracies obtained with the IIRFM are, in the case of integral Equation (77), quite comparable with those provided by the method of Mouley et al. [13].
Second Example
Let us now consider the following Abel integral equation of the second kind, also studied by Mouley et al. in [13]:
of which the analytical solution is . This is still a convolutive integral equation of the form (3), with , , , and .
Table 5 gathers the absolute errors and committed by numerically calculating the solution of (78), for different values of , for different resolutions j, and different approximation orders M.
Table 5.
Absolute errors in the numerical resolution of (78) using the Mouley et al. [13] and IIRFM methods (with and ).
Table 5.
Absolute errors in the numerical resolution of (78) using the Mouley et al. [13] and IIRFM methods (with and ).
| 21,732 | 4370 | 1074 | 29 | 3 | 3 | ||
| 10,739 | 2774 | 683 | 28 | 3 | 1 | ||
| 8568 | 2091 | 515 | 15 | 1 | 1 | ||
| 6971 | 1695 | 417 | 32 | 1 | 1 | ||
| 5890 | 1433 | 353 | 9 | 2 | 1 | ||
| 5113 | 1244 | 307 | 27 | 1 | 1 | ||
| 4522 | 1101 | 271 | 54 | 1 | 0 | ||
This time, it was found that the accuracy of the numerical resolution of (78) by the IIRFM (with and ) is much better than the accuracy allowed by the method of Mouley et al., which uses Daubechy wavelets. Despite the greater complexity of the source function considered in this second example, the accuracy obtained here with the IIRFM remains comparable to that obtained with the same method for the previous example. This is a clear advantage of the IIRFM in the present case, as it is found that the accuracy depends relatively little on the complexity of the source function .
3.2.4. Comparison of the IIRFM with the Singha et al. [14] Approach
In the present section, the results obtained with the IIRFM are compared with the numerical results obtained using Laguerre polynomials of order i [14], at approximation order :
where is the approximation of Singha et al.
The accuracy of the results provided by the two methods is compared in two examples proposed by Singha et al. in [14].
First Example
Consider the following Abel integral equation of the second kind:
of which analytical solution is . This is a convolutive integral equation of the form (3), with , , , and . Table 6 gathers the absolute errors committed by numerically calculating the solution of (80), with the polynomial method proposed by Singha et al. [14] and with the IIRFM, for different values of , and for the same order of approximation .
Table 6.
Absolute errors in the numerical resolution of (80) by the Laguerre approximation (Singha et al. [14]) and by the IIRFM (with and ), and for the same order of approximation .
The results in Table 6 clearly demonstrate the benefits of the IIRFM for the numerical resolution of (80). For each value of t considered, the IIRFM is always much more accurate here than the approach proposed by Singha et al. [14].
The values of the Laguerre approximation have been calculated here using the coefficient values of Singha et al. [14]:
Second Example
Consider the following Abel integral equation of the second kind:
which admits the analytical solution . This is a convolutive integral equation of the form (3), with , , and . Table 7 gathers the absolute errors committed by numerically calculating the solution of (78) with the polynomial method of Singha et al. [14] and with the IIRFM, for different values of , and for the same order of approximation .
Table 7.
Absolute errors in the numerical resolution of (82) by the Laguerre approximation (Singha et al. [14]) and by the IIRFM (with and ), and for the same order of approximation .
It can also be seen here that the numerical resolution of Equation (82) by the IIRFM remains overall more accurate than the resolution made with the numerical method of Singha et al., and for which the absolute error suffers significant variations over the range of t values studied.
The values of the Laguerre approximation have been calculated here using the coefficient values of Singha et al. [14]:
3.3. Logarithmic Kernel
We now consider the case of a logarithmic kernel , for which . The Laplace transfer function associated with Equation (2) becomes
where is the Euler constant. The transfer function in this case admits a pole , which is the root of the non linear equation , given by the Lambert W function: . The same process is used here as in Section 3.2.2, for which it is recalled that the first step consists of calculating a rational Chebyshev interpolation (noted ) of the function .
In the following paragraphs, two examples of IIRFM solving Equation (2) with logarithmic kernel are presented when . Refer to Section 3.2.1 and Section 3.2.2 for details of the different steps involved in implementing the IIRFM in the present case.
3.3.1. First Example:
Equation (2) admits in the present case the following analytical solution , with zero initial condition.
Figure 12 compares the numerical results obtained with the IIRFM (for an order of approximation ) with the results obtained with the analytical solution. The relative error shown in Figure 12b here remains quite small, especially for increasing values of t, attesting to the stability of the IIRFM in this case, despite the presence of a pole in the transfer function .
Figure 12.
IIRFM resolution of Equation (2) considering a logarithmic kernel, with , , , , and an interpolation interval . (a) Changes in the analytical and numerical solutions as a function of t. (b) Relative error in %.
3.3.2. Second Example:
Equation (2) admits in the present case the following analytical solution . Figure 12 compares the numerical results obtained with the IIRFM (for an order of approximation ) with the results obtained with the analytical solution. Despite the relative complexity of the source function considered in this example, the IIRFM provides stable and accurate numerical results, as illustrated by the variations in relative error shown in Figure 13b.
Figure 13.
IIRFM resolution of Equation (2), considering a logarithmic kernel, with , , , , , and an interpolation interval . (a) Changes in the analytical and numerical solutions as a function of t. (b) Relative error in %.
4. Basic Applications in Thermics
To conclude this study, the IIRFM is applied to the numerical solution of two basic thermal problems: the study of the temperature time evolution of a source point placed in a homogeneous infinite solid medium (see Section 4.1), and the study of the time evolution of the surface temperature of a semi-infinite solid when radiative heat transfers can be neglected (see Section 4.2).
4.1. Heat Point Source
Consider a punctual heat source placed at a point of Cartesian coordinates , within a stationary, homogeneous, and opaque solid medium (m) of constant physical properties. At each time t, the temperature of the medium at a point M with coordinates is written as , with K. Noting the thermal power emitted by the source point placed at , and the temperature variation is given by the following integral [25]:
where ; is the thermal diffusivity of (m); k, , and c are the thermal conductivity, density, and specific heat of (m), respectively. It is also assumed that thermal power is generated by the Joule effect and is written as , where is the electrical resistance of the source point and is the electrical intensity of the heating current. In the present example, the resistance of the source point is assumed to vary linearly with temperature, as is usually the case for examples with metallic materials:
where is the temperature coefficient of the source point. From Equation (85), the temperature is given in this case by the following relation:
Assuming that the point source is spherical, with a radius being a very small compared to the dimensions of the medium (m), located at the origin of the coordinates, the uniform temperature of the point source verifies the following integral equation deduced from (87):
where . Assuming that the heating current of the point source is of constant intensity , the temperature is now given by the following linear Volterra integral equation of the second kind:
which is of the form (2), with:
To the best of our knowledge, integral Equation (89) has no analytical solution, so we propose to solve it numerically using the IIRFM, following the various steps shown in Figure 2.
Using the result , the Laplace transfer function of the temperature is written as follows, according to (17):
Note that the denominator of the transfer function (91) can have a pole , given by the following relationship:
The transfer function (91) is then decomposed into the form (18), using a Chebyshev rational interpolation. Applying the bilinear transformation finally leads to the result (24), which is written here:
with:
where the coefficients and have the usual expressions introduced in the previous paragraphs. Note that in the limit where (case of constant electrical resistance), the temperature is then identified with the function .
Figure 14 shows the time variations in temperature of a heat point source with radius mm, immersed in ethylene glycol at rest, at room temperature (, ). The electrical heating current considered had a constant intensity and the temperature coefficient of the point source was , for an electrical resistance . The Chebyshev interpolation was calculated with , over the interpolation interval . The maximal relative error committed on the approximation of was in this case for . The sampling period was s.
From the results shown in Figure 14, it can be seen that the temperature coefficient has a non-negligible influence on the time evolution of the source point temperature. When the influence of is taken into account, the self-heating of the source point leads to an increase in its electrical resistance (because is positive), and so at constant heating intensity, this leads to an increase in the Joule heating power and consequently in its temperature , compared to the situation where . These observations could be applied to various methods of the thermal characterization of materials.
4.2. Surface Temperature of Semi-Infinite Solids
The IIRFM is now applied to the solution of the linear integral equation verified by the interface temperature of a semi-infinite isotropic solid (defined by ), of uniform initial temperature , subjected to mixed (or Robin, see Figure 15a) boundary conditions at .
Figure 15.
Temperature of a semi-infinite solid () with constant Robin boundary conditions at , due to a fluid flowing at constant velocity and temperature far from the solid, with constant Newton coefficient h. (a) Temperature profiles at different times, for . (b) Time evolution of the surface temperature when . The symbols correspond to the analytical solution (100) and the solid line to the numerical solution (102) obtained by the IIRFM method.
The temperature field in this case satisfies the usual heat equation without a source term, as follows:
where is the thermal diffusivity of the solid, assumed constant. Applying the Laplace transformation to Equation (95) leads to the ordinary differential equation , of which the solution is written in the general form , with . The finite boundary condition implies here.
Let us note , the heat flux exchanged by the solid with the external fluid at . The continuity of heat fluxes at the interface is written as . Applying the Laplace transformation to the continuity relation leads to the following expression for :
where . By recalling that and applying the convolution theorem, it is possible to invert and write in the form of the following convolution integral:
Finally, using Newton’s law leads to the following expression of :
where the Newton coefficient h is assumed to be constant. According to result (98), the surface temperature finally verifies the following Abel integral equation of the second kind:
with and .
In the following paragraphs, Equation (99) is solved by the IIRFM for two different expressions of the temperature of the fluid far from the solid wall.
4.2.1. First Application:
First, consider the usual case where the temperature of the fluid far from the solid wall is constant. In this case, it is found that with and . Equation (99) then admits an analytical solution involving the complementary error function:
Equation (99) is solved in the following by the IIRFM, using the general result (24). First of all, it is possible here to determine an explicit expression for the sum , in the general case where :
where the polylogarithm Li and transcendent Lerch functions were defined in Section 3.1.1. Using result (101) with , the following explicit expression is obtained for the IIRFM solution to the problem (99), at time (with ):
The thermal problem (99), of calculating the surface temperature of a semi-infinite solid surrounded by a fluid, is solved using result (102) for the following physical properties: ; ; ; ; for Newton coefficient ; ; and s. Numerical (continuous line) and analytical results ( + symbols) are shown in Figure 15b. From this figure it can be seen that there is a good correspondence between the IIRFM numerical solution and the analytical solution. This good agreement is confirmed by the low values of the maximal error K and root mean square error K, with
where is the set of points obtained using the IIRFM method.
4.2.2. Second Application:
Thermal problem (99) is still considered, but now for a sinusoidal temperature with pulsation : , all other things being equal to what was considered in the previous example. The function in Equation (99) becomes here
where ; ; and are the Fresnel integrals. An analytical solution also exists here, and can be obtained by inverting the Laplace transform :
Figure 16 compares the numerical results (solid line) obtained by the IIRFM to the results provided (black dashes) by the analytical expression (105), when with and . The correspondence between the results provided by the IIRFM and the analytical solution is again very good, with maximum error K and root mean square error K, calculated for a sampling period .
Figure 16.
Time changes in the surface temperature of a semi-infinite solid, for sinusoidal variations of the fluid temperature far from the solid and for a constant flow velocity .
5. Conclusions
In this work, the first-order infinite impulse response filters method (IIRFM), usually reserved for the study of linear ordinary differential equations with constant coefficients, has been extended to the numerical solution of various linear Volterra convolution integral equations (VCIE) of the second kind. A wide variety of examples have been studied, illustrating the great flexibility of the IIRFM. Three types of convolutive kernels were discussed in detail in this work: unit, Abel, and logarithmic kernels.
In the case of the unit kernel, the IIRFM was compared to the homotopic perturbation method with Laplace transform (HPM-L). The HPM-L method has the great advantage of leading, for certain special cases, to an analytic solution of the linear convolutive Volterra integral equation of the second kind. However, due to its iterative nature, the numerical version of the HPM-L method may exhibit convergence speeds that are far too low to allow, in the absence of an analytical solution, an efficient numerical resolution of certain VCIEs. In contrast, we have observed that the IIRFM leads, in the case of the unit kernel, to numerical solutions that do not exhibit convergence problems. In many cases, it has also been possible to provide a simple, highly efficient analytical expression for the IIRFM numerical solution.
In the case of the Abel kernel, the numerical results provided by the IIRFM approach have been compared with the results provided by various recent numerical methods (Daubechies wavelets and approximations based on Laguerre polynomials). For most of the comparisons examined, the IIRFM proved to be the best-performing and most consistent overall.
Finally, the IIRFM has been applied to the numerical solution of Volterra integral equations of the second kind encountered in two linear thermal problems. In addition, a new approximate expression for the pathological function has been proposed, giving accurate results for , even using single-precision floating-point numbers.
In a forthcoming paper, the IIRFM will be extended to the numerical solution of the non-linear Volterra convolution integral equations of the second kind. It will also be very interesting to consider the application of the IIRFM to fractional differential or integral equations [26].
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.
Conflicts of Interest
The author declares no conflicts of interest.
Abbreviations
The following abbreviations are used in this manuscript:
| BLT | Bilinear Transformation |
| CAIE | Convolutive Abel Integral Equation |
| CIE | Convolutive Integral Equation |
| CVIE | Convolutive Volterra Integral Equation |
| FOD | First-Order Partial Fractions Decompositon |
| HPM | Homotopy Perturbation Method |
| HPM-L | Homotopy Perturbation Method with Laplace Transform |
| IIR | Infinite Impulse Response |
| IIRFM | Infinite Impulse Response First-Order Filters Method |
| ODE | Ordinary Differential Equation |
| OIDE | Ordinary Integro-Differential Equation |
| LT | Laplace Transformation |
| LTIS | Linear Time Invariant Systems |
| PDE | Partial Differential Equation |
References
- De, S.; Mandal, B.; Chakrabarti, A. Use of Abel integral equations in water wave scattering by two surface-piercing barriers. Wave Motion 2010, 47, 279–288. [Google Scholar] [CrossRef]
- Mirceski, V.; Tomovski, Z. Analytical solutions of integral equations for modelling of reversible electrode processes under voltammetric conditions. J. Electroanal. Chem. 2008, 619–620, 164–168. [Google Scholar] [CrossRef]
- Wazwaz, A.M. Linear and Nonlinear Integral Equations—Methods and Applications; Springer: Berlin/Heidelberg, Germany, 2011. [Google Scholar]
- Polyanin, A.D.; Manzhirov, A.V. Handbook of Integral Equations, 2nd ed.; Chapman and Hall/CRC: Boca Raton, FL, USA, 2008. [Google Scholar]
- Kumar, S.; Kumar, A.; Kumar, D.; Singh, J.; Singh, A. Analytical solution of Abel integral equation arising in astrophysics via Laplace transform. J. Egypt. Math. Soc. 2015, 23, 102–107. [Google Scholar] [CrossRef]
- Thota, S. Solution of Generalized Abel’s Integral Equations by Homotopy Perturbation Method with Adaptation in Laplace Transformation. Sohag J. Math. 2022, 9, 29–35. [Google Scholar]
- Chowdhury, M.S.H.; Mohamed, M.S.; Gepreel, K.A.; Al-Malki, F.A.; Al-Humyani, M. Approximate Solutions of the Generalized Abel’s Integral Equations Using the Extension Khan’s Homotopy Analysis Transformation Method. J. Appl. Math. 2015, 2015, 357861. [Google Scholar]
- Liao, S. On the homotopy analysis method for nonlinear problems. Appl. Math. Comput. 2004, 147, 499–513. [Google Scholar] [CrossRef]
- Liao, S. Comparison between the homotopy analysis method and homotopy perturbation method. Appl. Math. Comput. 2005, 169, 1186–1194. [Google Scholar] [CrossRef]
- Bairwa, R.K.; Kumar, A.; Kumar, D. An Efficient Computation Approach for Abel’s Integral Equations of the Second Kind. Sci. Technol. Asia 2020, 25, 85–94. [Google Scholar]
- Heyd, R. Real-time heat conduction in a self-heated composite slab by Padé filters. Int. J. Heat Mass Transf. 2014, 71, 606–614. [Google Scholar] [CrossRef]
- Lahboub, D.; Heyd, R.; Bakak, A.; Lotfi, M.; Koumina, A. Solution of Basset integro-differential equations by IIR digital filters. Alex. Eng. J. 2022, 61, 11899–11911. [Google Scholar] [CrossRef]
- Mouley, J.; Panja, M.M.; Mandal, B.N. Approximate solution of Abel integral equation in Daubechies wavelet basis. CUBO A Math. J. 2021, 23, 245–264. [Google Scholar] [CrossRef]
- Singha, N.; Nahak, C. Solutions of the Generalized Abel’s Integral Equation using Laguerre Orthogonal Approximation. Appl. Appl. Math. Int. J. (AAM) 2019, 14, 1051–1066. [Google Scholar]
- Adomian, G.; Rach, R. Noise terms in decomposition series solution. Comput. Math. Appl. 1992, 24, 61–64. [Google Scholar] [CrossRef]
- Adomian, G. Solving Frontier Problems of Physics: The Decomposition Method; Kluwer: Alphen aan den Rijn, The Netherlands, 1994. [Google Scholar]
- He, J.H. Homotopy perturbation technique. Comput. Methods Appl. Mech. Eng. 1999, 178, 257–262. [Google Scholar] [CrossRef]
- He, J.H. A coupling method of a homotopy technique and a perturbation technique for non-linear problems. Int. J. Non-Linear Mech. 2000, 35, 37–43. [Google Scholar] [CrossRef]
- He, J.H. Homotopy perturbation method: A new nonlinear analytical technique. Appl. Math. Comput. 2003, 135, 73–79. [Google Scholar] [CrossRef]
- Madani, M.; Fathizadeh, M. Homotopy Perturbation Algorithm using Laplace Transformation. Nonlinear Sci. Lett. A 2010, 1, 263–267. [Google Scholar]
- Khan, Y.; Wu, Q. Homotopy perturbation transform method for nonlinear equations using He’s polynomials. Comput. Math. Appl. 2011, 61, 1963–1967. [Google Scholar] [CrossRef]
- Singh, J.; Kumar, D.; Rathore, S. Application of Homotopy Perturbation Transform Method for Solving Linear and Nonlinear Klein-Gordon Equations. J. Inf. Comput. Sci. 2012, 7, 131–139. [Google Scholar]
- Heyd, R.; Hadaoui, A.; Saboungi, M. 1D analog behavioral SPICE model for hot wire sensors in the continuum regime. Sens. Actuators A Phys. 2012, 174, 9–15. [Google Scholar] [CrossRef]
- Lotfi, M.; Mezrigui, L.; Heyd, R. Study of heat conduction through a self-heated composite cylinder by Laplace transfer functions. Appl. Math. Model. 2016, 40, 10360–10376. [Google Scholar] [CrossRef]
- Carslaw, H.; Jaeger, J.C. Conduction of Heat in Solids; Oxford University Press: Oxford, UK, 1959. [Google Scholar]
- Zhao, K.; Liu, J.; Lv, X. A Unified Approach to Solvability and Stability of Multipoint BVPs for Langevin and Sturm–Liouville Equations with CH-Fractional Derivatives and Impulses via Coincidence Theory. Fractal Fract. 2024, 8, 111. [Google Scholar] [CrossRef]
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. |
© 2024 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).