In this paper, we present two new families of iterative methods for multiple roots of nonlinear equations. One of the families require one-function and two-derivative evaluation per step, and the other family requires two-function and one-derivative evaluation. It is shown that both are third-order convergent for multiple roots. Numerical examples suggest that each family member can be competit...

We revisit the quaternion Newton method for computing roots of a class of quaternion valued functions and propose modified algorithms for finding multiple roots of simple poly-nomials. We illustrate the performance of these new methods by presenting several numerical experiments.

This paper covers location determination in wireless cellular networks based on time difference of arrival (TDoA) measurements in a factor graphs framework. The resulting nonlinear estimation problem of the localization process for the mobile station cannot be solved analytically. The well-known iterative Gauss-Newton method as standard solution fails to converge for certain geometric constella...

A three-step iterative method with fifth-order convergence as a new modification of Newton’s method was presented. This method is for finding multiple roots of nonlinear equation with unknown multiplicity m whose multiplicity m is the highest multiplicity. Its order of convergence is analyzed and proved. Results for some numerical examples show the efficiency of the new method.

The computation of the n-th root r of a strictly positive real number r has a long history [1, 14]. In more recent work, for example in [10] and [20], continued fraction expansions are used to derive methods to compute r. Also, in [12] methods similar to those presented in [20] are obtained as special case of a determinantal family of root-finding methods [11]. For the computation of n-th root ...

In this paper, some meshless methods based on the local Newton basis functions are used to solve some time dependent partial differential equations. For stability reasons, used variably scaled radial kernels for constructing Newton basis functions. In continuation, with considering presented basis functions as trial functions, approximated solution functions in the event of spatial variable wit...

We show that deciding whether a sparse univariate polynomial has a p-adic rational root can be done in NP for most inputs. We also prove a polynomial-time upper bound for trinomials with suitably generic p-adic Newton polygon. We thus improve the best previous complexity upper bound of EXPTIME. We also prove an unconditional complexity lower bound of NP-hardness with respect to randomized reduc...

At short distances, energy eigenfunctions of chaotic systems have spatial correlations that are well described by assuming a microcanonical density in phase space for the corresponding Wigner function. However, this is not correct on large scales. The correct correlation function is in turn needed to get the correct formula for the root-mean-square value of the off-diagonal matrix elements of s...

There are many occasions where the base of a robotic manipulator is attached to a moving platform, such as on a moving ship, terrain or space shuttle. In this paper a dynamic model of a robotic manipulator mounted on a moving base is derived using both Newton-Euler and Lagrange-Euler methods. The presented models are simulated for a Mitsubishi PA10-6CE robotic manipulator characteristics mounte...