in this paper, we present two new families of third-order and fourth-order methods for finding multiple roots of nonlinear equations. each of them requires one evaluation of the function and two of its first derivative per iteration. several numerical examples are given to illustrate the performance of the presented methods.

Hain and Freire have proposed different floating point square root algorithms that can be efficiently implemented in hardware. The algorithms are compared and evaluated on both performance and precision.

Polynomial root-finders usually consist of two stages. At first a crude approximation to a root is slowly computed; then it is much faster refined by means of the same or distinct iteration. The efficiency of computing an initial approximation resists formal study, and the users rely on empirical data. In contrast, the efficiency of refinement is formally measured by the classical concept q whe...

The line graph of a G has one node per each edge G, two them being adjacent only when the corresponding edges have in common. In this work, we consider problem finding minimum number to delete so that resulting is graph, which presents an interesting application haplotyping diploid organisms. We propose Integer Linear Programming formulation for problem. compare our approach with other existing...