Next Article in Journal
Design and Real-Time Implementation of a Cascaded Model Predictive Control Architecture for Unmanned Aerial Vehicles
Previous Article in Journal
Optimizing Cross-Dock Terminal Location Selection: A Multi-Step Approach Based on CI-DEA–IDOCRIW–MABAC for Enhanced Supply Chain Efficiency—A Case Study
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Weighted Optimal Formulas for Approximate Integration

by
Kholmat Shadimetov
1,2,* and
Ikrom Jalolov
1
1
Department of Informatics and Computer Graphics, Tashkent State Transport University, 1 Odilkhodjayev Str., Tashkent 100167, Uzbekistan
2
Computational Mathematics Laboratory, V.I. Romanovskiy Institute of Mathematics, Uzbekistan Academy of Sciences, 9 University Str., Tashkent 100174, Uzbekistan
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(5), 738; https://doi.org/10.3390/math12050738
Submission received: 17 January 2024 / Revised: 19 February 2024 / Accepted: 26 February 2024 / Published: 29 February 2024

Abstract

:
Solutions to problems arising from much scientific and applied research conducted at the world level lead to integral and differential equations. They are approximately solved, mainly using quadrature, cubature, and difference formulas. Therefore, in the current work, we consider a discrete analogue of the differential operator 1 1 2 π 2 d 2 d x 2 m in the Hilbert space H 2 μ R , called D m β . We modify the Sobolev algorithm to construct optimal quadrature formulas using a discrete operator. We provide a weighted optimal quadrature formula, using this algorithm for the case where m = 1 . Finally, we construct an optimal quadrature formula in the Hilbert space H 2 μ R for the weight functions p x = 1 and p x = e 2 π i ω x when m = 1 .

1. Introduction and Problem Statement

Numerical integration formulas, also known as quadrature and cubature formulas, are used to calculate definite integrals approximately. They are handy for integrals where the antiderivative of the integrand cannot be expressed through elementary functions or when the integrand is only available at discrete points, such as from experimental data. Furthermore, quadrature formulas are a fundamental tool for numerically solving differential and integral equations.
In the field of quadrature theory, several methods are available to calculate integrals roughly using a finite number of integrand values. These methods include the spline method [1,2,3], the φ -function method (as seen in [4,5,6,7,8,9]) and the Sobolev method [10,11,12,13]. Many authors have studied the Sard problem using these methods in different spaces (refer to [14,15,16,17,18,19,20,21,22] and the related literature).
It is worth mentioning that S.L. Sobolev studied the problem of minimizing the norm of the error functional of cubature formulas with regards to coefficients in space L 2 ( m ) ( R n ) . He solved this problem by reducing it to a system of difference equations of the Wiener–Hopf type. As a result, he proved the existence and uniqueness of a solution to this system (see [10,11,12,13]). In addition, he described a specific analytical algorithm for finding optimal coefficients in [10]. To complete this, he defined and studied a discrete analogue D h H ( m ) β of the polyharmonic operator Δ m .
The problem of the construction of the discrete operator D h H ( m ) β in an n-dimensional case is complicated and remains an open problem. In the one-dimensional case, Z. Z. Zhamalov and K. M. Shadimetov [23] considered a discrete analogue D h ( m ) β of the differential operator d 2 m d E 2 m . In the work [24], it was possible to construct a discrete analogue of the differential operator d 2 m d E 2 m + 2 ω 2 d 2 m 2 d E 2 m 2 + ω 4 d 2 m 4 d E 2 m 4 . Furthermore, in the works [25,26], discrete analogues of differential operators d 2 m d x 2 m 1 (for odd m) and d 2 m d x 2 m + 2 d 2 m 2 d x 2 m 2 + 1 (if even m) were created, and their properties were studied.
M.D. Ramazanov [27] constructed optimal cubature formulas in their work. The author studied the spaces of functions W 2 μ , which are obtained by completing the finite Fourier series
f x = k f k e 2 π i k x
in the following norm:
f W 2 μ = k f k μ 2 π i k 2 1 / 2 .
In the work of M.D. Ramazanov and Kh.M. Shadimetov [28], optimal cubature formulas were constructed in the space L 2 m ˜ H .
In the current work, we study Sard’s problem of constructing optimal quadrature formulas in a Hilbert space.
Definition 1. 
Space H 2 μ R is defined as the closure of infinitely differentiable functions defined in R and decreasing to infinity faster than any negative degree in the
f ( x ) H 2 μ R = F 1 ( 1 + y 2 ) m / 2 · F f ( x ) ( y ) 2 d x 1 / 2 .
Here, F and F 1 are direct and inverse Fourier transforms
F f ( x ) ( y ) = f ( x ) e 2 π i y x d x
and
F 1 f ( x ) ( y ) = f ( x ) e 2 π i y x d x .
When condition ν m / 2 ( x ) = F 1 ( 1 + y 2 ) m / 2 ( x ) L 2 ( R ) is satisfied, space H 2 μ R is embedded in the space of continuous functions C ( R ) .
The inner product in H 2 μ R is defined as follows:
φ ( x ) , ψ ( x ) = F 1 ( 1 + y 2 ) m / 2 · F φ ( x ) ( y ) · F 1 ( 1 + y 2 ) m / 2 · F ψ ( x ) ( y ) d x .
We consider a quadrature formula of the form
0 1 p ( x ) f ( x ) d x β = 0 N C β f ( h β ) ,
where C β and h β h β [ 0 , 1 ] are coefficients and nodes, respectively, and p ( x ) is a weighted function, and f ( x ) is an element of the Hilbert space H 2 μ R .
The error of the quadrature formula is the difference
, f = 0 1 p ( x ) f ( x ) d x β = 0 N C β f ( h β ) ,
where
N ( x ) = ε [ 0 , 1 ] ( x ) p ( x ) β = 0 N C β δ ( x h β ) .
The error functional of the quadrature Formula (2) is denoted by N ( x ) . Here, ϵ [ 0 , 1 ] ( x ) is the characteristic function of the interval [ 0 , 1 ] , and δ ( x ) is the Dirac’s delta-function.
The error of the quadrature formula will be a linear and continuous functional from space H 2 μ * R dual to space H 2 μ R , i.e., N ( x ) H 2 μ * ( R ) .
The quality of the quadrature formula is assessed using the norm of the error functional as follows:
N ( x ) H 2 μ * ( R ) = sup f 0 ( f ) f ( x ) H 2 μ ( R ) .
The norm of the error functional N ( x ) depends on the coefficients C β . If
N ( x ) H 2 μ * ( R ) = inf C β N ( x ) H 2 μ * ( R ) ,
then they say that the functional N corresponds to the optimal quadrature formula in H 2 μ * R .
The focus of this work is to investigate Sard’s problem and to construct optimal quadrature formulas using the Sobolev method in the H 2 μ R space. The objective is to create a quadrature formula that accurately represents the basis functions of the norm kernel (1). However, it should be noted that this optimal quadrature formula will not be exact for algebraic polynomial, exponential or trigonometric functions.
The following article is divided into eight sections. Section 2 discusses the extremal function of the error functional of the quadrature formula and its norm. It calculates the norm of the error functional using this extremal function. Section 3 studies the existence and uniqueness of the optimal quadrature formula. Section 4 explains the Sobolev algorithm for determining the optimal coefficients of a quadrature formula of the form (2). Meanwhile, Section 5 modifies the Sobolev algorithm to find optimal coefficients. Section 6 provides an algorithm for constructing the Fourier transform of function ν ^ m x . In Section 7, a discrete analogue D m , [ β ] of the differential operator 1 d 2 2 π 2 d x 2 m is constructed. Section 8 discusses the Sobolev method for constructing optimal quadrature formulas of the form (2) in space H 2 μ R . Finally, under m = 1 , optimal quadrature formulas are obtained for the cases of weight functions p x = 1 and p x = e 2 π i ω x .

2. Extremal Function of the Error Functional of the Quadrature Formula and Its Norm

To find the norm of the error functional (4) in space H 2 μ * R , its extremal function is used.
Function ψ ( x ) is called an extremal function of functional N ( x ) , if
( N ( x ) , ψ ( x ) ) = N H 2 μ * ( R ) · ψ H 2 μ ( R ) .
Based on the Riesz theorem on the general form of a linear continuous functional in a Hilbert space for any f ( x ) H 2 μ R , we have
( N ( x ) , f ( x ) ) = ψ ( x ) , f ( x ) and N ( x ) H 2 μ * = ψ ( x ) H 2 μ ,
where ψ ( x ) is a function from space H 2 μ ( R ) , which corresponds to the functional N ( x ) . The following theorem is true.
Theorem 1. 
The extremal function of the error functional N ( x ) has the form
ψ ( x ) = 0 1 p ( y ) ν m ( x y ) d y β = 0 N C β ν m ( x h β ) ,
where p ( x ) is the weight function, ν m ( x ) = F 1 [ ( 1 + y 2 ) m ] ( x ) .
Proof. 
To prove the theorem, we use generalized function theorems and the Fourier transform. By virtue of the Fourier transform of generalized functions we have
( N ( x ) , f ( x ) ) = F [ N ( x ) ] ( y ) , F [ f ( x ) ] ( y ) =
= ( 1 + y 2 ) m / 2 F [ N ( x ) ] ( y ) , ( 1 + y 2 ) m / 2 F [ f ( x ) ] ( y ) =
= F 1 ( 1 + y 2 ) m / 2 F [ N ( x ) ] ( y ) , F 1 ( 1 + y 2 ) m / 2 F [ f ( x ) ] ( y ) .
If in this equality, we assume
F 1 ( 1 + y 2 ) m / 2 F [ ψ ( x ) ] ( y ) = F 1 ( 1 + y 2 ) m / 2 F [ N ( x ) ] ( y ) ,
i.e., if we assume
f ( x ) = ψ ( x ) = F 1 ( 1 + y 2 ) m · F [ N ( x ) ] ( y ) ( x ) ,
then we will have
( N ( x ) , ψ ( x ) ) = < ψ ( x ) , ψ ( x ) > = N H 2 μ * ( R ) 2 .
It follows, firstly, that
ψ ( x ) = F 1 ( 1 + y 2 ) m · F [ N ( x ) ] ( y ) ( x ) =
= [ p ( x ) · ε [ 0 , 1 ] ( x ) ] ν m ( x ) β = 0 N C β ν m ( x h β ) = 0 1 p ( y ) ν m ( x y ) d y β = 0 N C β ν m ( x h β ) ,
where
ν m ( x ) = F 1 [ ( 1 + y 2 ) m ] ( x ) .
Function ψ ( x ) is an extremal function of the error functional (4). In this case, the squared norm of the error functional is calculated by the formula
N ( x ) H 2 μ * ( R ) 2 = ψ ( x ) , ψ ( x ) = F 1 ( 1 + y 2 ) m / 2 F [ N ( x ) ] ( y ) ( x ) 2 d x .
The theorem is completely proven. □

3. Research on the Existence and Uniqueness of an Optimal Quadrature Formula

From (13), it is clear that the norm of the error functional (4) is a function of the coefficients C β , β = 0 , 1 , 2 , . . . , N .
The problem of minimizing the norm of the error functional for fixed nodes h β is to determine such coefficients C β , β = 0 , 1 , 2 , . . . , N for which
inf C β N H 2 μ * ( R ) .
To find the coefficients C β , β = 0 , 1 , 2 , . . . , N , we rewrite equality (13) in a slightly different form
N H 2 μ * ( R ) 2 = F 1 ( 1 + y 2 ) m / 2 F [ N ( x ) ] ( y ) ( x ) 2 d x =
= F 1 [ ( 1 + y 2 ) m / 2 ] ( x ) N ( x ) 2 d x = ν m / 2 ( x ) N ( x ) 2 d x =
= ν m / 2 ( x ) p ( x ) · ε [ 0 , 1 ] ( x ) β = 0 N C β ν m ( x h β ) 2 d x .
Equality (14) connects the problem of constructing the quadrature Formula (2) with the problem of approximating functions L 2 in p ( x ) ν m ( x ) by a linear combination of functions x β shifted to ν m ( x ) .
Indeed, from (14), it is clear that finding the smallest value of the norm of the error functional by coefficients at fixed nodes x β is equivalent to the best approximation of function ν m / 2 ( x ) [ p ( x ) · ε [ 0 , 1 ] ( x ) ] by a linear combination of function ν m / 2 ( x ) , and it shifts by x β = β h , β = 0 , 1 , 2 , . . . , N in the norm of space L 2 ( R ) .
Let us first prove the following lemmas.
Lemma 1. 
The following equality is true
β = 0 N C β δ ( x h β ) H 2 μ * 2 = β = 0 N C β ν m 2 ( x h β ) 2 d x .
Proof. 
An extremal function of functional 1 ( x ) = β = 0 N C β δ ( x h β ) is a function of ψ 1 ( x ) = β = 0 N C β ν m ( x h β ) .
Indeed, taking (11) into account, we have
ψ 1 ( x ) = F 1 { ( 1 + y 2 ) m F [ 1 ( x ) ] ( y ) } ( x ) = F 1 { ( 1 + y 2 ) m } 1 ( x ) =
= ν m ( x ) 1 ( x ) = ν m ( x y ) β = 0 N C β δ ( y h β ) d y = β = 0 N C β ν m ( x h β ) .
By the Riesz theorem on the general form of a linear continuous functional on a Hilbert space, we have
β = 0 N C β δ ( x h β ) H 2 μ * 2 = ψ 1 ( x ) H 2 μ 2 =
= F 1 { ( 1 + y 2 ) m 2 F [ ψ 1 ( x ) ] ( y ) } ( x ) 2 d x =
= F 1 { ( 1 + y 2 ) m 2 F [ β = 0 N C β ν m ( x h β ) ] ( y ) } ( x ) 2 d x =
= F 1 { ( 1 + y 2 ) m 2 F [ ν m ( x ) β = 0 N C β δ ( x h β ) ] ( y ) } ( x ) 2 d x =
= F 1 { ( 1 + y 2 ) m 2 F [ ν m ( x ) ] · F [ β = 0 N C β δ ( x h β ) ] ( y ) } ( x ) 2 d x =
= F 1 { ( 1 + y 2 ) m 2 1 ( 1 + y 2 ) m · F [ β = 0 N C β δ ( x h β ) ] ( y ) } ( x ) 2 d x =
= F 1 { 1 ( 1 + y 2 ) m 2 · F [ β = 0 N C β δ ( x h β ) ] ( y ) } ( x ) 2 d x =
= F 1 { F [ ν m 2 ( x ) ] ( y ) · F [ β = 0 N C β δ ( x h β ) ] ( y ) } ( x ) 2 d x =
= F 1 { F [ ν m 2 ( x ) β = 0 N C β δ ( x h β ) ] ( y ) } ( x ) 2 d x =
= β = 0 N C β ν m 2 ( x h β ) 2 d x
Lemma 1 is proven. □
Lemma 2. 
The system
ν m / 2 ( x β h ) β = 0 N
is a linearly independent system.
Proof. 
Consider the linear combination
β = 0 N C β δ ( x h β ) H 2 μ * ( R ) .
We have
β = 0 N C β δ ( x h β ) , φ ( x ) β = 0 N C β δ ( x h β ) H 2 μ * ( R ) · φ ( x ) H 2 μ ( R ) .
Let system (15) be linearly dependent, i.e., β = 0 N C β ν m / 2 ( x h β ) = 0 and β = 0 N C β 2 0 . Let C β = max { C β C β 0 , β = 0 , 1 , 2 , . . . , N } .
Hence and from Lemma 1, it follows that
β = 0 N C β δ ( x h β ) H 2 * ( R ) 2 = β = 0 N C β ν m / 2 ( x h β ) 2 d x = 0 .
Let us take the function
ω β ( x ) = C β e ( x h β ) 2 · β β ( x h β ) ( h β h β ) .
For this function, we have
β = 0 N C β δ ( x h β ) , ω β ( x ) = C β 2 .
On the other hand, we have
0 < C β 2 = β = 0 N C β δ ( x h β ) , ω β ( x ) β = 0 N C β δ ( x h β ) H 2 μ * ( R ) · ω β ( x ) H 2 μ ( R ) .
This inequality contradicts equality (16).
The linear independence of system (15) is proven by this contradiction.
Lemma 2 is proven. □
This also implies the linear independence of δ ( x h β ) , β = 0 , 1 , 2 , . . . , N in H 2 μ R . Thus, the linear span of functions ν m / 2 ( x h β ) , β = 0 , 1 , 2 , . . . , N is a ( N + 1 ) -dimensional subspace in L 2 ( R ) .
As is known from the theory of Hilbert spaces, an element β = 0 N C β ν m / 2 ( x h β ) is closest to an element p ( x ) · ε [ 0 , 1 ] ( x ) ν m / 2 ( x ) only if the difference [ p ( x ) · ε [ 0 , 1 ] ( x ) ] ν m / 2 ( x ) β = 0 N C β ν m / 2 ( x h β ) is orthogonal to each element ν m / 2 ( x h β ) , β = 0 , 1 , 2 , . . . , N in L 2 ( R ) , i.e.,
N ( x ) ν m 2 ( x ) , ν m 2 ( x h α ) = 0 , α = 0 , 1 , 2 N .
Using the Fourier transform and the left side of equality (17), we reduce it to
N ( x ) ν m 2 ( x ) , ν m 2 ( x h α )
= ν m / 2 ( x ) [ p ( x ) · ε [ 0 , 1 ] ( x ) ] β = 0 N C β ν m / 2 ( x h β ) , ν m / 2 ( x h α ) =
= ν m / 2 ( x ) [ p ( x ) · ε [ 0 , 1 ] ( x ) ] ν m / 2 ( x ) β = 0 N C β δ ( x h β ) , ν m / 2 ( x ) δ ( x h α ) =
= ( F [ ν m / 2 ( x ) [ p ( x ) · ε [ 0 , 1 ] ( x ) ] ] ( y )
F [ ν m / 2 ( x ) β = 0 N C β δ ( x h β ) ] , F [ ν m / 2 ( x ) δ ( x h α ) ] ) =
= ( 1 ( 1 + y 2 ) m / 2 · F [ [ p ( x ) · ε [ 0 , 1 ] ( x ) ] ] ( y )
1 ( 1 + y 2 ) m / 2 · F [ β = 0 N C β δ ( x h β ) ] , 1 ( 1 + y 2 ) m / 2 · F [ δ ( x h α ) ] )
= 1 ( 1 + y 2 ) m · F [ [ p ( x ) · ε [ 0 , 1 ] ( x ) ] ] ( y ) 1 ( 1 + y 2 ) m · F [ β = 0 N C β δ ( x h β ) ] , F [ δ ( x h α ) ] .
From here, applying the inverse Fourier transform, we obtain
N ( x ) ν m 2 ( x ) , ν m 2 ( x h α ) =
= ν m ( x ) [ p ( x ) · ε [ 0 , 1 ] ( x ) ] ν m ( x ) β = 0 N C β δ ( x h β ) , δ ( x h α ) =
= ν m ( x ) [ p ( x ) · ε [ 0 , 1 ] ( x ) ] β = 0 N C β ν m ( x h β ) , δ ( x h α ) =
= ν m ( x ) [ p ( x ) · ε [ 0 , 1 ] ( x ) ] β = 0 N C β ν m ( x h β ) x = h α .
Hence, taking (17) into account, from (18), we obtain
ψ ( h α ) = 0 , α = 0 , 1 , 2 , . . . , N .
This theorem, known as Babushka’s theorem (see [10]), states that the error functional’s extremal function of the optimal quadrature formula becomes zero at the formula’s nodes.
System (19) represents a set of linear algebraic equations for the coefficients C β . As such, it can be expressed in the following form:
β = 0 N C β ν m ( h α h β ) = p ( y ) · ε [ 0 , 1 ] ( y ) ] · ν m ( h α y ) d y , α = 0 , 1 , 2 , . . . , N .
The solution to this system is the optimal coefficients of the quadrature formula. From these lemmas and from the theory of existence and uniqueness of the best approximation under space, the existence and uniqueness of the optimal quadrature formula follows.
Thus, the following is true.
Theorem 2. 
The coefficients of the optimal quadrature formula in space H 2 μ R are a solution to the system of linear Equation (20), which exists and is unique.

