Next Article in Journal
Application of the SSA for Optimal Reactive Power Compensation in Radial and Meshed Distribution Using D-STATCOMs
Previous Article in Journal
Reasoning about Confidence in Goal Satisfaction
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On an Optimal Quadrature Formula in a Hilbert Space of Periodic Functions

by
Kholmat Shadimetov
1,2,
Abdullo Hayotov
2,3,* and
Botir Abdikayimov
1
1
Department of Informatics and Computer Graphycs, Tashkent State Transport University, 1, Odilkhodjaev Str., Tashkent 100167, Uzbekistan
2
V. I. Romanovskiy Institute of Mathematics, Uzbekistan Academy of Sciences, 4b, University Str., Tashkent 100174, Uzbekistan
3
Department of Computational Mathematics and Information Systems, National University of Uzbekistan named after M.Ulugbek, 4, University Str., Tashkent 100174, Uzbekistan
*
Author to whom correspondence should be addressed.
Algorithms 2022, 15(10), 344; https://doi.org/10.3390/a15100344
Submission received: 23 July 2022 / Revised: 18 September 2022 / Accepted: 19 September 2022 / Published: 24 September 2022

Abstract

:
The present work is devoted to the construction of optimal quadrature formulas for the approximate calculation of the integrals 0 2 π e i ω x φ ( x ) d x in the Sobolev space H ˜ 2 m . Here, H ˜ 2 m is the Hilbert space of periodic and complex-valued functions whose m-th generalized derivatives are square-integrable. Here, firstly, in order to obtain an upper bound for the error of the quadrature formula, the norm of the error functional is calculated. For this, the extremal function of the considered quadrature formula is used. By minimizing the norm of the error functional with respect to the coefficients, an optimal quadrature formula is then obtained. Using the explicit form of the optimal coefficients, the norm of the error functional of the optimal quadrature formula is calculated. The convergence of the constructed optimal quadrature formula is investigated, and it is shown that the rate of convergence of the optimal quadrature formula is O ( h m ) for | ω | < N and O ( | ω | m ) for | ω | N . Finally, we present numerical results of comparison for absolute errors of the optimal quadrature formula with the exp ( i ω x ) weight in the case m = 2 and the Midpoint formula. There, one can see the advantage of the optimal quadrature formulas.

1. Introduction and Statement of the Problem

Approximate calculation of the integral
0 2 π exp ( i ω x ) φ ( x ) d x ,
where ω is an integer and i 2 = 1 , plays an important role in computational mathematics. It is well-known that numerical calculation of such integrals encounters difficulties for large values of ω because the integrand oscillates strongly. Computation of the integral (1) are often done by the Filon method [1]. The Filon method reminds us of the Simpson quadrature formula. However, while in the Simpson method the entire integrand is replaced by a parabola, in the Filon method, only the function φ ( x ) is replaced by a parabola. This way Filon obtained the quadrature formula with coefficients depending on ω [1].
Various aspects of the calculation of the integral (1) are discussed in a number of papers [2,3,4,5,6,7,8,9,10,11,12,13,14,15,16], where there are fairly complete bibliographies.
In the present work, combining S.L. Sobolev’s and I. Babuška’s methods for the approximate computation of the integral (1), an optimal quadrature formula is constructed, and the square of the norm for the error functional of the obtained optimal quadrature formula is evaluated in a certain Hilbert space.
Suppose H ˜ 2 m , m 1 is the Hilbert space of 2 π -periodic, complex-valued functions φ x , < x < , which are square-integrable with the mth generalized derivative. Every element of the space H ˜ 2 m is a class of such functions that differ from each other by a constant term, and the inner product of the elements in this space is defined as
f , g m = 0 2 π f ( m ) ( x ) g ( m ) ( x ) ¯ d x .
Here, the notation g ¯ is the complex conjugate to g. The norm of a function φ ( x ) in the space H ˜ 2 m is defined by
φ | H ˜ 2 m = 0 2 π φ m ( x ) φ m ¯ ( x ) 1 2 .
For φ x H ˜ 2 m , we consider a quadrature formula of the form
0 2 π exp ( i ω x ) φ x d x k = 1 N C k φ 2 π k N ,
where C k are coefficients of the quadrature formula, N = 2 , 3 , .
The error of the quadrature formula is given in the form
, φ = 0 2 π exp ( i ω x ) φ ( x ) d x k = 1 N C k φ 2 π k N = 0 2 π exp ( i ω x ) k = 1 N C k β = δ x 2 π k N 2 π β φ ( x ) d x .
Here, δ ( x ) is the Dirac delta-function,
( x ) = exp ( i ω x ) k = 1 N C k β = δ x 2 π k N 2 π β ,
is the periodic functional of the error for the quadrature formula, and ( , φ ) is the value of the error functional at φ .
The challenge in the construction of an optimal quadrature formula for the approximate calculation of the integral (1) is calculating the quantity
inf C k sup φ H ˜ 2 ( m ) ( , φ ) φ | H ˜ 2 ( m ) = ˚ | H ˜ 2 ( m ) * = ˚ ,
that is, finding a function ψ ( x ) from H ˜ 2 ( m ) for which the exact upper bound is attained, and the coefficients C k ˚ for which the exact lower bound are attained in (7).
In this case, the function ψ ( x ) is said to be the extremal for the given quadrature formula, C k ˚ values are called the the optimal coefficients for the quadrature Formula (4) in the space H ˜ 2 ( m ) , and ˚ is the norm for the error functional of the optimal quadrature formula.
It should be noted that H ˜ 2 ( m ) * is the conjugate space to the space H ˜ 2 ( m ) , and it consists of all periodic functionals that are orthogonal to the unity, i.e.,
, 1 = 0 .
The remaining part of the paper is organized as follows. In Section 2, we present the main results; i.e., we obtain the extremal function, the analytic expressions for the optimal coefficients, and the norm of the error functional for the optimal quadrature formula of the form (4). Further, in Section 3, Section 4, Section 5 and Section 6, we provide proofs of the main results.

