Introduction

Let n = 0 u n be a given infinite series with sequence of its nth partial sums {s n }. If the {p n } be a nonnegative and nondecreasing, which generates sequences of constants, real or complex, let us write

P n = k = 0 n P k 0 n 0 , P 1 = 0 = P 1 and P n as n .

The condition for regularity of Nörlund summability are easily seen to be

lim n P n P n 0 and
(1.)
k = 0 p k = O P n , as n .
(2.)

The sequence-to-sequence transformation

t n N = 1 P n k = 0 n p n k s k .
(1.1)

defines the sequence {t n N} of Nörlund means of the sequence {s n }, as generated by the sequence of coefficients {p n }. The series ∑ n = 0u n is said to be summable (N, p n ) to the sum s if lim n t n N exists and equal to s.

In the special case in which

p n = n + α 1 α 1 = Г n + α Г n + 1 Г α ; α > 1

the Nörlund summability (N, p n ) reduces to the familiar (C, α) summability.

The product of N p summability with a C1summability defines N p . C1 summability. Thus the N p . C1 mean is given by t N C n x = P n 1 k = 1 n p n k C k x .

If t n NC → s as n →  , then the infinite series ∑ n = 0u n is said to be the summable N p .C1 to the sum s if lim n t n N C exists and is equal to s.

Let f (x) be a 2π-periodic function and Lebesgue integrable. The Fourier series of f (x) at any point x is given by

f x a 0 2 + k = 1 a k cos k x + b k sin k x k = 0 A k x .
(1.2)

With nth partial sum, s n (f; x) is called trigonometric polynomial of degree (order) n of the first (n + 1) terms of the Fourier series of f.

The conjugate series of Fourier series (1.2) is given by

k = 1 b k cos k x a k sin k x k = 1 B k x
(1.3)

The regularity conditions of N p  . C1 are as follows: n B n  → s ⇒ C1(n B n ) = t n C = n− 1 ∑ k = 1nk B k  (x) → s, as n → , C1 method is regular, ⇒ N p  {C1(nB n )} = t n NC = P n − 1 ∑ k = 1nPn −k(k− 1 ∑ r = 1kr B r (x)) → s,  as n → ,  N p method is also regular, and ⇒ C1.N p method is regular. We note that t n N and t n NC are also trigonometric polynomials of degree (order) n.

Abel’s transformation

The formula

k = m n u k v k = k = m n 1 U k v k v k + 1 U m 1 v m + U n v n ,
(1.4)

where 0 ≤ m ≤ n, U k  = u0 + u1 + u2+.. + u k , if k ≥ 0, U− 1 = 0, which can be verified, is known as Abel’s transformation and will be used extensively in the succeeding discussion.

If v m , vm + 1, …, v n are nonnegative and nonincreasing, the left hand side of (1.4) does not exceed 2 v m max m 1 k n U k in the absolute value. In fact,

k = m n u k v k max U k k = m n 1 v k v k + 1 + v m + v n = 2 v m max U k .

Throughout in this paper, we use the following notations

ψ t = ψ x t = f x + t f x t l , Ψ t = 0 t ψ u du , Q n , t = 1 π P n k = 1 n p n k sin k t k t 2 cos k t t , Δ k p n k = p n k p n k 1 , 0 k n ,

and τ = [1/t] is the largest integer contained in 1/t, where l is a constant.

The (C, 1) and (H, 1) denotes the Cesàro and harmonic summabilities respectively of order one. The product summability (N, p n ) (C, 1) is obtained by superimposing (N, p n ) summability on (C, 1) summability, and the product summability (N, p n ) (C, 1) plays an important role in signal theory as a double digital filter in finite impulse response in particular [1].

Methods

Known theorems

The theory of summability is a very extensive field. Mohanty and Nanda [2] proved the following theorem on C1 summability of the sequence {n B n (x)}.

Theorem 2.1 [[2]] If

Ψ t = ο t / log 1 / t , as t + 0
(2.1)

and

a n = Ο n δ ; b n = Ο n δ , as t + 0 ,
(2.2)

then the sequence {n B n (x)} is the summable C 1 to the value of l/π.

Varshney [3] improved Theorem 2.1 by extending it to product H1. C1 summability. He has proved that

Theorem 2.2 [[3]] if

Ψ t = ο t / log 1 / t , as t + 0 ,
(2.3)

then the sequence {n B n (x)} is the summable H1. C1to the value of l/π.

Various investigators such as Sharma [4], Rhoades [5] (cor. 19, p. 533), Pandey [6], Rai [7], Dwivedi [8], Mittal and Prasad [9], Prasad [10], Mittal [11], Chandra [12], Mittal et al. [13, 14], and Mittal and Singh [1] used different summability methods with different sets of conditions. In particular, Prasad [10] has proved the following:

