Factors involved in the performance of computations on Beowulf clusters.
Fast Fourier analysis for over a finite field and related numerical experiments.
Filter factor analysis of an iterative multilevel regularizing method.
Finding nonoverlapping substructures of a sparse matrix.
FLQ, the Fastest Quadratic Complexity Bound on the Values of Positive Roots of Polynomials
In this paper we present F LQ, a quadratic complexity bound on the values of the positive roots of polynomials. This bound is an extension of FirstLambda, the corresponding linear complexity bound and, consequently, it is derived from Theorem 3 below. We have implemented FLQ in the Vincent-Akritas-Strzeboński Continued Fractions method (VAS-CF) for the isolation of real roots of polynomials and compared its behavior with that of the theoretically proven best bound, LM Q. Experimental results indicate...