Results 121 to 130 of about 7,840 (182)
Optimizing FPGA implementation of high-precision chaotic systems for improved performance. [PDF]
Damaj I, Zaher A, Lawand W.
europepmc +1 more source
Numerical stability of DeepGOPlus inference. [PDF]
Gonzalez Pepe I +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Algorithms for roundoff error analysis —A relative error approach
Computing, 1980Methods are presented for performing various error analyses of numerical algorithms. These analyses include forward, backward, and B-analysis (a combination of forward and backward). These analyses additionally provide alternative criteria by which different algorithms that solve the same problem may be compared.
Larson, J. L., Sameh, A. H.
openaire +1 more source
Numerical chaos, roundoff errors, and homoclinic manifolds
Physical Review Letters, 1993The focusing nonlinear Schr\"odinger equation is numerically integrated over moderate to long time intervals. In certain parameter regimes small errors on the order of roundoff grow rapidly and saturate at values comparable to the main wave. Although the constants of motion are nearly preserved, a serious phase instability (chaos) develops in the ...
, Ablowitz, , Schober, , Herbst
openaire +2 more sources
Roundoff error in fast Fourier transforms
Proceedings of the IEEE, 1975The finite word length used in the computer causes round-off error in the calculation of Fourier coefficients. When the fast Fourier transform method is used, the statistical mean-square error has been previously determined [3] for the case of the decimation-infrequency algorithm. This letter treats the same problem for the decimation-in-time algorithm.
B. Liu, T. Kaneko
openaire +1 more source
Roundoff Errors in Signal Averaging Systems
IEEE Transactions on Biomedical Engineering, 1986In biomedical signal averaging applications where a small repetitive signal is to be extracted form a very noisy waveform (noise variance ?2n), the A/D converter range is set at ±A?n where A typically has a value of 3 or 4. In this case, A/D roundoff noise using a (b + 1)-bit A/D converter degrades the SNR of the resulting signal estimate by an amount ...
openaire +2 more sources
Quantization and Roundoff Errors
1989A one-dimensional (1-D) digital filter, as noted in Section 1.3, is generally defined by $${y_n} = \sum\limits_{i = 0}^M {{a_i}{u_{n - i}}} - \sum\limits_{i = 1}^N {{b_i}{y_{n - i}}} $$ (5.1) where {u n } is the input sequence, {y n } is the output sequence, and a i , and b i are some constants.
Robert King +4 more
openaire +1 more source
Symplectic Integrators: Rotations and Roundoff Errors
Celestial Mechanics and Dynamical Astronomy, 1998We investigate the numerical implementation of a symplectic integrator combined with a rotation (as in the case of an elongated rotating primary). We show that a straightforward implementation of the rotation as a matrix multiplication destroys the conservative property of the global integrator, due to roundoff errors.
openaire +2 more sources
Roundoff errors in fixed-point FFT
2009 IEEE International Symposium on Intelligent Signal Processing, 2009The general assumptions made about roundoff noise are that its samples form a white sequence. and they are uniformly distributed between ±q/2, where q is the size of the LSB. While this is often true, strange cases may appear, e.g. misleading peaks can occur in the spectrum. This paper investigates the roundoff error of fixed-point FFT.
Pálfi, Vilmos, Kollár, István
openaire +1 more source
Improved Roundoff Error Analysis for Precomputed Twiddle Factors
Journal of Computational Analysis and Applications, 2002The paper presents both worst-case and average case analysis of rounfoff errors occuring in eight precomputation methods of twiddle factors. Two of the methods are new. The paper is interested for methods with small roundoff errors, low complexity and using only little computer memory.
Tasche, Manfred, Zeuner, Hansmartin
openaire +1 more source

