SlideShare a Scribd company logo
1 of 4
Download to read offline
International Journal of Engineering Research and Development
e-ISSN: 2278-067X, p-ISSN : 2278-800X, www.ijerd.com
Volume 4, Issue 10 (November 2012), PP. 58-61

                             On L1-Convergence of Cosine Sums
                                                           Nawneet Hooda
                      Department of Mathematics, DCR University of Sci & Tech, Murthal(131039), India.


     Abstract:- A necessary and sufficient condition for L1_convergence of a modified trigonometric sum has been
     obtained which generalizes a result of Kumari and Ram[5]. A result of Fomin [2]follows as a corollary of our
     result.

     Keywords:- Modified cosine sum, class Fp

                                                   I.              INTRODUCTION
Let Sn(x) denote the partial sum of the cosine series
                                                                    
                              (1.1)                     (a0/2) +   
                                                                   k 1
                                                                          ak cos kx ,

  and let f(x) = limn Sn(x), if it exists. The convergence of the series (1.1) in the metric space L, has been studied by
various authors under different conditions on the coefficients ak .

Theorem A [8]. If {ak} is convex (2ak  0 , for every k) null sequence, then the cosine series (1.1) is the Fourier series of
its sum f, and
               ||Sn(x)  f(x)|| = o(1) , if and only if an log n = o(1), n   .
Kolmogorov extended the definition of convex null sequence. A sequence {a k} is said to be quasi-convex if ak = o(1), k 
                     
 , and the series   
                     k 1
                             k | 2ak | <  .

Theorem B[4]. If {ak} is a quasi-convex null sequence, then the cosine series (1.1) is the Fourier series of its sum f, and
                ||Sn(x)  f(x)|| = o(1) , if and only if an log n = o(1), n .


Sidon generalized the concept of convex (quasi-convex) null sequence. We say a sequence {ak} belongs to the class S[6], if
there exists a monotonically decreasing sequence {Ak} such that  Ak <  , and | ak|  Ak, for every k.
                                                                                  
A quasi-convex null sequence satisfies the class S if we take An =               
                                                                                 m n
                                                                                        | 2am| .


Theorem C[7]. Let {ak} belong to the class S. Then the cosine series (1.1) is the Fourier series of its sum f and
              ||Sn(x)  f(x)| = o(1), if and only if an log n = o(1), n .
Fomin[2] generalized Teljakovskǐi’s Theorem by introducing a new class Fp . A null sequence {ak} belongs to the class Fp,
if for some 1 < p  2, we have
                                 1
      n
                            p
        ak
                         p
                             n       < .
     k 1  k n              
and proved that Fp  BV , where BV denotes the class of bounded variation and

                                          

                                         k     p 1
                                                       a k
                                                              p
if {ak}  Fp , then f  L1 (o, ) and                             < .
                                         k 1


Theorem D [2]. Let {ak} satisfy the conditions of Fp ,then the cosine series (1.1) is the Fourier series of its sum f and
         ||Sn(x)  f(x)|| = o(1) if and only if an log n = o(1), n .
Kumari and Ram [5]introduced a new modified trigonometric cosine sum


2000 AMS Mathematics Subject Classification : 42A20, 42A32


                                                                          58
On L1-Convergence of Cosine Sums

                                                 n    n
(1.2)                      fn(x) = (a0/2) +    
                                              k 1   j k
                                                            (aj/j) k cos kx ,


and proved

Theorem E[5]. Let the sequence {ak} satisfy the conditions of the class S.
 If a n log n = o(1), n , then      ||f(x)  fn(x)|| = o(1), n .
           In this paper, we generalize Theorem E by obtaining a necessary and sufficient condition for the convergence of
the limit of (1.2) in the metric space L by taking {ak} in the class Fp . We also deduce Fomin’s Theorem D as a corollary
from our result.

                                                                    II.        LEMMA
We require the following Lemma for the proof of our result:

Lemma 1[3]. If Dn(x),Dn(x) and Fn(x) denote Dirichlet, conjugate Dirichlet and Fejér’s kernel respectively, then F n(x) =
Dn(x)  (1/n+1)Dn(x) .

                                                             III. MAIN RESULT
Theorem 1. Let {ak} belong to the class Fp . Then
||f(x)  fn(x)|| = o(1) if and only if an log n = o(1), n.

Proof. Application of Lemma 1 and summation by parts give
                       a0          n    n   aj 
(3.1) fn(x)    =              +        k cos kx
                                             j
                       2          k 1 j k  
                                     a n 1 
               = Sn(x)                        Dn(x)
                                     n  1
               = Sn(x)  an+1 Dn(x) + an+1 Fn(x)
                       n
               =   
                   k 0
                             ak Dk(x) + an+1 Fn(x)


Since Dn(x) = O(1/x2) and an  0 as n, limn fn(x) exists and
f(x) = limn fn(x). Now,
                                          1
                                         n                              
(3.2)      
           0
               |fn(x)  f(x)| dx =        
                                          0
                                              |fn(x)  f(x) | dx +       
                                                                         1
                                                                              |fn(x)  f(x)| dx.

                                                                         n


For the first integral of right hand side of (3.2),we have

           1                             1                           1
           n                             n                           n

           
           0
               |fn(x) f(x) | dx        0
                                              |n(x)  f(x)|dx +    0
                                                                             |fn(x)  n(x)|dx,


