exact numerical computation in algebra and geometry
Many problems in Computational Science & Engineering (CSE) are defined on the continuum. Standard algorithms for these problems are numerical and approximate. Their computational techniques include iteration, subdivision, and approximation. Such techniques are rarely seen in exact or algebraic algorithms. In this tutorial, we discuss a mode of computation called exact numerical computation (ENC) that achieves exactness through numerical approximation. Through ENC, we can naturally incorporate iteration, subdivision and approximation into the design of exact algorithms for computer algebra and computational geometry. Such algorithms are both novel and practical. This tutorial on ENC is divided into three equal parts: (a) Zero Problems (b) Explicitation Problems (c) Techniques and Complexity Analysis of Adaptivity
exact numerical computation explicitization problems adaptive complexity analysis zero bounds numerical algebraic computation numerical computational geometry