4. Algorithm S.L. Sobolev to Determine Optimal Coefficients

Sometimes, it is impossible to solve the system (20) by using known methods because the determinant of the system is too small. To address this issue, S.L. Sobolev [10] proposed a method that enables us to identify the optimal coefficients of the quadrature formula.
We can make some changes to the variables in system (20) to simplify it. Let us redefine C β as C [ β ] and ν m ( h β ) as ν h ( m ) [ β ] . We will also assume that C [ β ] is defined everywhere and is equal to zero when h β [ 0 , 1 ] . After these changes, we can express system (20) as a convolution of functions with a discrete argument as follows:
C [ β ] ν h ( m ) [ β ] = f m [ β ] , β = 0 , 1 , . . . , N ,
C [ β ] = 0 , h β [ 0 , 1 ] ,
where
f m [ β ] = 0 1 p ( y ) · ν m ( h β y ) d y .
The system of Equations (21) and (22) will be denoted by system B.
Let us consider the corresponding problem.
Problem B: Find a discrete function C [ β ] that satisfies system B for given f m [ β ] . Let us now turn to the solution of system B.
The main idea of this solution is to replace an unknown function.
Namely, instead of C [ β ] we introduce the function
u h ( m ) [ β ] = ν h ( m ) [ β ] C [ β ] .
In this formulation, we only need to express C [ β ] through u h ( m ) [ β ] , i.e., find an operator D m [ β ] that satisfies the equality
D m β ν h ( m ) β = δ β ,
where δ [ β ] = 1 , β = 0 , 0 , β 0 .
This will allow us to express C [ β ] in turn as
C [ β ] = D m [ β ] u h ( m ) [ β ] .

5. Modification of the Algorithm by S.L. Sobolev for Finding Optimal Coefficients

Some properties of function ν m ( x ) are given below.
  • The parity of μ 1 ( x ) = ( 1 + x 2 ) m implies the parity of ν m ( ξ ) = F 1 [ μ 1 ( x ) ] ( ξ ) . This is obvious.
  • The function ν m ( x ) decreases to infinity at a faster rate than any negative power of x . Moreover, both μ ( x ) and μ 1 ( x ) are infinitely differentiable functions. Due to the infinite differentiability and summability of μ 1 ( x ) and its derivatives, it can be concluded that
    ν m ( ξ ) = ( 2 π i ξ ) α · [ ( 1 + x 2 ) m ] α · e 2 π i ξ x d x
    for each α 0 .
    It follows that ν m ( ξ ) ( 2 π i ξ ) α < .
  • The explicit form of ν m ( x ) . Due to the parity of ν m ( x ) , we have
    ν m ( x ) = e 2 π i y x ( 1 + y 2 ) m d y = 2 0 cos 2 π y x ( 1 + y 2 ) m d y .
    Further, we know that the equality is [10]
    0 cos ( a y ) d y ( b 2 + y 2 ) n = π · e a b ( 2 · b ) 2 n 1 ( n 1 ) ! ( 2 n k 2 ) ! k ! ( n k 1 ) ! ( 2 a b ) k
    We can obtain an explicit expression for the Fourier transform of the function μ 1 ( x ) in elementary functions by substituting a = 2 π x , b = 1 and n = m in the given equation. It is worth noting that the left side of (27) does not change when we replace x with x because of the parity of the integrand. However, the right side is valid only for x > 0 . Therefore, we replace the equality x with x on the right side of the equation.