where n(x) is the Fejér sum of Sn(x), and
                   1
                   n

                   
                   0
                           |n(x)  f(x)|dx = O(||n(x)  f(x)|| ) , n .


From (3.1), we get

                                                              n                                     n
          fn(x)  n(x) = an+1 Fn(x) + 
                                       
                                                 
                                                     1 
                                                       
                                                   n 1
                                                              kak Dk ( x) -  1 
                                                             k 1
                                                                                 
                                                                                         n 1
                                                                                                    a D ( x)
                                                                                                   k 1
                                                                                                          k   k




                                                                              59
On L1-Convergence of Cosine Sums

Therefore,

1                                                                                                 1
n                                                                    n                            n

        |fn(x)  n(x)| dx  (/2) an+1 + 
                                           
                                                        1 
                                                          
                                                     n 1
                                                                     k a  D ( x) dx
                                                                    k 1
                                                                                         k                 k
0                                                                                                 0
                                                                                                               1
                                                                                              n                n
                                                               +
                                                                
                                                                
                                                                    1 
                                                                      
                                                                  n 1
                                                                                          a  D ( x) dx
                                                                                             k 1
                                                                                                          k         k
                                                                                                               0


                    1
                    n
                                                           1  n      
or                        |fn(x)  n(x)| dx =O           n  k ak                                  , n .
                    0                                       k 1     
Hence, for the first integral in (3.2) we have

                              1

                                                                                                     1  n    
                                                                              ( x)  f ( x)  + O   k ak 
                              n

                              
                              0
                                      |fn(x)  f(x)| dx = O                 n
                                                                                                     n  k 1 
                                                                                                                                          , n .


For the second integral of right hand side of (3.2), we have

                                                                                                   
(3.3)           
                1
                        |fn(x)  f(x)| dx      
                                                1
                                                     |an+1Fn(x)| dx +                 
                                                                                     1
                                                                                              |
                                                                                                  k  n 1
                                                                                                               ak Dk(x)| dx

                n                               n                                    n


                                                                                       
                                             |an+1 Fn(x)|dx +                |     
                                                                                     k  n 1
                                                                                                      ak Dk(x)| dx
                                           0                            1
                                                                        n


                                                                           
                                          = (/2)an+1 +        |       
                                                                    k  n 1
                                                                                     ak Dk(x)| dx .
                                                           1
                                                           n


Combining all these estimates as in [2], we obtain
     
                                                            n          
                                                                                 p
          |fn(x)  f(x)|dx = O         n ( x)  f ( x)   k ak   k p1 ak 
     0                                                     k 1     k  n 1     
                           = o(1) , n .

This completes the proof of our result.
Corollary. If {ak} belongs to Fp, then
||Sn(x)  f(x)|| = o(1) if and only if an log n = o(1), n .
 Proof . We have
                                     
        | f(x)  Sn(x) | dx =             | f(x)  fn(x) + fn(x)  Sn(x) | dx
0                                     0
                                                                        
                                        | f(x)  fn(x) |dx        +              | fn(x)  Sn(x) |dx
                                  0                                      0
                                                                                                             
                                        | f(x) fn(x) |dx +           |an+1 Dn(x)|dx +                          |an+1Kn(x) |dx
                                  0                            0                                               
and

                                                                                                      60
On L1-Convergence of Cosine Sums

                                                        
       | an+1 Dn(x) |dx          | fn(x)Sn(x) |dx +           | an+1Kn(x) | dx
 0                              0                         
                                                              
                           ≤       | f(x)  Sn(x) |dx    +         | an+1Kn(x) |dx .
                                0                             
                                                                                
Since    
        
             | Dn(x) |dx behave like log n for large values of nand              
                                                                                 0
                                                                                      f ( x)  f n ( x) dx=0 by our theorem for n , the
corollary follows.

                                                               REFERENCES
[1].         N.K.Bari A Treatise on trigonometric series (London : Pregamon Press) Vol.1,Vol. II (1964).
[2].         G.A .Fomin,On linear methods for summing Fourier series, Mat. Sb., 66 (107) (1964) 114152.
[3].         N.Hooda and B.Ram,     Convergence of certain modified cosine sum, Indian J. Math,44(1)(2002),41-46.
[4].         A.N.Kolmogorov. Sur I ordre de grandeur des coefficients de la serie de Fourier-lebesque, Bull. Acad. Polan. Sci.
             Ser. Sci. Math., Astronom Phys., (1923) 83-86.
[5].         S.Kumari and B.Ram L1-convergence of a modified cosine sum, Indiaj J. pure appl. Math., 19 (1988) 1101-1104.
[6].         S.Sidon,Hinreichende be dingeingen fur den Fourier-character einer trigonometris
[7].         S. A. Teljakovskǐi, A sufficient condition for Sidon for the integrability of trigonometric series, Mat. Zametki, 14
             (1973), 317-328.
[8].         W.H.Young. On the Fourier series of bounded functions, Proc. London Math. Soc., 12 (1913), 41-70.




                                                                          61

More Related Content

What's hot

Jyokyo-kai-20120605
Jyokyo-kai-20120605Jyokyo-kai-20120605
Jyokyo-kai-20120605ketanaka
 
