Synthesis of optimal numerical algorithms using real quantifier elimination (case study: square root computation)

Abstract

We report on on-going efforts to apply real quantifier elimination to the synthesis of optimal numerical algorithms. In particular, we describe a case study on the square root problem: given a real number x and an error bound e, find a real interval such that it contains [EQUATION] and its width is less than or equal to e.A typical numerical algorithm starts with an initial interval and repeatedly updates it by applying a on it until it becomes narrow enough. Thus the synthesis amounts to finding a refinement map that ensures the correctness and optimality of the resulting algorithm.This problem can be formulated as a real quantifier elimination. Hence, in principle, the synthesis can be carried out automatically. However, the computational requirement is huge, making the automatic synthesis practically impossible with the current general real quantifier elimination software.We overcame the difficulty by (1) carefully reducing a complicated quantified formula into several simpler ones and (2) automatically eliminating the quantifiers from the resulting ones using the state of the art quantifier elimination software.As the result, we were able to synthesize semi-automatically, under mild assumptions, a class of optimal maps, which are significantly better than the well known hand-crafted Secant-Newton map. Interestingly, the optimal synthesized maps are not contracting as one would naturally expect.