We study the accuracy of an algorithm which computes the convolution via Radix-2 fast Fourier transforms. Upper bounds are derived for the expected value and the variance of the accompanying linear forms in terms of the expected value and variance of the relative roundoff errors for the elementary operations of addition and multiplication. These results are compared with the corresponding ones ...

Loop integration results have been obtained using numerical integration and extrapolation. An extrapolation to the limit is performed with respect to a parameter in the integrand which tends to zero. Results are given for a non-scalar four-point diagram. Extensions to accommodate loop integration by existing integration packages are also discussed. These include: using previously generated part...

In this report, we propose lossless/lossy coding gain as a new objective criterion to theoretically evaluate lossless and lossy coding performance of the lossless/lossy wavelet (LLW). The proposed lossless/lossy coding gain consists of three parameters: “lossless coding gain”, “quantization-lossy coding gain” and “rounding errors”. Performances of 15 kinds of the LLW are measured with two-dimen...

A line-smoothing algorithm based on simple arithmetic is presented and its characteristics are analyzed for various implementations. The algorithm is efficient because it can be implemented using only simple integer arithmetic, with no square root or trigonometric calculations. The algorithm is applicable to graph drawing applications that require smooth polylines between graph nodes. Though th...

An iterative algorithm is presented for solving the extended Sylvester-conjugate matrix equation. By this iterativemethod, the solvability of thematrix equation can be determined automatically. When the matrix equation is consistent, a solution can be obtained within finite iteration steps for any initial values in the absence of round-off errors. The algorithm is also generalized to solve a mo...

An efficient iterative algorithm is applied to seek analytical solutions of higher dimensional initial boundary value problems (IBVPS) with variable coefficients. The proposed scheme finds the solution without any discretization, perturbation, transformation or restrictive assumptions and avoids the round off errors. Numerical results clearly reveal the complete reliability and efficiency of th...

We introduce a concrete semantics for floating-point operations which describes the propagation of roundoff errors throughout a calculation. This semantics is used to assert the correctness of a static analysis which can be straightforwardly derived from it. In our model, every elementary operation introduces a new first order error term, which is later propagated and combined with other error ...

The vast use of computers on scientific numerical computation makes the awareness of the limited precision that these machines are able to provide us an essential matter. A limited and insufficient precision allied to the truncation and rounding errors may induce the user to incorrect interpretation of his/hers answer. In this work, we have developed a computational package to minimize this kin...

Because of the importance of special functions, several books and a large collection of papers have been devoted to the numerical computation of these functions, the most well-known being the Abramowitz and Stegun handbook [1]. But up to this date, no environment offers routines for the provable correct evaluation of these special functions. We point out how series and limit-periodic continued ...

On recent architectures, a numerical program may give different answers depending on the execution hardware and the compilation. Our goal is to formally prove properties about numerical programs that are true for multiple architectures and compilers. We propose an approach that states the rounding error of each floating-point computation whatever the environment. This approach is implemented in...