2. Main Results

The central results of the present paper are the following.
Theorem 1.
The extremal function of the periodic error functional ℓ for the quadrature Formula (4) has the form
ψ ( x ) = exp ( i ω x ) ω 2 m k = 1 N C ¯ k β 0 exp ( i β x 2 π k N ) 2 π β 2 m + ν .
Here, C ¯ k are complex conjugate to the coefficients C k of the quadrature Formula (4), and ν is an unknown number.
Theorem 2.
If φ ( x ) H ˜ 2 ( m ) , then, for the optimal coefficients of the quadrature Formula (4) with the error functional (6), the following formula holds
C k ˚ = 2 π N sin π ω N π ω N 2 m ( 2 m 1 ) ! · exp ( 2 π i ω k N ) 2 n = 0 m 2 a n ( 2 m 2 ) cos ( 2 π ( m 1 n ) ω N ) + a m 1 ( 2 m 2 ) , k = 1 , 2 , , N .
In the last formula, the a n ( 2 m 2 ) values are the coefficients of the Euler–Frobenius polynomial E 2 m 2 ( x ) of degree ( 2 m 2 ) and are defined as follows:
a n ( 2 m 2 ) = j = 0 n ( 1 ) j 2 m j n + 1 j 2 m 1 , 2 m j = ( 2 m ) ! ( 2 m j ) ! j ! .
Theorem 3.
In the space H ˜ 2 ( m ) , the square of the norm of the error functional ( x ) for the optimal quadrature formula of the form (4) has the following expression:
˚ | H ˜ 2 ( m ) * 2 = 2 π ω 2 m 1 sin π ω N π ω N 2 m ( 2 m 1 ) ! 2 n = 0 m 2 a n ( 2 m 2 ) cos ( m 1 n ) ω N + a m 1 ( 2 m 2 ) .
Hence, in particular, we obtain the following.
Remark 1.
For ω = 0 , we have the well-known optimal quadrature formula, which is the following rectangular formula
0 2 π φ ( x ) d x 2 π N k = 1 N φ 2 π k N .
Moreover, for the norm of the error functiona, we obtain
˚ | H ˜ 2 ( m ) * 2 = 2 π N 2 m B 2 m ( 2 m ) ! ,
where B 2 m is the Bernoulli number.
Remark 2.
If ω is a multiple for the number N of the nodes of the quadrature formula, i.e., ω = N p , p = ± 1 , ± 2 , , then
C k ˚ = 0 , k = 1 , 2 , , N
and
˚ | H ˜ 2 ( m ) * 2 = 2 π ω 2 m .
Remark 3.
Calculations show that
n = 0 2 m 2 a n ( 2 m 2 ) = ( 2 m 1 ) ! ,
where a n ( 2 m 2 ) values are the coefficients of the Euler–Frobenius polynomial of degree ( 2 m 2 ) .

3. The Extremal Function to the Error Functional for the Quadrature Formula (4)

