Results 151 to 160 of about 2,905,950 (213)

Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations

SIAM Journal on Matrix Analysis and Applications, 2022
Christopher J. Lourenco, Erick Moreno-Centeno   +1 more
semanticscholar   +1 more source

Comments on "Roundoff Errors in Signal Averaging Systems"

IEEE Transactions on Biomedical Engineering, 1987
In this paper1 the author finds the degradation in signal-to-noise ratio (SNR) of a signal averaging system output as a function of A/D bits. The results stated are based on certain assumptions which do not hold for low values of A/D bits. Under these conditions the results seriously overestimate the SNR degradation.
openaire   +2 more sources

Roundoff Error and Double Precision

1977
As we have seen, most applications of computers to calculus involve the evaluation of several terms in a sequence. The evaluations continue until some criterion is satisfied. In Figure 1–5 for example, the criterion was that the terms of two sequences differ by less than 10-3. In EXERCISE 5–5 the values of the sequence \( \frac{{f(1.8 + {{10}^{{ - n}}})
openaire   +1 more source

Roundoff errors in block-floating-point systems

IEEE Transactions on Signal Processing, 1996
Block-floating-point representation is a special case of floating-point representation, where several numbers have a joint exponent term. In this paper, roundoff errors in signal processing systems utilizing block-floating-point representation are studied. Special emphasis is on analysis of quantization errors when data is quantized to a block-floating-
K. Kalliojarvi, J. Astola
openaire   +1 more source

Tests of probabilistic models for propagation of roundoff errors

Communications of the ACM, 1966
In any prolonged computation it is generally assumed that the accumulated effect of roundoff errors is in some sense statistical. The purpose of this paper is to give precise descriptions of certain probabilistic models for roundoff error, and then to describe a series of experiments for testing the validity of these models.
Hull, T. E., Swenson, J. R.
openaire   +2 more sources

On roundoff error problems in diffusion calculations

Annals of Nuclear Energy, 1983
Abstract The problem of roundoff errors in diffusion calculations is illustrated by an extreme example. A two-group point core which is shown to have immediate absolute convergence using an infinite-length computer word, fails to converge to an acceptable level using a short-length computer word.
Y. Bartal, Y. Gur, S. Yiftah
openaire   +1 more source

Roundoff error in multidimensional generalized discrete transforms

IEEE Transactions on Circuits and Systems, 1974
The analysis of rounding error in the one-dimensional fast Fourier transform (FFT) is extended to a class of generalized orthogonal transforms [1] with a common fast algorithm similar to the FFT algorithm. This class includes the BInary FOurier REpresentation (BIFORE) transform (BT) [2], the complex BT (CBT) [3], and the discrete Fourier transform (DFT)
O. Chan, E. Jury
openaire   +1 more source

Stairway to Heaven: Accumulation of Roundoff Error

1996
Martin Gardner’s popular “Mathematical Games” column appeared monthly in Scientific American from January 1957 through December 1981. During those 25 years he entertained his readers with discussions of such topics as how to fold adding machine tape into hexaflexagons, John Conway’s Game of Life, and the discoveries of the mysterious numerologist Dr ...
openaire   +1 more source

Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates

SIAM Journal on Matrix Analysis and Applications, 2017
Adolfo R. Escobedo, Erick Moreno-Centeno
semanticscholar   +1 more source

Towards complete and error-free genome assemblies of all vertebrate species

Nature, 2021
Arang Rhie, Shane A Mccarthy, Olivier Fedrigo   +2 more
exaly