b852691a58
-- FFTW is a free collection of fast C routines for computing the Discrete Fourier Transform in one or more dimensions. It includes complex, real, and parallel transforms, and can handle arbitrary array sizes efficiently. FFTW is typically faster than other publically-available FFT implementations, and is even competitive with vendor-tuned libraries. (See our web page for extensive benchmarks.) To achieve this performance, FFTW uses novel code-generation and runtime self-optimization techniques (along with many other tricks). WWW: http://www.fftw.org/ Submitted by Nikolay Sturm <Nikolay.Sturm@desy.de>
17 lines
482 B
Plaintext
17 lines
482 B
Plaintext
$OpenBSD: patch-doc_fftw_texi,v 1.1.1.1 2001/07/01 23:10:44 lebel Exp $
|
|
--- doc/fftw.texi.orig Mon Nov 8 02:41:53 1999
|
|
+++ doc/fftw.texi Sat Jun 30 13:53:48 2001
|
|
@@ -5,6 +5,12 @@
|
|
@settitle FFTW
|
|
@c %**end of header
|
|
|
|
+@dircategory C library code
|
|
+@direntry
|
|
+* FFTW: (fftw). Routines for computing the
|
|
+ Discrete Fourier Transform.
|
|
+@end direntry
|
|
+
|
|
@include version.texi
|
|
@setchapternewpage odd
|
|
@c define constant index (ct)
|