The minimal distance between distinct roots of a polynomial (separation of roots) appears in the computational analysis of many algorithms in Numerical Analysis and Computer Algebra. In this paper we demonstrate several typical problems as localization of roots, distribution of inclusion disks, a local convergence of Weierstrass' iterative method, where the root separation is involved. [References: 25]
展开▼
