Page 1

Displaying 1 – 9 of 9

Showing per page

FLQ, the Fastest Quadratic Complexity Bound on the Values of Positive Roots of Polynomials

Akritas, Alkiviadis, Argyris, Andreas, Strzeboński, Adam (2008)

Serdica Journal of Computing

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...

On the local convergence of Kung-Traub's two-point method and its dynamics

Parandoosh Ataei Delshad, Taher Lotfi (2020)

Applications of Mathematics

In this paper, the local convergence analysis of the family of Kung-Traub's two-point method and the convergence ball for this family are obtained and the dynamical behavior on quadratic and cubic polynomials of the resulting family is studied. We use complex dynamic tools to analyze their stability and show that the region of stable members of this family is vast. Numerical examples are also presented in this study. This method is compared with several widely used solution methods by solving test...

Currently displaying 1 – 9 of 9

Page 1