Renyis entropy
Renyis entropyRenyis entropy
Renyis entropywtyru1989
 
Functional analysis in mechanics
Functional analysis in mechanicsFunctional analysis in mechanics
Functional analysis in mechanicsSpringer
 
Functional analysis in mechanics 2e
Functional analysis in mechanics  2eFunctional analysis in mechanics  2e
Functional analysis in mechanics 2eSpringer
 
Coordinate sampler: A non-reversible Gibbs-like sampler
Coordinate sampler: A non-reversible Gibbs-like samplerCoordinate sampler: A non-reversible Gibbs-like sampler
Coordinate sampler: A non-reversible Gibbs-like samplerChristian Robert
 
On Spaces of Entire Functions Having Slow Growth Represented By Dirichlet Series
On Spaces of Entire Functions Having Slow Growth Represented By Dirichlet SeriesOn Spaces of Entire Functions Having Slow Growth Represented By Dirichlet Series
On Spaces of Entire Functions Having Slow Growth Represented By Dirichlet SeriesIOSR Journals
 
Monte-Carlo method for Two-Stage SLP
Monte-Carlo method for Two-Stage SLPMonte-Carlo method for Two-Stage SLP
Monte-Carlo method for Two-Stage SLPSSA KPI
 
Some Thoughts on Sampling
Some Thoughts on SamplingSome Thoughts on Sampling
Some Thoughts on SamplingDon Sheehy
 
Csr2011 june15 11_00_sima
Csr2011 june15 11_00_simaCsr2011 june15 11_00_sima
Csr2011 june15 11_00_simaCSR2011
 
Regularity and complexity in dynamical systems
Regularity and complexity in dynamical systemsRegularity and complexity in dynamical systems
Regularity and complexity in dynamical systemsSpringer
 
Algorithm Design and Complexity - Course 11
Algorithm Design and Complexity - Course 11Algorithm Design and Complexity - Course 11
Algorithm Design and Complexity - Course 11Traian Rebedea
 
Least squares support Vector Machine Classifier
Least squares support Vector Machine ClassifierLeast squares support Vector Machine Classifier
Least squares support Vector Machine ClassifierRaj Sikarwar
 
Topological Inference via Meshing
Topological Inference via MeshingTopological Inference via Meshing
Topological Inference via MeshingDon Sheehy
 
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
 
Fixed Point Theorem in Fuzzy Metric Space Using (CLRg) Property
Fixed Point Theorem in Fuzzy Metric Space Using (CLRg) PropertyFixed Point Theorem in Fuzzy Metric Space Using (CLRg) Property
Fixed Point Theorem in Fuzzy Metric Space Using (CLRg) Propertyinventionjournals
 
A Novel Methodology for Designing Linear Phase IIR Filters
A Novel Methodology for Designing Linear Phase IIR FiltersA Novel Methodology for Designing Linear Phase IIR Filters
A Novel Methodology for Designing Linear Phase IIR FiltersIDES Editor
 
Coincidence points for mappings under generalized contraction
Coincidence points for mappings under generalized contractionCoincidence points for mappings under generalized contraction
Coincidence points for mappings under generalized contractionAlexander Decker
 
Solution set 3
Solution set 3Solution set 3
Solution set 3慧环 赵
 

What's hot (20)

Adc
AdcAdc
Adc
 
Jyokyo-kai-20120605
Jyokyo-kai-20120605Jyokyo-kai-20120605
Jyokyo-kai-20120605
 
Renyis entropy
Renyis entropyRenyis entropy
Renyis entropy
 
Richard Everitt's slides
Richard Everitt's slidesRichard Everitt's slides
Richard Everitt's slides
 
Functional analysis in mechanics
Functional analysis in mechanicsFunctional analysis in mechanics
Functional analysis in mechanics
 
Functional analysis in mechanics 2e
Functional analysis in mechanics  2eFunctional analysis in mechanics  2e
Functional analysis in mechanics 2e
 
Coordinate sampler: A non-reversible Gibbs-like sampler
Coordinate sampler: A non-reversible Gibbs-like samplerCoordinate sampler: A non-reversible Gibbs-like sampler
Coordinate sampler: A non-reversible Gibbs-like sampler
 
On Spaces of Entire Functions Having Slow Growth Represented By Dirichlet Series
On Spaces of Entire Functions Having Slow Growth Represented By Dirichlet SeriesOn Spaces of Entire Functions Having Slow Growth Represented By Dirichlet Series
On Spaces of Entire Functions Having Slow Growth Represented By Dirichlet Series
 
Monte-Carlo method for Two-Stage SLP
Monte-Carlo method for Two-Stage SLPMonte-Carlo method for Two-Stage SLP
Monte-Carlo method for Two-Stage SLP
 
Some Thoughts on Sampling
Some Thoughts on SamplingSome Thoughts on Sampling
Some Thoughts on Sampling
 
Csr2011 june15 11_00_sima
Csr2011 june15 11_00_simaCsr2011 june15 11_00_sima
Csr2011 june15 11_00_sima
 
Regularity and complexity in dynamical systems
Regularity and complexity in dynamical systemsRegularity and complexity in dynamical systems
Regularity and complexity in dynamical systems
 
