Now showing items 1-9 of 9

• #### Advances on the continued fractions method using better estimations of positive root bounds ﻿

(2007)
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 ...
• #### Applications of singular-value decomposition (SVD) ﻿

(2004)
Let A be an m x n matrix with m greater than or equal to n. Then one form of the singular-value decomposition of A is A = U-T SigmaV, where U and V are orthogonal and Sigma is square diagonal. That is, UUT = I-rank(A), VVT ...
• #### A comparison of various methods for computing bounds for positive roots of polynomials ﻿

(2007)
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 ...
• #### Computations in modules over commutative domains ﻿

(2007)
This paper is a review of results on computational methods of linear algebra over commutative domains. Methods for the following problems are examined: solution of systems of linear equations, computation of determinants, ...
• #### Counting the number of real roots in an interval with Vincent's theorem ﻿

(2010)
It is well known that, in 1829, the French mathematician Jacques Charles Francois Sturm (1803-1855) solved the problem of finding the number of real roots of a polynomial equation f(x) = 0, with rational coefficients and ...

(2005)
• #### Improving the Performance of the Continued Fractions Method Using New Bounds of Positive Roots ﻿

(2008)
In this paper we compare four implementations of the Vincent-Akritas-Strzebonski Continued Fractions (VAS-CF) real root isolation method using four different (two linear and two quadratic complexity) bounds on the values ...
• #### Linear and Quadratic Complexity Bounds on the Values of the Positive Roots of Polynomials ﻿

(2009)
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-Strzebonski (VAS) continued ...
• #### Vincent's theorem of 1836: Overview and future research ﻿

(2010)
In this paper, we present two different versions of Vincent's theorem of 1836 and discuss various real root isolation methods derived from them: one using continued fractions and two using bisections, the former being the ... 