Abstract and Applied Analysis

Volume 2013 (2013), Article ID 523618, 12 pages

http://dx.doi.org/10.1155/2013/523618

Research Article

New Recursive Representations for the Favard Constants with Application to Multiple Singular Integrals and Summation of Series

Snezhana Georgieva Gocheva-Ilieva and Ivan Hristov Feschiev

Faculty of Mathematics and Computer Science, Paisii Hilendarski University of Plovdiv, 24 Tzar Assen Street, 4000 Plovdiv, Bulgaria

Received 11 February 2013; Accepted 22 April 2013

Academic Editor: Josip E. Pecaric

Copyright © 2013 Snezhana Georgieva Gocheva-Ilieva and Ivan Hristov Feschiev. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

There are obtained integral form and recurrence representations for some Fourier series and connected with them Favard constants. The method is based on preliminary integration of Fourier series which permits to establish general recursion formulas for Favard constants. This gives the opportunity for effective summation of infinite series and calculation of some classes of multiple singular integrals by the Favard constants.

1. Introduction

The Fourier series and related with them Achieser-Krein-Favard constants, often simply called Favard constants, have significant theoretical and practical roles in many areas [1, 2]. These remarkable mathematical constants are introduced firstly in the theory of Fourier series and approximations of functions by trigonometric polynomials [3].

The classical definitions of Favard constants are given by the infinite series [1, 4, 5]

These constants find wide applications in the approximation theory for exact and asymptotic results on the approximation of functions, and especially for the best approximations of trigonometric and other classes of functions in different spaces and related inequalities [1, 5–14]. In particular, many important applications are concerned with the approximation of Euler, cardinal, periodic, and other type of splines [15–17]. It can be noted that Favard constants are connected to approximations that are best in a pointwise sense in comparison, for instance, with the Lebesgue constants which are connected to approximations that are best in a least-squares sense (Fourier series) [5]. The Favard constants play also an important role in estimating optimal quadrature and cubature formulas, calculation of singular integrals, some classes of differential, integrodifferential and integral equations [18–24], and in other areas.

Nevertheless widely used, as a whole, the properties of the Favard constants have not been investigated well enough [14], except for some particular cases.

Different methods for their calculation are given, for instance, in [2, Ch. 5.2]. In general these methods are based on the properties of the well-known constants and special functions as gamma function , generalized Riemann zeta function , the Bernoulli polynomials and the Bernoulli numbers , and the Euler polynomials and the Euler numbers , given by the following expressions [2]:

From now on we will use the following notations:

where the three multiple singular integrals (4) contain exactly integral operations.

The main purpose of this paper is to establish new recursive formulas for the Favard constants (1), including only finite number of terms and recursive formulas for (2). They will be further used to obtain new integral representations for the previously stated objects, in particular for calculation of the multiple singular integrals (4) and summation of series.

2. Recursive Representations for and Some Fourier Series

We will prove the following.

Theorem 1. For the constants (), the following recursive representations hold:

Proof. We will use the method of induction and preliminary integration of appropriate Fourier series. Let us start by the well-known expansion [2]

where for we will have . By integration of both sides of (8) in , we get

For , (9) gives us , and consequently . The same results for and can be achieved starting from the equality [2]

For we find again that . After integration of the both sides of (10), we have

For we find that . Next after integration of the both sides of (11), we obtain

which for gives us

If we put in the same equality (12) and make a little processing, we will arrive at the value .

On the other hand, after integration of both sides of (9), we obtain

Here for , we get , and consequently

For the constant , we must now integrate both sides of (12) as

and put here, or integrate both sides of (14) as

and put again . Then we will have

Going on the indicated procedure on the base of induction, we easily arrive at the recursive representations (7a) and (7b) and complete the proof.

Remark 2. The scheme of this proof is valid for the most of the other statements in this paper.

In connection with Theorem 1, we would like to note another representation of (see, e.g., [25]). It can be written in terms of Lerch transcendent [25], or as it is shown in [2, Section ]

where the Bernoulli and Euler numbers are specified in (3).

Data for values of magnitudes of using (7a) and (7b) are shown in Table 1.

Table 1: Exact and approximate values of the Favard constants , calculated by the recursive formulas (7a) and (7b) using Mathematica software package.

Exact values of
Approximate values of

1

1.5707963267948966192313216916

2

1.2337005501361698273543113749

3

1.2919281950124925073115131277

4

1.2683475395052400681828168318

5

1.2750820199386727219280887918

6

1.2726723265645306132561498711

7

1.2734371248066831633864461900

