Abstract
This work introduces a direct method based on orthonormal Bernstein polynomials wavelet bases, to present a stable algorithm for numerical inversion of a system of generalized Abel integral equations. The application of all the currently existing numerical inversion methods was strictly limited to only one portion of the generalized Abel integral equations. The proposed method is quite accurate, and several numerical illustrations demonstrate the convergence and utilization of the proposed method compared to some of the preexisting numerical solution techniques. The permanence of the numerical result under the effect of small perturbation in input data has been examined, which is depicted with the use of numerical illustrations.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Introduction
In this paper, we propose the method of an approximate numerical inversion for the system of generalized Abel integral equations given by
where the coefficients \( \mathop \rho \nolimits_{1} (s),\mathop \rho \nolimits_{2} (s),\omega_{1} (s),\omega_{2} (s) \) must not vanish simultaneously and \( I_{1} (s),\,I_{2} (s) \) are the intensity functions.
The system of generalized Abel integral equations in Eq. (1) holds substantial significance in various spheres. It is considered as a mathematical model in the various fields such as water wave scattering [1], plasma spectroscopy [2], elasticity [3], mathematical physics, astrophysics, seismology, solid mechanics [4, 5].
There are various numerical methods to find the solution of different kinds of integral equations, such as Maleknejad et al. proposed Legendre wavelets and rationalized Haar wavelet methods [6, 7], Derili et al. proposed two-dimensional wavelets method [8] and Mandal et al. used the Daubechies scale function [9] method. Several other methods [10,11,12,13,14] have been previously used for the numerical inversion of the system of generalized Abel integral equations. In 1976, Lowengrub [10] showed that certain mixed boundary value problems arising in the classical theory of elasticity converted to the new problem in the form of functions ɛ1(u) and ɛ2(u), these functions satisfy the system in Eq. (1). Lowengrub and Waltson [11] provided a method based on converting the system of generalized Abel integral equations into an equivalent boundary value problem of coupled Riemann–Hilbert type. Some particular generalized system of Abel integral equations solved by creating an equivalent system of singular integral equation in [12]. Mandal et al. [13] have solved the system with the implementation of fractional calculus. In [14], Mandal and Pandey gave the numerical solution of the system of generalized Abel integral equations through the Bernstein polynomials bases. Jafarian et al. also used the Bernstein polynomial method [15] and Bernstein collocation method [16] for obtaining the solution of the system of integral equations and Abel integral equations, respectively.
This paper aims to give a new and user friendly algorithm for the numerical inversion of the system of generalized Abel integral equation, based on Bernstein polynomials orthonormal wavelet bases. Numerical examples have been provided to illustrate the convergence and stability of the method.
Bernstein polynomials orthonormal wavelet bases
A class of functions, which is obtained by dilation and translation of a single function known as mother wavelet [17]. The continuous variation of the dilation and translation parameters c and d gives the following continuous wavelet bases [18]
If the parameters c and d are regulated to \( c = 2^{ - k} ;\,\,d = n\,2^{ - k} \), then obtained a family of discrete wavelets from the above equation,
The Bernstein polynomials characterized over the interval \( [0,\,1] \) are given as;
Some significant characteristics of Bernstein polynomials are:
-
The sum of all Bernstein polynomials of degree n is always one
$$ \sum\limits_{i = 0}^{n} {B_{i,n} \left( y \right)} = \sum\limits_{i = 0}^{n} {\left( {\begin{array}{*{20}c} n \\ i \\ \end{array} } \right)y^{i} \left( {1 - y} \right)^{n - i} = \left( {1 - y + y} \right)^{n} = 1.} $$ -
\( B_{i,n} (y) \ge 0 \) for all \( y \in [0,1] \).
-
\( B_{n - i,n} (1 - y) = B_{i,n} (y) \).
The recurrence formula to obtain Bernstein polynomial of degree less than n using Bernstein polynomials of degree n is
The expansion of any polynomial P(y) of degree n can be expressed in terms of a linear combination of Bi,n(y)
where βi is called Bernstein polynomials coefficients, these polynomials are not orthonormal, so we used the Gram–Schmidt process [19] to get orthonormal polynomials, which are denoted by bi(y) given in “Appendix 1”.
We are taking orthonormal Bernstein polynomials for N = 7, which are shown graphically in Fig. 1.
The four arguments in the Bernstein polynomials orthonormal wavelet bases \( \psi_{m,n} (u) = \psi (k,m,n,u) \), where \( m = 0,\,1,\, \ldots ,\,2^{k} - 1 \) and \( k = 0,\,1,\,2,\, \ldots \) are translation and dilation parameters, respectively, \( n = 0,\,1,\, \ldots ,\,N \) is the order of Bernstein polynomial and the independent variable u is lying in the closed interval [0, 1]. The orthonormal wavelet bases ψm,n(u) are given in [20] on the interval [0, 1), such as
where 2 k/2 is the orthonormality factor, for the dyadic form of orthonormal Bernstein polynomials wavelet bases of the order n we are setting parameters \( c = 2^{ - k} \) and \( d = m2^{ - k} \) in Eq. (2).
Now, for \( k = 0;\,N = 7, \) there are eight, and for \( k = 1;\,N = 7, \) sixteen basis elements of orthonormal wavelet bases are obtained [21].
Function approximation
Let us consider \( f \in L^{2} [0,1], \) then may be written as the following expansion of f(u) on the closed interval [0, 1]
where \( \left\langle {.,.} \right\rangle \) is the inner product on the Hilbert space, and \( c_{mn} = \;\left\langle {f(.),\;\psi_{m\,n} \left( . \right)} \right\rangle \) be the wavelet coefficients. We truncate the infinite series in Eq. (5) at the levels m = 2 k − 1 and n = N, then obtained an approximate version of these series such as
where C and Ψ are \( 2^{k} (N + 1) \times 1 \) order matrices given by
The solution of the system of generalized Abel integral equations
In this section, we are discussing the solution of the system of generalized Abel integral equations in Eq. (1) by using Bernstein polynomials orthonormal wavelet bases.
Now, let us take the unknown (emissivity) functions \( \varepsilon_{1} (u),\,\varepsilon_{2} (u) \) and the intensity functions \( I_{1} (s),I_{2} (s) \) from Eq. (1) and approximates to this by using Eq. (6),
where \( C_{1} ,\,C_{2} ;\,F_{1} ,\,F_{2} \) are coefficient matrices. Substituting these approximated values of functions from Eq. (9) and taking \( a = 0,\,b = 1 \) in Eq. (1), we get
The integrals in Eq. (10) involve evaluating integrals of the types \( \int\nolimits_{0}^{s} {\frac{{u^{n} {\text{d}}u}}{{(s^{\beta } - u^{\beta } )^{\alpha } }}} \) and \( \int\limits_{s}^{1} {\frac{{u^{n} {\text{d}}u}}{{(u^{\beta } - s^{\beta } )^{\alpha } }}} \).
We calculate these integral using given recursive formulae,
where Γ(.) represents the gamma function and B(z, a, b) or Bz(a, b) stands for the incomplete beta function which is defined by
Here in Eq. (11b), we have \( B_{{s^{\beta } }} (\alpha - n + 1/\beta ,1 - \alpha ) \), which is expressed with the help of above function \( B_{z} \left( {a,b} \right) \) as
Now, by Eqs. (11a) and (11b) we have
where \( W_{1} \) and W2 are the almost Bernstein polynomial multiwavelets operational matrix of integration [22, 23] of wavelet bases Ψ(u) of order \( 2^{k} (N + 1) \times 2^{k} (N + 1) \).
The value of order eight matrices W1 and W2 for N = 7 and k = 0 (α = 1/3, β = 1) is:
Similarly, The value of order six matrices W1 and W2 for N = 5 and k = 0 (α = 1/2, β = 1) is:
The matrix W2 can be calculated directly from W1, it is the transpose of W1, so it is easy to calculate them and one matrix can be written in the form of another matrix (W2 = W T1 , W1 = W T2 ).
Now on substituting Eq. (12) in Eq. (10), we obtain
On simplifying we get
Next, we solve the algebraic system in Eq. (13a), for the vectors C T1 and C T2
We can also calculate the values of C T1 and C T2 for some special cases of the system given in Eq. (1),
(i) When the coefficient \( \mathop \rho \nolimits_{1} (s) = \mathop \omega \nolimits_{2} (s) \) and \( \mathop \rho \nolimits_{2} (s) = \mathop \omega \nolimits_{1} (s) \), then
On adding and subtracting equations of (13a), we get
Using approximations \( \mathop \rho \nolimits_{1} (s) = \mathop \omega \nolimits_{2} (s) \) and \( \mathop \rho \nolimits_{2} (s) = \mathop \omega \nolimits_{1} (s) \), Eq. (13c) becomes
Equation (13d) can be written in the following form
Next, we solve the above algebraic system in Eq. (14) for the vectors C T1 and C T2
(ii) When the values of all coefficients of the system given in Eq. (1) are unity. Then using approximation \( \mathop \rho \nolimits_{1} (s) = \mathop \rho \nolimits_{2} (s) = \mathop \omega \nolimits_{1} (s) = \mathop \omega \nolimits_{2} (s) = 1 \), in Eq. (13c), we get
Next, we solve the above algebraic system (14b) for the vectors C T1 and C T2
On substituting these values of the vectors C T1 and C T2 [for the general case from Eq. (13b), for the special case (i) from Eq. (14a) and special case (ii) from Eq. (14c)] in Eq. (9), we get the following approximate solutions
See “Appendix 2”.
Convergence of the wavelet bases
In this section, we discuss a lemma and theorem that supports the absolute error of the proposed method and also presents an error analysis of the proposed method.
Lemma 1
(See [24]) Let the function\( \varepsilon (u) \in C^{n} [0,\,\,1] \), be a collection of all real-valued n times continuously differentiable functions. The mean error bound of approximation in Eq. (6) is
Proof
Let us divide the existing interval [0, 1] into subintervals \( [{m \mathord{\left/ {\vphantom {m {2^{k} ,}}} \right. \kern-0pt} {2^{k} ,}}{{m + 1} \mathord{\left/ {\vphantom {{m + 1} {2^{k} }}} \right. \kern-0pt} {2^{k} }}] = I_{m,k} \)(say), on which the restriction of \( C^{T} \varPsi (u) \) to one such subinterval Im,k is the polynomial of order n that interpolates ɛ(u) with the minimum mean error. Following which, we employ the maximum error estimation for the polynomial which interpolates ɛ(u) at Chebyshev nodes, of order n. The interpolation polynomial of \( C^{T} \varPsi (u) \) is that unique polynomial that has a value ɛ(ui) at every point ui. The interpolation error at u is given by [24],
for some ξ (depending on u) in [a, b], so it is obvious to minimize \( \mathop {\sup }\limits_{{u \in \left[ {0,\,1} \right]}} \left| {\prod\limits_{i = 1}^{n} {(u - u_{i} )} } \right| \) for better convergence as n → ∞, here product represents in the form of monic polynomials. It can be demonstrated that the maximum norm of such polynomial is bounded below by 21−n. This bound is obtained by scaled Bernstein polynomials 21−nBn, which are monic as well. Thus, for an arbitrary interval [a, b] the roots of the given polynomial are the interpolation Chebyshev nodes ui, and the error satisfies the following equation
□
The left side of Eq. (16);
Using Eq. (17a) and \( I_{m,k} = [{m \mathord{\left/ {\vphantom {m {2^{k} }}} \right. \kern-0pt} {2^{k} }},{{m + 1} \mathord{\left/ {\vphantom {{m + 1} {2^{k} }}} \right. \kern-0pt} {2^{k} }}] \) we get
The square root of the Eq. (17b) will give the upper bound of the given approximation in Eq. (6). The approximation error of the function ɛ(u) rapidly decays like 1/2nk. These bounds of the error obtained are governed by the term \( 1/(2^{2n + n\,k - 1} n!) \), which varies inversely with values of k and n and minimizes to zero as values of k and n increase significantly. On the contrary, in classical orthogonal bases such as Chebyshev, Legendre and Fourier, it depends on \( 1/n! \). Here, the two arguments n and k, in the basis are the two degrees of freedom for the B-polynomial wavelet bases, which help in the accuracy of the introduced method. This is the advantage of the proposed method.
Theorem 1
(Ref. [25]) Suppose that the known functions in the system of generalized Abel integral equations are real n + 1 times continuously differentiable functions on the bounded interval [0, 1] and\( \sum\nolimits_{i = 0}^{\infty } {c_{i} \;\varPsi (u)} \)be the infinite series expansion of exact solution ɛ(u), in the form of Bernstein polynomials orthonormal wavelet bases and ɛn(u) denotes its truncation such as\( C^{T} \varPsi (u) \) and similarly,\( \tilde{\varepsilon }(u) \)is the infinite expansion of the approximate solution and\( \tilde{\varepsilon }_{n} (u) \)is the truncated part of\( \tilde{\varepsilon }(u) \), taken as\( \tilde{C}^{T} \varPsi (u) \), then there exist the real numbers λ1and λ2such that
where
and
Proof
Let us take the truncated series ɛn(u) and \( \tilde{\varepsilon }_{n} (u) \) are in Rn[u] (where Rn[u] is the space of real-valued polynomials of degree less than equal to the space of real-valued polynomials of degree less than equal to n), ɛn(u) is the best approximation of ɛ(u) in Rn[u], then
Now, the first part of the right-hand side of Eq. (19), yields
using Lemma 1, we get
Also, the second part of the right-hand side of Eq. (19), yields
i.e.,
□
Now, we use the generalized triangular inequality in the right-hand side of Eq. (21), such as
using orthonormality of Bernstein polynomial multiwavelets
Next, by substituting Eq. (22) in Eq. (21) we get,
We substituted values from Eq. (20) and Eq. (23) in Eq. (18) and concluded that it holds valid for
Hence, as illustrated, Δɛ(u) decreases as n → ∞.
Illustrative example
The estimated solution ɛ(u) (emissivity) cannot be calculated exactly if the data function I(s) is given with very small or high-frequency errors. These errors in the data function can occur from experimental errors which results into large errors in emissivity since differentiation of the measured data is required in these formulae, that’s why the stable numerical techniques become vital, but in the proposed method there is no need of the differentiation of data function. Thus, we have suggested a new stable numerical technique for the solution of the system given in Eq. (1). The stability of the proposed method is showing for a system by adding noise μ in I(s) and presented the convergence of the proposed method by calculating the pointwise error. Some suitable illustrative examples with figures are given to show the stability and accuracy of the introduced method for the known system even with particular noise μ.
Next, the exactness of the proposed method is shown by calculating the absolute error \( \Delta \varepsilon (u_{i} ) \) with the help of Theorem 1, such that
where \( \tilde{\varepsilon }_{n} \,(u_{i} ) \) and ɛ(ui) are the estimated solution and exact solutions calculated at the corresponding point ui, respectively. Also, I(s) and Iμ(s) represent the exact and noisy profiles, respectively, where Iμ(s) is obtained by adding a noise μ to I(s), i.e., \( I^{\mu } (s_{i} ) = I^{\mu } (s_{i} ) + \mu \theta_{i} \) where \( \theta_{i} \) stands for the uniform random variable which takes values in [− 1,1], \( s_{i} = i\mu ,\,\,i = 1, \ldots ,\tilde{N},\,\,\,\tilde{N}\mu = 1 \) and \( \mathop {\text{Max}}\limits_{1 \le i \le \,N} \left| {I_{i}^{\mu } (s) - I_{i} (s)} \right| \le \mu \).
Now, using Eqs. (14a) and (15) the reconstructed emissivities \( {}^{\mu }\tilde{\varepsilon }_{i} \) are obtained with noise term μ in intensity profile under the condition \( \mathop \rho \nolimits_{1} (s) = \mathop \omega \nolimits_{2} (s) \) and \( \mathop \rho \nolimits_{2} (s) = \mathop \omega \nolimits_{1} (s) \), are given as
where \( {}^{\mu }I_{i} (s) \) and Ii(s) are known functions (i = 1, 2), and they are obtained from the following equations:
and
i.e.,
where \( H_{1}^{T} = {}^{\mu }F_{1}^{T} - F_{1}^{T} ,\,H_{2}^{T} = {}^{\mu }F_{2}^{T} - F_{2}^{T} \) and
Similarly, from Eqs. (15) and (25), we get
Setting,
and
then \( h_{1} (u) \) and \( h_{2} (u) \) reflect the noise reduction capability [23] of the method, which is shown in Figs. 6 and 7, for example, 1. The general behavior of noise reduction is the same irrespective of the value of μ.
Example 1
In the first example, consider Eq. (1) with \( \mathop \rho \nolimits_{1} (s),\,\mathop \rho \nolimits_{2} (s)\,;\,\omega_{1} (s) \) and ω2(s) are unity and β = 1, α = 1/3 for the pairs:
where \( \varGamma (.) \) represents the gamma functions and
are exact solutions of Eq. (1) for the above values of \( I_{1} (s),\,\,I_{2} (s) \) and Eqs. (14c) and (15) provide the desired approximate solutions
Here, the Bernstein polynomials orthonormal wavelet bases are taking for k = 0, 1; N = 7 and apply the introduced method, to get the approximate solutions of Eq. (26), which are shown in Table 1. Now, the associated absolute errors without noise are depicted by
which are shown in Figs. 2 and 3, respectively, for dilation parameter k = 0 and k = 1. The comparison of absolute errors E3(u), E4(u) for the noise level μ1 = 0.001 and E5(u), E6(u) at the noise level μ2 = 0.002, respectively, for k = 0 and k = 1 are shown in Figs. 4 and 5.The stability of the proposed method is shown by calculating the noise reducing capability h1(u) and h2(u) which are shown in Figs. 6 and 7 for example 1, similarly we can calculate noise reducing capability for other examples.
Example 2
Let us consider Eq. (1) with \( \rho_{1} (s) = (s^{2} + 1), \, \rho_{2} (s) = \frac{(s + 1)}{4} ; { }\omega_{1} (s) = \frac{{s^{2} }}{2},\,\,\,\omega_{2} (s) = 2 - s \) and \( \alpha = 1/2,\beta = 1 \) for the pairs [14]:
there exist an analytical solution of Eq. (1) for the above \( I_{1} (s),\,\,I_{2} (s) \), like as
Here, we applied the proposed method similar to the example 1 for N = 5 and k = 0 to get the desired approximate solution
Now, the comparison of the approximated solution for the proposed method and the given method in Ref. [14] is shown in Table 2, even less number of polynomials taken but achieves better results with higher accuracy are obtained in the present method.Next, the absolute errors \( E_{1} (u) , { }E_{2} (u) \) for the proposed method are of order 10−5 as shown in Fig. 8.Whereas, the comparison of absolute errors \( E_{3} (u),E_{4} (u) \) for the noise level \( \mu_{1} = 0.001 \), and \( E_{5} (u),\,E_{6} (u) \) at the noise level μ2 = 0.002, respectively, for k = 0 and k = 1 can be obtained to the similar of example 1.
Example 3
In this example, we consider Eq. (1) with \( \rho_{1} (s) = \rho_{2} (s) = 1;\,\,\,\omega_{1} (s) = \omega_{2} (s) = 1 \) and \( \alpha = {1 \mathord{\left/ {\vphantom {1 2}} \right. \kern-0pt} 2},\beta = 2 \) for the pairs
with the exact solution
where
and its approximate solutions \( \tilde{\varepsilon }_{1} (u),\,\tilde{\varepsilon }_{2} (u) \) are free from noise, which is presented in Table 3, for N = 5, k = 0 by the same approach used in the above examples.Now, the absolute errors \( E_{1} (u) , { }E_{2} (u) \) associated with example 3 are obtained similar to the first example, and it is shown in Fig. 9.
Next, the comparison to the proposed method for this example is shown in Table 3 from the exact solution.
Conclusions
The system investigated in this paper holds substantial significance in the determination of intensity and emissivity of the plasma spectroscopy model. Our technique demonstrates the comparison between solutions for two different dilation parameters, i.e., k = 0 and k = 1. The stability with relevancy to the data is restored, and a favorable result is obtained, even for small sample intervals with high noise in the data. The selection of a small number of orthonormal polynomials (as shown for n = 5 and n = 7) makes the method easy and straightforward. The error bound obtained demonstrates that a higher degree of convergence is achieved even in the case of an infinite system as compared to the other method in Ref. [25]. This method [25] failed for an infinite system as the series obtained from the difference of truncated functions ɛn(u) and \( \tilde{\varepsilon }_{n} (u) \)
is a diverging series as \( n \to \infty \). Hence, it gives a weaker bound. But in the proposed method, it is less than or equal to \( \left\| {C - \tilde{C}} \right\|_{2} \), which holds for every value of n, so it converges slowly even in the case of n → ∞.
References
De, S., Mandal, B.N., Chakrabarti, A.: Use of Abel integral equations in water wave scattering by two surface-piercing barriers. Wave Motion 47(5), 279–288 (2010)
Andanson, P., Cheminat, B., Halbique, A.M.: Numerical solution of the Abel integral equation: application to plasma spectroscopy. J. Phys. D Appl. Phys. 11(3), 209 (1978)
Gorenflo, R., Vessella, S.: Abel integral equations: analysis and applications, pp. 23–37, 61–63. Springer, Berlin (1991)
Aben, H., Ainola, L., Errapart, A.: Application of the Abel inversion in case of a tensor field. Inverse Probl. Sci. Eng. 18(2), 241–249 (2010)
Asaki, T.J., Campbell, P.R., Chartrand, R., Powell, C.E., Vixie, K.R., Wohlberg, B.E.: Abel inversion using total variation regularization: applications. Inverse Probl. Sci. Eng. 14(8), 873–885 (2006)
Maleknejad, K., Sohrabi, S.: Numerical solution of Fredholm integral equations of the first kind by using Legendre wavelets. Appl. Math. Comput. 186(1), 836–843 (2007)
Maleknejad, K., Mirzaee, F.: Using rationalized Haar wavelet for solving linear integral equations. Appl. Math. Comput. 160(2), 579–587 (2005)
Derili, H.A., Sohrabi, S., Arzhang, A.: Two-dimensional wavelets for numerical solution of integral equations. Math. Sci. 6(1), 5 (2012)
Panjaa, M.M., Mandal, B.N.: Evaluation of singular integrals using Daubechies scale function. Adv. Comput. Math. Appl. 3, 64–75 (2012)
Lowengrub, M.: Systems of Abel type integral equations in function theoretic methods in differential equations. In: Gilbert, R.P., Weinacht, R.J. (eds.) Research Notes in Math, pp. 277–296. Pitman Publishing, London (1976)
Lowengrub, M., Waltson, J.: System of generalized Abel equation. SIAM J. Math. Anal. 10(4), 794–807 (1979)
Walton, J.: System of generalized Abel’s integral equation with applications to simultaneous dual relations. SIAM J. Math. Anal. 10(4), 808–822 (1979)
Mandal, N., Chakrabarti, A., Mandal, B.N.: Numerical solution of a system of generalized Abel’s integral equation using fractional calculus. Appl. Math. Lett. 9(5), 1–4 (1996)
Mandal, B.N., Chakrabarti, A.: Applied singular integral equations, pp. 231–239. CRC Press, Cambridge (2016)
Jafarian, A., Nia, S.A.M., S., Golmankhaneh, A.K., Baleanu, D.: On Bernstein polynomials method to the system of Abel integral equations. In: Abstract and Applied Analysis 2014, Hindawi (2014)
Jafarian, A., Nia, S.A.M., Golmankhaneh, A.K., Baleanu, D.: Numerical solution of linear integral equations system using the Bernstein collocation method. Adv. Differ. Equ. 2013(1), 123 (2013)
Daubechies, I.: Ten lectures on wavelets.CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 61. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (1992). https://doi.org/10.1137/1.9781611970104
Gu, J.S., Jiang, W.S.: The Haar wavelets operational matrix of integration. Int. J. Syst. Sci. 27, 623–628 (1996)
Giraud, L., Langou, J., Rozloznik, M.: The loss of orthogonality in the Gram-Schmidt orthogonalization process. Comput. Math. Appl. 50(7), 1069–1075 (2005)
Yousefi, S.A.: B-polynomial multiwavelets approach for the solution of Abel’s integral equation. Int. J. Comput. Math. 87(2), 310–316 (2010)
Pandey, S., Dixit, S., Verma, S.R.: New stable numerical inversion of generalized Abel integral equation. In: Deep, K., Jain, M., Salhi, S. (eds.) Logistics, Supply Chain and Financial Predictive Analytics. Asset Analytics (Performance and Safety Management). Springer, Singapore (2019)
Singh, V.K., Postnikov, E.B.: Operational matrix approach for solution of integro-differential equations arising in theory of anomalous relaxation processes in vicinity of singular point. Appl. Math. Model. 37(10–11), 6609–6616 (2013)
Dixit, S., Singh, O.P., Kumar, S.: A stable numerical inversion of generalized Abelʼs integral equation. Appl. Numer. Math. 62(5), 567–579 (2012)
Alpert, B.K.: A class of bases in L2 for the sparse representation of integral operators. SIAM J. Math. Anal. 24(1), 246–262 (1993)
Nemati, S.: Numerical solution of Volterra-Fredholm integral equations using Legendre collocation method. J. Comput. Appl. Math. 278, 29–36 (2015)
Acknowledgements
We would like to thank anonymous reviewers whose critical comments and valuable suggestions helped for improvement of the manuscript. The first author Shweta Pandey is working as a Ph.D. Scholar under the guidance of Dr. S. R. Verma Assistant Professor, Department of Mathematics and Statistics, Gurukula Kangri Vishwavidyalaya, Haridwar and thankful to him for all his support and guidance.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix 1: Gram–Schmidt process for finding Orthonormal Bernstein Polynomials
The Bernstein polynomial of degree N is \( B_{i,\,N} (y) \)
-
Step 1\( b_{0} (y): = \frac{B0,N(y)}{{\left\| {B_{0,N} (y)} \right\|}} \)
-
Step 2 For i = 1 to N
$$ C_{i,N} (y): = B_{i,N} (y) - \frac{{\langle Bi,N(y),C_{i - 1,N} (y)\rangle }}{{\left\| {C_{i - 1,N} (y)} \right\|}}*C_{i - 1,N} (y) - \frac{{\langle B_{i,N} (y),C_{i - 2,N} (y)\rangle }}{{\left\| {C_{i - 2,N} (y)} \right\|}}*C_{i - 2,N} (y) \cdots - \frac{{\langle B_{i,N} (y),B_{0,N} (y)\rangle }}{{\left\| {B_{0,N} (y)} \right\|}}*B_{0,N} (y) $$ -
Step 3\( b_{i} (y): = \frac{{C_{i,N} (y)}}{{\left\| {C_{i,N} (y)} \right\|}} \)
bi(y) is the required Bernstein polynomial. Here, 〈p(y), q(y)〉represents the inner product of p(y) and q(y) in the Hilbert space L2(R) and ‖ξ(y)‖ is the L2 norm of the given function ξ(y).
Appendix 2: Algorithm for the numerical method
-
1.
Obtain the orthonormalized version bn(u) of Bernstein polynomials Bi,n(u).
-
2.
Evaluate ψmn(u) on the interval [0, 1) using bn(u).
-
3.
Manipulate operational matrices W1and W2.
-
4.
Find determinant \( \left( {W_{1} + W_{2} } \right) \) and determinant \( \left( {W_{1} - W_{2} } \right) \), if it is nonzero then we proceed further and go to step 5 otherwise the solution ɛ1(u) and ɛ2(u) cannot be computed.
-
5.
Manipulate matrices \( F_{1}^{T} \) and \( F_{2}^{T} \).
-
6.
Calculate values of \( C_{1}^{T} \) and \( C_{2}^{T} \) for different cases accordingly
In general case
$$ \begin{aligned} C_{1}^{T} &= \left[ {F_{1}^{T} \omega_{2} (s)W_{1} - F_{2}^{T} \mathop \rho \nolimits_{2} (s)W_{2} } \right] \\ &\quad \times\left[ {\mathop \rho \nolimits_{1} (s)W_{1} \omega_{2} (s)W_{1} - \mathop \rho \nolimits_{2} (s)W_{2} \omega_{1} (s)W_{2} } \right]^{ - 1} , \\ C_{2}^{T} &= \left[ {F_{2}^{T} \mathop \rho \nolimits_{1} (s)W_{1} - F_{1}^{T} \omega_{1} (s)W_{2} } \right]\\ &\quad \times\left[ {\mathop \rho \nolimits_{1} (s)W_{1} \omega_{2} (s)W_{1} - \mathop \rho \nolimits_{2} (s)W_{2} \omega_{1} (s)W_{2} } \right]^{ - 1} \\ \end{aligned} $$For particular case (i) when \( \mathop \rho \nolimits_{1} (s) = \mathop \omega \nolimits_{2} (s) \) and \( \mathop \rho \nolimits_{2} (s) = \mathop \omega \nolimits_{1} (s) \),
$$ \begin{aligned} C_{1}^{T} =& \frac{1}{2}\left[ {[F_{1} + F_{2} ]^{T} \left[ {\mathop \rho \nolimits_{1} (s)W_{1} + \mathop \rho \nolimits_{2} (s)W_{2} } \right]^{ - 1} }\right.\\ & \left.{+ [F_{1} - F_{2} ]^{T} \left[ {\mathop \omega \nolimits_{2} (s)W_{1} - \mathop \omega \nolimits_{1} (s)W_{2} } \right]^{ - 1} } \right], \\ C_{2}^{T} =& \frac{1}{2}\left[ {[F_{1} + F_{2} ]^{T} \left[ {\mathop \rho \nolimits_{1} (s)W_{1} + \mathop \rho \nolimits_{2} (s)W_{2} } \right]^{ - 1}}\right.\\ &\left.{ - [F_{1} - F_{2} ]^{T} \left[ {\mathop \omega \nolimits_{2} (s)W_{1} - \mathop \omega \nolimits_{1} (s)W_{2} } \right]^{ - 1} } \right] \\ \end{aligned} $$For particular case (ii) when \( \mathop \rho \nolimits_{1} (s) = \mathop \rho \nolimits_{2} (s) = \mathop \omega \nolimits_{1} (s) = \mathop \omega \nolimits_{2} (s) = 1 \),
$$ \begin{aligned} & C_{1}^{T} = \frac{1}{2}\left[ {[F_{1} + F_{2} ]^{T} \left[ {W_{1} + W_{2} } \right]^{ - 1} + [F_{1} - F_{2} ]^{T} \left[ {W_{1} - W_{2} } \right]^{ - 1} } \right], \\ & C_{2}^{T} = \frac{1}{2}\left[ {[F_{1} + F_{2} ]^{T} \left[ {W_{1} + W_{2} } \right]^{ - 1} - [F_{1} - F_{2} ]^{T} \left[ {W_{1} - W_{2} } \right]^{ - 1} } \right]. \\ \end{aligned} $$ -
7.
Put values of \( C_{1}^{T} \) and \( C_{2}^{T} \) from step 6 to get the desired solution is \( \varepsilon_{1} (u) = C_{1}^{T} \varPsi (u);\,\,\varepsilon_{2} (u) = C_{2}^{T} \varPsi (u). \)
Rights and permissions
About this article
Cite this article
Pandey, S., Dixit, S. & Verma, S.R. An efficient solution of system of generalized Abel integral equations using Bernstein polynomials wavelet bases. Math Sci 14, 279–291 (2020). https://doi.org/10.1007/s40096-020-00342-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40096-020-00342-9