Efficient by Precision Algorithms for Approximating Functions from Some Classes by Fourier Series

Author:

Kolomys Olena1ORCID

Affiliation:

1. V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine, Kyiv

Abstract

Introduction. The problem of approximation can be considered as the basis of computational methods, namely, the approximation of individual functions or classes of functions by functions that are in some sense simpler than the functions being approximated. Most often, the role of an approximant is played by a set of algebraic polynomials or (in the case of a periodic function) a set of trigonometric polynomials of a given order. The ideas and methods of approximation theory are used in various fields of science, especially applied areas, since tasks related to the need to replace one object with another, close in one sense or another to the first, but easier to study, arise very often. The purpose of the paper is consider the problems of approximation of a function, which is given by its values in a certain set of nodal points on a certain interval and belongs to a certain class of functions by trigonometric Fourier series, using the quadrature formulas for calculating integrals of fast oscillating functions on this class of functions, which are optimal in accuracy and close to them. The main attention is paid to the study of the sources of error of the proposed approach to function approximation. Results. Effective approximation algorithms from classes of differentiable functions with the help of Fourier series are proposed, using the Fourier coefficients optimal in accuracy and close to them on the given classes of quadrature formulas for calculating integrals of fast-oscillating functions to determine the Fourier coefficients. The error estimates of the proposed approximation algorithms using the quadrature formulas for calculating the Fourier coefficients of the optimal accuracy and close to them for calculating integrals of fast-oscillating functions from classes of differential functions with given values at the nodes of a fixed grid are presented. The corresponding quadrature formulas and constructive estimates of the error of the method of approximation of functions of these classes are given. Conclusions. Efficient by precision algorithms for approximating functions from classes of differentiable functions by means of Fourier series are constructed using the optimal accuracy and close to them quadrature formulas for calculating integrals of fast-oscillating functions from the above classes of functions to calculate the Fourier coefficients. A comprehensive analysis of the quality of the constructed algorithms for approximating functions by finite sums of the Fourier series is carried out. Keywords: function approximation, Fourier series, Fourier series coefficients, quadrature formulas, approximation error.

Publisher

V.M. Glushkov Institute of Cybernetics

Reference9 articles.

1. Zadiraka V.K., Melnikova S.S. Digital signal processing. Kyiv: Naukova dumka, 1993. 294 p. (in Russian)

2. Sergienko I.V., Zadiraka V.K., Lytvyn O.M., Melnikova S.S., Nechuyviter O.P. Optimal algorithms for calculating integrals from fast-oscillating functions and their application. Vol. 1 Algorithms. Kyiv: Naukova dumka, 2011. 447 p. Vol. 2 Application. Kyiv: Naukova dumka, 2011. 346 p. (in Ukrainian)

3. Fichtenholtz G.M. Course of differential and integral calculus. M.: Fizmatlit, 2001. T. 3. 662 p. (in Russian)

4. Stepanets A.I. Methods of Approximation Theory. VSP: Leiden, Boston, 2005. 919 p. https://doi.org/10.1515/9783110195286

5. Zadiraka V.K., Babych M.D., Berezovsky A.I. etc. T-efficient algorithms for approximate solution of problems of computational and applied mathematics. Ternopil: Zbruch, 2003. 261 p. (in Ukrainian)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3