Results 1  10
of
82
A Gröbner free alternative for polynomial system solving
 Journal of Complexity
, 2001
"... Given a system of polynomial equations and inequations with coefficients in the field of rational numbers, we show how to compute a geometric resolution of the set of common roots of the system over the field of complex numbers. A geometric resolution consists of a primitive element of the algebraic ..."
Abstract

Cited by 82 (16 self)
 Add to MetaCart
Given a system of polynomial equations and inequations with coefficients in the field of rational numbers, we show how to compute a geometric resolution of the set of common roots of the system over the field of complex numbers. A geometric resolution consists of a primitive element of the algebraic extension defined by the set of roots, its minimal polynomial and the parametrizations of the coordinates. Such a representation of the solutions has a long history which goes back to Leopold Kronecker and has been revisited many times in computer algebra. We introduce a new generation of probabilistic algorithms where all the computations use only univariate or bivariate polynomials. We give a new codification of the set of solutions of a positive dimensional algebraic variety relying on a new global version of Newton’s iterator. Roughly speaking the complexity of our algorithm is polynomial in some kind of degree of the system, in its height, and linear in the complexity of evaluation
Solving parametric polynomial systems
 Journal of Symbolic Computation
, 2007
"... We present a new algorithm for solving basic parametric constructible or semialgebraic ..."
Abstract

Cited by 36 (2 self)
 Add to MetaCart
We present a new algorithm for solving basic parametric constructible or semialgebraic
Polar Varieties and Computation of one Point in each Connected Component of a Smooth Real Algebraic Set
, 2003
"... Let f1,..., fs be polynomials in Q[X1,..., Xn] that generate a radical ideal and let V be their complex zeroset. Suppose that V is smooth and equidimensional; then we show that computing suitable sections of the polar varieties associated to generic projections of V gives at least one point in each ..."
Abstract

Cited by 34 (15 self)
 Add to MetaCart
Let f1,..., fs be polynomials in Q[X1,..., Xn] that generate a radical ideal and let V be their complex zeroset. Suppose that V is smooth and equidimensional; then we show that computing suitable sections of the polar varieties associated to generic projections of V gives at least one point in each connected component of V ∩ R n. We deduce an algorithm that extends that of Bank, Giusti, Heintz and Mbakop to noncompact situations. Its arithmetic complexity is polynomial in the complexity of evaluation of the input system, an intrinsic algebraic quantity and a combinatorial quantity.
Motivations for an arbitrary precision interval arithmetic and the MPFI library
 Reliable Computing
, 2002
"... Nowadays, computations involve more and more operations and consequently errors. The limits of applicability of some numerical algorithms are now reached: for instance the theoretical stability of a dense matrix factorization (LU or QR) is ensured under the assumption that n 3 u < 1, where n is the ..."
Abstract

Cited by 29 (7 self)
 Add to MetaCart
Nowadays, computations involve more and more operations and consequently errors. The limits of applicability of some numerical algorithms are now reached: for instance the theoretical stability of a dense matrix factorization (LU or QR) is ensured under the assumption that n 3 u < 1, where n is the dimension of the matrix and u = 1 + − 1, with 1 + the smallest floatingpoint larger than 1; this means that n must be less than 200,000, which is almost reached by modern simulations. The numerical quality of solvers is now an issue, and not only their mathematical quality. Let us cite studies performed by the CEA (French Nuclear Agency) on the simulation of nuclear plant accidents and also softwares controlling and possibly correcting numerical programs, such as Cadna [10] or Cena [20]. Another approach consists in computing with certified enclosures, namely interval arithmetic [21, 2, 18]. The fundamental principle of this arithmetic consists in replacing every number by an interval enclosing it. For instance, π cannot be exactly represented using a binary or decimal arithmetic, but it
On the TimeSpace Complexity of Geometric Elimination Procedures
, 1999
"... In [25] and [22] a new algorithmic concept was introduced for the symbolic solution of a zero dimensional complete intersection polynomial equation system satisfying a certain generic smoothness condition. The main innovative point of this algorithmic concept consists in the introduction of a new ge ..."
Abstract

Cited by 23 (16 self)
 Add to MetaCart
In [25] and [22] a new algorithmic concept was introduced for the symbolic solution of a zero dimensional complete intersection polynomial equation system satisfying a certain generic smoothness condition. The main innovative point of this algorithmic concept consists in the introduction of a new geometric invariant, called the degree of the input system, and the proof that the most common elimination problems have time complexity which is polynomial in this degree and the length of the input.
Computing Parametric Geometric Resolutions
, 2001
"... Given a polynomial system of n equations in n unknowns that depends on some parameters, we de ne the notion of parametric geometric resolution as a means to represent some generic solutions in terms of the parameters. The coefficients of this resolution are rational functions of the parameters; we f ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
Given a polynomial system of n equations in n unknowns that depends on some parameters, we de ne the notion of parametric geometric resolution as a means to represent some generic solutions in terms of the parameters. The coefficients of this resolution are rational functions of the parameters; we first show that their degree is bounded by the Bézout number d n , where d is a bound on the degrees of the input system. We then present a probabilistic algorithm to compute such a resolution; in short, its complexity is polynomial in the size of the output and the probability of success is controlled by a quantity polynomial in the Bézout number. We present several applications of this process, to computations in the Jacobian of hyperelliptic curves and to questions of real geometry.
Fast Computation of Special Resultants
, 2006
"... We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multivariate resultants, that we compute using power sums of roots of polynomials, by means of their generating series. ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multivariate resultants, that we compute using power sums of roots of polynomials, by means of their generating series.
Fast algorithms for zerodimensional polynomial systems using duality
 APPLICABLE ALGEBRA IN ENGINEERING, COMMUNICATION AND COMPUTING
, 2001
"... Many questions concerning a zerodimensional polynomial system can be reduced to linear algebra operations in the quotient algebra A = k[X1,..., Xn]/I, where I is the ideal generated by the input system. Assuming that the multiplicative structure of the algebra A is (partly) known, we address the q ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
Many questions concerning a zerodimensional polynomial system can be reduced to linear algebra operations in the quotient algebra A = k[X1,..., Xn]/I, where I is the ideal generated by the input system. Assuming that the multiplicative structure of the algebra A is (partly) known, we address the question of speeding up the linear algebra phase for the computation of minimal polynomials and rational parametrizations in A. We present new formulæ for the rational parametrizations, extending those of Rouillier, and algorithms extending ideas introduced by Shoup in the univariate case. Our approach is based on the Amodule structure of the dual space � A. An important feature of our algorithms is that we do not require � A to be free and of rank 1. The complexity of our algorithms for computing the minimal polynomial and the rational parametrizations are O(2 n D 5/2) and O(n2 n D 5/2) respectively, where D is the dimension of A. For fixed n, this is better than algorithms based on linear algebra except when the complexity of the available matrix product has exponent less than 5/2.