Solving Some Overdetermined Polynomial Systems

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn 1999-January, Issue , 1999, Pages 1-8

  Giusti, Marc ^a   Schost, Éric ^a  

^a ECOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MANIPULATORS;

APPROXIMATE SOLUTION; EFFECTIVE FIELD; GEOMETRIC RESOLUTION; HYPER-SURFACES; OVER-CONSTRAINED; PARALLEL MANIPULATORS; POLYNOMIAL SYSTEMS; POLYNOMIAL-TIME; RESOLUTION ALGORITHMS; TIME-RESOLUTION;

POLYNOMIAL APPROXIMATION;

EID: 85139861192     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/309831.309838     Document Type: Conference Paper

References (22)

1. BAUR, W., AND STRASSEN, V. The complexity of partial derivatives. Theo. Comp. Sci. 22 (1983), 317-330.
2. BONDYFALAT, D., MOURHAIN, B., AND PAN, V. Controlled iterative methods for solving polynomial svstems. In ISSAC'98 (1998), ACM Press., pp. 252-259.
3. CHISTOV, A., AND GRIGORIEV, D. Subexponential time solving systems of algebraic equations. LOMI preprint, 1983.
4. DEDIEU, J., AND SHUB, M. Newton and predictor-corrector methods for overdetermined systems of equations. Tech. rep., IBM Research Division, 1998.
5. EGNER, S. Semi-numerical solution to 6/6-Stewart platform kinematics based on symmetry. Applicable Algebra in Engineering, Communication and Computinq 7 (1996), 449-468.
6. GIANNI, P., AND MORA, T. Algebraic solution of systems of polynomials equations. In AAECC-5 (1989), Springer, pp. 2470-257.
7. GIUSTI, M., HAEGELE, K., HEINTZ, J., MONTANA, J., MORAIS, J., AND PARDO, L. Lower bounds for dio-phantine approximations. In Journal of Pure and App. Algebra (Proceedings of MEGA '96) (1997), vol. 117, pp. 277-317.
8. GIUSTI, M., AND HEINTZ, J. La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial. In Computational Algebraic Geometry and Commutative Algebra (1993), E. D. and R. L., Eds., vol. XXXIV of Symposia Matematica, Cambridge University Press, pp. 216-256.
9. GIUSTI, M., HEINTZ, J., MORAIS, J., MORGENSTERN, J., AND PARDO, L. Straight-line programs in geometric elimination theorv. Journal of Pure and App. Algebra 124 (1998), 101-146.
10. GIUSTI, M., HEINTZ, J., MORAIS, J., AND PARDO, L. When polynomial equations can be "solved" fast ? In Applied Algebra, Algebraic Algorithms and Error Correcting Codes, Proceedings AAECC-11 (1995), C. G., G. M., and M. T., Eds., vol. 948 of LNCS, Springer, pp. 205-231.
11. HEINTZ, J. Definability and fast quantifier elimination in algebraically closed fields. Theor. Comput. Sci. 24, 3 (1983), 239-277.
12. HEINTZ, J., KRICK, T., PUDDU, S., SARIA, J., AND WAISSBEIN, A. Deformation techniques for efficient, polynomial equation solving. Submitted.
13. HEINTZ, J., AND SCHNORR, C. Testing polynomials which are easy to compute. In Logic and Algorithmic, vol. 30 of Monographie de l'enseignement mathématique. 1980, pp. 237-254.
14. KRICK, T., AND PARDO, L. A computational method for diophantine approximation. In Algorithms in Algebraic Geometry and Applications (Proceedings MEGA '94) (1996), G. V. L. and R. T., Eds., vol. 143 of Progress in Mathematics. Birkäuser Verlag, pp. 193-254.
15. KRONECKER, L. Grundzüge einer arithmetischen Theorie der algebraischen Grössen. Journal für die reine und andewandte Mathematik (1882).
16. LAZARD, D. Stewart platform and Gröbner bases. In Proceedings of the third international workshop on advances of robot kinematics (1992), P.-C. V. and L. J., Eds., Ferrare, pp. 136-142.
17. MERLET, J. Parallel manipulators - 3rd part research rep. no. 1003. Tech. rep., INRIA Sophia-Antipolis, 1988.
18. MORALS, J. Resolución eficaz de sistemas de ecuaciones polinomiales. PhD thesis, University of Santander, Spain, 1998.
19. MOURRAIN, B. Enumeration problems in Geometry, Robotics and Vision. In Algorithms in Algebraic Geometry and Applications (1996), L. González and T. Recio, Eds., vol. 143 of Prog. in Math., Birkhäuser. Basel, pp. 285-306.
20. RONGA, F., AND VUST, T. Stewart platforms without computer ? In International Conference on Real Analytic and Algebraic Geometry (1995), F. Broglia, M. Galbiati, and A. Tognoli, Eds., W. de Gruyter.
21. ROUILLIER, F. Algorithmes efficaces pour l'étude des zéros réels des systèmes polynomiaux. PhD thesis, Université Rennes I, 1996.
22. ROUILLIER, F. Solving zero-dimensional polynomial Systems trough the rational univariate representation. Tech. Rep. 3426, INRIA, Projet Polka, 1998.