ISSAC
15 years 2 months ago
2005 Springer 
In this paper, we give a necessary and sufficient condition for an algebraic ODE to have an algebraic general solution. For an autonomous first order ODE, we give an optimized bo...
ISSAC
15 years 2 months ago
2005 Springer 
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
ISSAC
15 years 2 months ago
2005 Springer 
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
ISSAC
15 years 2 months ago
2005 Springer 
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
ISSAC
15 years 2 months ago
2005 Springer 
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈ [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
|
Mathematics