Search results

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

• Fourier transform
  The self-Fourier functions are good for testing of the numerical implementations of the Fourier operator \(\mathcal{F}\). ==Numerical implementation of the Fourier operator==
  11 KB (1,501 words) - 18:44, 30 July 2019
• CosFourier
  The self-Fourier functions are good for testing of the numerical implementations of the [[Fourier operator]]. Generation of this figure is test of the discrete numerical implementation of CosFourier operator; the deviation of the calculated tran
  6 KB (915 words) - 18:26, 30 July 2019
• DiscreteCos
  and notations by the [[Numerical recipes in C]] <ref> W.H.Press, B.P.Flannery, S.A.Teukolsky, W.T.Vetterling. Numerical Recipes in C. Fast Sine and Cosine transform. </ref>.
  3 KB (482 words) - 18:26, 30 July 2019
• Cosft.cin
  // cosft.cin is the [[C++]] numerical implementation of the [[DiscreteCos]] transform. ...at) also may 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
  and notations by the [[Numerical recipes in C]] Numerical Recipes in C. Fast Sine and Cosine transform.
  10 KB (1,447 words) - 18:27, 30 July 2019
• DCT
  ====Numerical implementation==== In [[TORI]], the [[C++]] numerical implementation of the discrete cos transtorm of First kind consists of 3 fi
  10 KB (1,689 words) - 18:26, 30 July 2019
• Four1.cin
  ...The result is below. it should be close to the original by the "numerical recipes", but I cannot access the original to check this. [[Category:Numerical recipes]]
  2 KB (228 words) - 07:00, 1 December 2018
• CFT
  If \(N\!=\!2^n\) for some integer \(n\), then, there exist efficient numerical algorithms for evaluation of this sum. One of them is called cosft1 and described in the [[Numerical recipes in C]]; it is available online, as well as the similar algorithm got [[SFT]
  5 KB (721 words) - 18:44, 30 July 2019
• CosFT
  ==Numerical implementation== The [[Numerical recipes in C]] (http://numerical.recipes)
  3 KB (468 words) - 18:47, 30 July 2019
• Gauss-Legendre quadrature
  One example adopted from the [[Numerical recipes in C]] is shown below: [[Numerical recipes in C]]
  3 KB (486 words) - 18:47, 30 July 2019
• Realft.cin
  ...ess the original. I hope, it is close to the original from the [[Numerical recipes]] and does exactly the same.
  2 KB (257 words) - 07:04, 1 December 2018
• SFT
  For \(N\!=\!2^n\) for some integer \(n\), there exist efficient numerical algorithms for evaluation of this sum. One of implementation of the fast algorithms is suggested by the [[Numerical recipes in C]].
  4 KB (602 words) - 18:43, 30 July 2019
• Scft.cin
  ...he double precision 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
  ==Numerical implementation== The [[Numerical recipes in C]] (http://numerical.recipes)
  5 KB (807 words) - 18:44, 30 July 2019