One of the considerable discussions for solving the nonlinear equations is to find the optimal iteration, and to use a proper termination criterion which is able to obtain a high accuracy for the numerical solution. In this paper, for a certain class of the family of optimal two-point methods, we propose a new scheme based on the stochastic arithmetic to find the optimal number of iterations in...

In this paper, we apply the Newton’s and He’s iteration formulas in order to solve the nonlinear algebraic equations. In this case, we use the stochastic arithmetic and the CESTAC method to validate the results. We show that the He’s iteration formula is more reliable than the Newton’s iteration formula by using the CADNA library.

Interval arithmetic and stochastic arithmetic have been both developed for the same purpose, i. e. to control errors coming from floating point arithmetic of computers and validate the results of numerical algorithms performed on computers. Interval arithmetic delivers guaranteed bounds for numerical results but requires special analysis and algorithms. On the other hand stochastic arithmetic i...

Quantifying errors and losses due to the use of Floating-point (FP) calculations in industrial scientific computing codes is an important part Verification, Validation, Uncertainty Quantification process. Stochastic Arithmetic one way model estimate FP accuracy, which scales well large, codes. It exists different flavors, such as CESTAC or MCA, implemented various tools CADNA, Verificarlo, Verr...

This dissertation uses the theory of stochastic arithmetic as a solution for the FPGA implementation of complex control algorithms for power electronics applications. Compared with the traditional digital implementation, the stochastic approach simplifies the computation involved and saves digital resources. The implementation of stochastic arithmetic is also compatible with modern VLSI design ...

Floating-point arithmetic precision is limited in length the IEEE single (respectively double) precision format is 32-bit (respectively 64-bit) long. Extended precision formats can be up to 128-bit long. However some problems require a longer floating-point format, because of round-off errors. Such problems are usually solved in arbitrary precision, but round-off errors still occur and must be ...

In this paper, the evaluation of I = ∫ 1 −1 f(x) √ 1−x2 dx is proposed by using the opened and closed Gauss Chebyshev integration rules in the stochastic arithmetic. For this purpose, a theorem is proved to show the accuracy of the Gauss-Chebyshev rules. Then, the CESTAC 1 method and the stochastic arithmetic are used to validate the results and implement the numerical example.

An important task in solving second order linear ordinary differential equations by the finite difference is to choose a suitable stepsize h. In this paper, by using the stochastic arithmetic, the CESTAC method and the CADNA library we present a procedure to estimate the optimal stepsize hopt, the stepsize which minimizes the global error consisting of truncation and round-off error. Keywords—o...

‎we obtain the asymptotic expansion of the sequence with general term $frac{a_n}{g_n}$‎, ‎where $a_n$ and $g_n$ are the arithmetic and geometric means of the numbers $d(1),d(2),dots,d(n)$‎, ‎with $d(n)$ denoting the number of positive divisors of $n$‎. ‎also‎, ‎we obtain some explicit bounds concerning $g_n$ and $frac{a_n}{g_n}$.