Numerical decomposition of the solution sets of polynomial systems into irreducible components

SIAM Journal on Numerical Analysis

Volumn 38, Issue 6, 2001, Pages 2022-2046

  Sommese, Andrew J ^a   Verschelde, Jan ^b   Wampler, Charles W ^c  

^a UNIVERSITY OF NOTRE DAME   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^c GENERAL MOTORS CORPORATION   (United States)

Author keywords

Components of solutions; Embedding; Generic points; Homotopy continuation; Irreducible components; Numerical algebraic geometry; Polynomial system; Primary decomposition

Indexed keywords

EID: 0034580750     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036142900372549     Document Type: Article

References (44)

1. E.L. ALLGOWER AND K. GEORG, Numerical Continuation Methods. An Introduction, Springer Ser. Comput. Math. 13, Springer-Verlag, Berlin, 1990.
2. E.L. ALLGOWER AND K. GEORG, Numerical Path Following, in Handb. Numer. Anal. V, P.G. Ciarlet and J.L. Lions, eds., North-Holland, Amsterdam, 1997, pp. 3-207.
3. E.L. ALLGOWER AND A.J. SOMMESE, Piecewise Linear Approximations of Smooth Fibers, preprint, available at http://www.nd.edu/∼sommese.
4. P. AUBRY, D. LAZARD, AND M.M. MAZA, On the theories of triangular sets, J. Symbolic Comput., 28 (1999), pp. 105-124.
5. P. AUBRY AND M.M. MAZA, Triangular sets for solving polynomial systems: A comparative implementation of four methods, J. Symbolic Comput., 28 (1999), pp. 125-154.
6. M. BELTRAMETTI, A. HOWARD, M. SCHNEIDER, AND A.J. SOMMESE, Projections from subvarieties, in Complex Analysis and Algebraic Geometry, T. Peternell and F.O. Schreyer, eds., de Gruyter, Berlin, 2000, pp. 71-107.
7. J. BACKELIN, Square multiples n give infinitely many cyclic n-roots, Reports, no. 8, Matematiska Institutionen, Stockholms Universitet, Stockholm, Sweden, 1989.
8. J. BACKELIN AND R. FRÖBERG, How we proved that there are exactly 924 cyclic 7-roots, in Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC-91), ACM, New York, 1991, pp. 101-111.
9. p whose Fourier transforms have constant modulus, in Proceedings of the Alfred Haar Memorial Conference, Budapest, Hungary, Colloq. Math. Soc. János Bolyai 49, 1985, pp. 193-197.
10. n whose Fourier transforms have constant modulus, and "cyclic n-roots", in Recent Advances in Fourier Analysis and its Applications, J.S. Byrnes and J.L. Byrnes, eds., NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. 315, Kluwer, Dordrecht, 1989, pp. 131-140.
11. G. BJÖRCK AND R. FRÖBERG, A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic n-roots, J. Symbolic Comput., 12 (1991), pp. 329-336.
12. G. B.JÖRCK AND R. FRÖBERG, Methods to "divide out" certain solutions from systems of algebraic equations, applied to find all cyclic 8-roots, in Analysis, Algebra and Computers in Mathematical Research, M. Gyllenberg and L.E. Persson, eds., Lecture Notes in Pure and Appl. Math. 156, Dekker, New York, 1994, pp. 57-70.
13. W. BOEGE, R. GEBAUER, AND H. KREDEL, Some examples for solving systems of algebraic equations by calculating Groebner bases, J. Symbolic Comput., 2 (1986), pp. 83-98.
14. O. BOTTEMA AND B. ROTH, Theoretical Kinematics, North-Holland, Amsterdam, 1979.
15. B. BUCHBERGER AND F. WINKLER, EDS., Gröbner Bases and Applications, London Math. Soc. Lecture Note Ser. 251, Cambridge University Press, Cambridge, UK, 1998.
16. C. BUTCHER, An application of the Runge-Kutta space, BIT, 24 (1984), pp. 425-440.
17. J. DAVENPORT, Looking at a set of equations, Technical report 87-06, Bath Computer Science, 1987.
18. W. DECKER, G.M. GREUEL, AND G. PFISTER, Primary decomposition: Algorithms and comparisons, in Algorithmic Algebra and Number Theory, B.H. Matzat, G.M. Greuel, G. Hiss, eds., Springer-Verlag, Berlin, 1999, pp. 187-220.
19. D. EISENBUD, Commutative Algebra. With a View Toward Algebraic Geometry, Grad. Texts in Math. 150, Springer-Verlag, New York, 1995.
20. I.Z. EMIRIS, Sparse Elimination and Applications in Kinematics, Ph.D. thesis, University of California, Berkeley, CA, 1994.
21. I.Z. EMIRIS AND J.F. CANNY, Efficient incremental algorithms for the sparse resultant and the mixed volume, J. Symbolic Comput., 20 (1995), pp. 117-149; software available at http://www.inria.fr/saga/emiris.
22. 4), in Effective Methods in Algebraic Geometry, H. Lombardi and M.-F. Roy, eds., J. Pure Appl. Math., 139 (1999), pp. 61-88.
23. W. FULTON, Intersection Theory, Ergeb. Math. Grenzgeb(3), 2, Springer-Verlag, Berlin, 1984.
24. M. GIUSTI, K. HÄGELE, G. LECERF, J. MARCHAND, AND B. SALVY, The protective Noether Maple package: Computing the dimension of a protective, variety, J. Symbolic Comput., 30 (2000), pp. 291-307.
25. G.-M. GREUEL, Computer algebra and algebraic geometry - achievements and perspectives, J. Symbolic Comput., 30 (2000), pp. 253-289.
26. U. HAAGERUP, Orthogonal maximal abelian *-subalgebras of the n × n matrices and cyclic n-roots, in Operator Algebras and Quantum Field Theory, International Press, Cambridge, MA, 1996, pp. 296-322.
27. C. INNOCENTI, Polynomial solution to the position analysis of the 7-link Assur kinematic chain with one quaternary link, Mech. Mach. Theory, 30 (1995), pp. 1295-1303.
28. T.Y. LI, Numerical solution of multivariate polynomial systems by homotopy continuation methods, Acta Numer., 6 (1997), pp. 399-436.
29. H.M. MÖLLER, Gröbner bases and numerical analysis, in Gröbner Bases and Applications, B. Buchberger and F. Winkler, eds., London Math. Soc. Lecture Note Ser. 251, Cambridge University Press, Cambridge, UK, 1998, pp. 159-178.
30. A.P. MORGAN, Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems, Prentice-Hall, Englewood Cliffs, NJ, 1987.
31. A.P. MORGAN AND A.J. SOMMESE, Coefficient-parameter polynomial continuation, Appl. Math. Comput., 29 (1989), pp. 123-160.
32. A.P. MORGAN AND A.J. SOMMESE, Errata: "Coefficient-parameter polynomial continuation," Appl. Math. Comput., 51 (1992), p. 207.
33. A.P. MORGAN AND A.J. SOMMESE, Generically nonsingular polynomial continuation, in Computational Solution of Nonlinear Systems of Equations, Lectures in Appl. Math. 26, AMS, Providence, RI, 1990, pp. 467-493.
34. A.P. MORGAN AND C.W. WAMPLER, Solving a planar four-bar design problem using continuation, ASME J. Mech. Design, 112 (1990), pp. 544-550.
35. D. MUMFORD, Varieties defined by quadratic equations, in Questions On Algebraic Varieties, E. Marchionna, ed., Edizioni Cremonese, Rome, 1970, pp. 29-100.
36. D. MUMFORD, Algebraic Geometry I, Grundlehren Math. Wiss. 221, Springer-Verlag, New York, 1976.
37. D. MUMFORD, The Red Book of Varieties and Schemes, Lecture Notes in Math. 1358, Springer-Verlag, New York, 1988.
38. M. RAGHAVAN AND B. ROTH, Solving polynomial systems for the kinematic analysis and synthesis of mechanisms and robot manipulators, ASME J. Mech. Design, 117 (1995), pp. 71-79.
39. S. ROBERTS, On three-bar motion in plane space, Proc. London Math. Soc., VII (1875), pp. 14-23.
40. A.J. SOMMESE AND J. VERSCHELDE, Numerical homotopies to compute generic points on positive dimensional algebraic sets, J. Complexity, 16 (2000), pp. 572-602.
41. A.J. SOMMESE AND C.W. WAMPLER, Numerical algebraic geometry, in The Mathematics of Numerical Analysis, J. Renegar, M. Shub, and S. Smale, eds., Lectures in Appl. Math. 32, AMS, Providence, RI, 1996, pp. 749-763,
42. J. VERSCHELDE, Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation, ACM Trans. Math. Software, 25 (1999), pp. 251-276; paper and software available at http://www.math.uic.edu/∼jan.
43. C.W. WAMPLER, Solving the kinematics of planar mechanisms, ASME J. Mech. Design, 121 (1999), pp. 387-391.
44. C.W. WAMPLER, A.P. MORGAN AND A.J. SOMMESE, Complete solution of the nine-point path synthesis problem for four-bar linkages, ASME J. Mech. Design, 114 (1992), pp. 153-159.