William Stein wrote: > Hi Sage-Devel, > > Have you ever wondered about the mathematics behind how MPFR, GMP, > MPIR, etc., work under the hood? Fortunately, Paul Zimmerman and > Richard Brent just published a new very-accessible book about exactly > this, and has the foresight to release their book under a Creative > Commons license (in addition to publishing it in traditional book > form). > > "Modern Computer Arithmetic" > > http://www.loria.fr/~zimmerma/mca/mca-0.4.pdf
While browsing this book's pages, I was led to the FXT library: http://www.jjj.de/fxt/#fxt Does anyone know anything about it? Can you comment on it? It's GPL, in C++, and has a Linux Software Map description of: fxt is a library package implementing various algorithms for: Fast Fourier Transform (FFT), complex and real-valued, Fast Hartley Transform (FHT). Convolution (cyclic, linear and weighted), correlation and power spectrum. Mass storage convolution and fast multiplication routines. Number Theoretic Transform (NTT), Walsh Transform, Reed-Muller transform, Haar Transform, Wavelet Transform. Combinatorial generation: Combinations, Permutations, subsets. Sorting, Searching, Stack (FIFO), Queue (LIFO), heap and priority-queue. Bit-manipulations, shift registers (LFSR), modular arithmetics and computations in binary finite fields GF(2**n). It looks like it is fantastically documented, with a 1000 page reference manual that explains the algorithms. Thanks, Jason -- Jason Grout -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
