A hybrid polynomial system solving method for mixed trigonometric polynomial systems

SIAM Journal on Numerical Analysis

Volumn 46, Issue 3, 2008, Pages 1503-1518

  Yu, Bo ^a   Dong, Bo ^a  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Homotopy method; Mixed trigonometric polynomial system; Polynomial system; Symbolic numeric computation

Indexed keywords

COEFFICIENT PARAMETERS; HOMOTOPY; HOMOTOPY METHOD; HOMOTOPY METHODS; HYBRID METHODS; MIXED TRIGONOMETRIC POLYNOMIAL SYSTEM; NUMERICAL TESTS; POLYNOMIAL SYSTEM; POLYNOMIAL SYSTEM SOLVING; POLYNOMIAL SYSTEMS; PRACTICAL PROBLEMS; QUADRATIC EQUATIONS; REDUCTION TECHNIQUES; SCIENCE AND ENGINEERINGS; SPECIAL STRUCTURES; SYMBOLIC-NUMERIC COMPUTATION; TRIGONOMETRIC POLYNOMIALS; VARIABLE SUBSTITUTIONS;

POLYNOMIAL APPROXIMATION;

EID: 55349134913     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/070681740     Document Type: Article

References (48)

1. D. N. BERNSTEIN, The number of roots of a system of equations, Funct. Anal. Appl., 9 (1975), pp. 183-185.
2. J. CANNY AND J. M. ROJAS, An optimal condition for determining the exact number of roots of a polynomial system, in Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, ACM, New York, 1991, pp. 96-101.
3. D. COX, J. LITTLE, AND D. O'SHEA, Ideals, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra, 2nd ed., Undergrad. Texts Math., Springer-Verlag, New York, 1997.
4. D. COX, J. LITTLE, AND D. O'SHEA, Using Algebraic Geometry, Springer-Verlag, Berlin, 1998.
5. F. J. DREXLER, Eine Methode zur Berechnung sämtlicher Lösungen von Polynomgleichungssystemen, Numer. Math., 29 (1977/1978), pp. 45-58.
6. C. B. GARCIA AND W. I. ZANGWILL, Finding all solutions to polynomial systems and other systems of equations, Math. Programming, 16 (1979), pp. 159-176.
7. R. HARTSHORNE, Algebraic Geometry, Grad. Texts in Math. 52, Springer-Verlag, Berlin, New York, 1977.
8. H. HONG AND V. STAHL, Safe starting regions by fixed points and tightening, Computing, 53 (1995), pp. 322-335.
9. B. HUBER AND B. STURMFELS, A polyhedral method for solving sparse polynomial systems, Math. Comp., 64 (1995), pp. 1541-1555.
10. B. HUBER AND B. STURMFELS, Bernstein's theorem in affine space, Discrete Comput. Geom., 7 (1997), pp. 137-141.
11. A. G. KHOVANSKII, Newton polyhedra, and the genus of complete intersections, Funct. Anal. Appl., 12 (1978), pp. 38-46.
12. M. KOJIMA, http://www.is.titech.ac.jp/~kojima/PHoM/index.html.
13. A. G. KUSHNIRENKO, Newton polytopes and the Bezant theorem, Funct. Anal. Appl., 10 (1976), pp. 233-235.
14. T. Y. LI, http://www.mth.msu.edu/~li/.
15. T. Y. LI, On Chow, Mallet-Paret and Yorke homotopy for solving systems of polynomials, Bull. Inst. Math. Acad. Sinica, 11 (1983), pp. 433-437.
16. T. Y. LI, Solving polynomial systems by polyhedral homotopies, Taiwanese J. Math., 3 (1999), pp. 251-279.
17. T. Y. LI, Numerical solution of polynomial systems by homotopy continuation methods, in Handbook of Numerical Analysis, Vol. XI, North-Holland, Amsterdam, 2003, pp. 209-304.
18. T. Y. LI, T. SAUER, AND J. A. YORKE, Numerical solution of a class of deficient polynomial systems, SIAM J. Numer. Anal., 24 (1987), pp. 435-451.
19. T. Y. LI, T. SAUER, AND J. A. YORKE, The random product homotopy and deficient polynomial systems, Numer. Math., 61 (1987), pp. 481-500.
20. T. Y. LI, T. SAUER, AND J. A. YORKE, The cheater's homotopy: An efficient procedure for solving systems of polynomial equations, SIAM J. Numer. Anal., 26 (1989), pp. 1241-1251.
21. T. Y. LI AND X. WANG, Solving deficient polynomial systems with homotopies which keep the subschemes at infinity invariant, Math. Comp., 56 (1991), pp. 693-710.
22. T. Y. LI AND X. WANG, Nonlinear homotopies for solving deficient polynomial systems with parameters, SIAM J. Numer. Anal., 29 (1992), pp. 1104-1118.
23. n, Math. Comp., 65 (1996), pp. 1477-1484.
24. A. MORGAN AND V. SHAPIRO, Box-bisection for solving second-degree systems and the problem of clustering, ACM Trans. Math. Software, 13 (1987), pp. 152-167.
25. A. MORGAN AND A. SOMMESE, A homotopy for solving polynomial systems, Appl. Math. Comput., 18 (1986), pp. 173-177.
26. A. MORGAN AND A. SOMMESE, A homotopy for solving general polynomial systems that respects m-homogeneous structures, Appl. Math. Comput., 24 (1987), pp. 101-113.
27. A. MORGAN AND A. SOMMESE, Computing all solutions to polynomial systems using homotopy continuation, Appl. Math. Comput., 24 (1987), pp. 115-138.
28. A. MORGAN AND A. SOMMESE, Coefficient-parameter polynomial continuation, Appl. Math. Comput., 29 (1989), pp. 123-160; errata: Appl. Math. Comput., 51 (1992), p. 207.
29. A. P. MORGAN, A. J. SOMMESE, AND C. W. WAMPLER, A product-decomposition bound for Bézout numbers, SIAM J. Numer. Anal., 32 (1995), pp. 1308-1325.
30. A. MORGAN, A. J. SOMMESE, AND L. T. WATSON, Finding all isolated solutions to polynomial systems using HOMPACK, ACM Trans. Math. Software, 12 (1989), pp. 93-122.
31. A. SOMMESE, http://www.nd.edu/~sommese/.
32. A. SOMMESE AND C. W. WAMPLER, The Numerical Solution of Systems of Polynomials Arising in Engineering and Science, World Scientific, Hackensack, NJ, 2005.
33. P. VAN HENTENRYCK, D. MCALLESTER, AND D. KAPUR, Solving polynomial systems using a branch and prune approach, SIAM J. Numer. Anal., 34 (1997), pp. 797-827.
34. J. VERSCHELDE, Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation, ACM Trans. Math. Software, 25 (1999), pp. 251-276.
35. J. VERSCHELDE, M. BECKERS, AND A. HAEGEMANS, A new start system for solving deficient polynomial systems using continuation, Appl. Math. Comput., 44 (1991), pp. 225-239.
36. J. VERSCHELDE AND A. HAEGEMANS, The BQ-Algorithm for the Construction of an m-Homogeneous Start System, Report TW 147, Department of Computer Science, K.U. Leuven, 1991.
37. J. VERSCHELDE AND A. HAEGEMANS, The GBQ-algorithm for constructing start systems of homotopies for polynomial systems, SIAM J. Numer. Anal., 30 (1993), pp. 583-594.
38. J. VERSCHELDE AND R. COOLS, Symmetric homotopy construction, J. Comput. Appl. Math., 50 (1994), pp. 572-592.
39. J. VERSCHELDE AND R. COOLS, Nonlinear reduction for solving deficient polynomial systems by continuation methods, Numer. Math., 63 (1992), pp. 263-282.
40. J. VERSCHELDE, P. VERLINDEN, AND R. COOLS, Homotopies exploiting Newton polytopes for solving sparse polynomial systems, SIAM J. Numer. Anal., 31 (1994), pp. 915-930.
41. C. W. WAMPLER, A. P. MORGAN, AND A. J. SOMMESE, Numerical continuation methods for solving polynomial systems arising in kinematics, ASME J. Mechanical Design, 112 (1990), pp. 59-68.
42. L. T. WATSON, S. C. BILLUPS, AND A. P. MORGAN, ALGORITHM 652: HOMPACK: A suite of codes for globally convergent homotopy algorithms, ACM Trans. Math. Software, 13 (1987), pp. 281-310.
43. S. M. WISE, A. J. SOMMESE, AND L. T. WATSON, Algorithm 801: POLSYS_PLP: A partitioned linear product homotopy code for solving polynomial systems of equations, ACM Trans. Math. Software, 26 (2000), pp. 176-200.
44. A. H. WRIGHT, Finding all solutions to a system of polynomial equations, Math. Comp., 44 (1985), pp. 125-133.
45. W. T. WU, On the decision problem and the mechanization of theorem-proving in elementary geometry, in Automated Theorem Proving: After 25 Years, W. Bledsoe and D. Loveland, eds., Contemp. Math. 29, AMS, Providence, RI, pp. 213-234.
46. B. YU, Homotopy Methods for Solving Polynomial Systems and Multiparameter Eigenvalue Problems, Ph.D. Dissertation, Jilin University, 1992.
47. km, in Computer Mathematics (Tianjin, 1991), World Scientiuc, River Edge, NJ, 1993, pp. 36-45.
48. W. ZULEHNER, A simple homotopy method for determining all isolated solutions to polynomial systems, Math. Comp., 50 (1988), pp. 167-177.