8

1.2731754806526058136347769671

9

1.2732612424724875463814366656

10

1.2732323827293948495082797108

11

1.2732419458721540967715077901

12

1.2732387471572495304117396905

The equalities (10)–(13) outline a procedure for summing up the numerical series , () in (6). It leads to the assertion.

Corollary 3. The following recursive representation holds:

where for by definition .

It can be noted that the numbers can be also represented by the well known formula (see, e.g., [2, 5.1.2])

The same procedure applied on the base of the equality

leads to the following.

Corollary 4. The following recursive representation holds:

where for by definition .

In this connection we will note the explicit formula for represented by the Bernoulli numbers (see [2, 5.2.1])

It is easy to see that the constants satisfy the following inequalities (see also [1]):

and .

The procedure of getting the representations (11), (12), and (16) with the help of (10) gives us an opportunity to lay down the following.

Theorem 5. The following recursive representations hold:

(, (), for by definition and , ).

At the same time both series in (26) have the well-known representations [2, 5.4.2]

The previously stated procedure for obtaining (26) can now be applied on the strength of (22). This leads to the assertion.

Theorem 6. The following recursive representations hold:

(, (); for by definition and , ).

At the same time, both series in (28) have the well-known representations [2, 5.4.2]

By analogy with the previous, the procedure for obtaining (9), (14), and (17) with the help of (8) leads us to the following.

Theorem 7. The following recursive representations hold:

(); for   by definition   ().

At the same time, both series in (30) have the well-known formulas [2, 5.4.6]

The same procedure applied on the base of the equality

gives us the next theorem.

Theorem 8. The following recursive representations hold:

(, (), for : declines, ,  ()).

At the same time, both series in (33) have the well-known representations ([2, ])

Meanwhile it is important to note that the number of addends in our recurrence representations (26), (28), (30), and (33) is two times less than the number of the addends in the corresponding cited formulas from [2]. So our method appears to be more economic and effective.

Moreover, one can get many other representations of the constants () and numerical series () from Theorems 5–8 putting, in particular, or . For completeness we will note the main results.

From Theorem 5 for and immediately follows the following.

Corollary 9. For the Favard constants , the following recursive representations hold:

(, for : ).

For , one can get (20) too by replacing previously by .

For , we obtain the next corollary.

Corollary 10. For numbers , the following recursive representations hold:

(, for : .

Similarly, from Theorem 6 for and , we obtain, respectively, the following.

Corollary 11. For the Favard constants , the following recursive representations hold:

where , and for : , .

For , one can get (23) too by replacing previously by .

For from Theorem 6, (the second formula in (28)), we will have also the next analogous corollary.

Corollary 12. For numbers , the following recursive representations hold:

(, for : , ).

By the same manner from Theorem 7 for and , we obtain, respectively, the formulas for () different from these in Theorem 1.

Corollary 13. For the Favard constants and , the following recursive representations hold:

(, for ,   must be canceled) and

(, for , must be canceled).

The remaining cases for and immediately lead to Theorem 1 after replacing by .

From Theorem 8 for , one can get, respectively, other representations for (), different from these in Theorem 1.

Corollary 14. For the Favard constants , the following recursive representations hold:

where , for : , and for :   must be canceled.

Corollary 15. From the difference () and after replacing by in the obtained expression, one gets the following formula:

This is somewhat better than the corresponding formula in Theorem 1, because for .

3. Recursive Representations for and Some Fourier Series

Here we will get down to the integral representation and recursive formulas for the constants , defined in (2). As one can see they are closely linked with the approximation of the conjugate classes of functions obtained on the base of the Hilbert transform [1, 26]. First of all let us note their representations easily obtained by means of special functions in (3) as it is shown in [2, 5.1.4] for the Catalan constant as follows:

In the beginning we will prove the following assertion.

Theorem 16. For the constants (), the following recursive representations hold:

Proof. The proof of this theorem is based on induction again. However, for completeness we must give somewhat more detailed considerations at first steps, which underline further discussions.

Let us start by the well-known Fourier expansions (see, e.g., [2, 5.4])

For , the first equality gives us immediately . At the same time, the second equality in (45) leads to . So we obtain the integral representation of in the form

We have another integral representation of the same constant in our paper [8].

Further by integration of both sides of the first equality in (45), we get

from where for and we have simultaneously and , and consequently

Then, after the integration of both sides of the second equality in (45), we obtain

from where for we have . If we correspond this with (48), we find

In order to obtain the integral representation of , we must, at first, integrate the both sides of (47) as

Next it remains to put as

As another integral representation of , we can get after integration of both sides of (49)

On one hand, for , (53) gives

On the other hand, the same equality (53) for gives . Then

For the constant there are also different ways to receive its integral representations. One of them is based on the integration of both sides of (53) as

For , (56) gives (. Admitting (54) we will have

Another integral representation of can be obtained by integration of both sides of (51) as

For and , we get, respectively,

Further after integration of both sides of (56), we get

On one hand, if we put here and admit (54), we will have

On the other hand, the same formula (60) for gives us . Then admitting (54) and (61), we obtain

Next, in order to receive another integral representation of , we must integrate both sides of (58). So we will have

Putting , here, we get

Now after this preparatory work, we can go on the indicated procedure which leads us to the general recursive representations (43) and so complete the proof.

The previously stated procedure gives us the opportunity to obtain recursive formulas for the multiple integrals , , and in (4) for a given .

First of all we will note that on the base of induction and with the help of the first formula in (45), (47), (51), (58), and (63), we can lay down the following.

Theorem 17. For the multiple singular integrals , the following recursive representations hold:

(), , for :  (), and , where

By analogy with the previous and by means of the second formula in (45), (49), (53), (56), and (60), one can get the following.

Theorem 18. For the multiple singular integrals , the following recursive representations hold:

(), , for :  () declines, by definition   (), where (see [2])

As similar representations of , one can get on the base of the expansion (see [2, 5.4.2])

Theorem 19. For the multiple singular integrals , the following recursive representations hold:

(), for :  (), () declines, where (see [2])

By analogy with the previous, if we start from the expansion [2, ]

we can obtain the next theorem.

Theorem 20. The following recursive formulas hold:

(), , for :  (), where

The proof of this theorem requires to take integration from to and then to make the substitution .

From Table 2 one can see that  , . The constants satisfy the following inequalities [1]:

Table 2: Calculated values of the magnitudes , , and for , by using formulas (65), (67), and (70), respectively.

0

0.346573590279972654709
0.34657359027997265471

1
−1.831931188354438030
−0.91596559417721901505
0.91596559417721901506

2
−2.103599580529289999
−1.31474973783080624966
0.78884984269848374979

3
−1.326437390660483389
−0.89924201634043412749
0.42719537432004926159

4
−0.586164434174921923
−0.41567176475313624651
0.17049266942178567636

5
−0.200415775434410589
−0.14636851588819525831
0.05404725954621533063

6
−0.055999130148030908
−0.04177075772178286763
0.01422837242624804042

7
−0.013242890305882861
−0.01003832077074076074
0.00320456953514210000

8
−0.002716221784223860
−0.00208540018388810697
0.00063082160033575329

9
−0.000492033289602442
−0.00038173093475665008
0.00011030235484579206

10
−0.000079824623761109
−0.00006247448634651347
0.00001735013741459518

11
−0.000011727851308441
−0.00000924763886476940
0.00000248021244367167

12
−0.000001574609462951
−0.00000124968150024699
0.00000032492796270360

r

0

0.693147180559945309417

1
0
0
0

2
−4.2071991610585799989
−2.10359958052928999945
2.10359958052928999945

3
−6.6086529882853881226
−3.77637313616307892720
2.83227985212230919540

4
−6.3627527878802461560
−3.92286552530160912232
2.43988726257863703368

5
−4.5591894893017946564
−2.95428020294335768590
1.60490928635843697049

6
−2.6255391709472096141
−1.76271265891422894113
0.86282651203298067295

7
−1.2684915655900274347
−0.87472015815662857450
0.39377140743339886016

8
−0.5287656648068309189
−0.37237211738940254175
0.15639354741742837714

9
−0.1940031559506448617
−0.13897143291435930434
0.05503172303628555739

10
−0.0635985732918145806
−0.04620733330628432785
0.01739123998553025277

11
−0.0188489390019113804
−0.01385968931040814707
0.00498924969150323336

12
−0.0050985327885974909
−0.00378779048977775268
0.00131074229881973820

Remark 21. The equalities (49), (53), (56), and (60) outline a procedure for summing up the numerical series () in (2). It leads us to the following.

Corollary 22. The following recursive representation holds:

for   the term   declines.

For comparison we will note also the well-known formula [2, 5.1.2]

The same procedure based on induction and preliminary multiple integration of both sides of (69) leads us to the next.

Corollary 23. The following recursive representation holds:

, for the term declines.

As in previous, let us give the alternate formula [2, 5.1.3]

At the end we would like to note also that one can get many other representations (through multiple integrals) of the constants () from Theorems 17–20 setting, in particular, or , as it is made for the constants .

From the difference (), one can get the following formula:

which is somewhat inferior to the similar recursion formula in Theorem 16 because for .

As an exception we will give the inverse formula of (80) as

If we, by definition, lay , then the equality (80) is valid for too.

4. Some Notes on Numerical and Computer Implementations of the Derived Formulas

We will consider some aspects of numerical and symbolic calculations of the Favard constants , singular integrals (4), and summation of series.

Let us take only the first , terms in the final sums in the right-hand side of the formulas (7a) and (7b) and denote the remaining truncation sums by

respectively.

Theorem 24. For and any , the following estimates for the truncation errors (82) hold:

where Landau big notation is used. For the Landau notation see [27].

Proof. By means of the inequalities (25), it is easy to obtain

Consequently, . In the same way for the second truncation sum, we have

By the details of the proof it follows that the obtained representations did not depend on , for any . The a priori estimates (83) can be used for calculation of with a given numerical precision in order to decrease the number of addends in the sums for larger at the condition .

Remark 25. The error estimates, similar to (83), can be established for other recurrence representations in this paper too.

In Algorithm 1, we provide the simplest Mathematica code for exact symbolic and numerical calculation with optional 30 digits accuracy of the Favard constants for , based on recursive representations (7a) and (7b) for a given arbitrary integer . The obtained results are given in Table 1. We have to note that this code is not the most economic. It can be seen that the thrifty code will take about or arithmetic operations in (7a) and (7b).

;   Array  ;  ;  

For  ,

        ;

        ;

For [s = 1,  s ≤ m,  s ++, Print [,  "    ",  N[, 30]]];

Algorithm 1: Mathematica code for exact symbolic and approximate computation with optional 30 digits accuracy of the Favard constants by recursive representations (7a) and (7b).

The basic advantage of using formulas (7a) and (7b) is that they contain only finite number of terms (i.e., finite number of arithmetic operations) in comparison with the initial formula (), which needs the calculation of the slowly convergent infinite sum. It must be also mentioned that in Mathematica, Maple, and other powerful mathematical software packages, the Favard constants are represented by sums of and related functions, which are calculated by the use of Euler-Maclaurin summation and functional equations. Near the critical strip they also use the Riemann-Siegel formula (see, e.g., [28, A.9.4]).

Finally, we will note that the direct numerical integration in (4) is very difficult. This way a big opportunity is given by Theorems 17, 18, and 19 (formulas (65), (67) and (70)) for effective numerical calculation of the classes of multiple singular integrals , and for any . Their computation is reduced to find the finite number of the Favard constants for all and the calculation of one additional numerical sum. Numerical values for some of the singular integrals are presented in Table 2.

5. Concluding Remarks

As it became clear, there are many different ways and well-developed computer programs at present, for calculation of the significant constants in mathematics (in particular Favard constants) and for summation of important numerical series. Most of them are based on using of generalized functions as one can see in [2–5]. Nonetheless, we hope that our previously stated approach through integration of Fourier series appears to be more convenient and has its theoretical and practical meanings in the scope of applications, in particular for computing of the pointed special types of multiple singular integrals. The basic result with respect to multiple integrals reduces their calculation to finite number of numerical sums.

Acknowledgments

This paper is supported by the Bulgarian Ministry of Education, Youth and Science, Grant BG051PO001/3.3-05-0001 “Science and business,” financed under operational program “Human Resources Development” by the European Social Fund.

References

N. Korneĭchuk, Exact Constants in Approximation Theory, vol. 38, chapter 3, 4, Cambridge University Press, New York, NY, USA, 1991.

A. P. Prudnikov, A. Yu. Brychkov, and O. I. Marichev, Integrals and Series: Elementary Functions, chapter 5, CRC Press, Boca Raton, Fla, USA, 1998.

J. Favard, “Sur les meilleurs precedes d'approximation de certaines classes de fonctions par des polynomes trigonometriques,” Bulletin des Sciences Mathématiques, vol. 61, pp. 209–224, 1937.

S. R. Finch, Mathematical Constants, Cambridge University Press, New York, NY, USA, 2003.

J. Bustamante, Algebraic Approximation: A Guide to Past and Current Solutions, Springer Basel AG, Basel, Switzerland, 2012.

S. Foucart, Y. Kryakin, and A. Shadrin, “On the exact constant in the Jackson-Stechkin inequality for the uniform metric,” Constructive Approximation, vol. 29, no. 2, pp. 157–179, 2009.

Yu. N. Subbotin and S. A. Telyakovskiĭ, “On the equality of Kolmogorov and relative widths of classes of differentiable functions,” Matematicheskie Zametki, vol. 86, no. 3, pp. 432–439, 2009.

I. H. Feschiev and S. G. Gocheva-Ilieva, “On the extension of a theorem of Stein and Weiss and its application,” Complex Variables, vol. 49, no. 10, pp. 711–730, 2004.

R. A. DeVore and G. G. Lorentz, Constructive Approximation, vol. 303, Springer, Berlin, Germany, 1993.

V. P. Motornyĭ, “On sharp estimates for the pointwise approximation of the classes by algebraic polynomials,” Ukrainian Mathematical Journal, vol. 53, no. 6, pp. 916–937, 2001, Translation from Ukrains'kyi Matematychnyi Zhurnal, vol. 53, no. 6, pp. 783–799, 2001

W. Xiao, “Relative infinite-dimensional width of Sobolev classes ,” Journal of Mathematical Analysis and Applications, vol. 369, no. 2, pp. 575–582, 2010.

P. C. Nitiema, “On the best one-sided approximation of functions in the mean,” Far East Journal of Applied Mathematics, vol. 49, no. 2, pp. 139–150, 2010.

O. L. Vinogradov, “Sharp inequalities for approximations of classes of periodic convolutions by subspaces of shifts of odd dimension,” Mathematical Notes, vol. 85, no. 4, pp. 544–557, 2009, Translation from Matematicheskie Zametki, vol. 85, no. 4, pp. 569–584, 2009

A. V. Mironenko, “On the Jackson-Stechkin inequality for algebraic polynomials,” Proceedings of Institute of Mathematics and Mechanics, vol. 273, supplement 1, pp. S116–S123, 2011.

V. F. Babenko and V. A. Zontov, “Bernstein-type inequalities for splines defined on the real axis,” Ukrainian Mathematical Journal, vol. 63, pp. 699–708, 2011.

G. Vainikko, “Error estimates for the cardinal spline interpolation,” Journal of Analysis and its Applications, vol. 28, no. 2, pp. 205–222, 2009.

O. L. Vinogradov, “Analog of the Akhiezer-Krein-Favard sums for periodic splines of minimal defect,” Journal of Mathematical Sciences, vol. 114, no. 5, pp. 1608–1627, 2003.

L. A. Apaĭcheva, “Optimal quadrature and cubature formulas for singular integrals with Hilbert kernels,” Izvestiya Vysshikh Uchebnykh Zavedeniĭ, no. 4, pp. 14–25, 2004.

F. D. Gakhov and I. Kh. Feschiev, “Approximate calculation of singular integrals,” Izvestiya Akademii Nauk BSSR. Seriya Fiziko-Matematicheskikh Nauk, vol. 4, pp. 5–12, 1977.

F. D. Gakhov and I. Kh. Feschiev, “Interpolation of singular integrals and approximate solution of the Riemann boundary value problem,” Vestsī Akadèmīī Navuk BSSR. Seryya Fīzīka-Matèmatychnykh Navuk, no. 5, pp. 3–13, 1982.

B. G. Gabdulkhaev, “Finite-dimensional approximations of singular integrals and direct methods of solution of singular integral and integro-differential equations,” Journal of Soviet Mathematics, vol. 18, pp. 593–627, 1982.

V. P. Motornyĭ, “Approximation of some classes of singular integrals by algebraic polynomials,” Ukrainian Mathematical Journal, vol. 53, no. 3, pp. 377–394, 2001.

E. Vainikko and G. Vainikko, “Product quasi-interpolation in logarithmically singular integral equations,” Mathematical Modelling and Analysis, vol. 17, no. 5, pp. 696–714, 2012.

H. Brass and K. Petras, Quadrature Theory: The Theory of Numerical Integration on a Compact Interval, vol. 178, American Mathematical Society, Providence, RI, USA, 2011.

E. W. Weisstein, “Favard constants,” http://mathworld.wolfram.com/FavardConstants.html

A. G. Zygmund, Trigonometric Series, vol. 1, Cambridge University Press, 2nd edition, 1959.

D. E. Knuth, The Art of Computer Programming. Vol. 1: Fundamental Algorithms, Section 1.2.11: Asymptotic Representations, Addison-Wesley, 3rd edition, 1997.

S. Wolfram, The Mathematica Book, Wolfram Media, Champaign, Ill, USA, 5th edition, 2003.