Then, we will have
ν m ( x ) = e 2 π i y x ( 1 + y 2 ) m d y = π e 2 π x 2 2 m 2 · ( m 1 ) ! k = o m 1 ( 2 m k 2 ) ! · ( 4 π ) k k ! · ( m k 1 ) ! | x | k .
Using (24) and (28), we find the form of function u h ( m ) [ β ] at β < 0 and β > N .
Let β < 0 , then
u h ( m ) [ β ] = e 2 π h β k = 0 m 1 a k β k
Let β > N , then
u h ( m ) [ β ] = e 2 π h β k = 0 m 1 a k + β k
Here, the coefficients a k and a k + , k = 0 , 1 , . . . , m 1 are unknown. So, we obtain the following task to find function u h ( m ) [ β ] having the form
u h ( m ) [ β ] = e 2 π h β k = 0 m 1 a k β k , β < 0 , f m β , β = 0 , 1 , . . . , N , e 2 π h β k = 0 m 1 a k + β k , β > N .
Since C [ β ] = 0 with β < 0 and β > N from (26), we have
D m β u h ( m ) β = 0 , h β 0 , 1 .
If we construct a discrete operator D m [ β ] , then the unknown coefficients are determined from (29).
In the following paragraphs, we will deal with the construction of a discrete operator D m [ β ] .
We will now find a solution to Equation (25). The theory of periodic generalized functions and the Fourier transform suggest that it is more convenient to search for a harrow-shaped function instead of a discrete function D m [ β ] .
D ^ m ( x ) = β = D m β δ ( x h β ) .
Then, Equation (25) in the class of harrow-shaped functions becomes the equation
D ^ m ( x ) ν ^ m ( x ) = δ ( x ) ,
where
ν ^ m ( x ) = β = ν m ( h β ) δ ( x h β ) .
According to [10], harrow-shaped functions and discrete argument functions are isomorphic. This means that instead of studying D m β , we can focus on the D ^ m ( x ) function. To complete this, we can apply the Fourier transform to both sides of Equation (30). It is important to keep in mind that
F [ φ ( x ) ψ ( x ) ] = F [ φ ] · F [ ψ ] and F [ δ ( x ) ] = 1 ,
and we get
F [ D ^ m ( x ) ] · F [ ν ^ m ( x ) ] = 1 .
From here, we have
F [ D ^ m ( x ) ] = F [ ν ^ m ( x ) ] 1 .
Now, let us calculate the Fourier transform F [ ν ^ m ( x ) ] of the harrow-shaped function ν ^ m ( x ) . It is known (see [10]) that
ϕ 0 ( x ) = β = δ ( x β ) , δ ( h x ) = h 1 δ ( x ) and F β = e 2 π i x β = β = δ ( p β ) .
Keeping these equalities in mind, we get
ν ^ m ( x ) = β = ν m ( h β ) δ ( x h β ) = ν m ( x ) · β = δ ( x h β ) =
= h 1 ν m ( x ) · β = δ ( x h 1 β ) = h 1 ν m ( x ) · ϕ 0 ( h 1 x ) .
It is also known (see [23]) that
F [ ϕ 0 ( h 1 x ) ] = β = F [ δ ( h 1 x β ) ] = h β = F [ δ ( x h β ) ] =
= h β = e 2 π i p h β = h β = δ ( h p β ) = h ϕ 0 ( h p ) ,
i.e.,
F [ ϕ 0 ( h 1 x ) ] = h ϕ 0 ( h p ) .
Therefore, taking into account (33) and (34), we have
F [ ν ^ m ( x ) ] = F [ h 1 ν m ( x ) · ϕ 0 ( h 1 x ) ] =
= h 1 F [ ν m ( x ) ] F [ ϕ 0 ( h 1 x ) ] = h 1 F [ ν m ( x ) ] ϕ 0 ( h p ) h .
Since F [ ν m ( x ) ] ( p ) = ( 1 + p 2 ) m , then from (35), we have
F [ ν m ( x ) ] ( p ) = ( 1 + p 2 ) m ϕ 0 ( h p ) =
= β = ( 1 + p 2 ) m δ ( h p β ) = h 1 β = 1 1 + ( p β h 1 ) 2 m .
Function F [ ν m ( x ) ] ( p ) is a periodic function with period h 1 = N . Using equality (36), we must first determine F [ ν m ( x ) ] ( p ) 1 , which will also be an N-periodic function, and then expand it into a Fourier series. Then, based on (32), we will have
F [ D ^ m ( x ) ] ( p ) = β = D ^ β e 2 π i p h β ,
where D ^ β are the Fourier coefficients of function F [ D ^ m ( x ) ] ( p ) as follows:
D ^ β = 0 N F [ D ^ m ( x ) ] ( p ) e 2 π i p h β d p .
Applying the Fourier inversion formula to equality (37), we arrive at the harrow-shaped function
D ^ m ( x ) = β = D ^ β δ ( x h β ) .
To find the Fourier coefficients F [ D ^ m ( x ) ] , we need to apply the definition of a harrow-shaped function. This will give us the set of Fourier coefficients that we require. First, we need to determine the Fourier coefficients of the function F [ ν ^ m ( x ) ] ( p ) .
Lemma 3. 
The following equality is true
β = h 1 [ 1 + ( p β h 1 ) 2 ] m = β = ν m ( h β ) e 2 π i β h p .
Proof. 
Let φ ( x ) be the main function.
Then,
β = h 1 [ 1 + ( p h 1 β ) 2 ] m , φ ( p )
= F 1 [ β = h 1 [ 1 + ( p h 1 β ) 2 ] m ] , F 1 [ φ ( p ) ] =
= F 1 [ 1 / ( 1 + p 2 ) m ϕ 0 ( h p ) ] ( x ) , F 1 [ φ ( p ) ] ( x ) =
= F 1 [ 1 / ( 1 + p 2 ) m ] ( x ) · F 1 [ ϕ 0 ( h p ) ] ( x ) , F 1 [ φ ( p ) ] ( x ) =
= ν m ( x ) · h 1 ϕ 0 ( h 1 x ) , F 1 [ φ ( p ) ] ( x ) = β = ν m ( h β ) e 2 π i h β x , φ ( x ) .
From the definition of equality of two generalized functions, it follows (39), which proves Lemma 3. □
From (36) and (39), it follows that
F [ ν ^ m ( x ) ] ( p ) = β = ν m ( h β ) e 2 π i h p β .
From (36), it is clear that F [ ν ^ m ( x ) ] ( p ) > 0 is the sum of positive functions. Therefore, F [ ν ^ m ( x ) ] ( p ) 1 > 0 .
From (32), it is clear that to determine the Fourier coefficients of function F [ D ^ m ( h k ) ] ( p ) , we need to find the Fourier transform of function ν ^ m x .

6. Algorithm for Constructing the Fourier Transform of Function ν ^ m x