Algorithm Design and Complexity - Course 11
Algorithm Design and Complexity - Course 11Algorithm Design and Complexity - Course 11
Algorithm Design and Complexity - Course 11
 
Least squares support Vector Machine Classifier
Least squares support Vector Machine ClassifierLeast squares support Vector Machine Classifier
Least squares support Vector Machine Classifier
 
Topological Inference via Meshing
Topological Inference via MeshingTopological Inference via Meshing
Topological Inference via Meshing
 
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
 
Fixed Point Theorem in Fuzzy Metric Space Using (CLRg) Property
Fixed Point Theorem in Fuzzy Metric Space Using (CLRg) PropertyFixed Point Theorem in Fuzzy Metric Space Using (CLRg) Property
Fixed Point Theorem in Fuzzy Metric Space Using (CLRg) Property
 
A Novel Methodology for Designing Linear Phase IIR Filters
A Novel Methodology for Designing Linear Phase IIR FiltersA Novel Methodology for Designing Linear Phase IIR Filters
A Novel Methodology for Designing Linear Phase IIR Filters
 
Coincidence points for mappings under generalized contraction
Coincidence points for mappings under generalized contractionCoincidence points for mappings under generalized contraction
Coincidence points for mappings under generalized contraction
 
Solution set 3
Solution set 3Solution set 3
Solution set 3
 

Similar to Welcome to International Journal of Engineering Research and Development (IJERD)

Fourier series of odd functions with period 2 l
Fourier series of odd functions with period 2 lFourier series of odd functions with period 2 l
Fourier series of odd functions with period 2 lPepa Vidosa Serradilla
 
Lattices and codes
Lattices and codesLattices and codes
Lattices and codesSpringer
 
Slides: On the Chi Square and Higher-Order Chi Distances for Approximating f-...
Slides: On the Chi Square and Higher-Order Chi Distances for Approximating f-...Slides: On the Chi Square and Higher-Order Chi Distances for Approximating f-...
Slides: On the Chi Square and Higher-Order Chi Distances for Approximating f-...Frank Nielsen
 
Intro probability 4
Intro probability 4Intro probability 4
Intro probability 4Phong Vo
 
Dynamical systems solved ex
Dynamical systems solved exDynamical systems solved ex
Dynamical systems solved exMaths Tutoring
 
Fourier 3
Fourier 3Fourier 3
Fourier 3nugon
 
An introduction to quantum stochastic calculus
An introduction to quantum stochastic calculusAn introduction to quantum stochastic calculus
An introduction to quantum stochastic calculusSpringer
 
Math 1102-ch-3-lecture note Fourier Series.pdf
Math 1102-ch-3-lecture note Fourier Series.pdfMath 1102-ch-3-lecture note Fourier Series.pdf
Math 1102-ch-3-lecture note Fourier Series.pdfhabtamu292245
 
Convexity in the Theory of the Gamma Function.pdf
Convexity in the Theory of the Gamma Function.pdfConvexity in the Theory of the Gamma Function.pdf
Convexity in the Theory of the Gamma Function.pdfPeterEsnayderBarranz
 
On Frechet Derivatives with Application to the Inverse Function Theorem of Or...
On Frechet Derivatives with Application to the Inverse Function Theorem of Or...On Frechet Derivatives with Application to the Inverse Function Theorem of Or...
On Frechet Derivatives with Application to the Inverse Function Theorem of Or...BRNSS Publication Hub
 
International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)ijceronline
 

Similar to Welcome to International Journal of Engineering Research and Development (IJERD) (20)

Imc2017 day2-solutions
Imc2017 day2-solutionsImc2017 day2-solutions
Imc2017 day2-solutions
 
Fourier series of odd functions with period 2 l
Fourier series of odd functions with period 2 lFourier series of odd functions with period 2 l
Fourier series of odd functions with period 2 l
 
Lattices and codes
Lattices and codesLattices and codes
Lattices and codes
 
Dft
DftDft
Dft
 
Chapter 2 (maths 3)
Chapter 2 (maths 3)Chapter 2 (maths 3)
Chapter 2 (maths 3)
 
math camp
math campmath camp
math camp
 
Slides: On the Chi Square and Higher-Order Chi Distances for Approximating f-...
Slides: On the Chi Square and Higher-Order Chi Distances for Approximating f-...Slides: On the Chi Square and Higher-Order Chi Distances for Approximating f-...
Slides: On the Chi Square and Higher-Order Chi Distances for Approximating f-...
 
senior seminar
senior seminarsenior seminar
senior seminar
 
Intro probability 4
Intro probability 4Intro probability 4
Intro probability 4
 
Dynamical systems solved ex
Dynamical systems solved exDynamical systems solved ex
Dynamical systems solved ex
 
Fourier 3
Fourier 3Fourier 3
Fourier 3
 
ma112011id535
ma112011id535ma112011id535
ma112011id535
 
An introduction to quantum stochastic calculus
An introduction to quantum stochastic calculusAn introduction to quantum stochastic calculus
An introduction to quantum stochastic calculus
 
1. I. Hassairi.pdf
1.  I. Hassairi.pdf1.  I. Hassairi.pdf
1. I. Hassairi.pdf
 
