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. © 2010 Springer.
CITATION STYLE
Xu, M., Chen, L., Zeng, Z., & Li, Z. B. (2010). Real root isolation of multi-exponential polynomials with application. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5942 LNCS, pp. 263–268). https://doi.org/10.1007/978-3-642-11440-3_24
Mendeley helps you to discover research relevant for your work.