Jump to content

Irrational base discrete weighted transform

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Citation bot (talk | contribs) at 16:57, 21 June 2023 (Alter: template type. Add: jstor, doi, pages, issue, volume, journal. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Abductive | Category:Mathematical analysis stubs | #UCB_Category 369/373). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, the irrational base discrete weighted transform (IBDWT) is a variant of the fast Fourier transform using an irrational base; it was developed by Richard Crandall (Reed College), Barry Fagin (Dartmouth College) and Joshua Doenias (NeXT Software)[1] in the early 1990s using Mathematica.[2]

The IBDWT is used in the Great Internet Mersenne Prime Search's client Prime95 to perform FFT multiplication, as well as in other programs implementing Lucas-Lehmer test, such as CUDALucas and Glucas.[3]

References

  1. ^ Crandall, Richard (1997). "The Challenge of Large Numbers". Scientific American. 276 (2): 74–78. doi:10.1038/scientificamerican0297-74. JSTOR 24993611. Retrieved 29 March 2023.
  2. ^ "Mathematica Use of Renowned Computational Scientist and Author Richard Crandall". Wolfram Research. Retrieved 29 March 2023.
  3. ^ Thall, Andrew. "Fast Mersenne Prime Testing on the GPU" (PDF). Retrieved 29 March 2023.
Stub icon

This mathematical analysis–related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Irrational_base_discrete_weighted_transform&oldid=1161266138"