In order to find an explicit form of the norm for the error functional ( x ) , we use an extremal function of the given functional, i.e., a function ψ ( x ) for which the following holds:
, ψ = | H ˜ 2 ( m ) * · ψ | H ˜ 2 ( m ) .
Proof of Theorem 1. 
The idea of the proof is as follows. Using the Formula (2) and applying the Riesz theorem for the error functional , we find an explicit expression for by a new function ψ , which is an element of the space H ˜ 2 ( m ) . It is easy to see that the function ψ is related to the error functional by the following differential equation:
ψ ( 2 m ) ( x ) ¯ = ( 1 ) m exp ( i ω x ) k = 1 N C k β = δ x 2 π k N 2 π β .
Indeed, by the definition of the inner product, we have
( , φ ) = 0 2 π ψ ( m ) ( x ) ¯ φ ( m ) ( x ) d x .
Integrating by parts the right-hand side of (14) and taking into account that a function φ ( x ) is infinitely differentiable and finite, i.e., φ ( x ) C ˚ ( ) , we obtain
( , φ ) = ( 1 ) m 0 2 π d 2 m ψ ( x ) ¯ d x 2 m φ ( x ) d x .
On the other hand, by definition of the error functional ( x ) , we have
( , φ ) = 0 2 π exp ( i ω x ) k = 1 N C k β = δ x 2 π k N 2 π β φ ( x ) d x .
Placing (16) on the left-hand side of (15), we find (13). Since the space of the infinity differentiable and finite functions is dense in the space H ˜ 2 ( m ) , i.e., any function φ ( x ) from H ˜ 2 ( m ) can be approximated with arbitrary high accuracy by a sequence of the functions from the space C ˚ ( ) , it follows that a periodic solution of Equation (13) is the extremal function ψ of the error functional for the quadrature Formula (4) and ψ H ˜ 2 ( m ) .
Further, we find a periodic solution of Equation (13). In order to solve this equation, we use the Fourier transforms. For this, we provide some useful formulas:
F [ φ ] ( p ) = exp ( 2 π i p x ) φ ( x ) d x ,
F 1 [ φ ] ( x ) = exp ( 2 π i p x ) φ ( p ) d p ,
F 1 [ F [ φ ] ] = φ ( x ) ,
F [ φ ( n ) ( x ) ] = ( 2 π i p ) n F [ φ ] ,
F [ ϕ 0 ( x ) ] = ϕ 0 ( p ) , ϕ 0 ( x ) = β = δ ( x β ) .
Applying the Fourier transform to both sides of Equation (13), we obtain
F d 2 m ψ x ¯ d x 2 m = 1 m F exp i ω x F [ T ( x ) ] ,
where
T ( x ) = k = 1 N C k β δ x 2 π k N 2 π β .
By virtue of the Formula (20), we have
F d 2 m ψ x ¯ d x 2 m = 2 π i p 2 m F ψ x .
Now, using the definition of the Fourier transform, i.e., Formula (17), we directly obtain
F exp i ω x = δ p + ω 2 π .
Applying the Fourier transform defined by Formula (17) to both sides of (23), we find
F T ( x ) = k = 1 N C k F δ x 2 π k N 2 π β = k = 1 N C k exp 2 π i p x β = δ x 2 π k N 2 π β d x .
Using the known properties of the delta-function, we have
δ x 2 π k N 2 π β = 1 2 π δ N x 2 π k 2 π N β
and introducing the notation y = N x 2 π k 2 π N and using the Formula (21), we rewrite Equality (26) in the form
F T ( x ) = k = 1 N C k exp 2 π i p 2 π y + 2 π k N β = δ y β d y = k = 1 N C k exp 2 π i p 2 π k N exp 2 π i 2 π p y β = δ y β d y = k = 1 N C k exp 2 π i p 2 π k N β = δ 2 π p β .
Now, from (22), (24), (25) and (27), it immediately follows that
2 π i p 2 m F ψ ¯ ( x ) = ( 1 ) m δ p + ω 2 π k = 1 N C k exp 2 π i p 2 π k N β = δ 2 π p β .
The right-hand side of (28) is equal to 0 at p = 0 , since, in virtue of (8), the singularities
δ p + ω 2 π a n d k = 1 N C k exp 2 π i p 2 π k N β = δ 2 π p β
are mutually canceled.
Therefore, we can divide both sides of Equation (28) by 2 π i p 2 m . This division is not uniquely defined. For Equation (28), the function F [ ψ ¯ ] is defined up to the term of the form ν δ ( p ) . Taking into account the aforementioned as well as the properties of the delta-function, we obtain
F [ ψ ¯ ] = δ p + ω 2 π 2 π p 2 m k = 1 N C k exp 2 π 2 i p k N β 0 δ 2 π p β 2 π p 2 m = δ p + ω 2 π ω 2 m k = 1 N C k β 0 exp 2 π i β k N δ p β 2 π 2 π β 2 m + ν δ ( p ) .
Applying the inverse Fourier transform to both sides of Equation (29) and using Formulas (18) and (19), after some calculations, we have
ψ ¯ ( x ) = exp i ω x ω 2 m k = 1 N C k β 0 exp i β 2 π k N x 2 π β 2 m + ν .
From (30), it follows that
ψ ( x ) = exp i ω x ω 2 m k = 1 N C ¯ k β 0 exp i β 2 π k N x ( 2 π β ) 2 m + ν .
Theorem 1 is completely proved. □
Now, we give an important theorem on zeros of the extremal function which is due to I. Babuška. This theorem was proved in the language of functional analysis (see, for example [17,18]).
Theorem 4
(I. Babuška). Suppose the error functional , φ
(a) 
is defined on the space H ˜ 2 m —i.e., its value at constant is zero—and
(b) 
is optimal; i.e., among all functionals of the form
( x ) = exp ( i ω x ) k = 1 N C k β = δ x 2 π k N 2 π β
with given system of nodes, it has the lowest norm in H ˜ 2 m * .
Then there exists a solution ψ x of the equation
d 2 m ψ x d x 2 m ¯ = 1 m x ,
which is zero at points 2 π k N and belongs to H ˜ 2 m .

4. The Square of the Error Functional of the Quadrature Formula (4)

