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
|
2049
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
531
|
Matrix multiplication via arithmetic progressions., J.Symb
– Coppersmith, Winograd
- 1990
|
|
370
|
Deforestation: Transforming programs to eliminate trees
– Wadler
- 1990
|
|
271
|
Fast probabilistic algorithms for verification of polynomial identities
– Schwartz
- 1980
|
|
254
|
Faugeras: “A Theory of Self-Calibration of a Moving Camera
– Maybank, Olivier
- 1992
|
|
236
|
Gröbner Bases, A Computational Approach to Commutative Algebra
– Becker, Weispfenning
- 1992
|
|
198
|
The magma algebra system I: The user language
– Bosma, Cannon, et al.
- 1997
|
|
181
|
Al-gorithms for Computer Algebra
– Geddes, Czapor, et al.
- 1992
|
|
165
|
Probabilistic Algorithms for Sparse Polynominals
– Zippel
- 1979
|
|
136
|
On the computational complexity and geometry of the first-order theory of the reals
– Renegar
- 1989
|
|
107
|
Algebraic Complexity Theory
– Bürgisser, Clausen, et al.
- 1997
|
|
103
|
The complexity of partial derivatives
– Baur, Strassen
- 1982
|
|
95
|
Efficient computation of zero-dimensional Gröbner bases by change of ordering
– Faugère, Gianni, et al.
- 1993
|
|
87
|
On computing the determinant in small parallel time using a small number of processors
– Berkowitz
- 1984
|
|
84
|
The Computational Complexity of Algebraic and Numeric Problems
– Borodin, Munro
- 1975
|
|
74
|
The algebraic theory of modular systems
– Macaulay
- 1916
|
|
56
|
parallel matrix inversion algorithms
– Csanky
- 1976
|
|
50
|
A computational method for Diophantine approximation
– Krick, Pardo
- 1996
|
|
46
|
Exact solution of linear equations using p-adic expansions
– Dixon
- 1982
|
|
44
|
Grundzüge einer arithmetischen Theorie der algebraischen Grössen
– Kronecker
- 1882
|
|
44
|
Solving zero-dimensional systems through the Rational Univariate Representation
– Rouillier
- 1999
|
|
42
|
Lower bounds for Diophantine approximation
– Giusti, Hägele, et al.
- 1997
|
|
42
|
Definability and fast quantifier elimination in algebraically closed fields, Theoret
– Heintz
- 1983
|
|
42
|
Schnelle Berechnung von Kettenbruchentwicklungen
– Schönhage
- 1971
|
|
42
|
Algorithms for solving equations
– Smale
- 1986
|
|
41
|
La détermination des points isolés et de la dimension d’une variété algébrique peut se faire en temps polynomial, Computational Algebraic Geometry and Commutative Algebra (D.Eisenbud, L.Robbiano Eds.) Sympos
– Giusti, Heintz
- 1993
|
|
41
|
Schnelle Multiplikation von Polynomen über Körpern der Charakteristik
– Schönhage
|
|
40
|
Algebraic Solutions of systems of polynomial equations using Gröbner bases
– Gianni, Mora
- 1988
|
|
40
|
Straight-line programs in geometric elimination theory
– Giusti, Heintz, et al.
- 1998
|
|
35
|
Triangular factorization and inversion by fast matrix multiplication
– Bunch, Hopcroft
- 1974
|
|
35
|
Introduction to Commutative Algebra and Algebraic Geometry, Birkhauser
– Kunz
- 1985
|
|
34
|
When polynomial equation systems can be solved fast
– Giusti, Heintz, et al.
- 1995
|
|
34
|
Sur la complexité du principe de Tarski-Seidenberg
– Heintz, Roy, et al.
- 1990
|
|
34
|
The fundamental theorem of algebra and complexity
– Smale
- 1981
|
|
33
|
Zeros, multiplicities, and idempotents for zero-dimensional systems
– Alonso, Becker, et al.
- 1996
|
|
33
|
Schnelle Multiplikation großer Zahlen
– Schönhage, Strassen
- 1971
|
|
30
|
Zur ermittlung eines objektes aus zwei perspektiven mit innerer orientierung. Sitz.-Ber. Akad
– Kruppa
- 1913
|
|
30
|
How lower and upper complexity bounds meet in elimination theory
– Pardo
- 1995
|
|
28
|
zur Gathen. Parallel arithmetic computations: a survey
– von
- 1986
|
|
27
|
Converting bases with the Gröbner walk
– Collart, Kalkbrener, et al.
- 1997
|
|
26
|
Fast computation of GCDs
– Moenck
- 1973
|
|
23
|
Die Berechnungskomplexitat von Elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
– Strassen
- 1973
|
|
22
|
An algorithm for division of powerseries
– Sieveking
- 1972
|
|
21
|
Bounds for traces in complete intersections and degrees
– Sabia, Solerno
- 1996
|
|
19
|
On the computational complexity of polynomials and bilinear maps. A survey
– Heintz
- 1989
|
|
19
|
Berechnung und Programm I
– Strassen
- 1972
|
|
18
|
Polynomial-time factoring of multivariable polynomials over a global field. LOMI preprint E-5-82, Steklov Institute
– Chistov, Grigoriev
- 1982
|
|
18
|
Waissbein: On the time–space complexity of geometric elimination procedures
– Heintz, Matera, et al.
- 2001
|
|
18
|
Pardo: Une approche informatique pour l'approximation diophantienne
– Krick, Pardo
- 1994
|
|
18
|
On the complexity of zero-dimensional algebraic systems
– Lakshman, Lazard
- 1991
|
