Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

Minimizing multi-homogeneous Bézout numbers by a local search method


Authors: Tiejun Li and Fengshan Bai
Journal: Math. Comp. 70 (2001), 767-787
MSC (2000): Primary 65H10
Published electronically: October 18, 2000
MathSciNet review: 1813146
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract:

Consider the multi-homogeneous homotopy continuation method for solving a system of polynomial equations. For any partition of variables, the multi-homogeneous Bézout number bounds the number of isolated solution curves one has to follow in the method. This paper presents a local search method for finding a partition of variables with minimal multi-homogeneous Bézout number. As with any other local search method, it may give a local minimum rather than the minimum over all possible homogenizations. Numerical examples show the efficiency of this local search method.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2000): 65H10

Retrieve articles in all journals with MSC (2000): 65H10


Additional Information

Tiejun Li
Affiliation: School of Mathematical Sciences, Peking University, Beijing, P. R. China

Fengshan Bai
Affiliation: Department of Mathematics, Tsinghua University, Beijing, 100084, P. R. China
Email: fbai@math.tsinghua.edu.cn

DOI: http://dx.doi.org/10.1090/S0025-5718-00-01303-X
Keywords: Multi-homogeneous B\'{e}zout number, polynomial system, homotopy method, local search method
Received by editor(s): September 18, 1998
Published electronically: October 18, 2000
Additional Notes: Supported by National Science Foundation of China G19871047 and National Key Basic Research Special Fund G1998020306.
Article copyright: © Copyright 2000 American Mathematical Society