Skip to main content
Springer Nature Link
Log in

PHoMpara – Parallel Implementation of the Polyhedral Homotopy Continuation Method for Polynomial Systems

  • Published:
Computing Aims and scope Submit manuscript

Abstract

The polyhedral homotopy continuation method is known to be a successful method for finding all isolated solutions of a system of polynomial equations. PHoM, an implementation of the method in C++, finds all isolated solutions of a polynomial system by constructing a family of modified polyhedral homotopy functions, tracing the solution curves of the homotopy equations, and verifying the obtained solutions. A software package PHoMpara parallelizes PHoM to solve a polynomial system of large size. Many characteristics of the polyhedral homotopy continuation method make parallel implementation efficient and provide excellent scalability. Numerical results include some large polynomial systems that had not been solved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • S. G. Akl (1984) ArticleTitleOptimal parallel algorithms for computing convex hulls and for sorting Computing 33 1–11 Occurrence Handle0526.68062 Occurrence Handle757591 Occurrence Handle10.1007/BF02243071

    Article  MATH  MathSciNet  Google Scholar 

  • Allgower, E., Georg, K.: Numerical continuation methods. Springer 1990.

  • D. C. S. Allison A. Chakaborty L. T. Watson (1989) ArticleTitleGranularity issues for solving polynomial systems via globally convergent algorithms on a hypercube J. Supercomputing 3 5–20 Occurrence Handle10.1007/BF00129645

    Article  Google Scholar 

  • D. N. Bernshtein (1975) ArticleTitleThe number of roots of a system of equations Funct. Anal. Appl. 9 183–185 Occurrence Handle0328.32001 Occurrence Handle10.1007/BF01075595

    Article  MATH  Google Scholar 

  • W. Boege R. Gebauer H. Kredel (1986) ArticleTitleSome examples for solving systems of algebraic equations by calculating Groebner bases J. Symb. Comput. 2 83–98 Occurrence Handle839138 Occurrence Handle10.1016/S0747-7171(86)80014-1 Occurrence Handle0602.65032

    Article  MathSciNet  MATH  Google Scholar 

  • G. Björck R. Fröberg (1991) ArticleTitleA faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic n-roots J. Symb. Comput. 12 329–336 Occurrence Handle0751.12001 Occurrence Handle10.1016/S0747-7171(08)80153-8

    Article  MATH  Google Scholar 

  • Dai, Y., Kim S., Kojima, M.: Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods. J. Comput. Appl. Math. 151, 1–2:83–97 (2003).

    Google Scholar 

  • C. B. Garcia W. I. Zangwill (1979) ArticleTitleDetermining all solutions to certain systems of nonlinear equations Math. Oper. Res. 4 1–14 Occurrence Handle543605 Occurrence Handle0408.90086 Occurrence Handle10.1287/moor.4.1.1

    Article  MathSciNet  MATH  Google Scholar 

  • T. Gao T. Y. Li J. Verschelde M. Wu (2000) ArticleTitleBalancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods Appl. Math. Comput. 114 233–247 Occurrence Handle1779225 Occurrence Handle10.1016/S0096-3003(99)00115-0 Occurrence Handle1023.65048

    Article  MathSciNet  MATH  Google Scholar 

  • T. Gunji S. Kim M. Kojima A. Takeda K. Fujisawa T. Mizutani (2004) ArticleTitlePHoM – a polyhedral homotopy continuation method for polynomial systems Computing 73 55–77 Occurrence Handle2084974 Occurrence Handle10.1007/s00607-003-0032-4

    Article  MathSciNet  Google Scholar 

  • B. Huber B. Sturmfels (1995) ArticleTitleA Polyhedral method for solving sparse polynomial systems Math. Comput. 64 1541–1555 Occurrence Handle1297471 Occurrence Handle10.2307/2153370 Occurrence Handle0849.65030

    Article  MathSciNet  MATH  Google Scholar 

  • B. Huber J. Verschelde (1998) ArticleTitlePolyhedral end games for polynomial continuation Numer. Algorithms 18 91–108 Occurrence Handle1659862 Occurrence Handle10.1023/A:1019163811284 Occurrence Handle0933.65057

    Article  MathSciNet  MATH  Google Scholar 

  • S. Kim M. Kojima (2004) ArticleTitleNumerical stability of path tracing in polynomial homotopy continuation methods Computing 73 329–348 Occurrence Handle2110800 Occurrence Handle10.1007/s00607-004-0070-6 Occurrence Handle1061.65042

    Article  MathSciNet  MATH  Google Scholar 

  • T. Y. Li (1987) ArticleTitleSolving polynomial systems The mathematical intelligencer 9 33–39 Occurrence Handle0637.65047 Occurrence Handle895771 Occurrence Handle10.1007/BF03023953

    Article  MATH  MathSciNet  Google Scholar 

  • T. Y. Li (1999) ArticleTitleSolving polynomial systems by polyhedral homotopies Taiwan J. Math. 3 251–279 Occurrence Handle0945.65052

    MATH  Google Scholar 

  • T. Y. Li X. Li (2001) ArticleTitleFinding mixed cells in the mixed volume computation Foundation of Computational Mathematics 1 161–181 Occurrence Handle1830034 Occurrence Handle10.1007/s102080010005 Occurrence Handle1012.65019

    Article  MathSciNet  MATH  Google Scholar 

  • Morgan, A.: Solving polynomial systems using continuation for engineering and scientific problems. Prentice-Hall, 1987.

  • A. P. Morgan A. J. Sommese (1989) ArticleTitleCoefficient-parameter polynomial continuation Appl. Math. Comput. 29 123–160 Occurrence Handle977815 Occurrence Handle10.1016/0096-3003(89)90099-4 Occurrence Handle0664.65049

    Article  MathSciNet  MATH  Google Scholar 

  • A. P. Morgan L. T. Watson (1989) ArticleTitleA globally convergent parallel algorithm for zeros of polynomial systems Nonlinear Analysis 13 1339–1350 Occurrence Handle1021411 Occurrence Handle10.1016/0362-546X(89)90017-5 Occurrence Handle0704.65037

    Article  MathSciNet  MATH  Google Scholar 

  • A. P. Morgan A. J. Sommese C. W. Wampler (1992) ArticleTitleComputing singular solutions to polynomial systems Adv. Appl. Math. 13 305–327 Occurrence Handle1176579 Occurrence Handle10.1016/0196-8858(92)90014-N Occurrence Handle0764.65030

    Article  MathSciNet  MATH  Google Scholar 

  • MPI: http://www.mpi-forum.org.

  • Nemhauser,G. L.,Wolsey, L. A.: Integer and combinatorial optimization.Wiley-Interscience, 1988

  • V. W. Noonberg (1989) ArticleTitleA neural network modeled by an adaptive Lotka-Volterra system SIAM J. Appl. Math. 49 1779–1792 Occurrence Handle1025961 Occurrence Handle10.1137/0149109

    Article  MathSciNet  Google Scholar 

  • W. Pelz L. T. Watson (1989) ArticleTitleMessage length effects for solving polynomial systems on a hypercube Parallel Computing 10 161–176 Occurrence Handle993686 Occurrence Handle10.1016/0167-8191(89)90015-X Occurrence Handle0674.65025

    Article  MathSciNet  MATH  Google Scholar 

  • Sato, M., Nakada, H., Sekiguchi, S., Matsuoka, S., Nagashima, U., Takagi, H.: Ninf: A network based information library for a global world-wide computing infrastructure. HPCN'97 (LNCS-1225), 1997, pp. 491–502.

  • Su, H. -J., McCarthy, J. M.: Kinematic synthesis of RPS serial chains. In: Proc. ASME Design Engineering Technical Conferences (CDROM), Chicago, IL, September 2–6, 2003.

  • Sturmfels, B.: Solving systems of polynomial equations. CBMS Regional Conf. Series in Mathematics, No. 97. American Mathematical Society, 2002.

  • Su, H. J., McCarthy, J. M., Sosonkina, M., Watson, L. T.: POLSYS-GLP: A parallel general linear product homotopy code for solving polynomial systems of equations. ACM Trans. Math. Softw. (to appear).

  • A. Takeda M. Kojima K. Fujisawa (2002) ArticleTitleEnumeration of all solutions of a combinatorial linear inequality system arising from the polyhedral homotopy continuation method J. Oper. Soc. Japan 45 64–82 Occurrence Handle1898623 Occurrence Handle1031.65074

    MathSciNet  MATH  Google Scholar 

  • Traverso, C.: The PoSSo test suite examples. Available at http://www.inria.fr/saga/POL.

  • Verschelde, J.: The database of polynomial systems is in his web site: ``http://www.math.uic. edu/~jan/''.

  • J. Verschelde P. Verlinden R. Cools (1994) ArticleTitleHomotopies exploiting Newton polytopes for solving sparse polynomial systems SIAM J. Numer. Anal. 31 915–930 Occurrence Handle1275120 Occurrence Handle10.1137/0731049 Occurrence Handle0809.65048

    Article  MathSciNet  MATH  Google Scholar 

  • Verschelde, J.: Homotopy continuation methods for solving polynomial systems. Ph.D. thesis, Department of Computer Science, Katholieke Universiteit Leuven, 1996.

  • Verschelde, J., Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation. ACM Trans. Math. Softw. 25, 251–276 (1999).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo, 152-8552, Japan

    T. Gunji & M. Kojima

  2. Department of Mathematics, Ewha Women's University, 11-1 Dahyun-dong, Sudaemoon-gu, Seoul, 120-750, Korea

    S. Kim

  3. Department of Mathematical Sciences, Tokyo Denki University, Ishizuka, Hatoyama, Saitama, 350-0394, Japan

    K. Fujisawa

Authors
  1. T. Gunji
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K. Fujisawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Kojima
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to T. Gunji.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gunji, T., Kim, S., Fujisawa, K. et al. PHoMpara – Parallel Implementation of the Polyhedral Homotopy Continuation Method for Polynomial Systems. Computing 77, 387–411 (2006). https://doi.org/10.1007/s00607-006-0166-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-006-0166-2

AMS Subject Classifications

Keywords