Search results
Create the page "Numerical implementation" on this wiki! See also the search results found.
- ...on above can be used for the evlauation of the factorial. However, such an implementation is not efficient, and is not suitable, when the factorial is used as a comp ...LogFactorial does not show the fast growth and is easier for the numerical implementation, than factorial.27 KB (3,925 words) - 18:26, 30 July 2019
- </ref><ref name="vladi"/>. The fast complex(double) implementation in [[C++]] is suggested. ...exponential. Due to such a growth, the tetration could be useful for the [[numerical representation of huge numbers]], that can be stored as \(\mathrm {tet}_b(x21 KB (3,175 words) - 23:37, 2 May 2021
- // The numerical implementation of the complex tet(complex,complex) <br>6 KB (1,030 words) - 18:48, 30 July 2019
- ...rical implementation of [[tetration]] is available, see [[fsexp.cin]], the implementation of [[pentation]] does no bring serious problems; this representation is use7 KB (1,090 words) - 18:49, 30 July 2019
- ==Numerical evaluation== For real base \( b\!>\!1 \), the ArcTetration can be evaluated with numerical inversion of [[tetration]].7 KB (1,091 words) - 23:03, 30 November 2019
- ...ing the expansions in vicinity of the [[Fixed point]]s; in particular, the numerical implementations for [[tetration]], [[ArcTetration]], [[SuperFactorial]], [[ ...quality of the Mathematica graphics could be significantly improved at the implementation of some analogy of the algorithm [[conto.cin]] for the implicit plots.12 KB (1,901 words) - 18:43, 30 July 2019
- ...ons can be loaded from the figure. (I could not make the special numerical implementation for LambertW better than that through the [[Tania function]], it is fast an8 KB (1,107 words) - 18:26, 30 July 2019
- As properties, as the numerical implementation of the [[Tania function]] are simpler than those of the [[LambertW]] functi ==Implementation of the Doya function==19 KB (2,778 words) - 10:05, 1 May 2021
- 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
- ...Fast Fourier Transform''' or '''FFT''', is the efficient algorithm for the numerical evaluation of the [[Discrete Fouler Tansform]] defined with One of the simplest algorithms realized in the implementation of the6 KB (1,010 words) - 13:23, 24 December 2020
- ...irst non-trivial [[superfunction]], that had been precisely evaluated with numerical solution of the [[Transfer equation]] \( \mathrm{tet}(z\!+\!1)=\exp(\mathrm ...lgorithm for the evaluation had not yet been discovered. Using the precise implementation, the approxximation can be improved.14 KB (1,972 words) - 02:22, 27 June 2020
- The modulus of the numerical evaluation of the Fourier-2 transform \(g\) of function \(f\) is shown in t ==Numerical Implementation==6 KB (954 words) - 18:27, 30 July 2019
- ...This file is used in the generators of figures for the [[Cauchi integral]] implementation of the [[tetration]] to complex base and to base \(b>\exp(1/\mathrm{e})\),108 KB (1,626 words) - 18:46, 30 July 2019
- for the efficient implementation of functions [[Sinc]], [[Cosc]] and their inverse functions [[ArcSinc]] and ==Numerical Implementation of acos==5 KB (754 words) - 18:47, 30 July 2019
- ...rbing walls, the efficient implementation for ArcCip is required, and this implementation is used to plot the [[complex map]]. Complex maps For the numeric implementation, it is more convenienr to rewrite the expansion as follows:8 KB (1,211 words) - 18:25, 30 July 2019
- ==Numerical Implementation of ArcSin== This implementation above used to plot the [[complex map]] of ArcSin at the top figure.9 KB (982 words) - 18:48, 30 July 2019
- ...owever, it may have also other applications. Tterefore, the robust [[C++]] implementation is supplied in the description of the complex map (click on the map at righ ==Numerical implementation==8 KB (1,137 words) - 18:27, 30 July 2019
- ...[cohc]] and its inverse function [[ArcCohc]] is used to make the efficient implementation of the inverse function [[ArcCosc]]=cosc\(^{-1}\). ...he inverse function is described and supplied with the efficient numerical implementation in [[C++]]. The other branches are expected be considered in the similar wa4 KB (649 words) - 18:26, 30 July 2019
- The numerical solution of the equation (3) gives the approximation in the numerical implementation of function . Also,4 KB (581 words) - 18:25, 30 July 2019
- These asymptotics are used in the numerical implementation [[acosc1]] available at [[acosc1.cin]].6 KB (896 words) - 18:26, 30 July 2019