Search results
Create the page "Numerical implementation" on this wiki! See also the search results found.
- WIth the efficient numerical implementation of the Fourier transform, the solution \(\psi\) of the paraxial equation c3 KB (496 words) - 18:25, 30 July 2019
- The numerical test is not yet loaded. In particular this method could bemused for the precise numerical testing8 KB (1,183 words) - 10:21, 20 July 2020
- ...of this expansion; they can be extracted also from the [[complex(double)]] implementation [[Besselj0.cin]]. ==Numerical implementation==6 KB (913 words) - 18:25, 30 July 2019
- ==Numerical implementation== The efficient complex(fouble) implementation of the [[ArcSinc]] is available in the description of figures.4 KB (563 words) - 18:27, 30 July 2019
- '''Discrete Hankel transform''' is the numerical analogy of the [[Bessel transform]]. ...ectors, for fixed \(\nu\) and \(M\), using the gsl_dht_apply function. The implementation allows a scaling of the fundamental interval, for convenience, so that one7 KB (1,063 words) - 18:25, 30 July 2019
- These expansions are used in the numerical implementation.3 KB (394 words) - 18:26, 30 July 2019
- [[Category:Numerical implementation]]3 KB (51 words) - 14:59, 20 June 2013
- This asymptoric expansion is used for the numerical implenentation. However, \(z\) should not approach the negative part of the ...of this expansion; they can be extracted also from the [[complex(double)]] implementation [[Besselj1.cin]].3 KB (439 words) - 18:26, 30 July 2019
- ...expressions can be used to deduce the expansion suitable for the numerical implementation. These expressions can be used for testing of the numerical implementations of the [[Bessel transform]].13 KB (1,592 words) - 18:25, 30 July 2019
- The self-Fourier functions are good for testing of the numerical implementations of the [[Fourier operator]]. ...ld indicate the error in determination of step of grid if any error in the implementation or in the calling sequence;6 KB (915 words) - 18:26, 30 July 2019
- 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 is the [[C++]] numerical implementation of the [[DiscreteCos]] transform. ...ble or float) 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
- ==Numerical implementation==3 KB (421 words) - 18:26, 30 July 2019
- 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
- In TORI, aiming the efficient implementation, it worth to keep \(N=1^q\) for some natural number \(q\). For this reasons ====Numerical implementation====10 KB (1,689 words) - 18:26, 30 July 2019
- For the simple and efficient implementation, \(N=2^q\) for some natural number \(q\). Note that the size of the arrays ==Numerical implementation and example==5 KB (682 words) - 18:27, 30 July 2019
- For the simple and efficient implementation, \(N=2^q\) for some natural number \(q\). Note that the size of the arrays ==Numerical implementation and example==6 KB (825 words) - 18:25, 30 July 2019
- // '''serega.cin''' is the numerical [[C++]] implementation of functions1 KB (265 words) - 15:00, 20 June 2013
- ==Evaluation of the LogisticSequence and the Numerical implementation== The numerical implementations with 14 decimal digits in [[C++]] for functions \(\mathrm {7 KB (886 words) - 18:26, 30 July 2019
- ==Numerical implementation== As the Keller is expressed through elementary functions, no special numerical implementation is required.10 KB (1,479 words) - 05:27, 16 December 2019
