Influence of the multiplicity of the roots on the basins of attraction of Newton’s method

2013 ◽  
Vol 66 (3) ◽  
pp. 431-455 ◽  
Author(s):  
José M. Gutiérrez ◽  
Luis J. Hernández-Paricio ◽  
Miguel Marañón-Grandes ◽  
M. Teresa Rivas-Rodríguez
Author(s):  
Feitian Zhang ◽  
Fumin Zhang ◽  
Xiaobo Tan

Gliding robotic fish, a new type of underwater robot, combines both strengths of underwater gliders and robotic fish, featuring long operation duration and high maneuverability. In this paper, we present both analytical and experimental results on a novel gliding motion, tail-enabled three-dimensional (3D) spiraling, which is well suited for sampling a water column. A dynamic model of a gliding robotic fish with a deflected tail is first established. The equations for the relative equilibria corresponding to steady-state spiraling are derived and then solved recursively using Newton's method. The region of convergence for Newton's method is examined numerically. We then establish the local asymptotic stability of the computed equilibria through Jacobian analysis and further numerically explore the basins of attraction. Experiments have been conducted on a fish-shaped miniature underwater glider with a deflected tail, where a gliding-induced 3D spiraling maneuver is confirmed. Furthermore, consistent with model predictions, experimental results have shown that the achievable turning radius of the spiraling can be as small as less than 0.4 m, demonstrating the high maneuverability.


Author(s):  
Krzysztof Gdawiec ◽  
Wiesław Kotarski ◽  
Agnieszka Lisowska

AbstractThere are two main aims of this paper. The first one is to show some improvement of the robust Newton’s method (RNM) introduced recently by Kalantari. The RNM is a generalisation of the well-known Newton’s root finding method. Since the base method is undefined at critical points, the RNM allows working also at such points. In this paper, we improve the RNM method by applying the Mann iteration instead of the standard Picard iteration. This leads to an essential decrease in the number of root finding steps without visible destroying the sharp boundaries among the basins of attractions presented in polynomiographs. Furthermore, we investigate visually the dynamics of the RNM with the Mann iteration together with the basins of attraction for varying Mann’s iteration parameter with the help of polynomiographs for several polynomials. The second aim of this paper is to present the intriguing polynomiographs obtained from the dynamics of the RNM with the Mann iteration under various sequences used in this iteration. The obtained polynomiographs differ considerably from the ones obtained with the RNM and are interesting from the artistic perspective. Moreover, they can easily find applications in wallpaper or fabric design.


Fractals ◽  
2007 ◽  
Vol 15 (04) ◽  
pp. 323-336 ◽  
Author(s):  
XINGYUAN WANG ◽  
TINGTING WANG

The Julia sets theory of generalized Newton's method is analyzed and the Julia sets of generalized Newton's method are constructed using the iteration method. From the research we find that: (1) the basins of attraction of the Julia sets of generalized Newton's method depend on the roots of the equation and their orders and also the existence of the extraneous fixed points; (2) the Steffensen method is an exception to the law given in (1); and (3) if the order of the root is decimal, then the different choice of the range of the principal value of the phase angle will cause a different evolvement of the Julia sets.


2004 ◽  
Vol 14 (12) ◽  
pp. 4177-4190 ◽  
Author(s):  
FİGEN ÇİLİNGİR

For a nonconstant function F and a real number h∈]0, 1] the relaxed Newton's method NF,h of F is an iterative algorithm for finding the zeroes of F. We show that when relaxed Newton's method is applied to complex function F(z)=P(z)eQ(z), where P and Q are polynomials, the basin of attraction of a root of F has finite area if the degree of Q exceeds or equals 3. The key point is that NF,h is a rational map with a parabolic fixed point at infinity.


Author(s):  
Jin Xie ◽  
Kaiyin Yan ◽  
Yong Chen

Nonlinear equations arise from the synthesis of linkages. Newton’s method is one of the most accessible and easiest to implement of the iterative root-finding algorithms for these equations. As a discrete deterministic dynamical system, Newton’s method contains subsystems which have highly random motion. In a so-called chaotic zone, there is a rapid interchange between the basins of attraction for each root of the equation. Choosing initial points from such chaotic zone, one can obtain a certain number of roots or possible all of them under the Newton’s method. In this paper, how to locate the chaotic zones is addressed following the global analysis of real Newton’s method. It is show that there exist four chaotic zones for a general 4th degree polynomial. As an example, the equation derived from exact synthesis for five positions is solved.


SIAM Review ◽  
1998 ◽  
Vol 40 (1) ◽  
pp. 102-109 ◽  
Author(s):  
Bogdan I. Epureanu ◽  
Henry S. Greenside

2012 ◽  
Vol 3 (2) ◽  
pp. 167-169
Author(s):  
F.M.PATEL F.M.PATEL ◽  
◽  
N. B. PANCHAL N. B. PANCHAL

2012 ◽  
Vol 220-223 ◽  
pp. 2585-2588
Author(s):  
Zhong Yong Hu ◽  
Fang Liang ◽  
Lian Zhong Li ◽  
Rui Chen

In this paper, we present a modified sixth order convergent Newton-type method for solving nonlinear equations. It is free from second derivatives, and requires three evaluations of the functions and two evaluations of derivatives per iteration. Hence the efficiency index of the presented method is 1.43097 which is better than that of classical Newton’s method 1.41421. Several results are given to illustrate the advantage and efficiency the algorithm.


Sign in / Sign up

Export Citation Format

Share Document