Efficient solution to systems of multivariate polynomials using expression trees

IEEE International Conference on Shape Modeling and Applications 2008, Proceedings, SMI

Volumn , Issue , 2008, Pages 163-169

  Elber, Gershon ^a   Grandine, Tom ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b BOEING COMPANY   (United States)

Author keywords

Contact computation; Hausdorff distance; Interval arithmetic; Multivariate polynomial constraint solver; Self bisectors

Indexed keywords

APPLICATIONS; CHLORINE COMPOUNDS; JAVA PROGRAMMING LANGUAGE; POLYNOMIAL APPROXIMATION; SCALABILITY;

CONTACT COMPUTATION; HAUSDORFF DISTANCE; INTERVAL ARITHMETIC; MULTIVARIATE POLYNOMIAL CONSTRAINT SOLVER; SELF-BISECTORS;

TENSORS;

EID: 50949134111     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SMI.2008.4547965     Document Type: Conference Paper

References (14)

1. A. V. AHO, R. SETHI, J. D. U. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Menlo Park, CA, 1986.
2. BARTOŇ, M., AND JÜTTLER, B. Computing roots of polynomials by quadratic clipping. Comput. Aided Geom. Des. 24, 3 (2007), 125-141.
3. BARTOŇ, M., JÜTTLER, B., AND MOORE, B. Polynomial solvers with superquadratic convergence. The tenth SIAM Conference on Geometric Design & Computing, 2007.
4. E. COHEN, R. F. RIESENFELD, G. E. Geometric Modeling with Splines. A. K. Peters, New York, 2001.
5. 3. To appear in Geometric Modeling and Processing 2008.
6. ELBER, G., GRANDINE, T., AND KIM, M. S. Surface self-intersection computation via algebraic decomposition. Submitted for publication in Solid and Physical Modeling 2008.
7. ELBER, G., AND KIM, M.-S. Geometric constraint solver using multivariate rational spline functions. In Proceedings of the Symposium on Solid Modeling and Applications 2001 (Ann Arbor, Michigan, 2001), pp. 1-10.
8. HANNIEL, I., AND ELBER, G. Subdivision termination criteria in subdivision multivariate solvers. Computer Aided Design 39 (2007), 369-378.
9. LANE, J., AND RIESENFELD, R. Bounds on a polynomial. BIT 21 (1981), 112-117.
10. MOURRAIN, B., AND PAVONE, J. P. Subdivision methods for solving polynomial equations. Tech. Rep. RR-5658, INRIA Sophia-Antipolis, http://hal.inria.fr/inria-00070350/en/, 2006.
11. NISHITA, T., SEDERBERG, T. W., AND KAKIMOTO, M. Ray tracing trimmed rational surface patches. In SIGGRAPH '90: Proceedings of the 17th annual conference on Computer graphics and interactive techniques (New York, NY, USA, 1990), ACM, pp. 337-345.
12. REUTER, M., MIKKELSEN, T. S., SHERBROOKE, E. C., MAEKAWA, T., AND PATRIKALAKIS, N. M. Solving nonlinear polynomial systems in the barycentric bernstein basis. The Visual Computer 24, 3 (2008), 187-200.
13. SHERBROOKE, E. C., AND PATRIKALAKIS, N. M. Computation of the solutions of nonlinear polynomial systems. Computer Aided Geometric Design 10, 5 (1993), 279-405.
14. YAP, C. K. Robust geometric computation. In Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, Eds., 2nd ed. Chapman & Hall/CRC, Boca Raton, FL, 2004, ch. 41, pp. 927-952.