In traditional computer algebra on polynomials, we have assumed that the coefficients of polynomials were given rigorously by integers, rational numbers or algebraic numbers and that manipulation on the polynomials were also exact. However, in many practical applications or real world problems, the coefficients contain errors, that is, polynomial
(eng) Polynomials are used in many applications and hidden in libraries such as libm. Whereas the ac...
We perform a backward error analysis of polynomial eigenvalue problems solved via linearization. Thr...
The goal of this paper is to analyze two polynomial evaluation schemes for mul-tiple precision float...
AbstractThe error propagation characteristics of the polynomial evaluation schemes of Horner, Clensh...
This research aims to study and classify errors in polynomials made by secondary school students. Th...
Polynomial multiplication is as close to any problem comes to being “classical” in the field of comp...
Problem: Textbooks offer different definitions for polynomials. Examples: • Expressions over a ring...
Three theorems are given for approximate determination of magnitudes of polynomial roots. A definiti...
This thesis presents a practical means for determining checking polynomials for the fault tolerant c...
A roundoff error analysis of formulae for evaluating polynomials is performed. The considered formul...
<p>Error mean and standard deviation (measured using 100 random samples by cross-validation) for dif...
The Russian style of formulating mathematical problems means that nobody will be able to simplify yo...
AbstractWe consider the sequence of errors (En(f))nof best uniform approximation to a functionf∈C[−1...
Algorithms in Computer Algebra base on algebraic concepts and aim at finding exact solutions. Comput...
AbstractThe problem of the evaluation in floating-point arithmetic of a polynomial with floating-poi...
(eng) Polynomials are used in many applications and hidden in libraries such as libm. Whereas the ac...
We perform a backward error analysis of polynomial eigenvalue problems solved via linearization. Thr...
The goal of this paper is to analyze two polynomial evaluation schemes for mul-tiple precision float...
AbstractThe error propagation characteristics of the polynomial evaluation schemes of Horner, Clensh...
This research aims to study and classify errors in polynomials made by secondary school students. Th...
Polynomial multiplication is as close to any problem comes to being “classical” in the field of comp...
Problem: Textbooks offer different definitions for polynomials. Examples: • Expressions over a ring...
Three theorems are given for approximate determination of magnitudes of polynomial roots. A definiti...
This thesis presents a practical means for determining checking polynomials for the fault tolerant c...
A roundoff error analysis of formulae for evaluating polynomials is performed. The considered formul...
<p>Error mean and standard deviation (measured using 100 random samples by cross-validation) for dif...
The Russian style of formulating mathematical problems means that nobody will be able to simplify yo...
AbstractWe consider the sequence of errors (En(f))nof best uniform approximation to a functionf∈C[−1...
Algorithms in Computer Algebra base on algebraic concepts and aim at finding exact solutions. Comput...
AbstractThe problem of the evaluation in floating-point arithmetic of a polynomial with floating-poi...
(eng) Polynomials are used in many applications and hidden in libraries such as libm. Whereas the ac...
We perform a backward error analysis of polynomial eigenvalue problems solved via linearization. Thr...
The goal of this paper is to analyze two polynomial evaluation schemes for mul-tiple precision float...