#### Filter Results:

#### Publication Year

1976

2009

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Uspensky's 1948 book on the theory of equations presents an algorithm, based on Descartes' rule of signs, for isolating the real roots of a squarefree polynomial with real coefficients. Programmed in SAC-1 and applied to several classes of polynomials with integer coefficients, Uspensky's method proves to be a strong competitor of the recently discovered… (More)

Let A be an m × n matrix with m ≥ n. Then one form of the singular-value decomposition of A is A = U T ΣV, where U and V are orthogonal and Σ is square diagonal. That is, UU T = I rank(A) , V V T = I rank(A) , U is rank(A) × m, V is rank(A) × n and Σ = σ 1 0 · · · 0 0 0 σ 2 · · · 0 0. .. 0 0 · · · σ rank(A)−1 0 0 0 · · · 0 σ rank(A) … (More)

In this paper we review the existing linear and quadratic complexity (upper) bounds on the values of the positive roots of polynomials and their impact on the performance of the Vincent-Akritas-Strzebo´nski (VAS) continued fractions method for the isolation of real roots of polynomials. We first present the following four linear complexity bounds (two " old… (More)

We present an implementation of the Continued Fractions (CF) real root isolation method using a recently developed upper bound on the positive values of the roots of polynomials. Empirical results presented in this paper verify that this implementation makes the CF method always faster than the Vincent-Collins-Akritas bisection method 3 , or any of its… (More)

The recent interest in isolating real roots of polynomials has revived interest in computing sharp upper bounds on the values of the positive roots of polynomials. Until now Cauchy's method was the only one widely used in this process. S ¸tef˘ anescu's recently published theorem offers an alternative, but unfortunately is of limited applicability as it… (More)