A simple and fast algorithm for computing exponentials of power series (Q989478): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4110543 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Algorithms for Manipulating Formal Power Series / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4248250 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relax, but don't be too lazy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The truncated fourier transform and applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Newton's method and FFT trading / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Variations on computing reciprocals of power series / rank | |||
Normal rank |
Latest revision as of 02:20, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A simple and fast algorithm for computing exponentials of power series |
scientific article |
Statements
A simple and fast algorithm for computing exponentials of power series (English)
0 references
20 August 2010
0 references
algorithms
0 references
exponential
0 references
power series
0 references
fast Fourier transform
0 references
Newton iteration
0 references