Search results

Jump to: navigation, search
  • // [[afacc.cin]] is routine for the complex double evaluation of [[ArcFactorial]].
    995 bytes (148 words) - 18:46, 3 September 2023
  • ...ed using approximations (8) and (9) using calculations with just [[complex double]] arithmetics.
    7 KB (1,076 words) - 18:25, 30 July 2019
  • main(){ int m,n; double c,p,q; FILE *o;
    2 KB (87 words) - 15:01, 20 June 2013
  • double LambertWeCoe[102]={ -1., 1.,
    3 KB (223 words) - 18:48, 30 July 2019
  • double SuZexTay0co[97]={
    3 KB (107 words) - 15:01, 20 June 2013
  • ...) and its inverse [[LambertW]]\(=\mathrm{zex}^{-1}\), the efficient compex(double) numerical implementations are available. ...error due to the approximation is smaller than the rounding error at the [[double precision]] arithmetics. Perhaps, even less terms would be sufficient for t
    14 KB (2,037 words) - 18:25, 30 July 2019
  • double a[21][21]=
    6 KB (180 words) - 15:01, 20 June 2013
  • ...ay of coefficients in the approximation \(Q_{20}\), used for the [[complex double]] implementation of function [[SuZex]]. double c[112]={
    3 KB (139 words) - 18:47, 30 July 2019
  • #define DB double typedef complex<double> z_type;
    12 KB (682 words) - 07:06, 1 December 2018
  • double LambertWeCoe[102]={ -1., 1.,
    5 KB (287 words) - 15:01, 20 June 2013
  • double AuZexCo[46]={0,
    3 KB (274 words) - 15:01, 20 June 2013
  • ...uPow}_2\) approaches its limiting value unity at \(-\infty\) and shows the double-exponential growth at \(+\infty\); this growth is seen in both Fig.3 and F
    15 KB (2,495 words) - 18:43, 30 July 2019
  • This is close to the limit that can be achieved with the complex(double) variables.
    9 KB (1,285 words) - 18:25, 30 July 2019
  • // [[Sufac.cin]] is [[complex double]] implementation of superfunction of [[factorial]], constructed with [[regu ...); the retunting value is z_type; this type should be defined as [[complex double]].
    2 KB (119 words) - 07:06, 1 December 2018
  • ...ignificant figures; it is best precision that can be achieved with complex double variables.
    10 KB (1,442 words) - 18:47, 30 July 2019
  • This section describe the [[complex double]] numerical implementation of AuTra. For \(M=9\), the figure at right show ...that can be attributed to the rounding errors at the use of the [[complex double]] arithmetics.
    6 KB (1,009 words) - 18:48, 30 July 2019
  • #define DB double typedef complex<double> z_type;
    1 KB (197 words) - 15:03, 20 June 2013
  • After to finish this equation, the double-dollar should be repeated again. The result may look as this:
    5 KB (795 words) - 10:28, 26 March 2021
  • ...a dreary, whining sort of voice, ‘I thought I heard you come in. Do you think you could come across and have a look at our kitchen sink? It’s got block He put the diary away in the drawer. It was quite useless to think of hiding it, but he could at least make sure whether or not its existence
    587 KB (105,318 words) - 13:23, 7 April 2023
  • ...metic expression "as is", in the in the form, accepted for integer, folod, double, etc, the internal GSL format impllies writing of the call of the specific gsl_complex gsl_complex_add_real(gsl_complex a, double x) <br> This function returns the sum of the complex number a and the real
    6 KB (975 words) - 18:47, 30 July 2019

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