1. I. Hassairi.pdf
1.  I. Hassairi.pdf1.  I. Hassairi.pdf
1. I. Hassairi.pdf
 
Math 1102-ch-3-lecture note Fourier Series.pdf
Math 1102-ch-3-lecture note Fourier Series.pdfMath 1102-ch-3-lecture note Fourier Series.pdf
Math 1102-ch-3-lecture note Fourier Series.pdf
 
Convexity in the Theory of the Gamma Function.pdf
Convexity in the Theory of the Gamma Function.pdfConvexity in the Theory of the Gamma Function.pdf
Convexity in the Theory of the Gamma Function.pdf
 
Mcgill3
Mcgill3Mcgill3
Mcgill3
 
On Frechet Derivatives with Application to the Inverse Function Theorem of Or...
On Frechet Derivatives with Application to the Inverse Function Theorem of Or...On Frechet Derivatives with Application to the Inverse Function Theorem of Or...
On Frechet Derivatives with Application to the Inverse Function Theorem of Or...
 
International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)
 

More from IJERD Editor

A Novel Method for Prevention of Bandwidth Distributed Denial of Service Attacks
A Novel Method for Prevention of Bandwidth Distributed Denial of Service AttacksA Novel Method for Prevention of Bandwidth Distributed Denial of Service Attacks
A Novel Method for Prevention of Bandwidth Distributed Denial of Service AttacksIJERD Editor
 
MEMS MICROPHONE INTERFACE
MEMS MICROPHONE INTERFACEMEMS MICROPHONE INTERFACE
MEMS MICROPHONE INTERFACEIJERD Editor
 
Influence of tensile behaviour of slab on the structural Behaviour of shear c...
Influence of tensile behaviour of slab on the structural Behaviour of shear c...Influence of tensile behaviour of slab on the structural Behaviour of shear c...
Influence of tensile behaviour of slab on the structural Behaviour of shear c...IJERD Editor
 
Gold prospecting using Remote Sensing ‘A case study of Sudan’
Gold prospecting using Remote Sensing ‘A case study of Sudan’Gold prospecting using Remote Sensing ‘A case study of Sudan’
Gold prospecting using Remote Sensing ‘A case study of Sudan’IJERD Editor
 
Reducing Corrosion Rate by Welding Design
Reducing Corrosion Rate by Welding DesignReducing Corrosion Rate by Welding Design
Reducing Corrosion Rate by Welding DesignIJERD Editor
 
Router 1X3 – RTL Design and Verification
Router 1X3 – RTL Design and VerificationRouter 1X3 – RTL Design and Verification
Router 1X3 – RTL Design and VerificationIJERD Editor
 
Active Power Exchange in Distributed Power-Flow Controller (DPFC) At Third Ha...
Active Power Exchange in Distributed Power-Flow Controller (DPFC) At Third Ha...Active Power Exchange in Distributed Power-Flow Controller (DPFC) At Third Ha...
Active Power Exchange in Distributed Power-Flow Controller (DPFC) At Third Ha...IJERD Editor
 
Mitigation of Voltage Sag/Swell with Fuzzy Control Reduced Rating DVR
Mitigation of Voltage Sag/Swell with Fuzzy Control Reduced Rating DVRMitigation of Voltage Sag/Swell with Fuzzy Control Reduced Rating DVR
Mitigation of Voltage Sag/Swell with Fuzzy Control Reduced Rating DVRIJERD Editor
 
Study on the Fused Deposition Modelling In Additive Manufacturing
Study on the Fused Deposition Modelling In Additive ManufacturingStudy on the Fused Deposition Modelling In Additive Manufacturing
Study on the Fused Deposition Modelling In Additive ManufacturingIJERD Editor
 
Spyware triggering system by particular string value
Spyware triggering system by particular string valueSpyware triggering system by particular string value
Spyware triggering system by particular string valueIJERD Editor
 
A Blind Steganalysis on JPEG Gray Level Image Based on Statistical Features a...
A Blind Steganalysis on JPEG Gray Level Image Based on Statistical Features a...A Blind Steganalysis on JPEG Gray Level Image Based on Statistical Features a...
A Blind Steganalysis on JPEG Gray Level Image Based on Statistical Features a...IJERD Editor
 
Secure Image Transmission for Cloud Storage System Using Hybrid Scheme
Secure Image Transmission for Cloud Storage System Using Hybrid SchemeSecure Image Transmission for Cloud Storage System Using Hybrid Scheme
Secure Image Transmission for Cloud Storage System Using Hybrid SchemeIJERD Editor
 
Application of Buckley-Leverett Equation in Modeling the Radius of Invasion i...
Application of Buckley-Leverett Equation in Modeling the Radius of Invasion i...Application of Buckley-Leverett Equation in Modeling the Radius of Invasion i...
Application of Buckley-Leverett Equation in Modeling the Radius of Invasion i...IJERD Editor
 
Gesture Gaming on the World Wide Web Using an Ordinary Web Camera
Gesture Gaming on the World Wide Web Using an Ordinary Web CameraGesture Gaming on the World Wide Web Using an Ordinary Web Camera
Gesture Gaming on the World Wide Web Using an Ordinary Web CameraIJERD Editor
 
