A new algorithm for splitting polynomials is presented. This algorithm requires O(d log 1 ) 1+Æ floating point operations, with O(log 1 ) 1+Æ bits of precision. As far as complexity is concerned, this is the fastest algorithm known by the authors for that problem. An important application of the method is factorizing polynomials or polynomial root-finding
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
The evaluation of several polynomial forms is considered. New algorithms for the evaluation of a pol...
AbstractThis paper introduces the notion of normal factorisation of polynomials and then presents a ...
AbstractThis paper concerns the fast numerical factorization of degree a + b polynomials in a neighb...
AbstractThis paper concerns the fast numerical factorization of degree a + b polynomials in a neighb...
AbstractTo approximate all roots (zeros) of a univariate polynomial, we develop two effective algori...
Abstract(i) First we show that all the known algorithms for polynomial division can be represented a...
Finite fields, and the polynomial rings over them, have many neat algebraic properties and identitie...
Finite fields, and the polynomial rings over them, have many neat algebraic properties and identitie...
AbstractWe consider the problem of factoring univariate polynomials over a finite field. We demonstr...
AbstractWe consider the problem of factoring univariate polynomials over a finite field. We demonstr...
Division of polynomials has fundamental importance in algorithmic algebra, and is commonly encounter...
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $...
AbstractNumerical splitting of a real or complex univariate polynomial into factors is the basic ste...
The evaluation of several polynomial forms is considered. New algorithms for the evaluation of a pol...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
The evaluation of several polynomial forms is considered. New algorithms for the evaluation of a pol...
AbstractThis paper introduces the notion of normal factorisation of polynomials and then presents a ...
AbstractThis paper concerns the fast numerical factorization of degree a + b polynomials in a neighb...
AbstractThis paper concerns the fast numerical factorization of degree a + b polynomials in a neighb...
AbstractTo approximate all roots (zeros) of a univariate polynomial, we develop two effective algori...
Abstract(i) First we show that all the known algorithms for polynomial division can be represented a...
Finite fields, and the polynomial rings over them, have many neat algebraic properties and identitie...
Finite fields, and the polynomial rings over them, have many neat algebraic properties and identitie...
AbstractWe consider the problem of factoring univariate polynomials over a finite field. We demonstr...
AbstractWe consider the problem of factoring univariate polynomials over a finite field. We demonstr...
Division of polynomials has fundamental importance in algorithmic algebra, and is commonly encounter...
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $...
AbstractNumerical splitting of a real or complex univariate polynomial into factors is the basic ste...
The evaluation of several polynomial forms is considered. New algorithms for the evaluation of a pol...
A stable algorithm to compute the roots of polynomials is presented. The roots are found by computin...
The evaluation of several polynomial forms is considered. New algorithms for the evaluation of a pol...
AbstractThis paper introduces the notion of normal factorisation of polynomials and then presents a ...
Add to ORKG