Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-11440-3_24 | WALCOM |
Keywords | Field | DocType |
fourier theorem,real eigenvalues,distinct real root,complex system,root isolation,minimum root separation,real root isolation problem,multi-exponential polynomial,real root,efficient algorithm,disjoint interval,eigenvalues,linear system | Complex system,Discrete mathematics,Combinatorics,Disjoint sets,Linear system,Polynomial,Exponential polynomial,Reachability,Eigenvalues and eigenvectors,Difference polynomials,Mathematics | Conference |
Volume | ISSN | ISBN |
5942 | 0302-9743 | 3-642-11439-3 |
Citations | PageRank | References |
1 | 0.35 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ming Xu | 1 | 15 | 2.65 |
| Liangyu Chen | 2 | 16 | 3.79 |
| Zhenbing Zeng | 3 | 150 | 20.48 |
| Zhibin Li | 4 | 115 | 23.77 |