Add to ORKGWe present a new polynomial decomposition which generalizes the functional and homogeneous bivariate decomposition of irreducible monic polynomials of Q[t]. With these decompositions it is possible to calculate the roots of an imprimitive polynomial by solving polynomial equations of lower degree. (orig.)Available from TIB Hannover: RR 1606(98-21) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman
We present an algorithm for isolating the roots of an arbitrary complex polynomial $p$ that also wor...
International audienceIn this paper, we present an efficient and general algorithm for decomposing m...
A complete work on general reducibility and solvability of polynomial equations by algebraic meansra...
AbstractWe present a new polynomial decomposition which generalizes the functional and homogeneous b...
AbstractA homogeneous bivariate decomposition of a univariate polynomial f is of the form f = g(h, k...
AbstractGiven an irreducible polynomial P∈Z [ X ] of degree at least three and 0 ≠=a∈Z we are going ...
Division of polynomials has fundamental importance in algorithmic algebra, and is commonly encounter...
AbstractGiven a polynomial solution of a differential equation, its m -ary decomposition, i.e. its d...
Given a polynomial solution of a differential equation, its m-ary decomposition, i.e. its decomposit...
A given polynomial, possibly with multiple roots, is factored into several lower-degree distinct-roo...
Let $f(\vec{x}), h_{1}(\vec{x}),...,h_{d}(\vec{x})$ and $g(\vec{x})$ be elements of the polynomial ...
In this paper we establish a framework for the decomposition of approximate polynomials. We consider...
Article on polynomial harmonic decompositions. For real polynomials in two indeterminates a classica...
Livre en chinois. Ouvrage (auteur).This book provides a systematic and uniform presentation of elimi...
This paper presents an algorithm for computing a decomposition of a non- negative real polynomial as...
We present an algorithm for isolating the roots of an arbitrary complex polynomial $p$ that also wor...
International audienceIn this paper, we present an efficient and general algorithm for decomposing m...
A complete work on general reducibility and solvability of polynomial equations by algebraic meansra...
AbstractWe present a new polynomial decomposition which generalizes the functional and homogeneous b...
AbstractA homogeneous bivariate decomposition of a univariate polynomial f is of the form f = g(h, k...
AbstractGiven an irreducible polynomial P∈Z [ X ] of degree at least three and 0 ≠=a∈Z we are going ...
Division of polynomials has fundamental importance in algorithmic algebra, and is commonly encounter...
AbstractGiven a polynomial solution of a differential equation, its m -ary decomposition, i.e. its d...
Given a polynomial solution of a differential equation, its m-ary decomposition, i.e. its decomposit...
A given polynomial, possibly with multiple roots, is factored into several lower-degree distinct-roo...
Let $f(\vec{x}), h_{1}(\vec{x}),...,h_{d}(\vec{x})$ and $g(\vec{x})$ be elements of the polynomial ...
In this paper we establish a framework for the decomposition of approximate polynomials. We consider...
Article on polynomial harmonic decompositions. For real polynomials in two indeterminates a classica...
Livre en chinois. Ouvrage (auteur).This book provides a systematic and uniform presentation of elimi...
This paper presents an algorithm for computing a decomposition of a non- negative real polynomial as...
We present an algorithm for isolating the roots of an arbitrary complex polynomial $p$ that also wor...
International audienceIn this paper, we present an efficient and general algorithm for decomposing m...
A complete work on general reducibility and solvability of polynomial equations by algebraic meansra...