It is easy to proof Babuška’s theorem also by algebraic way. For the sake of completeness, we give this proof here as well. A quadrature formula with the error functional ( x ) in the space H ˜ 2 ( m ) can be characterized by two manners. From one side, this quadrature formula is defined by coefficients C k , k , = 1 , 2 , . . . , N , under the condition
( , 1 ) = 0 .
From the other side, it is defined by the extremal function ψ ( x ) of the quadrature formula. The square of the norm for the error functional of the quadrature formula is expressed by the bilinear form with respect to coefficients of the formula and values of the extremal function. Indeed, since H ˜ 2 ( m ) is a Hilbert space, we have
| H ˜ 2 ( m ) * 2 = ( , ψ ) = 0 2 π ψ ( m ) ( x ) ψ ( m ) ( x ) ¯ d x = ( 1 ) m 0 2 π ψ ( 2 m ) ( x ) ¯ ψ ( x ) d x ,
where ψ ( x ) is the extremal function of our quadrature formula. However,
d 2 m ψ ( x ) ¯ d x 2 m = ( 1 ) m ( x ) ,
so
| H ˜ 2 ( m ) * 2 = , ψ = 0 2 π ( x ) ψ ( x ) d x .
Using Formulas (6), (9), and (33), we have
| H ˜ 2 ( m ) * 2 = 0 2 π exp i ω x k = 1 N C k β = δ x 2 π k N 2 π β × exp ( i ω x ) ω 2 m k = 1 N C ¯ k β 0 exp i β x 2 π k N 2 π β 2 m + ν d x .
However, by virtue of (8), i.e., by equality k = 1 N C k = 0 , we obtain
| H ˜ 2 ( m ) * 2 = 0 2 π exp i ω x k = 1 N C k β = δ x 2 π k N 2 π β × exp ( i ω x ) ω 2 m k = 1 N C ¯ k β 0 exp i β x 2 π k N 2 π β 2 m d x = 1 ω 2 m 0 2 π exp i ω x exp i ω x d x k = 1 N C ¯ k β 0 1 2 π β 2 m
× 0 2 π exp i ω x exp i β x 2 π k N d x 1 ω 2 m k = 1 N C k × exp 2 π i ω k N + k = 1 N k = 1 N C k C ¯ k β 0 exp 2 π i β N k k 2 π β 2 m .
Simple calculations show that
1 ω 2 m 0 2 π exp i ω x exp i ω x d x = 2 π ω 2 m .
By virtue of
0 2 π exp ( i ( ω + β ) x ) d x = 0 , i f ω + β 0 , 2 π , i f ω + β = 0
it follows that
β 0 1 2 π β 2 m 0 2 π exp ( i ω x ) exp ( i β ( x 2 π k N ) ) d x
= β 0 exp 2 π k i β N 2 π β 2 m 0 2 π exp i ω + β x d x = 2 π ω 2 m exp 2 π i ω k N .
Using Equalities (34) and (35) for the square of the norm for the error functional of the quadrature formula, we obtain the following analytical expression
| H ˜ 2 ( m ) * 2 = 2 π ω 2 m 1 ω 2 m k = 1 N C ¯ k exp 2 π i ω k N 1 ω 2 m k = 1 N C k exp 2 π i ω k N + k = 1 N k = 1 N C k C ¯ k β 0 exp 2 π i β ( k k ) N 2 π β 2 m .
For finding the minimum of the square for the error functional of the quadrature formula, we apply the method of indefinite Lagrange multipliers. For this we consider the following function:
Λ ( C , C ¯ , ν )   =   | H ˜ 2 ( m ) * 2 ν ( , 1 ) .
Setting to 0 all partial derivatives by C k , C ¯ k , and ν of the function Λ ( C , C ¯ , ν ) , we have
Λ C k = 0 , k = 1 , 2 , , N , Λ C ¯ k = 0 , k = 1 , 2 , , N , Λ ν = 0 .
These give the following system of equations
Λ C k = 1 ω 2 m exp 2 π i ω k N + k = 1 N C ¯ k β 0 exp 2 π β i ( k k ) N ν = 0
for k = 1 , 2 , , N ,
Λ C ¯ k = 1 ω 2 m exp 2 π i ω k N + k = 1 N C k β 0 exp 2 π β i ( k k ) N 2 π β 2 m = 0 ,
for k = 1 , 2 , , N ,
Λ ν = k = 1 N C k = 0 .
It is not difficult to see that
Λ ¯ C ¯ k = 1 ω 2 m exp 2 π i ω k N + k = 1 N C ¯ k β 0 exp 2 π β i ( k k ) 2 π β 2 m = 0 , for   k = 1 , 2 , , N .
Taking into account (37), it follows immediately that ν = 0 .
In order to find unknown coefficients C k , it is enough to solve the systems (38) and (39). The solution of this system, which we denote by C ˚ k , k = 1 , 2 , , N and ν ˚ , is a stationary point for the function Λ ( C , ν ) . From the theory of the Lagrange method, it follows that C ˚ k values are searching values of the coefficients for the quadrature formula, k = 1 , 2 , , N . They give the conditional minimum for the square of the norm provided that (8) holds.
By virtue of condition (37), we see that the extremal function ψ ( x ) , defined by (9), vanishes at the nodes of the quadrature Formula (4), i.e., ψ 2 π k N = 0 . This proves Babuška’s theorem.
Here, we assume that the systems (38) and (39) are solvable. Its solvability follows from the general theory of the Lagrange multipliers. However, as is shown in the calculations, the matrix of the systems (38) and (39) coincides with the matrix of the system considered in [10] in the construction of optimal cubature formulas in the Sobolev space L ˜ 2 ( m ) of periodic functions. In [10], uniqueness of the set of the optimal coefficients was also proved. Hence, it immediately follows that the systems (38) and (39) have a unique solution.

5. Optimal Coefficients of the Quadrature Formula (4)

