Abstract

Приближение непрерывных 2π-периодических кусочно-гладких функций дискретными суммами Фурье

Highlights

  • In the present article we consider the problem of approximation of functions f ∈ CΩ2 by the polynomials Ln,N (f, x)

  • We show that instead of the estimate |f (x) − Ln,N (f, x)| c ln n/n, which follows from the well-known Lebesgue inequality, we found an exact order estimate |f (x) − Ln,N (f, x)| c/n (x ∈ R) which is uniform with respect to n (1 n N/2)

  • The proofs of these estimations are based on comparing of approximating properties of discrete and continuous finite Fourier series

Read more

Summary

Piecewise Smooth Functions by Discrete Fourier Sums

Let N be a natural number greater than 1. Select N uniformly distributed points tk = 2πk/N + u (0 k N − 1), and denote by Ln,N (f ) = Ln,N (f, x) (1 n N/2) the trigonometric polynomial of order n possessing the least quadratic deviation from f with respect to the system {tk}kN=−01. In the present article we consider the problem of approximation of functions f ∈ CΩ2 by the polynomials Ln,N (f, x). We found a local estimate |f (x) − Ln,N (f, x)| c(ε)/n2 (|x − ai| ε) which is uniform with respect to n (1 n N/2) The proofs of these estimations are based on comparing of approximating properties of discrete and continuous finite Fourier series.

INTRODUCTION
In the similar way we can get
Hence we have

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.