Abstract
We investigate the structure of the solution setS to a homotopy equationH(Z,t)=0 between two polynomialsF andG with real coefficients in one complex variableZ. The mapH is represented asH(x+iy, t)=h 1(x, y, t)+ih 2(x, y, t), whereh 1 andh 2 are polynomials from ℝ2 × [0,1] into ℝ and i is the imaginary unit. Since all the coefficients ofF andG are real, there is a polynomialh 3 such thath 2(x, y, t)=yh3(x, y, t). Then the solution setS is divided into two sets {(x, t)∶h 1(x, 0, t)=0} and {(x+iy, t)∶h 1(x, y, t)=0,h 3(x, y, t)=0}. Using this division, we make the structure ofS clear. Finally we briefly explain the structure of the solution set to a homotopy equation between polynomial systems with real coefficients in several variables.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Abraham and J. Robbin,Transversal mappings and flows (Benjamin, New York, 1967).
E. Allgower and K. Georg, “Simplicial and continuation methods for approximating fixed points and solutions to systems of equations”,SIAM Review 22 (1) (1980) 28–35.
E. Allgower and K. Georg, “Predictor-corrector and simplicial methods for approximating fixed-points and zero-points of nonlinear mappings”, in: A. Bachem, M. Grötschel and B. Korte, eds.,Mathematical Programming, Bonn 1982 (Springer, Berlin, 1983).
S.N. Chow, J. Mallet-Paret and J.A. Yorke, “Finding zeros of maps: Homotopy methods that are constructive with probability one”,Mathematics of Computation 32 (1978) 887–899.
S.N. Chow, J. Mallet-Paret and J.A. Yorke, “A homotopy method for locating all zeros of a system of polynomials”, in: H.O. Peitgen and H.O. Walther, eds.,Functional differential equations and approximate fixed points (Springer, Berlin, 1979).
F.J. Drexler, “A homotopy method for the calculation of all zero-dimensional ideals”, in: H. Wacker, ed.,Continuation methods (Academic Press, New York, 1978).
C.B. Garcia and W.I. Zangwill, “Finding all solutions to polynomial systems and other systems of equations”,Mathematical Programming 16 (1979) 159–176.
M. Kojima and S. Mizuno, “Computation of all solutions to a system of polynomial equations”,Mathematical Programming 25 (1983) 131–157.
M. Kojima, H. Nishino and N. Arima, “A PL homotopy for finding all the roots of a polynomial”,Mathematical Programming 16 (1979) 37–62.
H.W. Kuhn, “Finding roots of polynomials by pivoting”, in: S. Karamardian, ed.,Fixed points: Algorithms and applications (Academic Press, New York, 1977).
J.M. Ortega and W.G. Rheinboldt, “Iterative solution of nonlinear equations in several variables” (Academic Press, New York, 1970).
R. Saigal, “On computing all real roots of a polynomial with real coefficients”, Technical Report, Northwestern University (1982).
A.H. Wright, “Finding all solutions to a system of polynomial equations”, Technical Report, Western Michigan University (1982).
W.I. Zangwill, “Determining all minima of certain functions”, preprint, University of Chicago (1981).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mizuno, S. An analysis of the solution set to a homotopy equation between polynomials with real coefficients. Mathematical Programming 28, 329–336 (1984). https://doi.org/10.1007/BF02612337
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02612337