Skip to main content

Real Root Isolation of Multi-Exponential Polynomials with Application

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5942))

Included in the following conference series:

  • 839 Accesses

Abstract

Real root isolation problem is to compute a list of disjoint intervals, each containing a distinct real root and together containing all. Traditional methods and tools often attack the root isolation for ordinary polynomials. However many other complex systems in engineering are modeling with non-ordinary polynomials. In this paper, we extend the pseudo-derivative sequences and Budan–Fourier theorem for multi-exponential polynomials to estimate the bounds and counts of all real roots. Furthermore we present an efficient algorithm for isolating all real roots under given minimum root separation. As a proof of serviceability, the reachability of linear systems with real eigenvalues only is approximately computable by this algorithm.

Supported by NSFC (No. 90718041), Shanghai Leading Academic Discipline Project (No. B412) and PhD Program Scholarship Fund of ECNU 2009 (No. 2009056).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Uspensky, J.V.: Theory of Equations. McGraw-Hill, New York (1948)

    Google Scholar 

  2. Collins, G.E., Loos, R.: Real zeros of polynomials. In: Buchberger, B., Collins, G.E., Loos, R. (eds.) Computer Algebra: Symbolic and Algebraic Computation, pp. 83–94. Springer, Heidelberg (1983)

    Google Scholar 

  3. Collins, G.E., Hong, H.: Partial cylindrical algebraic decomposition for quantifier elimination. J. Symb. Comput. 12(3), 299–328 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  4. Yang, L., Hou, X., Zeng, Z.: A complete discrimination system for polynomials. Science in China (Ser. E) 39, 628–646 (1996)

    MATH  MathSciNet  Google Scholar 

  5. Tsigaridas, E.P., Emiris, I.Z.: Univariate polynomial real root isolation: Continued fractions revisited. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 817–828. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Lafferriere, G., Pappas, G.J., Yovine, S.: Symbolic reachability computaion for families of linear vector fields. J. Symb. Comput. 32(3), 231–253 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. Achatz, M., McCallum, S., Weispfenning, V.: Deciding polynomial-exponential problems. In: ISSAC 2008, pp. 215–222. ACM Press, New York (2008)

    Chapter  Google Scholar 

  8. Akritas, A.G.: Elements of Computer Algebra with Applications. Wiley, New York (1989)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xu, M., Chen, L., Zeng, Z., Li, Zb. (2010). Real Root Isolation of Multi-Exponential Polynomials with Application. In: Rahman, M.S., Fujita, S. (eds) WALCOM: Algorithms and Computation. WALCOM 2010. Lecture Notes in Computer Science, vol 5942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11440-3_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11440-3_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11439-7

  • Online ISBN: 978-3-642-11440-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics