Subdivision Termination Criteria in Subdivision Multivariate Solvers

Abstract. The need for robust solutions for sets of non-linear multivariate constraints or equations needs no motivation. Subdivision-based multivariate constraint solvers [1–3] typically employ the convex hull and subdivision/domain clipping properties of the B´ezier/B-spline representation to detect all regions that may contain a feasible solution. Once such a region has been identified, a numerical improvement method is usually applied, which quickly converges to the root. Termination criteria for this subdivision/domain clipping approach are necessary so that, for example, no two roots reside in the same sub-domain (root isolation). This work presents two such termination criteria. The first theoretical criterion identifies sub-domains with at most a single solution. This criterion is based on the analysis of the normal cones of the multiviarates and has been known for some time [1]. Yet, a computationally tractable algorithm to examine this criterion has never been proposed....

• Type: Conference
• Year: 2006
• Where: GMP
• Authors: Iddo Hanniel, Gershon Elber
• Keywords: GMP 2006, Multivariate Constraint, Subdivision/domain Clipping, Termination Criteria