Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods

نویسندگان

  • Tangan Gao
  • T. Y. Li
  • Jan Verschelde
  • Mengnien Wu
چکیده

Polyhedral homotopy continuation methods exploit the sparsity of polynomial systems so that the number of solution curves to reach all isolated solutions is optimal for generic systems. The numerical stability of tracing solution curves of polyhedral homotopies is mainly determined by the height of the powers of the continuation parameter. To reduce this height we propose a procedure that operates as an intermediate stage between the mixed-volume computation and the tracing of solution curves. This procedure computes new lifting values of the support of a polynomial system. These values preserve the structure of the mixed-cell connguration obtained from the mixed-volume computation and produce better-balanced powers of the continuation parameter in the polyhedral homotopies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical Stablity of Path Tracing in Polyhedral Homotopy Continuation Methods

The reliability of polyhedral homotopy continuation methods for solving a polynomial system becomes increasingly important as the dimension of the polynomial system increases. High powers of the homotopy continuation parameter t and ill-conditioned Jacobian matrices encountered in tracing of homotopy paths affect the numerical stability. We present modified homotopy functions with a new homotop...

متن کامل

PHoM: Polyhedral Homotopy Continuation Method for Polynomial Systems

PHoM is a software package in C++ for finding all isolated solutions of polynomial systems using a polyhedral homotopy continuation method. Among three modules constituting the package, the first module StartSystem constructs a family of polyhedrallinear homotopy functions, based on the polyhedral homotopy theory, from input data for a given system of polynomial equations f(x) = 0. The second m...

متن کامل

How to Count Efficiently all Affine Roots of a Polynomial System

Polynomials are ubiquitous in a variety of applications. A relatively recent theory exploits their sparse structure by associating a point connguration to each polynomial system; however, it has so far mostly dealt with roots having nonzero coordinates. We shift attention to arbitrary aane roots, and improve upon the existing algorithms for counting them and computing them numerically. The one ...

متن کامل

Constructing Polyhedral Homotopies on Grid-of-Clusters

Polyhedral homotopy continuation is a promising approach to solving large-scale polynomial systems. However, the method faces a computational bottleneck in constructing the homotopy functions because we need to find all mixed cells for polynomial systems. The search for mixed cells can be formulated as a vertex enumeration problem for polyhedra. Among the search methods for solving the problem ...

متن کامل

Computing All Nonsingular Solutions of Cyclic-n Polynomial Using Polyhedral Homotopy Continuation Methods

All isolated solutions of the cyclic-n polynomial equations are not known for larger dimensions than 8 except the dimensions 10 and 11. We exploit two types of symmetric structures in the cyclic-n polynomial to compute all isolated nonsingular solutions of the equations efficiently by the polyhedral homotopy continuation method and to verify the correctness of the generated approximate solution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 114  شماره 

صفحات  -

تاریخ انتشار 2000