Search results

Jump to: navigation, search
  • For the case of natural tetration, the complex double implementations in C++ and than in Mathematica are available at Citizendium; the generators
    21 KB (3,175 words) - 23:37, 2 May 2021
  • ...holomorphic function, declared as the [[transfer function]], the efficient implementations are necessary for the transfer function and its [[inverse function]]. Unfor ...ns as the last argument cause the error message. (For this reason, the C++ implementations of SuperFactorial and AbelFactorial were used to plot graphics.) One may ex
    13 KB (1,766 words) - 18:43, 30 July 2019
  • [[Category:Implementations]]
    5 KB (275 words) - 07:00, 1 December 2018
  • ...pansions in vicinity of the [[Fixed point]]s; in particular, the numerical implementations for [[tetration]], [[ArcTetration]], [[SuperFactorial]], [[Abel Factorial]]
    12 KB (1,901 words) - 18:43, 30 July 2019
  • The C++ implementations of Yulya and ArcYulya is simple; the conversion of the algorithms to other With these implementations one may plot
    12 KB (1,754 words) - 18:25, 30 July 2019
  • ...t plot of LambertW at the top uses the expansions (5) and (6) above; their implementations can be loaded from the figure. (I could not make the special numerical impl
    8 KB (1,107 words) - 18:26, 30 July 2019
  • The self-Fourier functions are good for testing of the numerical implementations of the Fourier operator \(\mathcal{F}\). ...discrete implementation of the Fourier operator at some grid. Then, other implementations can be built-up with minimal modifications of the algorithm, shifting and s
    11 KB (1,501 words) - 18:44, 30 July 2019
  • ...thms for evaluation of tetration and arctetration will be implemented, the implementations may have more understandable names TET and ATE.
    14 KB (1,972 words) - 02:22, 27 June 2020
  • ==Expansions and implementations==
    9 KB (982 words) - 18:48, 30 July 2019
  • While there exist efficient implementations of \(\mathrm{cosc}\) and \(\mathrm{cosc}'\), it is faster to make few addit
    8 KB (1,137 words) - 18:27, 30 July 2019
  • \(J_\nu\). For \(\nu=0\) and \(\nu=1\), there are specific implementations [[BesselJ0]] and [[BesselJ1]]. 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]].
    6 KB (915 words) - 18:26, 30 July 2019
  • ...f Research and Investigation, the formulas, their descriptions and the C++ implementations are collected here.
    3 KB (482 words) - 18:26, 30 July 2019
  • The numerical implementations with 14 decimal digits in [[C++]] for functions \(\mathrm {LogisticSequence
    7 KB (886 words) - 18:26, 30 July 2019
  • ...ions for funcitons [[LogisticSequence]] and [[ArcLogisticSequence]]; these implementations are available in the description of the pictures.
    6 KB (817 words) - 19:54, 5 August 2020
  • ...[[LambertW]]\(=\mathrm{zex}^{-1}\), the efficient compex(double) numerical implementations are available.
    14 KB (2,037 words) - 18:25, 30 July 2019
  • 8 KB (1,239 words) - 11:32, 20 July 2020
  • ...e expansions at large values of the argument, as well as for the numerical implementations of these functions.
    9 KB (1,285 words) - 18:25, 30 July 2019
  • The efficient implementation of function ArcTra, as the efficient implementations of [[SuTra]], [[AuTra]] and
    10 KB (1,442 words) - 18:47, 30 July 2019
  • ...he integrand and its components are important; in particular the efficient implementations are necessary for all the functions involved.
    13 KB (1,759 words) - 18:45, 30 July 2019

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)