Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Algorithm 801: POLSYS_PLP: a partitioned linear product homotopy code for solving polynomial systems of equations
Wise S., Sommese A., Watson L. ACM Transactions on Mathematical Software26 (1):176-200,2000.Type:Article
Date Reviewed: Jun 1 2000

The problem of solving large systems of polynomial equations arises in many application areas and poses difficult mathematical questions and computational challenges. This paper critically reviews the literature of the past two decades, during which there has been rapid evolution of both theory and codes. Homotopy (continuation) methods are a principal tool for such problems. The code under consideration uses modules from the more general HOMPACK90 package and is compatible with it.

The middle game of following a homotopy path is well understood at this point. The paper focuses principally on the end and opening games. The authors treat mainly isolated, finite, regular solutions, but they also introduce suitable transformations for coping gracefully and efficiently with more awkward situations. They exploit partitioned linear product structure to provide convenient starting points and to prune the number of paths to be followed. The discussion relies heavily on the previous literature cited throughout, but the relevant results are clearly explained--except for minor mysteries.

Reviewer:  Donald G. M. Anderson Review #: CR123054
Bookmark and Share
 
Polynomials, Methods For (G.1.5 ... )
 
 
Continuation (Homotopy) Methods (G.1.5 ... )
 
 
Fortran 90 (D.3.2 ... )
 
 
Language Classifications (D.3.2 )
 
 
Roots Of Nonlinear Equations (G.1.5 )
 
 
Mathematical Software (G.4 )
 
Would you recommend this review?
yes
no
Other reviews under "Polynomials, Methods For": Date
A robust procedure for discontinuity handling in continuous system simulation
Birta L., Oren T., Kettenis D. Transactions of the Society for Computer Simulation International 2(3): 189-205, 1985. Type: Article
Oct 1 1986
A heuristic irreducibility test for univariate polynomials
Monagan M. Journal of Symbolic Computation 13(1): 47-57, 1992. Type: Article
Apr 1 1993
Multipolynomial resultant algorithms
Manocha D., Canny J. Journal of Symbolic Computation 15(2): 99-122, 1993. Type: Article
Feb 1 1996
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy