Numerical methods of the solution of the equations are universal. This is their important quality. Quadrature formulas are quite often used in the solution of the integral equations. Quadrature formulas are applied only to continuous functions. In other words, the integrable function has to have a certain value at each point. This requirement cannot be fulfilled for the class of integrable functions. In such situation the alternative version of the quadrature solution of the integral equation is possible. This work is further work [1] .

For convenience of readers in this work, fundamentals of the article [1] are repeated.

The essence of the offered algorithm is as follows. On the main segment of the integral equation the system of segments is formed and on each such segment the integral average value of function is defined.

The equation is considered

y ( x ) − ∫ a b K ( x , t ) y ( t ) d t = f ( x ) (2.1)

which has the unique solution in a class of the integrable functions.

We form on the segment [a, b] a uniform grid of N segments with a step

h = b − a N (2.2)

On the grid there is N + 1 of points. We build segments δ_i in the vicinity of each point

δ 0 = [ a , a + h 2 ] ,   δ i = [ a + h 2 ( 2 i − 1 ) , a + h 2 ( 2 i + 1 ) ] ,   i = 1 , ⋯ , N − 1 , δ N = [ b − h 2 , b ] (2.3)

We will enter concept of integral average values on these segments. They have the form or functions y(x) and f(x)

w i = 1 δ i ∫ δ i y ( x ) d x , f j = 1 δ j ∫ δ j f ( x ) d x (2.4)

Let’s provide the function y(t) under integral (2.1) in the form

y t = ∑ i = 0 N w i δ i (2.5)

where δ_i is characteristic function of the corresponding segment.

Then (2.1) receives the form

y ( x ) − ∑ i = 0 N K i ( x ) w i = f ( x ) (2.6)

where K i ( x ) = ∫ δ i K ( x , t ) d t .

Let’s carry out to (2.6) integral averaging on segments δ_j

w j − ∑ i = 1 N K j i w i = f j ,     j = 0 , ⋯ , N (2.7)

where K j i = 1 δ j ∫ δ j ∫ δ i K ( x , t ) d t d x , f j = 1 δ j ∫ δ j f ( x ) d x , j is number of the equation, i is number of item in the equation.

(2.7) is system of the equations for definition of integral average values of unknown function on system of segments (2.3).

The equation is considered

y ( x ) − ∫ 0 x K ( x , t ) y ( t ) d t = f ( x ) (3.1)

For the given h we accept the grid of segments

δ 1 = [ 0 , h 2 ] ,   δ i = [ h 2 ( 2 i − 3 ) , h 2 ( 2 i − 1 ) ] ,     i = 2 , 3 , ⋯ (3.2)

Let’s consider two grids (3.2) with steps of h and h/2. Then the system of the bisecting points of the whole segments of the first grid completely contains in a system of the bisecting points of the second grid. Thanks to it, it is possible to carry out their comparison and processing.

We accept y = w 1 δ 1 on the first step under integral in (3.1). After averaging on x of the received equation on the segment δ₁ it is possible to calculate w₁

w 1 = f 1 1 − K 1 (3.3)

where f 1 = 2 h ∫ 0 h / 2 f ( x ) d x and K 1 = 2 h ∫ 0 h / 2 ∫ 0 x K ( x , t ) d t d x .

For further calculations we introduce designations

f n = 1 h ∫ h ( 2 n − 3 ) h ( 2 n − 1 ) / 2 f ( x ) d x ,     n = 2 , 3 , ⋯ k n , 1 = 1 h ∫ h ( 2 n − 3 ) / 2 h ( 2 n − 1 ) / 2 ∫ 0 h / 2 K ( x , t ) d t d x ,     n = 2 , 3 , ⋯ K n , i = 1 h ∫ h ( 2 n − 3 ) / 2 h ( 2 n − 1 ) / 2 ∫ h ( 2 i − 3 ) / 2 h ( 2 i − 1 ) / 2 K ( x , t ) d t d x ,     n = 3 , 4 , ⋯ ,     n > i k n , n = 1 h ∫ h ( 2 n − 3 ) / 2 h ( 2 n − 1 ) / 2 ∫ h ( 2 n − 3 ) / 2 x K ( x , t ) d t d x ,     n = 2 , 3 , ⋯ (3.4)

On the second step the Equation (3.1) receives the form

w 2 − w 1 k 2 , 1 − w 2 k 2 , 2 = f 2 (3.5)

from where

w 2 = f 2 + w 1 k 2 , 1 1 − k 2 , 2 (3.6)

On the third and the subsequent steps we receive

w n = f n + w 1 k n , 1 + ∑ i = 2 n − 1 w i K n , i 1 − k n , n (3.7)

