Novel Range Functions via Taylor Expansions and Recursive Lagrange Interpolation with Application to Real Root Isolation

Range functions are an important tool for interval computations, and they can be employed for the problem of root isolation. In this paper, we first introduce two new classes of range functions for real functions. They are based on the remainder form by Cornelius and Lohner [7] and provide different improvements for the remainder part of this form. On the one hand, we use centered Taylor expansions to derive a generalization of the classical Taylor form with higher than quadratic convergence. On the other hand, we propose a recursive interpolation procedure, in particular based on quadratic Lagrange interpolation, leading to recursive Lagrange forms with cubic and quartic convergence. We then use these forms for isolating the real roots of square-free polynomials with the algorithm Eval, a relatively recent algorithm that has been shown to be effective and practical. Finally, we compare the performance of our new range functions against the standard Taylor form. Range functions are often compared in isolation; in contrast, our holistic comparison is based on their performance in an application. Specifically, Eval can exploit features of our recursive Lagrange forms which are not found in range functions based on Taylor expansion. Experimentally, this yields at least a twofold speedup in Eval.

[1]  Victor Y. Pan,et al.  Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding , 2002, J. Symb. Comput..

[2]  H. Cornelius,et al.  Computing the range of values of real functions with accuracy higher than second order , 1984, Computing.

[3]  R. Baker Kearfott,et al.  Introduction to Interval Analysis , 2009 .

[4]  V. Stahl Interval Methods for Bounding the Range of Polynomials and Solving Systems of Nonlinear Equations , 2007 .

[5]  윤재량 2004 , 2019, The Winning Cars of the Indianapolis 500.

[6]  Michael A. Burr,et al.  Continuous amortization and extensions: With applications to bisection-based root isolation , 2016, J. Symb. Comput..

[7]  Juan Xu,et al.  Complexity Analysis of Root Clustering for a Complex Polynomial , 2016, ISSAC.

[8]  A. James 2010 , 2011, Philo of Alexandria: an Annotated Bibliography 2007-2016.

[9]  Chee-Keng Yap,et al.  Near optimal tree size bounds on a simple real root isolation algorithm , 2012, ISSAC.

[10]  Jihun Yu,et al.  The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra , 2010, ICMS.

[11]  Pramodita Sharma 2012 , 2013, Les 25 ans de l’OMC: Une rétrospective en photos.

[12]  Chee-Keng Yap,et al.  Continuous Amortization: A Non-Probabilistic Adaptive Analysis Technique , 2009, Electron. Colloquium Comput. Complex..

[13]  A. Azzouz 2011 , 2020, City.

[14]  Chee-Keng Yap,et al.  A simple but exact and efficient algorithm for complex root isolation , 2011, ISSAC '11.

[15]  Torbjrn Granlund,et al.  GNU MP 6.0 Multiple Precision Arithmetic Library , 2015 .

[16]  Florence March,et al.  2016 , 2016, Affair of the Heart.

[17]  M. Gribaudo,et al.  2002 , 2001, Cell and Tissue Research.

[18]  A. Neumaier Interval methods for systems of equations , 1990 .

[19]  Bruno Lang,et al.  A Comparison of the Moore and Miranda Existence Tests , 2004, Computing.

[20]  Victor Y. Pan,et al.  Implementation of a Near-Optimal Complex Root Clustering Algorithm , 2018, ICMS.

[21]  Jon G. Rokne,et al.  Computer Methods for the Range of Functions , 1984 .

[22]  Victor Y. Pan,et al.  Numerical methods for roots of polynomials , 2007 .

[23]  Alexandre Goldsztejn Comparison of the Hansen-Sengupta and the Frommer-Lang-Schnurr existence tests , 2006, Computing.

[24]  Felix Krahmer,et al.  SqFreeEVAL: An (almost) optimal real-root isolation algorithm , 2011, J. Symb. Comput..

[25]  Joachim von zur Gathen,et al.  Fast algorithms for Taylor shifts and certain difference equations , 1997, ISSAC.

[26]  Fabrice Rouillier,et al.  Computing Real Roots of Real Polynomials ... and now For Real! , 2016, ISSAC.

[27]  Chee-Keng Yap,et al.  Adaptive Isotopic Approximation of Nonsingular Curves: the Parameterizability and Nonlocal Isotopy Approach , 2011, Discret. Comput. Geom..

[28]  P. Gahinet,et al.  1995 , 2018, Syria 1975/76-2018.

[29]  Alexei Shadrin,et al.  Error Bounds for Lagrange Interpolation , 1995 .

[30]  Chee-Keng Yap,et al.  Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests , 2013, CiE.

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

[32]  Jihun Yu,et al.  Non-local isotopic approximation of nonsingular surfaces , 2013, Comput. Aided Des..

[33]  Kurt Mehlhorn,et al.  Computing real roots of real polynomials , 2013, J. Symb. Comput..

[34]  M. Anand “1984” , 1962 .

[35]  Juan Xu,et al.  Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity Analysis , 2019, ISSAC.

[36]  Eldon Hansen,et al.  Global optimization using interval analysis , 1992, Pure and applied mathematics.

[37]  Chee-Keng Yap,et al.  A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration , 2015, J. Symb. Comput..

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

[39]  Arnold Schönhage,et al.  The fundamental theorem of algebra in terms of computational complexity - preliminary report , 1982 .