In Praise of Numerical Computation

Theoretical Computer Science has developed an almost exclusively discrete/algebraic persona. We have effectively shut ourselves off from half of the world of computing: a host of problems in Computational Science & Engineering (CS&E) are defined on the continuum, and, for them, the discrete viewpoint is inadequate. The computational techniques in such problems are well-known to numerical analysis and applied mathematics, but are rarely discussed in theoretical algorithms: iteration, subdivision and approximation. By various case studies, I will indicate how our discrete/algebraic view of computing has many shortcomings in CS&E. We want embrace the continuous/analytic view, but in a new synthesis with the discrete/algebraic view. I will suggest a pathway, by way of an exact numerical model of computation, that allows us to incorporate iteration and approximation into our algorithms' design. Some recent results give a peek into how this view of algorithmic development might look like, and its distinctive form suggests the name "numerical computational geometry" for such activities.

[1]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[2]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[3]  Henryk Wozniakowski,et al.  Information-based complexity , 1987, Nature.

[4]  Jiaxun Yu.  Exact arithmetic solid modeling , 1992 .

[5]  Michael Pohst,et al.  Algorithmic algebraic number theory , 1989, Encyclopedia of mathematics and its applications.

[6]  Chee-Keng Yap,et al.  Robust Geometric Computation , 2016, Encyclopedia of Algorithms.

[7]  Chee Yap,et al.  The exact computation paradigm , 1995 .

[8]  Kokichi Sugihara,et al.  Topology-Oriented Implementation—An Approach to Robust Geometric Algorithms , 2000, Algorithmica.

[9]  D. Spielman,et al.  Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time , 2004 .

[10]  Siegfried M. Rump,et al.  Symbolic Algebraic Methods and Verification Methods , 2001 .

[11]  William L. Ditto,et al.  Principles and applications of chaotic systems , 1995, CACM.

[12]  Jon G. Rokne,et al.  Scci-hybrid Methods for 2d Curve Tracing , 2005, Int. J. Image Graph..

[13]  Arnold Schönhage.  Storage Modification Machines , 1980, SIAM J. Comput..

[14]  Kurt Mehlhorn,et al.  A Separation Bound for Real Algebraic Expressions , 2001, ESA.

[15]  J. Calmet.  Computer Algebra , 1982 .

[16]  Ee-Chien Chang,et al.  Shortest Path amidst Disc Obstacles Is Computable , 2006, Int. J. Comput. Geom. Appl..

[17]  Vikram Sharma.  Robust Approximate Zeros in Banach Space , 2007, Math. Comput. Sci..

[18]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[19]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[20]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[21]  Alexander Russell,et al.  Topological Neighborhoods for Spline Curves: Practice & Theory , 2008, Reliable Implementation of Real Number Algorithms.

[22]  Friedhelm Meyer auf der Heide,et al.  Algorithms — ESA 2001 , 2001, Lecture Notes in Computer Science.

[23]  Chee-Keng Yap,et al.  Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach , 2009, SCG '09.

[24]  Rolf Klein,et al.  Computer Science in Perspective , 2003, Lecture Notes in Computer Science.

[25]  Richard P. Brent,et al.  Fast Multiple-Precision Evaluation of Elementary Functions , 1976, JACM.

[26]  Stefan Näher,et al.  LEDA: A Library of Efficient Data Types and Algorithms , 1989, STACS.

[27]  Geert-Jan Giezeman,et al.  The CGAL Kernel: A Basis for Geometric Computation , 1996, WACG.

[28]  Jihun Yu,et al.  Foundations of Exact Rounding , 2009, WALCOM.

[29]  Kurt Mehlhorn,et al.  Exact Computation with leda_real - Theory and geometric Applications , 2001, Symbolic Algebraic Methods and Verification Methods.

[30]  Jon G. Rokne,et al.  Geometric Computations with Interval and New Robust Methods: Applications in Computer Graphics, GIS and Computational Geometry , 2003 .

[31]  L. Trefethen,et al.  Numerical linear algebra , 1997 .

[32]  Felipe Cucker,et al.  COMPLEXITY AND REAL COMPUTATION: A MANIFESTO , 1996 .

[33]  Antoni Kreczmar,et al.  Mathematical Foundations of Computer Science 1989 , 1989, Lecture Notes in Computer Science.

