80 search results - page 3 / 16 » On the Complexity of Real Root Isolation |
SASO
2007
IEEE
15 years 4 months ago
2007
IEEE
— The increasing complexity of distributed enterprise systems has made the task of managing these systems difficult and time consuming. The only way to simplify the management p...
TCS
2008
14 years 10 months ago
2008
We present exact and complete algorithms based on precomputed Sturm-Habicht sequences, discriminants and invariants, that classify, isolate with rational points and compare the re...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
AMC
2007
14 years 10 months ago
2007
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...