Hardware Analysis of Resonant Frequency Converter Using Isolated Circuits And...
Hardware Analysis of Resonant Frequency Converter Using Isolated Circuits And...Hardware Analysis of Resonant Frequency Converter Using Isolated Circuits And...
Hardware Analysis of Resonant Frequency Converter Using Isolated Circuits And...IJERD Editor
 
Simulated Analysis of Resonant Frequency Converter Using Different Tank Circu...
Simulated Analysis of Resonant Frequency Converter Using Different Tank Circu...Simulated Analysis of Resonant Frequency Converter Using Different Tank Circu...
Simulated Analysis of Resonant Frequency Converter Using Different Tank Circu...IJERD Editor
 
Moon-bounce: A Boon for VHF Dxing
Moon-bounce: A Boon for VHF DxingMoon-bounce: A Boon for VHF Dxing
Moon-bounce: A Boon for VHF DxingIJERD Editor
 
“MS-Extractor: An Innovative Approach to Extract Microsatellites on „Y‟ Chrom...
“MS-Extractor: An Innovative Approach to Extract Microsatellites on „Y‟ Chrom...“MS-Extractor: An Innovative Approach to Extract Microsatellites on „Y‟ Chrom...
“MS-Extractor: An Innovative Approach to Extract Microsatellites on „Y‟ Chrom...IJERD Editor
 
Importance of Measurements in Smart Grid
Importance of Measurements in Smart GridImportance of Measurements in Smart Grid
Importance of Measurements in Smart GridIJERD Editor
 
Study of Macro level Properties of SCC using GGBS and Lime stone powder
Study of Macro level Properties of SCC using GGBS and Lime stone powderStudy of Macro level Properties of SCC using GGBS and Lime stone powder
Study of Macro level Properties of SCC using GGBS and Lime stone powderIJERD Editor
 

More from IJERD Editor (20)

A Novel Method for Prevention of Bandwidth Distributed Denial of Service Attacks
A Novel Method for Prevention of Bandwidth Distributed Denial of Service AttacksA Novel Method for Prevention of Bandwidth Distributed Denial of Service Attacks
A Novel Method for Prevention of Bandwidth Distributed Denial of Service Attacks
 
MEMS MICROPHONE INTERFACE
MEMS MICROPHONE INTERFACEMEMS MICROPHONE INTERFACE
MEMS MICROPHONE INTERFACE
 
Influence of tensile behaviour of slab on the structural Behaviour of shear c...
Influence of tensile behaviour of slab on the structural Behaviour of shear c...Influence of tensile behaviour of slab on the structural Behaviour of shear c...
Influence of tensile behaviour of slab on the structural Behaviour of shear c...
 
Gold prospecting using Remote Sensing ‘A case study of Sudan’
Gold prospecting using Remote Sensing ‘A case study of Sudan’Gold prospecting using Remote Sensing ‘A case study of Sudan’
Gold prospecting using Remote Sensing ‘A case study of Sudan’
 
Reducing Corrosion Rate by Welding Design
Reducing Corrosion Rate by Welding DesignReducing Corrosion Rate by Welding Design
Reducing Corrosion Rate by Welding Design
 
Router 1X3 – RTL Design and Verification
Router 1X3 – RTL Design and VerificationRouter 1X3 – RTL Design and Verification
Router 1X3 – RTL Design and Verification
 
Active Power Exchange in Distributed Power-Flow Controller (DPFC) At Third Ha...
Active Power Exchange in Distributed Power-Flow Controller (DPFC) At Third Ha...Active Power Exchange in Distributed Power-Flow Controller (DPFC) At Third Ha...
Active Power Exchange in Distributed Power-Flow Controller (DPFC) At Third Ha...
 
Mitigation of Voltage Sag/Swell with Fuzzy Control Reduced Rating DVR
Mitigation of Voltage Sag/Swell with Fuzzy Control Reduced Rating DVRMitigation of Voltage Sag/Swell with Fuzzy Control Reduced Rating DVR
Mitigation of Voltage Sag/Swell with Fuzzy Control Reduced Rating DVR
 
Study on the Fused Deposition Modelling In Additive Manufacturing
Study on the Fused Deposition Modelling In Additive ManufacturingStudy on the Fused Deposition Modelling In Additive Manufacturing
Study on the Fused Deposition Modelling In Additive Manufacturing
 
Spyware triggering system by particular string value
Spyware triggering system by particular string valueSpyware triggering system by particular string value
Spyware triggering system by particular string value
 
A Blind Steganalysis on JPEG Gray Level Image Based on Statistical Features a...
A Blind Steganalysis on JPEG Gray Level Image Based on Statistical Features a...A Blind Steganalysis on JPEG Gray Level Image Based on Statistical Features a...
A Blind Steganalysis on JPEG Gray Level Image Based on Statistical Features a...
 
Secure Image Transmission for Cloud Storage System Using Hybrid Scheme
Secure Image Transmission for Cloud Storage System Using Hybrid SchemeSecure Image Transmission for Cloud Storage System Using Hybrid Scheme
Secure Image Transmission for Cloud Storage System Using Hybrid Scheme
 
Application of Buckley-Leverett Equation in Modeling the Radius of Invasion i...
Application of Buckley-Leverett Equation in Modeling the Radius of Invasion i...Application of Buckley-Leverett Equation in Modeling the Radius of Invasion i...
Application of Buckley-Leverett Equation in Modeling the Radius of Invasion i...
 