In the present section, we prove Theorem 2. In order to prove the theorem, it is enough to solve the systems (38) and (39) with respect to coefficients C k , k = 1 , 2 , , N . For a solution of this system, we search in the form
C ˚ k = C ( ω , N , m ) exp i ω 2 π k N ,
where C ( ω , N , m ) is an unknown function. We are directly convinced that C ˚ k values, defined by Formula (40), k = 1 , 2 , , N , satisfy Equality (39). Substituting (40) into (38), we obtain
1 ω 2 m exp 2 π i ω k N + C ( ω , N , m ) k = 1 N exp i ω 2 π k N β 0 exp 2 π i β ( k k ) N 2 π β 2 m = 0 .
We introduce the following notation:
z = C ( ω , N , m ) β 0 exp 2 π i β k N 2 π β 2 m k = 1 N exp 2 π i k N ( ω + β ) .
It is clear that
k = 1 N exp 2 π i k N ( ω + β ) = 0 , if   ω + β N   is   not   integer , N , if   ω + β N   is   integer .
Therefore, denoting t = ω + β N and then β = t N ω , we rewrite (42) in the form
z = N 2 π C ( ω , N , m ) exp 2 π i ( t N ω ) k N t = 1 ( t N ω ) 2 m = N 2 π C ( ω , N , m ) exp 2 π i ω k N t = 1 ( t N ω ) 2 m .
From (41)–(43), it follows that
N 2 π C ( ω , N , m ) exp 2 π i ω k N t = 1 ( t N ω ) 2 m 1 ω 2 m exp 2 π i k ω N = 0 , k = 1 , 2 , , N .
Hence, we have
1 ω 2 m exp 2 π i ω k N N 2 π C ( ω , N , m ) t = 1 ( 1 t N ω ) 2 m 1 = 0 , k = 1 , 2 , , N .
From the uniqueness of the solution for the systems (38) and (39), we obtain
C ( ω , N , m )   =   2 π N t = 1 ( 1 t N ω ) 2 m 1 .
Hence, we directly obtain
C ( ω , N , m )   =   2 π N N ω 2 m t = 1 ( t ω N ) 2 m 1 .
We now refer to calculations of
f ( z )   =   t = 1 ( t z ) 2 m 1 .
As is known [11],
t = 1 ( z t ) 2   =   π sin ( π z ) 2 .
Taking the derivative of order 2 m 2 with respect to z from both sides of (46) and taking (45) into account, we obtain
1 f ( z )   =   1 ( 2 m 1 ) ! d 2 m 2 d z 2 m 2 π sin ( π z ) 2 .
Now we calculate d 2 m 2 d z 2 m 2 π sin ( π z ) 2 . For this, we use Euler’s known formula
sin ( π z )   =   exp ( 2 π i x ) 1 2 i exp ( π i z )
Denoting λ : = exp ( 2 π i z ) , we have
d d z = d λ d z d d λ , d d z = 2 π i λ d d λ ,
d 2 m 2 d z 2 m 2 = ( 2 π i ) 2 m 2 D 2 m 2 ,
where D = λ d d λ , and D 2 m 2 = λ d d λ D 2 m 3 .
Consequently,
1 f ( z )   =   ( 2 π i ) 2 m ( 2 m 1 ) ! D 2 m 2 λ ( 1 λ ) 2 .
Hence, as is known (see, for example, [18]), the Euler–Frobenius polynomial is defined by the formula
λ E 2 m 2 λ = 1 λ 2 m D 2 m 2 λ 1 λ 2
and
E 2 m 2 λ = n = 0 2 m 2 a n 2 m 2 λ n ,
where
a n ( 2 m 2 ) = ( n + 1 ) 2 m 1 2 m 1 n 2 m 1 + 2 m 2 ( n 1 ) 2 m 1 ( 1 ) n 2 m n , a n ( 2 m 2 ) = a 2 m 2 n ( 2 m 2 ) .
From (48), we have
D 2 m 2 λ 1 λ 2 = λ E 2 m 2 λ 1 λ 2 m .
By virtue of (49) and (47), Equality (45) takes the form
f z = 1 m 1 λ 2 m 2 m 1 ! 2 π 2 m λ E 2 m 2 λ .
Using the formula
sin 2 π z = 1 λ 2 2 i λ ,
after some calculations, we obtain
f ( z ) = sin 2 m π z π 2 m · λ m 1 2 m 1 ! E 2 m 2 λ .
By virtue of symmetry for the coefficients of Euler’s polynomial, we have
f z = sin π z π 2 m λ m 1 2 m 1 ! n = 0 2 m 2 a n 2 m 2 λ 2 m 2 n = sin π z π 2 m 2 m 1 ! n = 0 m 2 a n 2 m 2 λ m 1 n = sin π z π 2 m 2 m 1 ! 2 n = 0 m 2 a n 2 m 2 λ m 1 n + λ n + 1 m + a m 1 2 m 2 = sin π z π 2 m 2 m 1 ! 2 n = 0 m 2 a n 2 m 2 cos 2 π m 1 n z + a m 1 2 m 2 .
Accordingly, from (50), (44), and (45), we obtain
C ω , N , m = 2 π N sin π ω N π ω N 2 m · 2 m 1 ! 2 n = 0 m 2 a n 2 m 2 cos 2 π m 1 n ω N + a m 1 2 m 2 .
From (40) and (53), the statement of Theorem 2 follows; i.e., the optimal coefficients of the quadrature Formula (4) have the form
C ˚ k = 2 π N sin π ω N π ω N 2 m · 2 m 1 ! exp 2 π i ω k N 2 n = 0 m 2 a n 2 m 2 cos 2 π m 1 n ω N + a m 1 2 m 2 , k = 1 , 2 , , N .