[34]  Stefano Leonardi,et al.  Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, ESA.

[35]  D. Koditschek,et al.  Approximating the Stance Map of a 2-DOF Monoped Runner , 2000 .

[36]  Stefan Funke,et al.  Exact Geometric Computation Using Cascading * , 2022 .

[37]  Chee-Keng Yap,et al.  Robust Geometric Computation , 2016, Encyclopedia of Algorithms.

[38]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[39]  Jean-Daniel Boissonnat,et al.  Effective computational geometry for curves and surfaces , 2006 .

[40]  Henri Cohen,et al.  A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[41]  Sylvain Pion,et al.  Constructive root bound for k-ary rational input numbers , 2006, Theor. Comput. Sci..

[42]  H. Woxniakowski.  Information-Based Complexity , 1988 .

[43]  Jon G. Rokne,et al.  Introduction to the Special Issue: What Can One Learn from Box-Plane Intersections? , 2000, Reliab. Comput..

[44]  Johannes Blömer,et al.  Computing Sums of Radicals in Polynomial Time , 1991, FOCS.

[45]  Chee-Keng Yap.  Complete subdivision algorithms, I: intersection of Bezier curves , 2006, SCG '06.

[46]  Kurt Mehlhorn,et al.  The Reliable Algorithmic Software Challenge RASC , 2003, Computer Science in Perspective.

[47]  G. H. Hardy.  What Is Geometry? (Presidential Address to the Mathematical Association, 1925) , 1925 .

[48]  Nicholas J. Higham,et al.  INVERSE PROBLEMS NEWSLETTER , 1991 .

[49]  B. Sturmfels.  Computational Synthetic Geometry , 1989 .

[50]  Gert Vegter,et al.  Isotopic approximation of implicit curves and surfaces , 2004, SGP '04.

[51]  Ker-I Ko,et al.  Complexity Theory of Real Functions , 1991, Progress in Theoretical Computer Science.

[52]  Daniel Richardson,et al.  Zero Tests for Constants in Simple Scientific Computation , 2007, Math. Comput. Sci..

[53]  Herbert Edelsbrunner,et al.  Hierarchical Morse—Smale Complexes for Piecewise Linear 2-Manifolds , 2003, Discret. Comput. Geom..

[54]  D. Du,et al.  Computing in Euclidean Geometry , 1995 .

[55]  Chee-Keng Yap,et al.  Theory of Real Computation According to EGC , 2008, Reliable Implementation of Real Number Algorithms.

[56]  Chee-Keng Yap,et al.  Robust Approximate Zeros , 2005, ESA.

[57]  Lloyd N. Trefethen.  Computing Numerically with Functions Instead of Numbers , 2007 .

[58]  Herbert Edelsbrunner,et al.  Hierarchical morse complexes for piecewise linear 2-manifolds , 2001, SCG '01.

[59]  Zilin Du,et al.  Uniform complexity of approximating hypergeometric functions with absolute error , 2006 .

[60]  Xiao-Shan Gao,et al.  Complete numerical isolation of real zeros in zero-dimensional triangular systems , 2007, ISSAC '07.

[61]  Kurt Mehlhorn,et al.  Structural filtering: A paradigm for efficient and exact geometric programs , 2005, CCCG.

[62]  John M. Snyder,et al.  Interval analysis for computer graphics , 1992, SIGGRAPH.

[63]  Kurt Mehlhorn,et al.  LEDA: A Library of Efficient Data Types and Algorithms , 1989, MFCS.

[64]  D. Du,et al.  Computing in Euclidean Geometry: (2nd Edition) , 1995 .

[65]  Kokichi Sugihara,et al.  Voronoi Diagram in the Flow Field , 2003, ISAAC.

[66]  Johannes Blömer,et al.  Simplifying expressions involving radicals , 1992 .

[67]  B. Mourrain,et al.  Meshing of Surfaces , 2006 .

[68]  Chee-Keng Yap,et al.  Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves , 2008, ISSAC '08.

[69]  Joseph R. Shoenfield,et al.  Mathematical logic , 1967 .

[70]  D. P. Mitchell.  Robust ray intersection with interval arithmetic , 1990 .

[71]  K. Borgwardt.  A probabilistic analysis of the simplex method , 1986 .