Solving nonlinear polynomial systems in the barycentric Bernstein basis

We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the barycentric Bernstein basis and subdivision. The roots are approximated to arbitrary precision by iteratively constructing a series of smaller bounding simplices. We use geometric subdivision to isolate multiple roots within a simplex. An algorithm implementing this method in rounded interval arithmetic is described and analyzed. We find that when the total order of polynomials is close to the maximum order of each variable, an iteration of this solver algorithm is asymptotically more efficient than the corresponding step in a similar algorithm which relies on polynomial representation in the tensor product Bernstein basis. We also discuss various implementation issues and identify topics for further study. Keywords CAD, CAGD, CAM, geometric modeling, solid modeling, intersections, distance computation, engineering...

• Type: Journal
• Year: 2008
• Where: VC
• Authors: Martin Reuter, Tarjei S. Mikkelsen, Evan C. Sherbrooke, Takashi Maekawa, Nicholas M. Patrikalakis
• Keywords: Bernstein Basis, Polynomial, Polynomial Representation, VC 2008