Search results

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

• Fourier transform
  ==Numerical implementation of the Fourier operator== ...to year 2011, it seems to be simplest and the most portable routine. This implementation is described below. The codes used to plot figures are supplied in the desc
  11 KB (1,501 words) - 18:44, 30 July 2019
• FFT
  One of the simplest algorithms realized in the implementation of the ...le), int, int) is stored in file [[fafo.cin]]. This routine is used in the implementation
  6 KB (1,010 words) - 13:23, 24 December 2020
• ArcCip
  ...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
• ArcSin
  ==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
• BesselJ1
  ...of this expansion; they can be extracted also from the [[complex(double)]] implementation [[Besselj1.cin]]. [[Category:Numeric implementation]]
  3 KB (439 words) - 18:26, 30 July 2019
• CosFourier
  The thin black segmented lines show the numeric CosFourier transforms at this grid with [[DCTI]]. These transforms coincide ...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
• Discrete Fourier
  ==Numeric implementation of the discrete Fourier== The numeric implementation of the Discrete Fourier is especially efficient when \(N=2^k\) for some nat
  6 KB (1,032 words) - 18:48, 30 July 2019
• Trappmann function
  In 2013, the direct implementation for function [[SuTra]] is suggested The numeric implementation is loaded as [[sutran.cin]].
  9 KB (1,320 words) - 11:38, 20 July 2020
• 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
• GSL
  ...times, as the time to catch each single misprint also raises 7 times. The implementation, that can be programmed in the conventional notations within 1 year, in the If the numeric implementation of some function id required, and it is not yet loaded to [[TORI]],
  6 KB (975 words) - 18:47, 30 July 2019