Search results

Create the page "Numerical recipes in C" on this wiki! See also the search results found.

• Fourier transform
  : \(A : \mathbb R \mapsto \mathbb C\) Then, function \(B : \mathbb R \mapsto \mathbb C\) can be defined with
  11 KB (1,501 words) - 18:44, 30 July 2019
• CosFourier
  : \(\!\!\!\!\!\!\!\!\!\!\! (1) \displaystyle ~ ~ ~ ふ_{\mathrm C}(x,y)=\sqrt{\frac{2}{\pi}} \cos(xy)\) ...~ \displaystyle \mathrm{CosFourier} f (x) = \int_0^\infty ~ ふ_{\mathrm C}(x,y)~ f(y)~ \mathrm d y\)
  6 KB (915 words) - 18:26, 30 July 2019
• DiscreteCos
  ...] that provides the orthogonal transformation of an array of finite length in a way, that have some analogies with the integral [[CosFourier]] transform ...ol of Research and Investigation, the formulas, their descriptions and the C++ implementations are collected here.
  3 KB (482 words) - 18:26, 30 July 2019
• Cosft.cin
  // cosft.cin is the [[C++]] numerical implementation of the [[DiscreteCos]] transform. ...y have sense for some applications; in the old book [[Numerical recipes in C]], the argument is supposed to be array of float variables.
  4 KB (571 words) - 15:00, 20 June 2013
• DCTI
  The name is created in analogy with [[DCT]] by Wikipedia and notations by the [[Numerical recipes in C]]
  10 KB (1,447 words) - 18:27, 30 July 2019
• DCT
  ...er to the '''Discrete cosine transform'''. The four kinds of DCT are often in use; </ref>. In order to avoid numbers in the names of operators, they are called using the Roman numeral system:
  10 KB (1,689 words) - 18:26, 30 July 2019
• CFT
  If \(N\!=\!2^n\) for some integer \(n\), then, there exist efficient numerical algorithms for evaluation of this sum. ...thm got [[SFT]] <ref>ftp://ftp.cpc.ncep.noaa.gov/wd51we/random_phase/four1.c
  5 KB (721 words) - 18:44, 30 July 2019
• CosFT
  ...that function \(f\) decays (or, at least, quickly oscillates) at infinity, in such a way that the integral converges. ==Numerical implementation==
  3 KB (468 words) - 18:47, 30 July 2019
• Gauss-Legendre quadrature
  characterized in that, that formula in such a way, that for any polinomail \(f\) of order up to \(2N-1\), the appr
  3 KB (486 words) - 18:47, 30 July 2019
• SFT
  For \(N\!=\!2^n\) for some integer \(n\), there exist efficient numerical algorithms for evaluation of this sum. ...] and its analogy [[CFT]] (for the [[CosFT]] transform) are implemented in C.
  4 KB (602 words) - 18:43, 30 July 2019
• Scft.cin
  ...recision versions from the original routines by the [[Numerical recipes in C]] /* (C) Copr. 1986-92 Numerical Recipes Software #1-03#)KB=DaVIkaY". */
  6 KB (764 words) - 07:05, 1 December 2018
• SinFT
  ...that function \(f\) decays (or, at least, quickly oscillates) at infinity, in such a way that the integral converges. ==Numerical implementation==
  5 KB (807 words) - 18:44, 30 July 2019