Journal of Mathematics
Volume 2016 (2016), Article ID 9048671, 7 pages
http://dx.doi.org/10.1155/2016/9048671

Research Article

Applications of Cesàro Submethod to Trigonometric Approximation of Signals (Functions) Belonging to Class in -Norm

M. L. Mittal and Mradul Veer Singh

Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee 247667, India

Received 28 July 2015; Revised 18 November 2015; Accepted 11 February 2016

Academic Editor: Mohsen Tadi

Copyright © 2016 M. L. Mittal and Mradul Veer Singh. 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.

We prove two Theorems on approximation of functions belonging to Lipschitz class in -norm using Cesàro submethod. Further we discuss few corollaries of our Theorems and compare them with the existing results. We also note that our results give sharper estimates than the estimates in some of the known results.

Dedicated to Professor S. C. Gupta

1. Introduction

For a given signal (function) , , let

denote the partial sums, called trigonometric polynomials of degree (or order) , of the first terms of the Fourier series of at a point .

Define

The trigonometric Fourier series of signal is said to be -summable to , if as .

Throughout , a linear operator, will denote an infinite lower triangular matrix with nonnegative entries and row sums 1. Such a matrix is said to have monotone rows if, , is either nonincreasing or nondecreasing in , . A linear operator is said to be regular if it is limit-preserving over the space of convergent sequences.

Note 1. In (2), behaves as a digital filter if and denote the input and output sequences of information, respectively. By taking different values of , we get a variety of digital filters, For example, if , we get a very popular digital filter known as Cesàro filter. Psarakis and Moustakides [1, p. 591] have mentioned that the digital filters are widely used in various signal processing applications. During past few decades, various techniques for designing digital filters have been suggested. It is worth mentioning that the most common techniques use, as approximation criterion, the minimization of the -measure . Thus the designing of digital filters has been recognized as an approximation problem. Here we are interested in approximations of functions in -space.

A signal (function) in is approximated by trigonometric polynomials of order (or degree) and the degree of approximation is given by . This method of approximation is called trigonometric Fourier approximation (tfa). Further nice applications of tfa can be found in [2, 3] and the references given there.

The integral modulus of continuity [4] of is defined by

If, for , , then (). Throughout will denote the -norm, defined by , ().

A positive sequence is called almost monotone decreasing (increasing) if there exists a constant , depending on the sequence only, such that, for all , (). Such sequences will be denoted by and , respectively. A sequence which is either or is called almost monotone sequence and will be denoted by .

A sequence of nonnegative numbers tending to zero is called a rest bounded variation sequence or briefly [5, 6], if it has the property for all natural numbers , where is a constant depending upon only.

A sequence of nonnegative numbers is called a head bounded variation sequence or briefly [6], if it has the property for all natural numbers , or only for all if the sequence has only a finite number of nonzero terms and the last nonzero term is .

When we write that a sequence belongs to one of the above classes, it means that it satisfies some of the above conditions with respect to for all .

Let . If (), then we shall say that is an almost monotone decreasing (increasing) mean sequence, or briefly () [7].

Let . If (), then we shall say that is an almost monotone decreasing (increasing) upper mean sequence or briefly () [8].

Note 2. If () is the class of nonnegative and nonincreasing (non-decreasing) sequences, then the following inclusion relations are true [7, 8] for the above classes of numerical sequences:

Also and .

Let be an infinite subset of and as the range of strictly increasing sequence of positive integers, say . The Cesàro submethod is defined as

where is a sequence of real or complex numbers. Therefore, -method yields a subsequence of the Cesàro method , and hence it is regular for any . -matrix is obtained by deleting a set of rows from Cesàro matrix. The basic properties of -method can be found in [9, 10].

The notation means the greatest integer contained in .

2. Known Results

Let , , denote the th term of the Cesàro, Nörlund, and Riesz transform of the partial sums of the Fourier series of a -periodic function , respectively. In 1937, Quade [11] proved that, if , then for either (i) and or (ii) and . He also showed that, if , then . These results have been further generalized by various investigators in [5–8, 12–21]. In 2002, Chandra [13] has extended the work of Quade [11] and proved three theorems on the trigonometric approximation using Nörlund and Riesz matrices.

Mittal and Rhoades [22, 23] have initiated the studies of error estimates through tfa for the situations in which the summability matrix does not have monotone rows. Leindler [16] has extended the results of Chandra [13] without the assumption of monotonicity on the generating sequence , while Mittal et al. [17, 18] have extended some results of Chandra [13] and Leindler [16] to general matrices. Recently Deger et al. [14] have extended the results of Chandra [13] in view of Armitage and Maddox [9]. Very recently, in [19], the authors of this paper have generalized two theorems of Deger et al. [14], by dropping the monotonicity on the elements of the matrix rows. These results also generalize the results of Leindler [16] to more general -method.

Szal [8], in 2009, has obtained the same degree of approximation as in theorems proved by Leindler [16] and Chandra [13] for more general class of triangular matrices. He has proved the following theorem for the Nörlund type means.

Theorem A (see [8]). Let and be an infinite lower triangular regular matrix with nonnegative entries and row sums 1. If one of the conditions,