We are currently studying the process of constructing the Fourier transform of the function ν ^ m ( x ) to determine the discrete analogue D m [ β ] of the differential operator ( 1 d 2 ( 2 π ) 2 d x 2 ) [ m ] . This discrete analogue is used to construct optimal quadrature formulas in the space H 2 μ ( R ) .
The following is true.
Theorem 3. 
The Fourier transform of function ν ^ m ( x ) is used to determine the discrete analogue of the differential operator 1 1 2 π 2 d 2 d x 2 m , satisfying the equality (32). This analogue takes the form
F ν ^ m x p = π 2 m 2 ! 2 2 m 2 ( m 1 ) ! 2 λ e 4 π h 1 λ 2 e 2 π h + λ e 4 π h + 1 e 2 π h +
+ π 2 2 m 2 ( m 1 ) ! k = 0 m 1 ( 2 m k 2 ) ! 4 π h k k ! ( m k 1 ) ! e 2 π h e 2 π h λ i = 0 k λ e 2 π h λ i ρ = 0 i 1 i ρ × × i ! ρ ! i ρ ! ρ k + λ e 2 π h λ e 2 π h 1 i = 0 k 1 λ e 2 π h 1 i ρ = 0 i 1 i ρ i ! ρ ! i ρ ! ρ k .
Proof. 
Using formulas (40), we calculate the Fourier transform of function ν ^ m x . We calculate equality (40) for x = h β as follows:
F ν ^ m x p = β = π · e 2 π h β 2 2 m 2 ( m 1 ) ! k = 0 m 1 ( 2 m k 2 ) ! 4 π k k ! ( m k 1 ) ! h β k e 2 π i h β p .
Thus, we have
F ν ^ m x p =
= β = ν m h β e 2 π i h β p β = π · e 2 π h β 2 2 m 2 ( m 1 ) ! k = 0 m 1 ( 2 m k 2 ) ! 4 π k k ! ( m k 1 ) ! h β k e 2 π i h β p =
= π 2 2 m 2 ( m 1 ) ! k = 0 m 1 ( 2 m k 2 ) ! 4 π h k k ! ( m k 1 ) ! β = e 2 π h β e 2 π i h p β β k .
Hence, denoting e 2 π i h p = λ , we have
F ν ^ m x p = π 2 2 m 2 ( m 1 ) ! k = 0 m 1 ( 2 m k 2 ) ! 4 π h k k ! ( m k 1 ) ! β = e 2 π h β λ β β k =
= π 2 2 m 2 ( m 1 ) ! ( 2 m 2 ) ! ( m 1 ) ! β = e 2 π h β λ β +
+ π 2 2 m 2 ( m 1 ) ! k = 1 m 1 ( 2 m k 2 ) ! 4 π h k k ! ( m k 1 ) ! β = e 2 π h β λ β β k =
= π 2 m 2 ! 2 2 m 2 ( m 1 ) ! 2 1 + β = 1 λ e 2 π h β + β = 1 e 2 π h β λ β +
+ π 2 2 m 2 ( m 1 ) ! k = 1 m 1 ( 2 m k 2 ) ! 4 π h k k ! ( m k 1 ) ! β = 1 λ e 2 π h β β k + β = 1 1 λ e 2 π h β β k =
= π 2 m 2 ! 2 2 m 2 ( m 1 ) ! 2 1 + β = 1 λ e 2 π h β + β = 1 1 λ e 2 π h β +
+ π 2 2 m 2 ( m 1 ) ! k = 1 m 1 ( 2 m k 2 ) ! 4 π h k k ! ( m k 1 ) ! β = 0 λ e 2 π h β β k + β = 0 1 λ e 2 π h β β k
Applying the formulas for the sum of an infinitely decreasing geometric progression, we obtain
F ν ^ m x p = π 2 m 2 ! 2 2 m 2 ( m 1 ) ! 2 1 + λ e 2 π h 1 + 1 λ e 2 π h 1 +
+ π 2 2 m 2 ( m 1 ) ! k = 0 m 1 ( 2 m k 2 ) ! 4 π h k k ! ( m k 1 ) ! β = 0 λ e 2 π h β β k + β = 0 1 λ e 2 π h β β k .
The following formula is valid
γ = 0 n 1 q γ γ k = 1 1 q i = 0 k q 1 q i Δ i 0 k q n 1 q i = 0 k q 1 q i Δ i γ k γ = n ,
where Δ i γ k is a finite difference of order i from γ k , Δ i 0 k = Δ i γ k γ = n . For q < 1 from (41), we have
γ = 0 q γ γ k = 1 1 q i = 0 k q 1 q i Δ i 0 k .
Thus, using formulas (42), we have
F ν ^ m x p = π 2 m 2 ! 2 2 m 2 ( m 1 ) ! 2 λ e 4 π h 1 λ 2 e 2 π h + λ e 4 π h + 1 e 2 π h +
π 2 2 m 2 ( m 1 ) ! k = 0 m 1 ( 2 m k 2 ) ! 4 π h k k ! ( m k 1 ) ! e 2 π h e 2 π h λ i = 0 k λ e 2 π h λ i Δ i 0 k + + λ e 2 π h λ e 2 π h 1 i = 0 k 1 λ e 2 π h 1 i Δ i 0 k ,
where Δ i γ k is a finite difference of the order of i from γ k , Δ i 0 k = Δ i γ k γ = n .
Using for calculation, a finite difference of order i, type Δ i 0 k , the results of work [23] from equality (43), we have
F ν ^ m x p = π 2 m 2 ! 2 2 m 2 ( m 1 ) ! 2 λ e 4 π h 1 λ 2 e 2 π h + λ e 4 π h + 1 e 2 π h +
+ π 2 2 m 2 ( m 1 ) ! k = 0 m 1 ( 2 m k 2 ) ! 4 π h k k ! ( m k 1 ) ! e 2 π h e 2 π h λ i = 0 k λ e 2 π h λ i Δ i 0 k +
+ λ e 2 π h λ e 2 π h 1 i = 0 k 1 λ e 2 π h 1 i Δ i 0 k ] = π 2 m 2 ! 2 2 m 2 ( m 1 ) ! 2 λ e 4 π h 1 λ 2 e 2 π h + λ e 4 π h + 1 e 2 π h +
π 2 2 m 2 ( m 1 ) ! k = 0 m 1 ( 2 m k 2 ) ! 4 π h k k ! ( m k 1 ) ! e 2 π h e 2 π h λ i = 0 k λ e 2 π h λ i ρ = 0 i 1 i ρ i ! ρ ! i ρ ! ρ k +
+ λ e 2 π h λ e 2 π h 1 i = 0 k 1 λ e 2 π h 1 i ρ = 0 i 1 i ρ i ! ρ ! i ρ ! ρ k ] ,
and it follows that
F ν ^ m x p = π 2 m 2 ! 2 2 m 2 ( m 1 ) ! 2 λ e 4 π h 1 λ 2 e 2 π h + λ e 4 π h + 1 e 2 π h + π 2 2 m 2 ( m 1 ) ! k = 0 m 1 ( 2 m k 2 ) ! 4 π h k k ! ( m k 1 ) ! e 2 π h e 2 π h λ i = 0 k λ e 2 π h λ i ρ = 0 i 1 i ρ i ! ρ ! i ρ ! ρ k +
+ λ e 2 π h λ e 2 π h 1 i = 0 k 1 λ e 2 π h 1 i ρ = 0 i 1 i ρ i ! ρ ! i ρ ! ρ k ,
which was what was required to be proven. □
To determine the Fourier coefficients of function F [ D ^ m ( h β ) ] ( p ) , i.e., D m β applying Theorem 3, we will deal with the expansion of the function F [ ν ^ m ( x ) ] ( p ) 1 into a Fourier‘series.

7. Discrete Analogue of one Differential Operator of the 2mth Order

