Search results

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

• SuZex approximation
  ..., various approximations are described below. They are used in the [[C++]] implementation of function [[SuZex]], called by generators of figures, and, in particular, ...s inverse [[LambertW]]\(=\mathrm{zex}^{-1}\), the efficient compex(double) numerical implementations are available.
  14 KB (2,037 words) - 18:25, 30 July 2019
• SuZexCoef20.cin
  // for the numerical implementation of [[SuZex]] in [[C++]]
  6 KB (180 words) - 15:01, 20 June 2013
• LambertW.cin
  // [[LambertW.cin]] is numerical implementation of function [[LambertW]] in [[C++]]. //End of the numerical implementation of LambertW.
  5 KB (287 words) - 15:01, 20 June 2013
• AuZex.cin
  // [[AuZex.cin]] is numerical implementation in [[C++]] of function [[AuZex]], with is [[inverse function]] of [[SuZex]]
  3 KB (274 words) - 15:01, 20 June 2013
• Name of function
  [[Name of function]] is sequence of letters (and sometimes, also [[numerical digit]]s) used to identify the [[mathematical function]]s. The name can be used to find description or implementation of a function in [[TORI]] or any other database.
  6 KB (901 words) - 18:27, 30 July 2019
• Schroeder equation
  The descriptions and [[numerical implementation]]s of the [[Tania function]] and [[WrightOmega]] and [[Filog]] are availabl
  8 KB (1,239 words) - 11:32, 20 July 2020
• ArcTra
  However the independent implementation of ArcTra can be arranged using its asymptotic properties. The same expansion van be written in more compact (and suitable for the implementation) form:
  10 KB (1,442 words) - 18:47, 30 July 2019
• AuTra
  Once [[AuZex]] is implemented, this expression can be used for the numerical implementation of [[AuTra]] at moderate values of the real part of the argument, while its This representation is used for the numericcal implementation of AuTra described below.
  6 KB (1,009 words) - 18:48, 30 July 2019
• Nori
  ...declared region, approximation fit is much better than the straightforward implementation through function [[BesselJ0]], denoted in C++ with identifier j0. ...t mathematical constant). Similar goal can be formulated for the numerical implementation of other [[special function]]s.
  13 KB (1,759 words) - 18:45, 30 July 2019
• Four1.cin
  ...to float. The result is below. it should be close to the original by the "numerical recipes", but I cannot access the original to check this. //The routine below is float implementation of the sin fourier transform ([[FSFT]]. It is supposed to be compiled toget
  2 KB (228 words) - 07:00, 1 December 2018
• Morias
  ...n of approximation with the complex double arithmetics in the examples and numerical tests. ...to have function implemented in a "dingle piece". Then, for the commercial implementation as a built-in function of some language or software, the appropriate combin
  3 KB (456 words) - 18:44, 30 July 2019
• Arcsin.cin
  For me, it is easier to write the efficient implementation, than to search for the appropriate compiler with these routines. [[User:T| ...e copypasted below. The generators of some figures still use the primitive implementation, that provides of order of 14 decimal digits instead of 15 digits.
  4 KB (488 words) - 06:58, 1 December 2018
• ArqNem
  ==Implementation== For \(q>0\), the [[C++]] implementation of function \(\mathrm{ArqNem}_q\) is suggested below. Note, that value of
  7 KB (1,319 words) - 18:46, 30 July 2019
• AuNem
  ...ing output is stored in file [[aunemco.txt]]; this file is used at the C++ implementation of function [[AuNem]]. ...e the approximation of limit with \(n\!=\!10\); id est, the complex double implementation evaluates function
  9 KB (1,441 words) - 18:45, 30 July 2019
• AuSin
  The numerical implementation of AuSin with the algorithm above is stored as [[ausin.cin]]. The area of agreement of this implementation with that of function [[SuSin]] is seen from the complex map of function
  5 KB (761 words) - 18:48, 30 July 2019
• CFT
  [[CFT]], is the discrete implementation of the [[CosFT]] transform. If \(N\!=\!2^n\) for some integer \(n\), then, there exist efficient numerical algorithms for evaluation of this sum.
  5 KB (721 words) - 18:44, 30 July 2019
• Chebyshev polynomial
  ..., the Chebyshev polynomial is expected be used for the efficient numerical implementation of the [[Bessel transform]]. Mainly, the properties that are important for
  1 KB (186 words) - 18:48, 30 July 2019
• CosFT
  ==Numerical implementation== The [[Numerical recipes in C]] (http://numerical.recipes)
  3 KB (468 words) - 18:47, 30 July 2019
• Exotic iteration
  ...expansion and the transfer equation. However, for the efficient numerical implementation, several terms of the asymptotic expansion should be calculated. For a spec
  11 KB (1,715 words) - 18:44, 30 July 2019
• Kori
  ...eviation \(\mathcal D(x)\) of the approximation korifit(x) from the direct implementation through [[j0]] ]] and in this range it is better than the naive, direct implementation by definition through the C++ built-in function double j0(double).
  14 KB (1,943 words) - 18:48, 30 July 2019

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