This thesis presents a practical means for determining checking polynomials for the fault tolerant computation of numerical functions. This method is based on certain algebraic features of the numerical functions such as the transcendence degree of a field extension. Checking polynomials are given for representative simple and compound numerical functions. Some of these checking models are implemented in a simulation environment. The program developed provides the means for generating checking polynomials for a broad class of numerical functions. Considerations for designing and deploying checking models are given. This numerical technique can lower costs and conserve system resources when engineering for remote or nanoscale supercomputing ...
AbstractThe error propagation characteristics of the polynomial evaluation schemes of Horner, Clensh...
A roundoff error analysis of formulae for evaluating polynomials is performed. The considered formul...
This dissertation investigates the problems of two distinctive formal verification techniques for ve...
This thesis presents a practical means for determining checking polynomials for the fault tolerant c...
Rigorous numerics aims at providing certified representations for solutions of various problems, not...
Computers use algorithms to evaluate polynomials. This paper will study the efficiency of various al...
The study of self-testing and self-correcting programs leads to the search for robust characterizat...
We provide sufficient conditions that formally guarantee that the floating-point computation of a po...
This thesis describes the development and testing of an analogue computer capable in principle of so...
This paper proposes an algebraic method to prove the correctness of Arithmetic Program which halts i...
12 pagesThe floating-point implementation of a function on an interval often reduces to polynomial a...
(eng) Polynomials are used in many applications and hidden in libraries such as libm. Whereas the ac...
AbstractThis paper explores the certification of properties of an efficient functional program in th...
In traditional computer algebra on polynomials, we have assumed that the coefficients of polynomials...
The purpose of the thesis is to get a better understanding of computer algebra in general, and polyn...
AbstractThe error propagation characteristics of the polynomial evaluation schemes of Horner, Clensh...
A roundoff error analysis of formulae for evaluating polynomials is performed. The considered formul...
This dissertation investigates the problems of two distinctive formal verification techniques for ve...
This thesis presents a practical means for determining checking polynomials for the fault tolerant c...
Rigorous numerics aims at providing certified representations for solutions of various problems, not...
Computers use algorithms to evaluate polynomials. This paper will study the efficiency of various al...
The study of self-testing and self-correcting programs leads to the search for robust characterizat...
We provide sufficient conditions that formally guarantee that the floating-point computation of a po...
This thesis describes the development and testing of an analogue computer capable in principle of so...
This paper proposes an algebraic method to prove the correctness of Arithmetic Program which halts i...
12 pagesThe floating-point implementation of a function on an interval often reduces to polynomial a...
(eng) Polynomials are used in many applications and hidden in libraries such as libm. Whereas the ac...
AbstractThis paper explores the certification of properties of an efficient functional program in th...
In traditional computer algebra on polynomials, we have assumed that the coefficients of polynomials...
The purpose of the thesis is to get a better understanding of computer algebra in general, and polyn...
AbstractThe error propagation characteristics of the polynomial evaluation schemes of Horner, Clensh...
A roundoff error analysis of formulae for evaluating polynomials is performed. The considered formul...
This dissertation investigates the problems of two distinctive formal verification techniques for ve...