In this section, we will discuss the creation of a discrete analogue of the differential operator 1 1 2 π 2 d 2 d x 2 m , which involves solving an equation using convolutions of a discrete argument: D m β ν m β = δ β .
To complete this, we present some well-known results from [23].
If we denote the Euler polynomial by E k ( x ) = s = 0 k a s ( k ) x s , then the coefficient a s ( k ) of the Euler polynomial, as was shown by Euler himself, is expressed by the formula
a s ( k ) = j = 0 s 1 j j k + 2 s + 1 j k + 1
The following theorem from [23] is valid.
Theorem 4. 
Polynomial
P k ( x ) = x 1 k + 1 i = 1 k + 1 Δ i 0 k + 1 x 1 i
is an Euler polynomial of degree k, and in addition,
E k ( x ) = x k E k 1 x
or else
a s ( k ) = a k s ( k ) , s = 0 , 1 , 2 , k .
Now, let us prove the following theorem.
Theorem 5. 
The discrete operator D m β is defined by the formula
D m β = 2 2 m 2 m 1 ! 2 π 2 m 2 ! k = 1 m 1 V m λ 1 , k λ 1 , k β λ 1 , k 2 T 2 m 2 λ 1 , k , β 2 ; 1 d 2 m 2 + k = 1 m 1 V m λ 1 , k λ 1 , k T 2 m 2 λ 1 , k , β = 1 ; k = 1 m 1 V m λ 1 , k λ 1 , k 2 T 2 m 2 λ 1 , k 2 m cosh 2 π h · d 2 m 2 + d 2 m 3 d 2 m 2 2 , β = 0 .
Proof. 
From (46), we have
e 2 π h e 2 π h λ i = 0 k λ e 2 π h λ i Δ i 0 k = e 2 π h e 2 π h λ i = 0 k 1 λ 1 e 2 π h 1 i Δ i 0 k = = e 2 π h e 2 π h λ · E k 1 λ 1 e 2 π h λ 1 e 2 π h 1 k = λ 1 e 2 π h E k 1 λ 1 e 2 π h λ 1 e 2 π h 1 k + 1 .
Also,
λ e 2 π h λ e 2 π h 1 i = 0 k 1 λ e 2 π h 1 i Δ i 0 k = λ e 2 π h E k 1 λ e 2 π h λ e 2 π h 1 k + 1 .
Substituting the found expressions (48) and (49) into (45), we obtain
F ν ^ x p = π 2 m 2 ! 2 2 m 2 m 1 ! 2 λ e 4 π h 1 λ 2 e 2 π h + λ e 4 π h + 1 e 2 π h + + m 1 ! 2 m 2 ! k = 1 m 1 2 m 2 k ! 4 π h k k ! m k 1 ! λ 1 e 2 π h E k 1 λ 1 e 2 π h λ 1 e 2 π h 1 k + 1 + λ e 2 π h E k 1 λ e 2 π h λ e 2 π h 1 k + 1 .
Now, using Formula (75), we obtain
λ 1 e 2 π h E k 1 λ 1 e 2 π h λ 1 e 2 π h 1 k + 1 = λ 1 e 2 π h λ 1 e 2 π h k 1 E k 1 λ e 2 π h λ 1 e 2 π h 1 k + 1 =
= λ e 2 π h λ 1 e 2 π h k + 1 E k 1 λ e 2 π h λ 1 e 2 π h 1 k + 1 = λ e 2 π h E k 1 λ e 2 π h 1 λ e 2 π h k + 1 .
Then, equality (50) takes the following form
F ν ^ x p = π 2 m 2 ! 2 2 m 2 m 1 ! 2 λ e 4 π h 1 λ 2 e 2 π h + λ e 4 π h + 1 e 2 π h + + m 1 ! 2 m 2 ! k = 1 m 1 2 m 2 k ! 4 π h k k ! m k 1 ! λ e 2 π h E k 1 λ e 2 π h 1 λ e 2 π h k + 1 + λ e 2 π h E k 1 λ e 2 π h λ e 2 π h 1 k + 1 .
It is easy to see that
λ e 4 π h 1 λ 2 e 2 π h + λ e 4 π h + 1 e 2 π h = 2 sinh 2 π h λ 2 2 λ cosh 2 π h + 1
and
λ e 2 π h E k 1 λ e 2 π h 1 λ e 2 π h k + 1 + λ e 2 π h E k 1 λ e 2 π h λ e 2 π h 1 k + 1 = = 1 k + 1 λ e 2 π h λ e 2 π h 1 k + 1 E k 1 λ e 2 π h + e 2 π h 1 λ e 2 π h k + 1 E k 1 λ e 2 π h λ 2 2 cosh 2 π h λ + 1 k + 1 .
Using equalities (52) and (53), we rewrite expression (51) in the form
F ν ^ x p = π 2 m 2 ! 2 2 m 2 m 1 ! 2 [ 2 sinh 2 π h λ 2 2 λ cosh 2 π h + 1 + + m 1 ! 2 m 2 ! k = 1 m 1 2 m 2 k ! 4 π h k k ! m k 1 ! × × 1 k + 1 λ e 2 π h λ e 2 π h 1 k + 1 E k 1 λ e 2 π h + e 2 π h 1 λ e 2 π h k + 1 E k 1 λ e 2 π h λ 2 2 λ cosh 2 π h + 1 k + 1 ] .
Let us denote by P 2 k a polynomial of degree 2 k in λ , i.e.,
Ψ 2 k λ = e 2 π h λ e 2 π h 1 k + 1 E k 1 λ e 2 π h + e 2 π h 1 λ e 2 π h k + 1 E k 1 λ e 2 π h ,
and through V λ , it is a polynomial of the second degree in λ , i.e.,
V λ = λ 2 2 λ cosh 2 π h + 1 ,
and the following coefficients through a k , i.e.,
d k = 1 k + 1 4 π h k 2 m 2 k ! m 1 ! 2 m 2 ! k ! m k 1 ! .
Taking into account notations (55), (56) and (57), we write equality (54) in the form
F ν ^ x p = π 2 m 2 ! 2 2 m 2 m 1 ! 2 2 λ sinh 2 π h V λ + λ k = 1 m 1 d k Ψ 2 k λ V k + 1 λ = = π 2 m 2 ! λ 2 2 m 2 m 1 ! 2 2 sinh 2 π h V m 1 λ + k = 1 m 1 d k Ψ 2 k λ V m k 1 λ V m λ =
= π 2 m 2 ! λ 2 2 m 2 m 1 ! 2 V m λ 2 sinh 2 π h V m 1 λ + k = 1 m 1 d k Ψ 2 k λ V m k 1 λ .
Let us denote by T 2 m 2 λ the next polynomial of degree 2 m 2 in λ , i.e.,
T 2 m 2 λ = k = 1 m 1 d k Ψ 2 k λ V m k 1 λ 2 sinh 2 π h V m 1 λ .
From the notation (55) and (56), it follows that T 2 m 2 λ = λ 2 m 2 T 2 m 2 1 λ so the coefficients of the polynomial T 2 m 2 λ are symmetrical. If the λ k roots of the polynomial T 2 m 2 λ , then λ k 1 k = 1 , m 1 ¯ is also a root of this polynomial. Hence, we have λ 1 , k < 1 , λ 2 , k > 1 ,
λ 1 , k · λ 2 , k = 1 , k = 1 , m 1 ¯ .
We write the polynomial T 2 m 2 λ in the form
T 2 m 2 λ = n = 0 2 m 2 d n λ n , a n = a 2 m 2 n .
After these notations, we write (58) in the form
F ν ^ x p = π 2 m 2 ! λ T 2 m 2 λ 2 2 m 2 m 1 ! 2 V m λ , λ = e 2 π i p h .
To construct this discrete operator, we use Formulas (32) and (60), i.e.,
F D ^ x p = 1 F ν ^ x p = 2 2 m 2 m 1 ! 2 V m λ π 2 m 2 ! λ T 2 m 2 λ .
From here,
F D ^ x p = 2 2 m 2 m 1 ! 2 V m λ π 2 m 2 ! λ T 2 m 2 λ .
To find the Fourier transform of functions D ^ x , we expand the functions A into a Fourier series
2 2 m 2 m 1 ! 2 V m λ π 2 m 2 ! λ T 2 m 2 λ .
In order to obtain the expansion of this function into a Fourier series, we divided the polynomial V m λ of degree 2 m from λ by the polynomial λ T 2 m 2 λ of degree 2 m 1 from λ , i.e.,
V m λ λ T 2 m 2 λ = λ d 2 m 2 + 2 m cosh 2 π h d 2 m 3 d 2 m 2 1 d 2 m 2 + R 2 m 2 λ λ T 2 m 2 λ .
Here, d 2 m 2 , d 2 m 3 are the coefficients of the polynomial T 2 m 2 λ , and R 2 m 2 λ is a polynomial of degree 2 m 2 then λ . Now, we decompose the rational fraction R 2 m 2 λ λ T 2 m 2 λ into elementary fractions
R 2 m 2 λ λ T 2 m 2 λ = M 0 λ + k = 1 m 1 M 1 , k λ λ 1 , k + k = 1 m 1 M 2 , k λ λ 2 , k .
Here, M 0 , M 1 , k , M 2 , k are unknown coefficients, λ 1 , k are roots of the polynomial T 2 m 2 λ with an absolute value less than one.
Taking (64) into account, equality (63) takes the following form
V m λ λ T 2 m 2 λ = λ d 2 m 2 + 2 m cosh 2 π h · d 2 m 2 d 2 m 3 d 2 m 2 2 + M 0 λ + k = 1 m 1 M 1 , k λ λ 1 , k + k = 1 m 1 M 2 , k λ λ 2 , k .
From here, we find V m λ , i.e.,
V m λ = λ T 2 m 2 λ d 2 m 2 2 m   cosh 2 π h d 2 m 2 + d 2 m 3 λ T 2 m 2 λ d 2 m 2 2 + + M 0 T 2 m 2 λ + k = 1 m 1 M 1 , k T 2 m 2 λ λ λ 1 , k + k = 1 m 1 M 2 , k T 2 m 2 λ λ λ 2 , k .
Substituting in equality (66) instead of λ : λ = 0 , λ = λ 1 , k , λ = λ 2 , k , we obtain M 0 d 0 = 1 ,
V m λ 1 , k = M 1 , k λ 1 , k T 2 m 2 λ 1 , k , V m λ 2 , k = M 2 , k λ 2 , k T 2 m 2 λ 2 , k .
From here, we consistently find
M 0 = 1 d 0 , M 1 , k = V m λ 1 , k λ 1 , k T 2 m 2 λ 1 , k , M 2 , k = V m λ 2 , k λ 2 , k T 2 m 2 λ 2 , k .
Since λ 1 , k · λ 2 , k = 1 and V m λ = λ 2 m V m 1 λ , then after some calculations, we obtain
M 1 , k = M 2 , k λ 2 , k 2 .
Considering that λ 1 , k < 1 and λ 2 , k > 1 , then the sums k = 1 m 1 M 1 , k λ λ 1 , k and k = 1 m 1 M 2 , k λ λ 2 , k can be represented by a Laurent series on circle λ 2 = 1 as follows:
k = 1 m 1 M 1 , k λ λ 1 , k = 1 λ k = 1 m 1 M 1 , k 1 λ 1 , k λ = 1 λ k = 1 m 1 M 1 , k β = 0 λ 1 , k λ β ,
k = 1 m 1 M 2 , k λ λ 2 , k = k = 1 m 1 M 2 , k λ 2 , k 1 λ 2 , k λ = k = 1 m 1 M 2 , k λ 2 , k β = 0 λ λ 2 , k β .
Substituting expressions (69) and (70) into (65), we have
V m λ λ T 2 m 2 λ = λ d 2 m 2 1 d 2 m 2 2 2 m cosh 2 π h · d 2 m 2 + d 2 m 3 + + M 0 λ + 1 λ k = 1 m 1 M 1 , k β = 0 λ 1 , k λ β k = 1 m 1 M 2 , k λ 2 , k β = 0 λ λ 2 , k β .
From equality (71) for the Fourier transform of D ^ x given by Formula (61), we have
F D ^ x p = 2 2 m 2 m 1 ! 2 V m λ π 2 m 2 ! λ T 2 m 2 λ = 2 2 m 2 m 1 ! 2 π 2 m 2 ! [ λ d 2 m 2 2 m   cosh 2 π h · d 2 m 2 + d 2 m 3 d 2 m 2 2 + M 0 λ + 1 λ k = 1 m 1 M 1 , k β = 0 λ 1 , k λ β k = 1 m 1 M 2 , k λ 2 , k β = 0 λ λ 2 , k β ] .
Hence, taking into account that λ = e 2 π i p h and d 0 = d 2 m 2 , then using Formulas (67), (68) after some simplifications we obtain
F D ^ x p = 2 2 m 2 m 1 ! 2 π 2 m 2 ! [ 1 d 2 m 2 + k = 1 m 1 M 1 , k e 2 π i p h 2 m   cosh 2 π h · d 2 m 2 + d 2 m 3 d 2 m 2 2 + k = 1 m 1 M 1 , k λ 1 , k + 1 d 2 m 2 + k = 1 m 1 M 1 , k e 2 π i p h + + k = 1 m 1 M 1 , k β = 2 λ 1 , k β 1 e 2 π i p h β + k = 1 m 1 M 1 , k β = 2 λ 1 , k β 1 e 2 π i p h β ] .
This is the Fourier series for function D ^ x , i.e.,
F D ^ x p = β = D m β e 2 π i p h β ,
where D m β is the desired discrete operator. Then from the last two equalities, we obtain the statement of the theorem. Theorem 5 is proven. □