6. The Norm for the Error Functional of the Optimal Quadrature Formula

Here, we present the proof of Theorem 3. For this, we simplify the expression (36) as follows:
˚ | H ˜ 2 m * 2 = 2 π ω 2 m 1 ω 2 m k = 1 N C ¯ ˚ k exp 2 π i k ω N 1 ω 2 m k = 1 N C ˚ k exp 2 π i k ω N + k = 1 N k = 1 N C ˚ k C ¯ ˚ k β 0 exp 2 π i β ( k k ) N 2 π β 2 m = 2 π ω 2 m k = 1 N C ¯ ˚ k × 1 ω 2 m exp 2 π i k ω N k = 1 N C ˚ k β 0 exp 2 π i β ( k k ) N 2 π β 2 m 1 ω 2 m k = 1 N C ˚ k exp 2 π i ω k N .
Hence, taking (38) into account for the square of the norm, we obtain
˚ | H ˜ 2 m * 2 = 2 π ω 2 m 1 ω 2 m k = 1 N C ˚ k exp 2 π i ω k N .
Then, using the analytic expressions of the optimal coefficients, i.e., by the Formula (52), we obtain
˚ | H ˜ 2 m * 2 = 2 π ω 2 m 2 π N ω 2 m k = 1 N sin π ω N π ω N 2 m × 2 m 1 ! exp 2 π i k ω N exp 2 π i k ω N 2 n = 0 m 2 a n 2 m 2 cos 2 π m 1 n ω N + a m 1 2 m 2 .
Provided that exp 2 π i k ω N exp 2 π i k ω N = 1 and k = 1 N 1 = N , for the square of the norm, we finally obtain
˚ | H ˜ 2 m * 2   =   2 π ω 2 m 1 sin π ω N π ω N 2 m 2 m 1 ! 2 n = 0 m 2 a n 2 m 2 cos 2 π m 1 n ω N + a m 1 2 m 2 .
Theorem 3 is completely proved.
Now, we give the square of the norm of the error functional for the several first values of m for ω < N .
If m = 1 , then
˚ | H ˜ 2 ( 1 ) * 2   =   π 3 2 π N 2 ω 2 180 2 π N 4 + O 2 π N 6 .
Now let m = 2 . It follows that
˚ | H ˜ 2 ( 2 ) * 2   =   π cos 2 π ω N + 2 1 5 ! 2 π N 4 + 3 ω 2 7 ! 2 π N 6 + O 2 π N 8 .
It is easy to see that, for N and ω < N ,
sin π ω N π ω N 2 m 1 and 2 n = 0 m 2 a n ( 2 m 2 ) cos 2 π m 1 n ω N + a m 1 ( 2 m 2 ) 2 n = 0 m 2 a n ( 2 m 2 ) + a m ( 2 m 2 ) = ( 2 m 1 ) ! , t h e n 2 0 .
In the case ω > N and ω , we have
2 2 π ω 2 m .
From the last results, we can conclude that, for the functions from the space H ˜ 2 m , the rate of convergence of the constructed optimal quadrature formula is O ( h m ) for | ω | < N and O ( | ω | m ) for | ω | N .

7. Numerical Results

In this section, we present numerical results of comparison for absolute errors of the optimal quadrature formula of the form (4) with the exp ( i ω x ) weight in the case m = 2 and the Midpoint formula. We note that the rate of convergence for both of these formulas is O ( h 2 ) . Here we use the Maple to obtain numerical results.
As an example, we consider calculation of the integral
I = 0 2 π exp ( i ω x ) φ ( x ) d x
with φ ( x ) = e 1 x / ( 2 π ) + e x / ( 2 π ) 2 ( 1 e ) . Since for the functions φ we have the relation φ ( 0 ) = φ ( 2 π ) , we can consider it as a periodic function on the interval [ 0 , 2 π ] . For convenience, we denote the integrand as f ( x ) ; i.e., f ( x ) = exp ( i ω x ) e 1 x / ( 2 π ) + e x / ( 2 π ) 2 ( 1 e ) .
We approximately calculate the integral I by the Midpoint rule. Then approximate value for the integral (53) is then calculated as follows using the Midpoint rule
A mid = k = 1 N f x k + x k 1 2 ( x k x k 1 ) ,
where x k = k h , k = 0 , 1 , , N and h = 2 π / N .
Hence, for the function f ( x ) = exp ( i ω x ) e 1 x / ( 2 π ) + e x / ( 2 π ) 2 ( 1 e ) , the error of the Midpoint rule (54) is
I A mid = 0 2 π f ( x ) d x k = 1 N f x k + x k 1 2 ( x k x k 1 ) .
In Table 1, we give the absolute values for the real part of the error (55) of the Midpoint rule for N = 1 , 10 , 100 , 1000 and ω = 1 , 10 , 100 , 1000 .
It can be seen from the results given in Table 1 that the Midpoint rule converges for N > ω . In Figure 1, the process of this convergence is graphically shown when ω = 1 and N = 1 , 10 , 100 , 1000 for the real part of the function f ( x ) .
In Figure 2 the graphs of numerical calculation of the integral (53) by the Midpoint rule for the case ω = 1 , 10 , 100 , 1000 and N = 1 are given. Here, we can see that the Midpoint rule does not converge when ω N for the function f ( x ) .
Now, we approximate the above integral (53) using the optimal quadrature formula of the form (4) with exp ( i ω x ) weight in the case m = 2 . Then, taking into account (10), we have the approximate equality
0 2 π exp ( i ω x ) φ x d x k = 1 N C ˚ k φ 2 π k N ,
for φ ( x ) = e 1 x / ( 2 π ) + e x / ( 2 π ) 2 ( 1 e ) with the optimal coefficients
C ˚ k = 2 π N sin ( π ω N ) π ω N 4 3 exp ( 2 π i ω k N ) cos ( 2 π ω N ) + 2 , k = 1 , 2 , , N .
The approximate value for the integral (53) is calculated as follows, using the optimal quadrature formula:
A opt = k = 1 N C ˚ k e 1 k N + e k N 2 ( 1 e ) .
Hence, for the function φ ( x ) = e 1 x / ( 2 π ) + e x / ( 2 π ) 2 ( 1 e ) , the error of the optimal quadrature Formula (56) is
I A opt = 0 2 π exp ( i ω x ) e 1 x / ( 2 π ) + e x / ( 2 π ) 2 ( 1 e ) d x k = 1 N C ˚ k e 1 k N + e k N 2 ( 1 e ) .
Thus, the numerical results of Table 2 show convergence of the optimal quadrature Formula (56) for N ω and N < ω .

