Sciweavers

CAGD
2007
75views more  CAGD 2007»
13 years 11 months ago
Computing roots of polynomials by quadratic clipping
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
Michael Barton, Bert Jüttler
ISSAC
2007
Springer
163views Mathematics» more  ISSAC 2007»
14 years 5 months ago
POSIX threads polynomials(PTPol): a scalable implementation of univariate arithmetic operations
In this paper, we describe the design of a C library named PTPol implementing arithmetic operations for univariate polynomials and report on practical experiments showing the rele...
Mohab Safey El Din, Philippe Trebuchet
ISSAC
2007
Springer
132views Mathematics» more  ISSAC 2007»
14 years 5 months ago
Structured matrix methods for polynomial root-finding
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
Luca Gemignani
ICCS
2007
Springer
14 years 5 months ago
On the Virtues of Generic Programming for Symbolic Computation
The purpose of this study is to measure the impact of C level code polynomial arithmetic on the performances of AXIOM highlevel algorithms, such as polynomial factorization. More p...
Xin Li, Marc Moreno Maza, Éric Schost