8. Calculation of Coefficients of Optimal Lattice Quadrature Formulas

We can obtain C β from equality (26) as follows:
C β = D 1 [ β ] u h 1 [ β ] .
The value of D 1 [ β ] is given by Formula (45) when m = 1 . The value of u h 1 [ β ] is given by formula
u h 1 [ β ] = f 1 [ β ] ,
when β = 0 , 1 , . . . , N . Here, f 1 [ β ] = 0 1 p ( y ) ν 1 ( h β y ) d y . However, we have not yet determined the value of the function u h 1 [ β ] for β < 0 and β > N .
Using Formula (17), we can determine the specific values of u h 1 [ β ] for β < 0 and β > N by using the form of the function u h 1 [ β ] for β < 0 and β > N . According to Formula (17),
u h 1 ( h γ ) = β = 0 N C β ν 1 ( h γ h β ) ,
where ν 1 ( x ) = e 2 π x . Using the form of ν 1 ( x ) , we can show that
u h 1 ( h ) = e 2 π h u ( 0 ) and u h 1 ( ( N + 1 ) h ) = e 2 π h u h 1 ( N h ) .
From the general form u h 1 ( h γ ) , we have
u h 1 ( 0 ) = C 0 ν 1 ( 0 ) + C 1 ν 1 ( h ) + C 2 ν 1 ( 2 h ) + . . . + C N ν 1 ( N h ) ,
u h 1 ( h ) = C 0 ν 1 ( h ) + C 1 ν 1 ( 2 h ) + C 2 ν 1 ( 3 h ) + . . . + C N ν 1 ( ( N 1 ) h ) =
= e 2 π h C 0 + C 1 e h + C 2 e 2 h + . . . + C N e N h =
= e 2 π h u h 1 ( 0 )
and
u h 1 ( N h ) = C 0 e 2 π N h + C 1 e 2 π ( N 1 ) h + . . . + C N 2 π 0 ,
u h 1 ( ( N + 1 ) h ) = e 2 π h C 0 e 2 π N h + C 1 e 2 π ( N 1 ) h + . . . + C N =
= e 2 π h u h 1 ( N h ) .
These values of function u h 1 [ β ] are sufficient for us to determine the optimal coefficients. From (74),
C [ β ] = D h 1 [ β ] u h 1 [ β ] = α = 1 1 D h 1 ( h α ) u h 1 ( h α h β ) .
Hence, by virtue of formulas (74), (75) and (76), for the optimal coefficients C [ β ] , we have
C [ β ] = 1 π coth ( 2 π h ) · u h 1 [ β ] 1 2 π sinh 2 π h u h 1 [ β 1 ] 1 2 π sinh 2 π h u 1 [ β + 1 ] =
= 1 π coth 2 π h 0 1 p ( y ) ν 1 ( h β y ) d y 1 2 π sinh 2 π h 0 1 p ( y ) ν 1 ( h ( β 1 ) y ) d y
1 2 π sinh 2 π h 0 1 p ( y ) ν 1 ( h ( β + 1 ) y ) d y ,
at β = 1 , 2 , . . . , N 1 . From the general form of function ν m ( x ) from Formula (12), it follows
ν 1 ( x ) = π e 2 π x .
Keeping this in mind, we obtain
C [ β ] = coth ( 2 π h ) · 0 1 p ( y ) e 2 π h β y d y 1 2 sinh 2 π h 0 1 p ( y ) e 2 π h ( β 1 ) y d y
1 2 sinh 2 π h 0 1 p ( y ) e 2 π h ( β + 1 ) y d y , β = 1 , 2 , . . . , N 1 .
From (74), (75), (76) and (79), we obtain
C [ 0 ] = π coth 2 π h u h 1 [ 0 ] 1 2 π sinh 2 π h u h 1 [ h ] 1 2 π sinh 2 π h u h 1 [ h ] =
= coth ( 2 π h ) 0 1 p ( y ) e 2 π y d y e 2 π h 2 sinh ( 2 π h ) 0 1 p ( y ) e 2 π y d y
1 2 sinh ( 2 π h ) 0 1 p ( y ) e 2 π h y d y .
In the same way, taking into account (77), (78), (79) and (74), we have
C [ N ] = coth ( 2 π h ) · 0 1 p ( y ) e 2 π N h y d y 1 2 sinh ( 2 π h ) 0 1 p ( y ) e 2 π h N 1 y d y
1 2 sinh 2 π h 0 1 p ( y ) e 2 π h ( N + 1 ) y d y .
So, we have proven the following theorem:
Theorem 6. 
Among all quadrature formulas of the form
0 1 p ( x ) f ( x ) d x β = 0 N C [ β ] f [ β ] ,
there is a unique optimal quadrature formula in space H 2 μ R 0 , 1 , the coefficients of which H 2 μ R 0 , 1 ,
C [ 0 ] = 1 2 sinh 2 π h 0 1 p x 2 cosh 2 π h e 2 π h e 2 π x e 2 π x h d x ,
C [ β ] = 1 2 sinh 2 π h 0 1 p x [ 2 cosh 2 π h e 2 π x h β
e 2 π x h β + 1 e 2 π x h β 1 ] d x , β = 1 , N 1 ¯ ,
C [ N ] = 1 2 sinh 2 π h 0 1 p x 2 cosh 2 π h e 2 π h e 2 π ( x + 1 ) e 2 π x 1 + h d x ,
This leads to the following corollaries.
Corollary 1. 
Among all quadrature formulas of the form (2) with optimal coefficients, which minimizes the norm of the error functional (4) with equally spaced nodes in the H 2 μ R space for m = 1 and p x = 1 , the optimal one has the following form
0 1 f x d x cosh 2 π h 1 π sinh 2 π h 1 2 f 0 + f 1 + β = 1 N 1 f h β ,
here,
C 0 = cosh 2 π h 1 2 π sinh 2 π h ,
C β = cosh 2 π h 1 π sinh 2 π h for β = 1 , N 1 ¯ ,
C N = cosh 2 π h 1 2 π sinh 2 π h ,
where h is small parameter.
Corollary 2. 
Among all quadrature formulas of the form (2) with optimal coefficients, which minimizes the norm of the error functional (4) with equally spaced nodes in the H 2 μ R space for m = 1 and p x = e 2 π i ω x , the optimal one has the following form:
0 1 e 2 π i ω x f ( x ) d x β = 0 N C [ β ] f [ β ] ,
here,
C 0 = 1 2 π 1 + ω 2 sinh 2 π h e 2 π h e 2 π h i ω + i ω sinh 2 π h ,
C β = e 2 π i ω h β π ω 2 + 1 sinh 2 π h cosh 2 π h cos 2 π ω h , β = 1 , N 1 ¯ ,
C N = e 2 π i ω 2 π 1 + ω 2 sinh 2 π h cosh 2 π h e 2 π i ω h i ω sin 2 π h ,
where h is a small parameter.