Theorem 2.3 [[6]] Let p(u) be monotonically decreasing and strictly positive value with u ≥ 0. Let p n = p(n) and

P u = 0 u p x dx , as u .
(2.4)

Let α(t) be a positive and nondecreasing function of t. If

Ψ t = ο t / α 1 / t , as t + 0 ,
(2.5)

then a sufficient condition that the sequence {n B n (x)} be a summable N P . C1to the value of l/π is that

1 n P x x α x dx = Ο P n , as n .
(2.6)

Results and discussion

Main theorem

In the present paper, we extend Theorem 2.3 by dropping the monotonicity on the generating sequence {Pn − k} (that is, by weakening the conditions on the filter, we improve the quality of the digital filter). More precisely, we prove in Theorem 3.1:

Theorem 3.1 Let {p k } be a nonnegative value such that

(i.) k = r n Δ k p n - k = Ο p n - r , (ii.) n p n = Ο p n .
(3.1)

Let α(t) be a positive and increasing function of t such that

Ψ ( t ) = o t / α ( 1 / t ) , as t + 0
(3.2)

and

α ( n ) , as n
(3.3)

then a sufficient condition for the sequence {nB n (x)} to be as the summable (N, p n ) (C, 1) to the value of l/π is

1 / δ n P x x α x dx = Ο P n , as n .
(3.4)

Remark 3.2 (1) If pn − k ≤ pn − k − 1, ∀ 0 ≤ k < n, as used in Theorem 2.3, then both the conditions (3.1) holds. Thus Theorem 3.1 extends Theorem 2.3. (2) In the proof of Theorem 2.3, author in [10] has used the condition (3.3) but did not mention in his statement.

Lemmas. For the proof of our Theorem 3.1, we require the following lemmas.

Lemma 4.1[10]If 0 ≤ t ≤ 1/n, then

Q n , t = 0 n

Lemma 4.2[15]For all values of n and t

k = 0 n sin k + 1 t k + 1 1 + π 2 .
(4.2)

Lemma 4.3 Under the regularity conditions of matrix (N, p n ) in satisfying (3.1), we get Q(n, t) = Ο(t− 1P(τ)/P n ) + Ο(t− 2p1/P n ),   for

1 / n t δ .
(4.3)

Proof We have Q n , t = k = 0 n 1 p n k / π P n sin n k t n k t 2 cos n k t t = Q 1 n , t + Q 2 ( n , t ) , as we say .

By using Abel’s transformation, Lemma 4.2, and condition (3.1), we have

Q 1 n , t = k = 0 n 1 p n k / π P n sin n k t n k t 2 k = 0 τ 1 p n k / π P n sin n k t n k t 2 + k = τ n 1 p n k / π P n sin n k t n k t 2
t 1 k = 0 τ 1 p n k sin n k t n k t + t 2 k = τ n 1 p n k sin n k t n k / π P n t 1 k = 0 τ 1 p n k + t 2 k = τ n 2 Δ k p n k r = 0 k sin n r t n r / π P n + t 2 p n τ / π P n k = 0 τ 1 sin n k t n k + t 2 p 1 / π P n k = 0 n 1 sin n k t n k
[ t 1 k = 0 τ p n k + t 2 1 + π 2 k = τ n 2 Δ k p n k + p n τ + p 1 ] / π P n = Ο t 1 P τ + τ + 1 p n τ / P n + Ο t 2 p 1 / P n = Ο t 1 P τ / P n + Ο t 2 p 1 / P n .

Again by using Abel’s transformation and condition (3.1), we have

Q 2 n , t = k = 0 n 1 p n k / π P n cos n k t t = Ο t 1 P τ + k = 0 n 2 Δ k p n k r = 0 k cos n r t p n τ r = 0 τ 1 cos n r t P n 1 + Ο t 1 P n 1 p 1 r = 0 n cos n r t
Q 2 n , t = Ο t 1 P τ + t 1 k = τ n 2 Δ k p n k + t 1 p n τ + t 1 p 1 / P n = Ο t 1 P τ / P n + Ο t 2 p 1 / P n .

By collecting Q1(n, t), Q2(n, t) and Q(n, t), we get

Q n , t = Ο t 1 P τ / P n + Ο t 2 p 1 / P n .

This completes the proof of Lemma 4.3.

Proof of Theorem 3.1 The C1 transform of the sequence {n B n (x)} denoted by C n (x) is defined by

C n x = 1 n k = 1 n k B k x .

The N p . C1 transform of the sequence {n B n (x)}, which is denoted by tN C n (x), is given by

