Some recurrence relations and their parallel evaluation using nested recurrent product form algorithm (Q1825585)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Some recurrence relations and their parallel evaluation using nested recurrent product form algorithm
scientific article

    Statements

    Some recurrence relations and their parallel evaluation using nested recurrent product form algorithm (English)
    0 references
    0 references
    1989
    0 references
    Parallel evaluation of recurrence relations for the Fourier expansion of the Jacobian elliptic functions (JEFs) and those for the expansion of \(\sin^ m(\pi x)\), \(\cos^ m(\pi x)\) in powers of JEFs is studied. The results heavily depend on earlier work, which is not explicitly given. The ``recurrent product form algorithm'' seems to justify the claim for high parallelism of computations.
    0 references
    0 references
    parallel computation
    0 references
    recurrence relations
    0 references
    Fourier expansion
    0 references
    Jacobian elliptic functions
    0 references
    recurrent product form algorithm
    0 references
    high parallelism
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references