Gesture Gaming on the World Wide Web Using an Ordinary Web Camera
Gesture Gaming on the World Wide Web Using an Ordinary Web CameraGesture Gaming on the World Wide Web Using an Ordinary Web Camera
Gesture Gaming on the World Wide Web Using an Ordinary Web Camera
 
Hardware Analysis of Resonant Frequency Converter Using Isolated Circuits And...
Hardware Analysis of Resonant Frequency Converter Using Isolated Circuits And...Hardware Analysis of Resonant Frequency Converter Using Isolated Circuits And...
Hardware Analysis of Resonant Frequency Converter Using Isolated Circuits And...
 
Simulated Analysis of Resonant Frequency Converter Using Different Tank Circu...
Simulated Analysis of Resonant Frequency Converter Using Different Tank Circu...Simulated Analysis of Resonant Frequency Converter Using Different Tank Circu...
Simulated Analysis of Resonant Frequency Converter Using Different Tank Circu...
 
Moon-bounce: A Boon for VHF Dxing
Moon-bounce: A Boon for VHF DxingMoon-bounce: A Boon for VHF Dxing
Moon-bounce: A Boon for VHF Dxing
 
“MS-Extractor: An Innovative Approach to Extract Microsatellites on „Y‟ Chrom...
“MS-Extractor: An Innovative Approach to Extract Microsatellites on „Y‟ Chrom...“MS-Extractor: An Innovative Approach to Extract Microsatellites on „Y‟ Chrom...
“MS-Extractor: An Innovative Approach to Extract Microsatellites on „Y‟ Chrom...
 
Importance of Measurements in Smart Grid
Importance of Measurements in Smart GridImportance of Measurements in Smart Grid
Importance of Measurements in Smart Grid
 
Study of Macro level Properties of SCC using GGBS and Lime stone powder
Study of Macro level Properties of SCC using GGBS and Lime stone powderStudy of Macro level Properties of SCC using GGBS and Lime stone powder
Study of Macro level Properties of SCC using GGBS and Lime stone powder
 

