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

We present an algorithm which is capable of globally solving a well-constrained transcendental system over some sub-domain D⊂RnD⊂Rn, 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 RnRn 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.

► A “divide and conquer” algorithm capable of solving transcendental, well-constrained systems.
► The domains that contain at most one root are isolated.
► The solver is applied on several benchmark problems of CAGD.