9. Conclusions

Thus, in this work, we used the Sobolev method to solve a system of algebraic equations that determines the coefficients of quadrature formulas of the form (2). To achieve this, we created a discrete analogue D m β of the differential operator 1 1 2 π 2 d 2 d x 2 m that we used to solve the system of Equations (21) and (22). With this, we obtained explicit expressions for the optimal coefficients C β , which we used to construct weighted optimal quadrature formulas in space H 2 μ R in the form of Equation (2). Finally, we constructed an optimal quadrature formula in Hilbert space H 2 μ R for the case m = 1 , using weight functions p x = 1 and p x = e 2 π i ω x .

Author Contributions

Conceptualization, K.S. and I.J.; methodology, K.S. and I.J.; validation, I.J.; formal analysis; investigation, I.J.; writing—original draft preparation, I.J.; writing—review and editing, I.J.; supervision, K.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

All relevant data are within the manuscript.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Schoenberg, I.J. Cardinal Spline Interpolation; SIAM: Philadelphia, PA, USA, 1973; p. 1276. [Google Scholar]
  2. Schoenberg, I.J. On equidistant cubic spline interpolation. Bull. Am. Math. Soc. 1971, 77, 1039–1044. [Google Scholar] [CrossRef]
  3. Schumaker, L.L. Spline Functions: Basic Theory; Cambridge University Press: Cambridge, UK, 2007; p. 600. [Google Scholar]
  4. Blaga, P.; Coman, G. Some problems on quadrature. Stud. Univ. Babeş-Bolyai Math. 2007, 52, 21–44. [Google Scholar]
  5. Ghizzetti, A.; Ossicini, A. Quadrature Formulae; Academie Verlag: Berlin, Germany, 1970; p. 192. [Google Scholar]
  6. Köhler, P. On the Weights of Sard’s Quadrature Formulas. Calcolo 1988, 25, 169–186. [Google Scholar] [CrossRef]
  7. Lanzara, F. On optimal quadrature formulae. J. Ineq. Appl. 2000, 5, 201–225. [Google Scholar] [CrossRef]
  8. Schoenberg, I.J. On mono splines of least deviation and best quadrature formulae. J. Soc. Indust. Appl. Math. Ser. B Numer. Anal. 1965, 2, 144–170. [Google Scholar] [CrossRef]
  9. Schoenberg, I.J. On mono splines of least square deviation and best quadrature formulae II. SIAM J. Numer. Anal. 1966, 3, 321–328. [Google Scholar] [CrossRef]
  10. Sobolev, S.L. Introduction to the Theory of Cubature Formulas; Nauka: Mosow, Russia, 1974; p. 808. (In Russian) [Google Scholar]
  11. Sobolev, S.L. Coefficients of optimal quadrature formulas. Dokl. Akad. Nauk SSSR 1977, 235, 34–37. (In Russian) [Google Scholar]
  12. Sobolev, S.L. The coefficients of optimal quadrature formulas. In Selected Works of S.L. Sobolev; Springer: New York, NY, USA, 2006; pp. 561–566. [Google Scholar]
  13. Sobolev, S.L.; Vaskevich, V.L. The Theory of Cubature Formulas; Kluwer Academic Publishers Group: Dordrecht, The Netherlands, 1997; p. 484. [Google Scholar]
  14. Boltaev, A.K.; Akhmedov, D.M. On an exponential-trigonometric natural interpolation spline. AIP Conf. Proc. 2021, 2365, 020023. [Google Scholar]
  15. Babuska, I. Optimal quadrature formulas. Dokl. Akad. Nauk SSSR 1963, 149, 227–229. (In Russian) [Google Scholar]
  16. Sard, A. Best approximate integration formulas, best approximate formulas. Am. J. Math. 1949, LXXI, 80–91. [Google Scholar] [CrossRef]
  17. Catinaş, T.; Coman, G. Optimal quadrature formulas based on the φ-function method. Stud. Univ. Babeş-Bolyai Math. 2006, 51, 49–64. [Google Scholar]
  18. Coman, G. Formule de cuadrature de tip Sard. Univ. Babeş-Bolyai Ser. Math.-Mech. 1972, 17, 73–77. [Google Scholar]
  19. Coman, G. Monoplines and optimal quadrature. Formule Rend. Mat. 1972, 5, 567–577. [Google Scholar]
  20. Meyers, L.F.; Sard, A. Best approximate integration formulas. J. Math. Phys. 1950, XXIX, 118–123. [Google Scholar] [CrossRef]
  21. Nikol’skii, S.M. Quadrature Formulas; Nauka: Moscow, Russia, 1988; p. 256. (In Russian) [Google Scholar]
  22. Vasilenko, V.A. Spline Functions: Theory, Algorithms, Programs; Steklov Mathematical Institute: Novosibirsk, Russia, 1983; p. 215. (In Russian) [Google Scholar]
  23. Shadimetov, K.M. Optimal quadrature formulas of closed type in the space L 2 m (0,1). arXiv 2010, arXiv:1005.0163. [Google Scholar]
  24. Hayotov, A.R. The discrete analogue of a differential operator and its applications. Lith. Math. J. 2014, 54, 290–307. [Google Scholar] [CrossRef]
  25. Boltaev, A.K.; Hayotov, A.R.; Shadimetov, K.M. Construction of optimal quadrature formulas exact for exponential-trigonometric functions by Sobolev’s method. Acta Math. Sin. Engl. Ser. 2021, 37, 1066–1088. [Google Scholar] [CrossRef]
  26. Shadimetov, K.M.; Boltaev, A.K.; Parovik, R. Optimization of the Approximate Integration Formula Using the Discrete Analogue of a High-Order Differential Operator. Mathematics 2023, 11, 3114. [Google Scholar] [CrossRef]
  27. Ramazanov, M.D. Problems of the theory of lattice cubature formulas. In Cubature Formulas and Their Applications: Proceedings of the VI International Seminar-Conference; Institute of Mathematics with Computing Center UFSC RAS: Ufa, Russia, 2001; pp. 103–105. (In Russian) [Google Scholar]
  28. Ramazanov, M.D.; Shadimetov, K.M. Weighted optimal cubature formulas in periodic Sobolev space. Dokl. Akad. Nauk SSSR 1999, 4, 453–455. (In Russian) [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Shadimetov, K.; Jalolov, I. Weighted Optimal Formulas for Approximate Integration. Mathematics 2024, 12, 738. https://doi.org/10.3390/math12050738

AMA Style

Shadimetov K, Jalolov I. Weighted Optimal Formulas for Approximate Integration. Mathematics. 2024; 12(5):738. https://doi.org/10.3390/math12050738

Chicago/Turabian Style

Shadimetov, Kholmat, and Ikrom Jalolov. 2024. "Weighted Optimal Formulas for Approximate Integration" Mathematics 12, no. 5: 738. https://doi.org/10.3390/math12050738

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