8. Conclusions

We obtained optimal quadrature formulas for the approximate calculation of the Fourier coefficients 0 2 π e i ω x φ ( x ) d x in Sobolev space H ˜ 2 m . Firstly, in order to obtain an upper bound for the error of the quadrature formula, the norm of the error functional was calculated. Using the extremal function of the considered quadrature formula, we calculated the norm of the error functional. We found the explicit forms of the coefficients for the optimal quadrature formula, and they provide the minimum value to the norm of the error functional. Finally, we calculated the norm of the error functional of the optimal quadrature formulas. We show that, for the functions from the space H ˜ 2 m , the rate of convergence of the constructed optimal quadrature formula is O ( h m ) for | ω | < N and O ( | ω | m ) for | ω | N . Finally, we presented numerical results of comparison for absolute errors of the constructed optimal quadrature formula in the case m = 2 and the Midpoint formula, showing the advantage of the optimal quadrature formulas.

Author Contributions

The problem of the manuscript was stated by K.S. and A.H.; proofs of the main theoretical results were obtained by K.S., A.H. and B.A.; the numerical results were obtained by B.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

The study was conducted in accordance with the Scientific program of the Computational Mathematics Laboratory of V. I. Romanovskiy Institute of Mathematics and discussed in the Scientific seminar of the Laboratiry (protocol code 7, 8 July 2022).

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

We are very thankful to the reviewers for valuable comments and remarks that have improved the quality of the paper.

Conflicts of Interest

The authors declare that they have no competing interests.

References

  1. Filon, L.N.G. On a quadrature formula for trigonometric integrals. Proc. Roy. Soc. Edinb. 1928, 49, 38–47. [Google Scholar] [CrossRef]
  2. Babuška, I. An optimal formula for computation of linear functionals. APL Mater. (Ger.) 1965, 10, 441–443. [Google Scholar]
  3. Boltaev, N.D.; Hayotov, A.R.; Shadimetov, K.M. Construction of optimal quadrature formulas for Fourier coefficients in Sobolev space L 2 ( m ) (0,1). Numer. Algorithms 2017, 74, 307–336. [Google Scholar] [CrossRef]
  4. Boltaev, N.D.; Hayotov, A.R.; Milovanović, G.V.; Shadimetov, K.M. Optimal quadrature formulas for numerical evaluation of Fourier coefficients in W 2 ( m , m 1 ) . J. Appl. Anal. Comput. 2017, 7, 1233–1266. [Google Scholar]
  5. Filin, E.A. A modification of Filon’s method of numerical integration. J. Assoc. Comput. Mach. 1960, 7, 181–184. [Google Scholar] [CrossRef]
  6. Hayotov, A.R.; Jeon, S.; Lee, C.-O. On an optimal quadrature formula for approximation of Fourier integrals in the space L 2 ( 1 ) . J. Comput. Appl. Math. 2020, 372, 112713. [Google Scholar] [CrossRef]
  7. Hayotov, A.R.; Jeon, S.; Lee, C.-O.; Shadimetov, K.M. Optimal Quadrature Formulas for Non-periodic Functions in Sobolev Space and Its Application to CT Image Reconstruction. Filomat 2021, 35, 4177–4195. [Google Scholar] [CrossRef]
  8. Hayotov, A.R.; Jeon, S.; Shadimetov, K.M. Application of optimal quadrature formulas for reconstruction of CT images. J. Comput. Appl. Math. 2021, 388, 113313. [Google Scholar] [CrossRef]
  9. Luke, Y.L. On the computation of oscillatory integrals. Proc. Camb. Phil. Soc. 1954, 50, 269–277. [Google Scholar] [CrossRef]
  10. Shadimetov, K.M. Optimal Lattice Quadrature and Cubature Formulas in the Sobolev Spaces; Fan va Texnologiya: Tashkent, Russia, 2019; 224p. [Google Scholar]
  11. Saks, S.; Zygmund, A. Analytic Functions; Monografie Matematyczne; Instytut Matematyczny Polskiej Akademii Nauk: Warsaw, Poland, 1952. [Google Scholar]
  12. Zadiraka, V.K. Theory of Computations of Fourier Transforms; Naukova Dumka: Kiev, Russia, 1988; 216p. [Google Scholar]
  13. Zhileikin, Y.M. The errors in the approximate computation of integrals of rapidly oscillating functions. Comput. Math. Math. Phys. 1971, 11, 344–348. [Google Scholar] [CrossRef]
  14. Zhileikin, Y.M.; Kukarkin, A.B. Optimal calculation of integrals of rapidly oscillating functions. Comput. Math. Math. Phys. 1978, 18, 15–21. [Google Scholar] [CrossRef]
  15. Bakhvalov, N.S. Numerical Methods; Nauka: Moscow, Russia, 1973; 632p. [Google Scholar]
  16. Babuška, I. The optimal computation of Fourier coefficients. APL Mater. (Ger.) 1966, 11, 113–123. [Google Scholar] [CrossRef]
  17. Sobolev, S.L. Introduction to the Theory of Cubature Formulas; Nauka: Moscow, Russia, 1974; 808p. [Google Scholar]
  18. Sobolev, S.L.; Vaskevich, V.L. The Theory of Cubature Formulas; Siberian Division of the Russia Academy of Sciences Novosibirsk: Novosibirsk, Russia, 1996; 484p. [Google Scholar]
