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 in the Hilbert space , called . 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 . Finally, we construct an optimal quadrature formula in the Hilbert space for the weight functions and when .
Keywords:
differential operator; discrete analogue; Hilbert space; discrete argument functions; optimal quadrature formula MSC:
65D32
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 . 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 of the polyharmonic operator
The problem of the construction of the discrete operator 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 of the differential operator . In the work [24], it was possible to construct a discrete analogue of the differential operator . Furthermore, in the works [25,26], discrete analogues of differential operators (for odd m) and (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 , which are obtained by completing the finite Fourier series
in the following norm:
In the work of M.D. Ramazanov and Kh.M. Shadimetov [28], optimal cubature formulas were constructed in the space .
In the current work, we study Sard’s problem of constructing optimal quadrature formulas in a Hilbert space.
Definition 1.
Space is defined as the closure of infinitely differentiable functions defined in R and decreasing to infinity faster than any negative degree in the
Here, F and are direct and inverse Fourier transforms
and
When condition is satisfied, space is embedded in the space of continuous functions .
The inner product in is defined as follows:
We consider a quadrature formula of the form
where and are coefficients and nodes, respectively, and is a weighted function, and is an element of the Hilbert space .
The error of the quadrature formula is the difference
where
The error functional of the quadrature Formula (2) is denoted by . Here, is the characteristic function of the interval , and is the Dirac’s delta-function.
The error of the quadrature formula will be a linear and continuous functional from space dual to space , i.e., .
The quality of the quadrature formula is assessed using the norm of the error functional as follows:
The norm of the error functional depends on the coefficients . If
then they say that the functional corresponds to the optimal quadrature formula in .
The focus of this work is to investigate Sard’s problem and to construct optimal quadrature formulas using the Sobolev method in the 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 . In Section 7, a discrete analogue of the differential operator is constructed. Section 8 discusses the Sobolev method for constructing optimal quadrature formulas of the form (2) in space . Finally, under , optimal quadrature formulas are obtained for the cases of weight functions and .
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 , its extremal function is used.
Function is called an extremal function of functional if
Based on the Riesz theorem on the general form of a linear continuous functional in a Hilbert space for any , we have
where is a function from space which corresponds to the functional . The following theorem is true.
Theorem 1.
The extremal function of the error functional has the form
where is the weight function,
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
If in this equality, we assume
i.e., if we assume
then we will have
It follows, firstly, that
where
Function is an extremal function of the error functional (4). In this case, the squared norm of the error functional is calculated by the formula
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 .
The problem of minimizing the norm of the error functional for fixed nodes is to determine such coefficients for which
To find the coefficients , we rewrite equality (13) in a slightly different form
Equality (14) connects the problem of constructing the quadrature Formula (2) with the problem of approximating functions in by a linear combination of functions shifted to .
Indeed, from (14), it is clear that finding the smallest value of the norm of the error functional by coefficients at fixed nodes is equivalent to the best approximation of function by a linear combination of function , and it shifts by in the norm of space .
Let us first prove the following lemmas.
Lemma 1.
The following equality is true
Proof.
An extremal function of functional is a function of
Indeed, taking (11) into account, we have
By the Riesz theorem on the general form of a linear continuous functional on a Hilbert space, we have
Lemma 1 is proven. □
Lemma 2.
The system
is a linearly independent system.
Proof.
Hence and from Lemma 1, it follows that
Let us take the function
For this function, we have
On the other hand, we have
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 in . Thus, the linear span of functions is a -dimensional subspace in .
As is known from the theory of Hilbert spaces, an element is closest to an element only if the difference is orthogonal to each element in , i.e.,
Using the Fourier transform and the left side of equality (17), we reduce it to
From here, applying the inverse Fourier transform, we obtain
Hence, taking (17) into account, from (18), we obtain
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 . As such, it can be expressed in the following form:
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 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 as and as . We will also assume that is defined everywhere and is equal to zero when . After these changes, we can express system (20) as a convolution of functions with a discrete argument as follows:
where
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 that satisfies system B for given
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 we introduce the function
In this formulation, we only need to express through , i.e., find an operator that satisfies the equality
where
This will allow us to express in turn as
5. Modification of the Algorithm by S.L. Sobolev for Finding Optimal Coefficients
Some properties of function are given below.
- The parity of implies the parity of . This is obvious.
- The function decreases to infinity at a faster rate than any negative power of . Moreover, both and are infinitely differentiable functions. Due to the infinite differentiability and summability of and its derivatives, it can be concluded thatfor each .It follows that .
- The explicit form of . Due to the parity of , we haveFurther, we know that the equality is [10]We can obtain an explicit expression for the Fourier transform of the function in elementary functions by substituting and in the given equation. It is worth noting that the left side of (27) does not change when we replace x with because of the parity of the integrand. However, the right side is valid only for . Therefore, we replace the equality x with on the right side of the equation.
Let , then
Let , then
Here, the coefficients and , are unknown. So, we obtain the following task to find function having the form
Since with and from (26), we have
If we construct a discrete operator , then the unknown coefficients are determined from (29).
In the following paragraphs, we will deal with the construction of a discrete operator .
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 .
Then, Equation (25) in the class of harrow-shaped functions becomes the equation
where
According to [10], harrow-shaped functions and discrete argument functions are isomorphic. This means that instead of studying , we can focus on the function. To complete this, we can apply the Fourier transform to both sides of Equation (30). It is important to keep in mind that
and we get
From here, we have
Now, let us calculate the Fourier transform of the harrow-shaped function . It is known (see [10]) that
, and
Keeping these equalities in mind, we get
It is also known (see [23]) that
i.e.,
Therefore, taking into account (33) and (34), we have
Since , then from (35), we have
Function is a periodic function with period . Using equality (36), we must first determine , which will also be an N-periodic function, and then expand it into a Fourier series. Then, based on (32), we will have
where are the Fourier coefficients of function as follows:
Applying the Fourier inversion formula to equality (37), we arrive at the harrow-shaped function
To find the Fourier coefficients , 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 .
Lemma 3.
The following equality is true
Proof.
Let be the main function.
Then,
From the definition of equality of two generalized functions, it follows (39), which proves Lemma 3. □
From (36) and (39), it follows that
From (36), it is clear that is the sum of positive functions. Therefore,
From (32), it is clear that to determine the Fourier coefficients of function , we need to find the Fourier transform of function .
6. Algorithm for Constructing the Fourier Transform of Function
We are currently studying the process of constructing the Fourier transform of the function to determine the discrete analogue of the differential operator . This discrete analogue is used to construct optimal quadrature formulas in the space .
The following is true.
Theorem 3.
The Fourier transform of function is used to determine the discrete analogue of the differential operator , satisfying the equality (32). This analogue takes the form
Proof.
Using formulas (40), we calculate the Fourier transform of function We calculate equality (40) for as follows:
Thus, we have
Hence, denoting , we have
Applying the formulas for the sum of an infinitely decreasing geometric progression, we obtain
The following formula is valid
where is a finite difference of order i from , . For from (41), we have
Thus, using formulas (42), we have
where is a finite difference of the order of i from , .
Using for calculation, a finite difference of order i, type , the results of work [23] from equality (43), we have
and it follows that
which was what was required to be proven. □
To determine the Fourier coefficients of function , i.e., applying Theorem 3, we will deal with the expansion of the function 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 , which involves solving an equation using convolutions of a discrete argument: .
To complete this, we present some well-known results from [23].
If we denote the Euler polynomial by , then the coefficient of the Euler polynomial, as was shown by Euler himself, is expressed by the formula
The following theorem from [23] is valid.
Theorem 4.
Polynomial
is an Euler polynomial of degree k, and in addition,
or else
Now, let us prove the following theorem.
Theorem 5.
The discrete operator is defined by the formula
Proof.
From (46), we have
Also,
Substituting the found expressions (48) and (49) into (45), we obtain
Now, using Formula (75), we obtain
Then, equality (50) takes the following form
It is easy to see that
and
Using equalities (52) and (53), we rewrite expression (51) in the form
Let us denote by a polynomial of degree in , i.e.,
and through , it is a polynomial of the second degree in , i.e.,
and the following coefficients through , i.e.,
Taking into account notations (55), (56) and (57), we write equality (54) in the form
Let us denote by the next polynomial of degree in , i.e.,
From the notation (55) and (56), it follows that so the coefficients of the polynomial are symmetrical. If the roots of the polynomial , then is also a root of this polynomial. Hence, we have
We write the polynomial in the form
After these notations, we write (58) in the form
To construct this discrete operator, we use Formulas (32) and (60), i.e.,
From here,
To find the Fourier transform of functions , we expand the functions A into a Fourier series
In order to obtain the expansion of this function into a Fourier series, we divided the polynomial of degree from by the polynomial of degree from , i.e.,
Here, are the coefficients of the polynomial , and is a polynomial of degree then . Now, we decompose the rational fraction into elementary fractions
Here, are unknown coefficients, are roots of the polynomial with an absolute value less than one.
Taking (64) into account, equality (63) takes the following form
From here, we find , i.e.,
Substituting in equality (66) instead of , we obtain
From here, we consistently find
Since and then after some calculations, we obtain
Considering that and , then the sums and can be represented by a Laurent series on circle as follows:
Substituting expressions (69) and (70) into (65), we have
From equality (71) for the Fourier transform of given by Formula (61), we have
Hence, taking into account that and , then using Formulas (67), (68) after some simplifications we obtain
This is the Fourier series for function , i.e.,
where 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 from equality (26) as follows:
The value of is given by Formula (45) when . The value of is given by formula
when . Here, . However, we have not yet determined the value of the function for and .
Using Formula (17), we can determine the specific values of for and by using the form of the function for and . According to Formula (17),
where . Using the form of , we can show that
and .
From the general form , we have
and
These values of function are sufficient for us to determine the optimal coefficients. From (74),
Hence, by virtue of formulas (74), (75) and (76), for the optimal coefficients , we have
at . From the general form of function from Formula (12), it follows
Keeping this in mind, we obtain
From (74), (75), (76) and (79), we obtain
In the same way, taking into account (77), (78), (79) and (74), we have
So, we have proven the following theorem:
Theorem 6.
Among all quadrature formulas of the form
there is a unique optimal quadrature formula in space , the coefficients of which ,
This leads to the following corollaries.
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 of the differential operator that we used to solve the system of Equations (21) and (22). With this, we obtained explicit expressions for the optimal coefficients , which we used to construct weighted optimal quadrature formulas in space in the form of Equation (2). Finally, we constructed an optimal quadrature formula in Hilbert space for the case , using weight functions and .
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
- Schoenberg, I.J. Cardinal Spline Interpolation; SIAM: Philadelphia, PA, USA, 1973; p. 1276. [Google Scholar]
- Schoenberg, I.J. On equidistant cubic spline interpolation. Bull. Am. Math. Soc. 1971, 77, 1039–1044. [Google Scholar] [CrossRef]
- Schumaker, L.L. Spline Functions: Basic Theory; Cambridge University Press: Cambridge, UK, 2007; p. 600. [Google Scholar]
- Blaga, P.; Coman, G. Some problems on quadrature. Stud. Univ. Babeş-Bolyai Math. 2007, 52, 21–44. [Google Scholar]
- Ghizzetti, A.; Ossicini, A. Quadrature Formulae; Academie Verlag: Berlin, Germany, 1970; p. 192. [Google Scholar]
- Köhler, P. On the Weights of Sard’s Quadrature Formulas. Calcolo 1988, 25, 169–186. [Google Scholar] [CrossRef]
- Lanzara, F. On optimal quadrature formulae. J. Ineq. Appl. 2000, 5, 201–225. [Google Scholar] [CrossRef]
- 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]
- 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]
- Sobolev, S.L. Introduction to the Theory of Cubature Formulas; Nauka: Mosow, Russia, 1974; p. 808. (In Russian) [Google Scholar]
- Sobolev, S.L. Coefficients of optimal quadrature formulas. Dokl. Akad. Nauk SSSR 1977, 235, 34–37. (In Russian) [Google Scholar]
- 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]
- Sobolev, S.L.; Vaskevich, V.L. The Theory of Cubature Formulas; Kluwer Academic Publishers Group: Dordrecht, The Netherlands, 1997; p. 484. [Google Scholar]
- Boltaev, A.K.; Akhmedov, D.M. On an exponential-trigonometric natural interpolation spline. AIP Conf. Proc. 2021, 2365, 020023. [Google Scholar]
- Babuska, I. Optimal quadrature formulas. Dokl. Akad. Nauk SSSR 1963, 149, 227–229. (In Russian) [Google Scholar]
- Sard, A. Best approximate integration formulas, best approximate formulas. Am. J. Math. 1949, LXXI, 80–91. [Google Scholar] [CrossRef]
- Catinaş, T.; Coman, G. Optimal quadrature formulas based on the φ-function method. Stud. Univ. Babeş-Bolyai Math. 2006, 51, 49–64. [Google Scholar]
- Coman, G. Formule de cuadrature de tip Sard. Univ. Babeş-Bolyai Ser. Math.-Mech. 1972, 17, 73–77. [Google Scholar]
- Coman, G. Monoplines and optimal quadrature. Formule Rend. Mat. 1972, 5, 567–577. [Google Scholar]
- Meyers, L.F.; Sard, A. Best approximate integration formulas. J. Math. Phys. 1950, XXIX, 118–123. [Google Scholar] [CrossRef]
- Nikol’skii, S.M. Quadrature Formulas; Nauka: Moscow, Russia, 1988; p. 256. (In Russian) [Google Scholar]
- Vasilenko, V.A. Spline Functions: Theory, Algorithms, Programs; Steklov Mathematical Institute: Novosibirsk, Russia, 1983; p. 215. (In Russian) [Google Scholar]
- Shadimetov, K.M. Optimal quadrature formulas of closed type in the space (0,1). arXiv 2010, arXiv:1005.0163. [Google Scholar]
- Hayotov, A.R. The discrete analogue of a differential operator and its applications. Lith. Math. J. 2014, 54, 290–307. [Google Scholar] [CrossRef]
- 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]
- 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]
- 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]
- 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. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).