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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