Figure 1. The process of convergence for the Midpoint rule when ω = 1 and N = 1 , 10 , 100 , 1000 for the real part of the function f ( x ) .
Figure 1. The process of convergence for the Midpoint rule when ω = 1 and N = 1 , 10 , 100 , 1000 for the real part of the function f ( x ) .
Algorithms 15 00344 g001
Figure 2. The Midpoint rule does not converge when ω N for the function f ( x ) .
Figure 2. The Midpoint rule does not converge when ω N for the function f ( x ) .
Algorithms 15 00344 g002
Table 1. The absolute values for the real part of the error (55) of the Midpoint rule for N = 1 , 10 , 100 , 1000 and ω = 1 , 10 , 100 , 1000 .
Table 1. The absolute values for the real part of the error (55) of the Midpoint rule for N = 1 , 10 , 100 , 1000 and ω = 1 , 10 , 100 , 1000 .
ω = 1 ω = 10 ω = 100 ω = 1000
| I A mid | | I A mid | | I A mid | | I A mid |
N = 1 6.184049 6.027234 6.028810 6.028825
N = 10 2.709174 ( 3 ) 6.282159 6.280552 6.280552
N = 100 2.618891 ( 5 ) 2.710011 ( 5 ) 6.283175 6.283159
N = 1000 2.618003 ( 7 ) 2.618898 ( 7 ) 2.710020 ( 7 ) 6.283185
Table 2. The absolute values for the real part of the error (57) of the optimal quadrature Formula (56) for N = 1 , 10 , 100 , 1000 and ω = 1 , 10 , 100 , 1000 .
Table 2. The absolute values for the real part of the error (57) of the optimal quadrature Formula (56) for N = 1 , 10 , 100 , 1000 and ω = 1 , 10 , 100 , 1000 .
ω = 1 ω = 10 ω = 100 ω = 1000
| I A opt | | I A opt | | I A opt | | I A opt |
N = 1 1.552231 ( 1 ) 1.591146 ( 3 ) 1.591545 ( 5 ) 1.591549 ( 7 )
N = 10 5.301897 ( 3 ) 1.591146 ( 3 ) 1.591545 ( 5 ) 1.591549 ( 7 )
N = 100 5.236676 ( 5 ) 5.301920 ( 5 ) 1.591545 ( 5 ) 1.591549 ( 7 )
N = 1000 5.235995 ( 7 ) 5.236677 ( 7 ) 5.301920 ( 7 ) 1.591549 ( 7 )
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Shadimetov, K.; Hayotov, A.; Abdikayimov, B. On an Optimal Quadrature Formula in a Hilbert Space of Periodic Functions. Algorithms 2022, 15, 344. https://doi.org/10.3390/a15100344

AMA Style

Shadimetov K, Hayotov A, Abdikayimov B. On an Optimal Quadrature Formula in a Hilbert Space of Periodic Functions. Algorithms. 2022; 15(10):344. https://doi.org/10.3390/a15100344

Chicago/Turabian Style

Shadimetov, Kholmat, Abdullo Hayotov, and Botir Abdikayimov. 2022. "On an Optimal Quadrature Formula in a Hilbert Space of Periodic Functions" Algorithms 15, no. 10: 344. https://doi.org/10.3390/a15100344

APA Style

Shadimetov, K., Hayotov, A., & Abdikayimov, B. (2022). On an Optimal Quadrature Formula in a Hilbert Space of Periodic Functions. Algorithms, 15(10), 344. https://doi.org/10.3390/a15100344

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

Article Metrics

Back to TopTop