Two recursive algorithms for the Fourier series (Q1922223): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unrestricted algorithms for elementary and special functions / rank
 
Normal rank

Latest revision as of 13:29, 24 May 2024

scientific article
Language Label Description Also known as
English
Two recursive algorithms for the Fourier series
scientific article

    Statements

    Two recursive algorithms for the Fourier series (English)
    0 references
    0 references
    19 May 1997
    0 references
    The paper presents two recursive algorithms for evaluation of the Fourier series \[ f(x)={a_0\over 2}+\sum^n_{i=1} (a_i\cos ix+b_i\sin ix), \] where \(a_i\) and \(b_i\) are known complex constants and \(x\) is the evaluation point. The algorithms are based on simple trigonometric identities, and require less arithmetic operations than the traditional algorithm. FORTRAN programs for the two algorithms are given.
    0 references
    recursive algorithms
    0 references
    Fourier series
    0 references
    FORTRAN programs
    0 references

    Identifiers