Welcome to International Journal of Engineering Research and Development (IJERD)

  • 1. International Journal of Engineering Research and Development e-ISSN: 2278-067X, p-ISSN : 2278-800X, www.ijerd.com Volume 4, Issue 10 (November 2012), PP. 58-61 On L1-Convergence of Cosine Sums Nawneet Hooda Department of Mathematics, DCR University of Sci & Tech, Murthal(131039), India. Abstract:- A necessary and sufficient condition for L1_convergence of a modified trigonometric sum has been obtained which generalizes a result of Kumari and Ram[5]. A result of Fomin [2]follows as a corollary of our result. Keywords:- Modified cosine sum, class Fp I. INTRODUCTION Let Sn(x) denote the partial sum of the cosine series  (1.1) (a0/2) +  k 1 ak cos kx , and let f(x) = limn Sn(x), if it exists. The convergence of the series (1.1) in the metric space L, has been studied by various authors under different conditions on the coefficients ak . Theorem A [8]. If {ak} is convex (2ak  0 , for every k) null sequence, then the cosine series (1.1) is the Fourier series of its sum f, and ||Sn(x)  f(x)|| = o(1) , if and only if an log n = o(1), n   . Kolmogorov extended the definition of convex null sequence. A sequence {a k} is said to be quasi-convex if ak = o(1), k    , and the series  k 1 k | 2ak | <  . Theorem B[4]. If {ak} is a quasi-convex null sequence, then the cosine series (1.1) is the Fourier series of its sum f, and ||Sn(x)  f(x)|| = o(1) , if and only if an log n = o(1), n . Sidon generalized the concept of convex (quasi-convex) null sequence. We say a sequence {ak} belongs to the class S[6], if there exists a monotonically decreasing sequence {Ak} such that  Ak <  , and | ak|  Ak, for every k.  A quasi-convex null sequence satisfies the class S if we take An =  m n | 2am| . Theorem C[7]. Let {ak} belong to the class S. Then the cosine series (1.1) is the Fourier series of its sum f and ||Sn(x)  f(x)| = o(1), if and only if an log n = o(1), n . Fomin[2] generalized Teljakovskǐi’s Theorem by introducing a new class Fp . A null sequence {ak} belongs to the class Fp, if for some 1 < p  2, we have 1 n   p    ak p n < . k 1  k n  and proved that Fp  BV , where BV denotes the class of bounded variation and  k p 1 a k p if {ak}  Fp , then f  L1 (o, ) and < . k 1 Theorem D [2]. Let {ak} satisfy the conditions of Fp ,then the cosine series (1.1) is the Fourier series of its sum f and ||Sn(x)  f(x)|| = o(1) if and only if an log n = o(1), n . Kumari and Ram [5]introduced a new modified trigonometric cosine sum  2000 AMS Mathematics Subject Classification : 42A20, 42A32 58
  • 2. On L1-Convergence of Cosine Sums n n (1.2) fn(x) = (a0/2) +   k 1 j k (aj/j) k cos kx , and proved Theorem E[5]. Let the sequence {ak} satisfy the conditions of the class S. If a n log n = o(1), n , then ||f(x)  fn(x)|| = o(1), n . In this paper, we generalize Theorem E by obtaining a necessary and sufficient condition for the convergence of the limit of (1.2) in the metric space L by taking {ak} in the class Fp . We also deduce Fomin’s Theorem D as a corollary from our result. II. LEMMA We require the following Lemma for the proof of our result: Lemma 1[3]. If Dn(x),Dn(x) and Fn(x) denote Dirichlet, conjugate Dirichlet and Fejér’s kernel respectively, then F n(x) = Dn(x)  (1/n+1)Dn(x) . III. MAIN RESULT Theorem 1. Let {ak} belong to the class Fp . Then ||f(x)  fn(x)|| = o(1) if and only if an log n = o(1), n. Proof. Application of Lemma 1 and summation by parts give a0 n n aj  (3.1) fn(x) = +      k cos kx  j 2 k 1 j k    a n 1  = Sn(x)    Dn(x)  n  1 = Sn(x)  an+1 Dn(x) + an+1 Fn(x) n =  k 0 ak Dk(x) + an+1 Fn(x) Since Dn(x) = O(1/x2) and an  0 as n, limn fn(x) exists and f(x) = limn fn(x). Now, 1  n  (3.2)  0 |fn(x)  f(x)| dx =  0 |fn(x)  f(x) | dx +  1 |fn(x)  f(x)| dx. n For the first integral of right hand side of (3.2),we have 1 1 1 n n n  0 |fn(x) f(x) | dx  0 |n(x)  f(x)|dx + 0 |fn(x)  n(x)|dx, where n(x) is the Fejér sum of Sn(x), and 1 n  0 |n(x)  f(x)|dx = O(||n(x)  f(x)|| ) , n . From (3.1), we get n n fn(x)  n(x) = an+1 Fn(x) +    1   n 1  kak Dk ( x) -  1  k 1    n 1  a D ( x) k 1 k k 59
  • 3. On L1-Convergence of Cosine Sums Therefore, 1 1 n n n  |fn(x)  n(x)| dx  (/2) an+1 +   1    n 1  k a  D ( x) dx k 1 k k 0 0 1 n n +   1   n 1  a  D ( x) dx k 1 k k 0 1 n  1  n  or  |fn(x)  n(x)| dx =O  n  k ak  , n . 0   k 1  Hence, for the first integral in (3.2) we have 1  1  n   ( x)  f ( x)  + O   k ak  n  0 |fn(x)  f(x)| dx = O n  n  k 1  , n . For the second integral of right hand side of (3.2), we have     (3.3)  1 |fn(x)  f(x)| dx   1 |an+1Fn(x)| dx +   1 | k  n 1 ak Dk(x)| dx n n n      |an+1 Fn(x)|dx +  |  k  n 1 ak Dk(x)| dx 0 1 n   = (/2)an+1 +  |  k  n 1 ak Dk(x)| dx . 1 n Combining all these estimates as in [2], we obtain   n  p  |fn(x)  f(x)|dx = O   n ( x)  f ( x)   k ak   k p1 ak  0  k 1 k  n 1  = o(1) , n . This completes the proof of our result. Corollary. If {ak} belongs to Fp, then ||Sn(x)  f(x)|| = o(1) if and only if an log n = o(1), n . Proof . We have    | f(x)  Sn(x) | dx =  | f(x)  fn(x) + fn(x)  Sn(x) | dx 0 0    | f(x)  fn(x) |dx +  | fn(x)  Sn(x) |dx 0 0     | f(x) fn(x) |dx +  |an+1 Dn(x)|dx +  |an+1Kn(x) |dx 0 0  and 60
  • 4. On L1-Convergence of Cosine Sums     | an+1 Dn(x) |dx  | fn(x)Sn(x) |dx +  | an+1Kn(x) | dx 0 0    ≤  | f(x)  Sn(x) |dx +  | an+1Kn(x) |dx . 0    Since   | Dn(x) |dx behave like log n for large values of nand  0 f ( x)  f n ( x) dx=0 by our theorem for n , the corollary follows. REFERENCES [1]. N.K.Bari A Treatise on trigonometric series (London : Pregamon Press) Vol.1,Vol. II (1964). [2]. G.A .Fomin,On linear methods for summing Fourier series, Mat. Sb., 66 (107) (1964) 114152. [3]. N.Hooda and B.Ram, Convergence of certain modified cosine sum, Indian J. Math,44(1)(2002),41-46. [4]. A.N.Kolmogorov. Sur I ordre de grandeur des coefficients de la serie de Fourier-lebesque, Bull. Acad. Polan. Sci. Ser. Sci. Math., Astronom Phys., (1923) 83-86. [5]. S.Kumari and B.Ram L1-convergence of a modified cosine sum, Indiaj J. pure appl. Math., 19 (1988) 1101-1104. [6]. S.Sidon,Hinreichende be dingeingen fur den Fourier-character einer trigonometris [7]. S. A. Teljakovskǐi, A sufficient condition for Sidon for the integrability of trigonometric series, Mat. Zametki, 14 (1973), 317-328. [8]. W.H.Young. On the Fourier series of bounded functions, Proc. London Math. Soc., 12 (1913), 41-70. 61