The linear change of variables transforms integrals with variable limits into integrals with constant limits

∫ c d ∫ a ( x ) b ( x ) f ( x , t ) d t d x = ∫ c d ∫ 0 1 ( b − a ) f ( x , y ( b − a ) + a ) d y d x (3.8)

which are calculated by means of the known algorithms.

In the quasiquadrature solution integral average value cannot be referred to any certain point of the segment and it is possible to accept that function is constant on each segment. Therefore, the graph of the quasiquadrature solution is step function, i.e. the histogram. It is reasonable to consider that integral average value is value in the central point of each segment and to build the graph using this assumption.

On segments where function is rather smooth, it is possible to construct algorithm for increase in accuracy of solutions. Let’s consider such segment. We will enter on this segment the new coordinate z = x − x 0 where x₀ is bisecting point of a segment. Let’s construct system of segments h_i with the general center z = 0. We assume h i + 1 < h i and h i → 0 at i → ∞ . Obviously

1 h i ∫ − h i / 2 h i / 2 y ( z ) d z → y ( 0 ) = w       at     i → ∞ (4.1)

where w is exact value of the integral average value in the vicinity of the point of z = 0.

According to Weierstrass’s theorem continuous function can be approximated arbitrary exactly by polynom and we will present on the segment h₁ the function y(z) in the form

y ( z ) = y ( 0 ) + ∑ k = 1 a k z k (4.2)

where lack of the top sign at the sum means that the remainder term is included in this sum.

Then

1 h i ∫ − h i / 2 h i / 2 y ( z ) d z = y ( 0 ) + ∑ k = 1 a 2 k 4 k ( 2 k + 1 ) h i 2 k = y ( 0 ) + ∑ k = 1 b k h i 2 k = w i (4.3)

Now (4.3) taking into account (4.1) and (4.2) it is possible to write down in the form

w − w i = ∑ k = 1 b k h i 2 k (4.4)

Expression (4.4) matches the formula (2.1) in [2] which is used for carrying out extrapolation of Richardson, and it is possible to use the results received in [2] . In [2] value w i = w i ( 0 ) is called extrapolation of the zero order. For the most important case when

h i + 1 = h i 2 (4.5)

we have the recurrence formula

w i ( j + 1 ) = 4 j + 1 w i + 1 ( j ) − w i ( j ) 4 j + 1 − 1 (4.6)

Richardson’s extrapolation is effective only at sufficient smoothness of the sought function. However, there is no need to conduct special research of smoothness of function: from the extrapolation table and derivative tables [2] will automatically be defined to what order of extrapolation is effective.

The equation is considered

y ( x ) − ∫ 0 1 | t − x | y ( t ) d t = 1 x − x π 2 − x ln x 2 − 1 − x + 1 2 x ln ( 2 − x + 2 1 − x ) (5.1)

which has the exact solution y = 1 x .

Results of the quasiquadrature solution of this equation are presented in Table 1.

In Table 1 y₀ and y_N are the integral average values calculated according to the exact solution.

Let’s make some analysis of the received solution. We see that the function y(x) grows at approach to a point x = 0. We will assume that this growth has power character. Specifically: we will assume that in the vicinity of a point x = 0 function has form p + q x n . Then

2 h ∫ 0 h / 2 ( p + q x n ) d x = p + q h n ( n + 1 ) 2 n = p + q 2 n ( n + 1 ) N n (5.2)

For definition of unknown p q and n we equate the received expression to three values from Table 1

p + q 2 n ( n + 1 ) 160 n = w 0 ( 160 ) = 35.777063 p + q 2 n ( n + 1 ) 240 n = w 0 ( 240 ) = 43.817803 p + q 2 n ( n + 1 ) 320 n = w 0 ( 320 ) = 50.596448 (5.3)

The solution of system (5.3) gives (after rounding) n = − 0.5 , p = 0 , q = 1 . This solution correctly defines behavior of function y(x).

The equation is considered

y ( x ) − ∫ 0 x y ( t ) d t x − t = x − x π 2 (6.1)

which has the exact solution y = x .

Results of the quasiquadrature solution of this equation are presented in Table 2.

In Table 2 y₀ and y_N are the integral average values calculated according to the exact solution. Using a formula (5.2) it is also possible to carry out the analysis at vicinity of a point of x = 0.

The presented work and work [2] liquidate the last gaps in the field of quadrature solutions of linear integral equations of the second kind.

The author declares no conflicts of interest regarding the publication of this paper.

Dobrovolsky, I.P. (2020) Quasiquadrature Solution of the Linear Integral Equations of the Second Kind in the Class of Integrable Functions. Open Access Library Journal, 7: e6069. https://doi.org/10.4236/oalib.1106069