t N C n x = P n 1 k = 1 n p n k C k x = P n 1 k = 1 n p n k 1 k r = 1 k r B r x .

Therefore, following Mohanty and Nanda [2], we obtain

t N C n x l / π = P n 1 k = 1 n p n k 1 k r = 1 k r B r x l / π = P n 1 k = 1 n p n k 1 π 0 π ψ t sin kt k t 2 cos kt t dt + ο 1 = 1 π 0 π ψ t P n 1 k = 1 n p n k sin kt k t 2 cos kt t dt + ο 1 = 1 π 0 1 / n + 1 / n δ + δ π ψ t Q n , t d t + ο 1 , where 0 < δ < π
= 1 π I 1 + I 2 + I 3 + ο 1 ,
(5.1)

where

I 1 = 0 1 / n ψ t Q n , t dt = Ο n 0 1 / n ψ t dt = Ο n Ψ 1 / n = Ο n ο 1 / n α n
= ο 1 / α n = ο 1 , as n ,
(5.2)

in view of Lemma 4.1, conditions (3.2), and (3.3).

Using Lemma 4.3, we have

I 2 = 1 / n δ ψ t Q n , t dt = 1 / n δ ψ t P n 1 Ο t 2 p 1 + Ο t 1 P τ dt = I 2 , 1 + I 2 , 2 as we say.
(5.3)

Now, using conditions (3.1-ii), (3.2), (3.3), and second mean value theorem for integrals, we have

I 2 , 1 = Ο 1 1 / n δ t 2 P n 1 p 1 ψ t dt = Ο P n 1 p 1 1 / n δ t 2 ψ t dt = Ο 1 n t 2 Ψ t 1 / n δ + 1 / n δ t 3 Ψ t dt = ο 1 n 1 t α 1 / t 1 / n δ + ο 1 n 1 / n δ dt t 2 α 1 / t = ο 1 n + ο 1 α n + ο 1 n α 1 / δ 1 / n δ dt t 2 = ο 1 n + ο 1 α n + ο 1 n α 1 / δ ( δ 1 / n )
= ο 1 , as n .
(5.4)

Using conditions (3.1-ii), (3.2), (3.3), and (3.4), we have

I 2 , 2 = Ο 1 1 / n δ ψ t t P n - 1 P τ dt = Ο 1 Ψ t P n 1 P τ t 1 / n δ + Ο 1 1 / n δ Ψ t P n 1 P τ t 2 dt + Ο 1 1 / n δ Ψ t t d P n 1 P τ = ο 1 + ο P n 1 P n α n + ο 1 1 / n δ P n 1 P τ t α 1 / t dt + Ο P n 1 1 / n δ Ψ t d P 1 / t α 1 / t t α 1 / t
= ο 1 + ο P n 1 P n α n + ο 1 1 / n δ P n 1 P τ t α 1 / t dt + Ο P n 1 1 / n δ o t α 1 / t d P 1 / t t α 1 / t α 1 / t + Ο P n 1 1 / n δ o t α 1 / t P 1 / t t α 1 / t d α 1 / t
= ο 1 + ο 1 α n + ο 1 1 / n δ P n 1 P τ t α 1 / t dt + o P n 1 1 / n δ t d P 1 / t t α 1 / t + o 1 1 / n δ d α 1 / t α 1 / t 2
= ο 1 + ο 1 α n + ο 1 1 / n δ P n 1 P τ t α 1 / t dt
+ o P n 1 t P 1 / t t α 1 / t 1 / n δ 1 / n δ P 1 / t t α 1 / t dt + o 1 1 α 1 / t 1 / n δ
= ο 1 + ο 1 α n + ο 1 1 / n δ P n 1 P τ t α 1 / t dt = ο 1 + ο 1 1 / δ n P n 1 P x x α x dx
= ο 1 + ο 1 Ο P n 1 P n = ο 1 , as n .
(5.5)

On combining (5.3), (5.4) and (5.5), we get

I 2 = ο 1 , as n
(5.6)

Finally, by Riemann-Lebesgue Theorem, we have

I 3 = δ π ψ t Q n , t dt = ο 1 , as n
(5.7)

By collecting (5.2), (5.6), and (5.7), we get

t N C n x l / π = ο 1 , as n .

This completes the proof of Theorem 3.1.

Conclusions

Various results pertaining to the C1 and H1C1 summabilities of the sequence {n B n (x)} have been reviewed, and the condition of monotonicity on the means of generating the sequence {pnk} has been relaxed. Moreover, a proper set of conditions have been discussed to rectify the errors pointed out in Remark 3.2 (1) and (2).