(i), , and ,(ii), , , and ,(iii), , and ,(iv), , and ,(v), for some , and , holds, then

where .

In 2012, Mohapatra and Szal [7] have proved some embedding results on the classes of sequences; few of them are given here in Note 2. Further they proved the following theorem for Riesz type means.

Theorem B (see [7]). Let and be an infinite lower triangular regular matrix with nonnegative entries and row sums 1. If one of the conditions,

(i), , and ,(ii), , , and ,(iii), , and ,(iv), , , and ,(v), , , and ,(vi), for some , and , is maintained, then

In continuation of Mittal and Singh [19, 20], in this paper, we generalize the results of Mohapatra and Szal [7] and Szal [8] using more general -method to get sharper estimates as mentioned in Remark 6 (given afterwards). Further we show its connections with the existing results as corollaries.

3. Main Results

We prove the following theorems:

Theorem 1. Let and be an infinite lower triangular regular matrix with nonnegative entries and row sums 1. If one of the conditions,

(i), , and ,(ii), , , and ,(iii), , and ,(iv), , , and ,(v), , , and ,(vi), for some , and , is maintained, then

where , .

Theorem 2. Let and be defined as in Theorem 1. If one of the conditions,

(i), , and ,(ii), , , and ,(iii), , and ,(iv), , and ,(v), for some , and , holds, then

where .

Corollary 3. If , then our Theorems 1 and 2 generalize the results of Mohapatra and Szal [7] and Szal [8], respectively.

Corollary 4. If , then our Theorems 1 and 2 extend very recent results of Deǧer and Kaya [15].

Corollary 5. In view of Note 2, our Theorems 1 and 2 have been proved with the less stringent conditions than that of results in [20] where the authors have proved a theorem using , . Thus our results also generalize the earlier results of Mittal et al. [18, 19], Leindler [16], Chandra [13], and Quade [11].

Remark 6. The estimates in our Theorems 1 and 2 are in terms of and sharper than the estimates in Mittal et al. [18], Leindler [16], Chandra [13], and Quade [11] as for .

4. Lemmas

We shall use the following lemmas in the proofs of our Theorems.

Lemma 7 (see [11, p. 538]). If , for , , then, for any positive integer , may be approximated in by a trigonometric polynomial, , of order such that

Lemma 8 (see [11, p. 539]). If , for and , then

Lemma 9 (see [11, p. 541]). If , for , then

Lemma 10 (see [11, p. 541, last line]). If , for , then

Note 3. We are using sums up to in the th partial sums and and writing these sums and , respectively, in the above lemmas for our purpose.

Lemma 11. Let be defined as in Theorem 1. If either (i) or (ii) and , then, for ,

Proof. Let . Then

By Abel’s transformation and using the Lagrange Mean Value Theorem to the function , on the interval , we get

(i) If , that is, , then

(ii) If , that is, , and , then, as mentioned above, the proof of this case runs parallel to that of case (i).

Lemma 12. Let be a trigonometric polynomial as in Lemma 7. If for some and , then

Proof. If denotes the partial sum of the first terms of the Fourier series of (as in [13, p. 14 & 21]) at , then for

Thus

where

Using the generalized Minkowski inequality [24, p. 37], we get

where .
Now using , we have .
If for some , then as . This further implies that , since, for ,

Using , (), and ,

Putting , in (22) and using Lemma 7, we get

This completes the proof of Lemma 12.

Lemma 13. Let be defined as in Theorem 1. If either (i) or (ii) and . Then for ,

Lemma 14. Let be a trigonometric polynomial as in Lemma 7. If for some and , then

We omit the proofs of Lemmas 13 and 14 as they are similar to that of Lemmas 11 and 12, respectively.

5. Proofs of Main Results

5.1. Proof of the Theorem 1

Cases (i) and (ii). Since , thus, using Lemmas 8 and 11, we have

This completes the proofs of (i) and (ii).

Case (iii). In view of Note 3, we use as and then, using Abel’s transformation twice,

Hence by Minkowski’s inequality, we get

Since

thus by Lemma 10

If , then

in view of (30), (32), and Lemma 8.

Cases (iv) and (v). Using Abel’s transformation,

Using Lemma 9, we get

Using conditions and , we get

This completes the proof of case (iv).

Further, if , then we have

Therefore from (35), (37), and (as ), we get

since . This completes the proof of case (v).

Case (vi). By Lemmas 7 and 12, we have

Using Abel’s transformation, we get

since and . This completes the proof of case (vi) and hence the proof of Theorem 1.

5.2. Proof of the Theorem 2

We omit the details as the proof is similar to that of Theorem 1. We use Lemmas 13 and 14 instead of Lemmas 11 and 12.

6. New Contribution

In classical Fourier analysis many results on tfa of functions in certain function spaces have been established using monotonicity condition on the elements of summability matrices. These results can be generalized in two possible directions. One is to use more general method and the other is to weaken the monotonicity condition. To achieve the latter aim, various generalizations of the monotonicity condition such as semimonotonicity, quasimonotonicity, , , , and were suggested by many authors from time to time. Weakening the monotonicity condition will enhance the quality of a digital filter in view of Note 1.

