Global Solutions of Well-Constrained Transcendental Systems Using Expression Trees and a Single Solution Test

  • Maxim Aizenshtein
  • Michael Bartoň
  • Gershon Elber
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6130)


We present an algorithm which is capable of globally solving a well-constrained transcendental system over some sub-domain \(D\subset \mathbb 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 \(\mathbb R^n\) and thus a bounding cone of its normal 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 and curve-surface intersection problems.


Global Solution Normal Cone Polynomial System Interval Arithmetic Transcendental Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barequet, G., Elber, G.: Optimal bounding cones of vectors in three and higher dimensions. Information Processing Letters 93, 83–89 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Bartoň, M., Hanniel, I., Elber, G.: Topologically guaranteed univariate solutions of underconstrained polynomial systems via no–loop and single–component tests (in preparation)Google Scholar
  3. 3.
    Cox, D.A., Little, J.B., O’Shea, D.: Using algebraic geometry. Springer, Heidelberg (2005)zbMATHGoogle Scholar
  4. 4.
    Elber, G., Grandine, T.: Efficient solution to systems of multivariate polynomials using expression trees. In: Tenth SIAM Conference on Geometric Design and Computing (2007)Google Scholar
  5. 5.
    Gaukel, J.: Efficient solving of polynomial and nonpolynomial systems using subdivision (in German), PhD thesis, TU Darmstadt (2003)Google Scholar
  6. 6.
    Graspa, T.N., Vrahatis, M.N.: Dimension reducing methods for systems of nonlinear equations and unconstrained optimization: A review. Recent Adv. Mech. Related Fields, 215–225 (2003)Google Scholar
  7. 7.
    Grosan, C., Abraham, A.: A new approach for solving nonlinear equations systems. IEEE Transactions on systems, man and cybernetics: Systems and humans 38(3) (2008)Google Scholar
  8. 8.
    Hanniel, I., Elber, G.: Subdivision termination criteria in subdivision multivariate solvers using dual hyperplanes representations. Computer Aided Design (39), 369–378 (2007)Google Scholar
  9. 9.
    McNamee, J.M.: Bibliographies on roots of polynomials. J. Comp. Appl. Math (47), 391–394, 78(1-1), (110), 305–306, (142) (433–434) (1993–2002)Google Scholar
  10. 10.
    Mourrain, B., Pavone, J.-P.: Subdivision methods for solving polynomial equations. J. of Symbolic Computation 44(3), 292–306 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Neumaier, A.: Introduction to Numerical Analysis. Cambridge Univ. Press, Cambridge (2001)zbMATHCrossRefGoogle Scholar
  12. 12.
    Reuter, M., Mikkelsen, T.S., Sherbrooke, E.C., Maekawa, T., Patrikalakis, N.M.: Solving nonlinear polynomial systems in the barycentric Bernstein basis. Visual Computer (24), 187–200 (2008)Google Scholar
  13. 13.
    Rheinboldt, W.C.: Methods for solving systems of nonlinear equations. In: Regional Conference Series in Applied Mathematics, 2nd edn. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1998)Google Scholar
  14. 14.
    Sherbrooke, E.C., Patrikalakis, N.M.: Computation of solution of nonlinear polynomial systems. Computer Aided Geometric Design 5(10), 379–405 (1993)CrossRefMathSciNetGoogle Scholar
  15. 15.
    Sommese, A.J., Wampler, C.W.: The numerical solution of systems of polynomials arising in engineering and science. World Scientific, Singapore (2005)zbMATHCrossRefGoogle Scholar
  16. 16.
    Stewart, J.: Multivariate Calculus (2002)Google Scholar
  17. 17.
    Wang, H., Kearney, J., Atkinson, K.: Robust and efficient computation of the closest point on a spline curve. In: Lyche, T., et al. (eds.) Curve and Surface Design, Saint Malo 2002, pp. 397–405. Nashboro Press, Brentwood (2002)Google Scholar
  18. 18.
    Zhou, J., Sherbrooke, E.C., Patrikalakis, N.M.: Computation of stationary points of distance functions. Engineering with Computers 9(4), 231–246 (1993)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Maxim Aizenshtein
    • 1
  • Michael Bartoň
    • 1
  • Gershon Elber
    • 1
  1. 1.Department of Computer ScienceTechnionHaifaIsrael

Personalised recommendations