Global solutions of well-constrained transcendental systems using expression trees and a single solution test

Authors:
Maxim Aizenshtein;Michael Bartoň;Gershon Elber
Affiliations:
Technion - Israel Institute of Technology, Haifa 32000, Israel;Technion - Israel Institute of Technology, Haifa 32000, Israel;Technion - Israel Institute of Technology, Haifa 32000, Israel
Venue:
Computer Aided Geometric Design
Year:
2012

Citing 10
Cited 2

A bibliography on roots of polynomials

Journal of Computational and Applied Mathematics
Subdivision termination criteria in subdivision multivariate solvers using dual hyperplanes representations

Computer-Aided Design
Solving nonlinear polynomial systems in the barycentric Bernstein basis

The Visual Computer: International Journal of Computer Graphics
Subdivision methods for solving polynomial equations

Journal of Symbolic Computation
Continued fraction expansion of real roots of polynomial systems

Proceedings of the 2009 conference on Symbolic numeric computation
Computation of the solutions of nonlinear polynomial systems

Computer Aided Geometric Design
Optimal bounding cones of vectors in three dimensions

Information Processing Letters
Topologically guaranteed univariate solutions of underconstrained polynomial systems via no-loop and single-component tests

Proceedings of the 14th ACM Symposium on Solid and Physical Modeling
Global solutions of well-constrained transcendental systems using expression trees and a single solution test

GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing
A New Approach for Solving Nonlinear Equations Systems

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Solving polynomial systems using no-root elimination blending schemes

Computer-Aided Design
Solving polynomial systems using no-root elimination blending schemes

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm which is capable of globally solving a well-constrained transcendental system over some sub-domain D@?R^n, isolating all roots. Such a system consists of n unknowns and n regular functions, where each may contain non-algebraic (transcendental) functions like sin, exp or log. Every equation is considered as a hyper-surface in R^n and thus a bounding cone of its normal (gradient) field can be defined over a small enough sub-domain of D. A simple test that checks the mutual configuration of these bounding cones is used that, if satisfied, guarantees at most one zero exists within the given domain. Numerical methods are then used to trace the zero. If the test fails, the domain is subdivided. Every equation is handled as an expression tree, with polynomial functions at the leaves, prescribing the domain. The tree is processed from its leaves, for which simple bounding cones are constructed, to its root, which allows to efficiently build a final bounding cone of the normal field of the whole expression. The algorithm is demonstrated on curve-curve intersection, curve-surface intersection, ray-trap and geometric constraint problems and is compared to interval arithmetic.