Motivated by these ideas we improve the results of Mohapatra and Szal [7] and Szal [8] using Cesàro submethod which in turn generalize various known results in the light of recent developments and in view of Note 2. We also note that we get sharper estimates than that of [7, 8] as for . A few more applications of sharper estimates and tfa can be seen in [18, p. 4484].

Remark 15. The study of degree of approximation of functions in other function spaces such as , weighted Lipschitz, Hölder, and Zygmund classes may be the future interest of few investigators in this direction.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgment

The second author is thankful to Ministry of Human Resource Development, India, for financial support to carry out this research work.

References

E. Z. Psarakis and G. V. Moustakides, “An L₂-based method for the design of 1-D zero phase FIR digital filters,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 44, no. 7, pp. 591–601, 1997.

W. K. Chen, Mathematics for Circuits and Filters, CRC Press, 2000.

J. G. Proakis, Digital Communications, McGraw-Hill, New York, NY, USA, 1995.

A. Zygmund, Trigonometric Series. Volume I, II, Cambridge Mathematical Library, Cambridge University Press, Cambridge, UK, 1988, reprint of the 1979 edition.

L. Leindler, “On the uniform convergence and boundedness of a certain class of sine series,” Analysis Mathematica, vol. 27, no. 4, pp. 279–285, 2001.

L. Leindler, “On the degree of approximation of continuous functions,” Acta Mathematica Hungarica, vol. 104, no. 1-2, pp. 105–113, 2004.

R. N. Mohapatra and B. Szal, “On trigonometric approximation of functions in the Lp-norm,” http://arxiv.org/abs/1205.5869

B. Szal, “Trigonometric approximation by Nörlund type mean in Lp-norm,” Commentationes Mathematicae Universitatis Carolinae, vol. 50, no. 4, pp. 575–589, 2009.

D. H. Armitage and I. J. Maddox, “A new type of Cesàro mean,” Analysis, vol. 9, no. 1-2, pp. 195–204, 1989.

J. A. Osikiewicz, “Equivalence results for Cesàro submethods,” Analysis, vol. 20, no. 1, pp. 35–43, 2000.

E. S. Quade, “Trigonometric approximation in the mean,” Duke Mathematical Journal, vol. 3, no. 3, pp. 529–543, 1937.

P. Chandra, “A note on degree of approximation by Nörlund and Riesz operators,” Matematicki Vesnik, vol. 42, no. 1, pp. 9–10, 1990.

P. Chandra, “Trigonometric approximation of functions in -norm,” Journal of Mathematical Analysis and Applications, vol. 275, no. 1, pp. 13–26, 2002.

U. Deger, I. Dagadur, and M. Küçükaslan, “Approximation by trigonometric polynomials to functions in Lp-norm,” Proceedings of the Jangjeon Mathematical Society, vol. 15, no. 2, pp. 203–213, 2012.

U. Deǧer and M. Kaya, “On the approximation by Cesàro submethod,” Palestine Journal of Mathematics, vol. 4, no. 1, pp. 44–56, 2015.

L. Leindler, “Trigonometric approximation in -norm,” Journal of Mathematical Analysis and Applications, vol. 302, no. 1, pp. 129–136, 2005.

M. L. Mittal, B. E. Rhoades, V. N. Mishra, and U. Singh, “Using infinite matrices to approximate functions of class Lip(α,p) using trigonometric polynomials,” Journal of Mathematical Analysis and Applications, vol. 326, no. 1, pp. 667–676, 2007.

M. L. Mittal, B. E. Rhoades, S. Sonker, and U. Singh, “Approximation of signals of class Lip(α, p) by linear operators,” Applied Mathematics and Computation, vol. 217, no. 9, pp. 4483–4489, 2011.

M. L. Mittal and M. V. Singh, “Approximation of signals (functions) by trigonometric polynomials in L p-norm,” International Journal of Mathematics and Mathematical Sciences, vol. 2014, Article ID 267383, 6 pages, 2014.

M. L. Mittal and M. V. Singh, “Approximation of functions of class Lip(α, p) in Lp-norm,” in Mathematical Analysis and its Applications: Roorkee, India, December 2014, Springer Proceedings in Mathematics & Statistics, pp. 109–120, Springer, Berkeley, Calif, USA, 2015.

R. N. Mohapatra and D. C. Russell, “Some direct and inverse theorems in approximation of functions,” Australian Mathematical Society. Series A. Pure Mathematics and Statistics, vol. 34, no. 2, pp. 143–154, 1983.

M. L. Mittal and B. E. Rhoades, “On the degree of approximation of continuous functions by using linear operators on their Fourier series,” International Journal of Mathematics, Game Theory, and Algebra, vol. 9, no. 4, pp. 259–267, 1999.

M. L. Mittal and B. E. Rhoades, “Degree of approximation to functions in a normed space,” Journal of Computational Analysis and Applications, vol. 2, no. 1, pp. 1–10, 2000.

C. K. Chui, An Introduction to Wavelets, vol. 1 of Wavelet Analysis and Its Applications, Academic Press, New York, NY, USA, 1992.