Generalized normal forms and polynomial system solving

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

Volumn 2005, Issue , 2005, Pages 253-260

  Mourrain, Bernard ^a  

^a INRIA   (France)

Author keywords

Multivariate polynomial; Normal form; Quotient algebra; Root finding; Symbolic numeric computation

Indexed keywords

ALGEBRA; ALGORITHMS; NUMERICAL METHODS; PROBLEM SOLVING;

MULTIVARIATE POLYNOMIALS; NORMAL FORM; QUOTIENT ALGEBRA; SYMBOLIC NUMERIC COMPUTATION;

POLYNOMIALS;

EID: 33748980671     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073884.1073920     Document Type: Conference Paper

References (21)

1. W. Auzinger and H. J. Stetter. An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations. In Proc. Intern. Conf. on Numerical Math., volume 86 of Int. Series of Numerical Math, pages 12-30. Birkhäuser Verlag, 1988.
2. L. Busé, M. Elkadi, and B. Mourrain. Using projection operators in computer aided geometric design. In Topics in Algebraic Geometry and Geometric Modeling, pages 321-342. Contemporary Mathematics, 2003.
3. R.M. Corless, P.M. Gianni, and B.M. Trager. A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots. In W.W. Küchlin, editor, Proc. ISSAC, pages 133-140, 1997.
4. D. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Undergraduate Texts in Mathematics. Springer Verlag, New York, 1992.
5. D. Eisenbud. Commutative Algebra with a view toward Algebraic Geometry, volume 150 of Graduate Texts in Math. Berlin, Springer-Verlag, 1994.
6. I.Z. Emiris and B. Mourrain. Matrices in Elimination Theory. J. of Symbolic Computation, 28(1&2):3-44, 1999.
7. J.C. Faugère. A new efficient algorithm for computing Gröbner Basis (F4). J. of Pure and Applied Algebra, 139:61-88, 1999.
8. J.C. Faugère, P. Gianni, D. Lazard, and T. Mora. Efficient computation of zero-dimensional groebner bases by change of ordering. J.S.C, 16(4):329-344, 1993.
9. Marc Giusti, Grégoire Lecerf, and Bruno Salvy. A Gröbner free alternative for polynomial system solving. Journal of Complexity, 17(1):154-211, 2001.
10. A. Kehrein, M. Kreuzer, and L. Robbiano. An algebraist's view on border bases. In A. Dickenstein and I. Emiris, editors, Solving Polynomial Equations: Foundations, Algorithms, and Applications., volume 14 of Algorithms and Computation in Mathematics, pages 169-202. Springer, 2005.
11. D. Lazard. Stewart platforms and gröbner bases. In ARK'92, Proceedings of Advance in Robot Kinematik, Ferrare, Italia, September 1992.
12. F.S. Macaulay. The Algebraic Theory of Modular Systems. Cambridge Univ. Press, 1916.
13. H.M. Möller and T. Sauer. H-bases for polynomial interpolation and system solving, multivariate polynomial interpolation. Advances Comput. Math., 12(4):335-362, 2000.
14. B. Mourrain. The 40 generic positions of a parallel robot. In M. Bronstein, editor, Proc. Intern. Symp. on Symbolic and Algebraic Computation, ACM press, pages 173-182, Kiev (Ukraine), July 1993.
15. B. Mourrain. Computing isolated polynomial roots by matrix methods. J. of Symbolic Computation, Special Issue on Symbolic-Numeric Algebra for Polynomials, 26(6):715-738, Dec. 1998.
16. B. Mourrain. A new criterion for normal form algorithms. In M. Fossorier, H. Imai, Shu Lin, and A. Poli, editors, Proc. AAECC, volume 1719 of LNCS, pages 430-443. Springer, Berlin, 1999.
17. B. Mourrain and Ph. Trébuchet. Solving projective complete intersection faster. In C. Traverso, editor, Proc. Intern. Symp. on Symbolic and Algebraic Computation, pages 231-238. New-York, ACM Press., 2000.
18. B. Mourrain and Ph. Trébuchet. Algebraic methods for numerical solving. In Proc. of the 3rd International Workshop on Symbolic and Numeric Algorithms for Scientific Computing'01 (Timisoara, Romania), pages 42-57, 2002.
19. B. Mourrain and Ph. Trébuchet. Generalised normal forms and polynomial system solving. Technical Report 5471, INRIA Sophia-Antipolis, 2005.
20. F. Rouillier. Solving zero-dimensional polynomial systems throuhg Rational Univariate Representation. App. Alg. in Eng. Com. Comp., 9(5):433-461, 1999.
21. Hans J. Stetter. Numerical polynomial algebra. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2004.