Abstract
WHEN solving certain practical problems it is desirable to represent a function f( x), specified at a discrete set of equidistant base-points( x = j = 1, 2, … , N), by a trigono-metric polynomial [1, 2]. Harmonic analysis of functions of a discrete argument is used when processing experimental data (in correlation and spectral analysis), or during numeri-cal solution of certain problems of linear algebra, difference equations and partial differ-ential equations etc. [3, 4]. The number of arithmetic operations required for direct computation of the Fourier coefficients is proportional to N 2. When N is large, the computations can prove difficult even with a modern computer. Hence various methods have been suggested for reducing the number of arithmetical operations [1, 3, 5].
Sign-in/Register to access full text options 
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 callMore From: USSR Computational Mathematics and Mathematical Physics
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.
