TAYLOR MODELS AND OTHER VALIDATED FUNCTIONAL INCLUSION METHODS

Abstract

Abstract: A detailed comparison between Taylor model methods and other tools for validated computations is provided. Basic elements of the Taylor model (TM) methods are reviewed, beginning with the arithmetic for elementary operations and intrinsic functions. We discuss some of the fundamental properties, including high approximation order and the ability to control the dependency problem, and pointers to many of the more advanced TM tools are provided. Aspects of the current imple-mentation, and in particular the issue of floating point error control, are discussed. For the purpose of providing range enclosures, we compare with modern versions of centered forms and mean value forms, as well as the direct computation of remainder bounds by high-order interval auto-matic differentiation and show the advantages of the TM methods. We also compare with the so-called boundary arithmetic (BA) of Lanford, Eckmann, Wittwer, Koch et al., which was developed to prove existence of fixed points in several comparatively small systems, and the ultra-arithmetic (UA) developed by Kaucher, Miranker et al. which