Jing-Cao Li
ABSTRACT
We consider a class of univariate real functions---poly-powers---that extend integer exponents to real algebraic exponents for polynomials. Our purpose is to isolate positive roots of such a function into disjoint intervals, which can be further easily computed up to any desired precision. To this end, we first classify poly-powers into simple and non-simple ones, depending on the number of linearly independent exponents. For the former, we present a complete isolation method based on Gelfond--Schneider theorem. For the latter, the completeness depends on Schanuel's conjecture. Finally experiential results demonstrate the effectivity of the proposed method.
- M. Achatz, S. McCallum, and V. Weispfenning. Deciding polynomial--exponential problems. In J. R. Sendra and L. González-Vega, editors, Proc. ISSAC 2008, pages 215--222, New York, 2008. ACM Press. Google Scholar
Digital Library
- J. Ax. On Schanuel's conjectures. Annals of Mathematics, 93(2):252--268, 1971.Google Scholar
- J. Bak, D. Leviatan, D. Newman, and J. Tzimbalario. Generalized polynomial approximation. Israel Journal of Mathematics, 15(4):337--349, 1973.Google ScholarCross Ref
- V. Chonev, J. Ouaknine, and J. Worrell. On the Skolem problem for continuous linear dynamical systems. In Proc. ICALP 2016, 2016. to appear.Google Scholar
- G. E. Collins and A. G. Akritas. Polynomial real root isolation using Descarte's rule of signs. In Proc. SYMSAC 1976, pages 272--275, New York, 1976. ACM Press. Google ScholarDigital Library
- G. E. Collins and R. Loos. Polynomial real root isolation by differentiation. In Proc. SYMSAC 1976, pages 15--25, New York, 1976. ACM Press. Google ScholarDigital Library
- M. Coste, T. Lajous-Loaeza, H. Lombardic, and M.-F. Roy. Generalized Budan--Fourier theorem and virtual roots. Journal of Complexity, 21(4):479--486, 2005. Google ScholarDigital Library
- F. Cucker and S. Smale. Complexity estimates depending on condition and round-off error. Journal of the ACM, 46(1):113--184, 1999. Google ScholarDigital Library
- J.-P. Dedieu and J.-C. Yakoubsohn. Computing the real roots of a polynomial by the exclusion algorithm. Numerical Algorithms, 4(1):1--24, 1993.Google ScholarCross Ref
- A. Gupta, P. Kamath, N. Kayal, and R. Saptharishi. Approaching the chasm at depth four. In Proc. CCC 2013, pages 65--73, Los Alamitos, CA, 2013. IEEE Computer Society.Google ScholarCross Ref
- G. B. Gustafson. Systems of Differential Equations. 1998. available at www.math.utah.edu/gustafso/s2013/2250/systemsExamplesTheory2008.pdf.Google Scholar
- R. Loos. Computing in algebraic extensions. In B. Buchberger, G. E. Collins, and R. Loos, editors, Computer Algebra: Symbolic and Algebraic Computation, 2nd Edition, pages 173--187, Berlin, 1983. Springer.Google Scholar
- S. McCallum and V. Weispfenning. Deciding polynomial-transcendental problems. Journal of Symbolic Computation, 47(1):16--31, 2012. Google ScholarDigital Library
- I. Newton. De analysi per aequationes numero terminorum infinitas. William Jones, London, 1711.Google Scholar
- D. Richardson. Towards computing non algebraic cylindrical decompositions. In S. M. Watt, editor, Proc. ISSAC 1991, pages 247--255, New York, 1991. ACM Press. Google ScholarDigital Library
- D. Richardson. How to recognize zero. Journal of Symbolic Computation, 24(6):627--645, 1997. Google ScholarDigital Library
- C. L. Siegel. Transcendental Numbers. Princeton University Press, Princeton, NJ, 1949.Google Scholar
- S. Smale. Newton's method estimates from data at one point. In R. E. Ewing, K. I. Gross, and C. F. Martin, editors, The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics, pages 185--196, Berlin, 1986. Springer.Google Scholar
- A. Strzebonski. Real root isolation for exp--log functions. In J. R. Sendra and L. González-Vega, editors, Proc. ISSAC 2008, pages 303--313, New York, 2008. ACM Press. Google ScholarDigital Library
- A. Strzebonski. Real root isolation for tame elementary functions. In J. R. Johnson, H. Park, and E. Kaltofen, editors, Proc. ISSAC 2009, pages 341--350, New York, 2009. ACM Press. Google ScholarDigital Library
- A. Strzebonski. Cylindrical decomposition for systems transcendental in the first variable. Journal of Symbolic Computation, 46(11):1284--1290, 2011. Google ScholarDigital Library
- A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley, 2 edition, 1951.Google Scholar
- M. Xu, Z.-B. Li, and L. Yang. Quantifier elimination for a class of exponential polynomial formulas. Journal of Symbolic Computation, 68(1):146--168, 2015. Google ScholarDigital Library
- M. Xu, C. Mu, Z. Zeng, and Z.-B. Li. A heuristic approach to positive root isolation for multiple power sums. Journal of Universal Computer Science, 16(14):1912--1926, 2010.Google Scholar
- L. Yang. Solving harder problems with lesser mathematics. In Proc. 10th Asian Technology Conference in Mathematics, pages 37--46, Blacksburg, 2005. ATCM Inc.Google Scholar
- C. Yap, M. Sagraloff, and V. Sharma. Analytic root clustering: A complete algorithm using soft zero tests. In P. Bonizzoni, V. Brattka, and B. Löwe, editors, Proc. CiE 2013, LNCS 7921, pages 433--444, Berlin, 2013. Springer.Google Scholar
Index Terms
- Positive Root Isolation for Poly-Powers
Recommendations
A root isolation algorithm for sparse univariate polynomials
ISSAC '12: Proceedings of the 37th International Symposium on Symbolic and Algebraic ComputationWe consider a univariate polynomial f with real coefficients having a high degree N but a rather small number d + 1 of monomials, with d ≪ N. Such a sparse polynomial has a number of real root smaller or equal to d. Our target is to find for each real ...
Univariate real root isolation in multiple extension fields
ISSAC '12: Proceedings of the 37th International Symposium on Symbolic and Algebraic ComputationWe present algorithmic, complexity and implementation results for the problem of isolating the real roots of a univariate polynomial in Bα ∈ L[y], where L = Q(α1,..., αℓ) is an algebraic extension of the rational numbers. Our bounds are single ...
Univariate real root isolation in an extension field
ISSAC '11: Proceedings of the 36th international symposium on Symbolic and algebraic computationWe present algorithmic, complexity and implementation results for the problem of isolating the real roots of a univariate polynomial in Bα ∈ L[y], where L=Qα is a simple algebraic extension of the rational numbers. We revisit two approaches for the ...
Comments