zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Graphic and numerical comparison between iterative methods. (English) Zbl 1003.65046
From the introduction: There are two motives for studying convergence of iterative methods: (a) to find roots of nonlinear equations, and to know the accuracy and stability of the numerical algorithms; (b) to show the beauty of the graphics that can be generated with the aid of computers. Generally, there are three strategies to obtain graphics from Newton’s method: (i) We take a rectangle $D\subset\bbfC$ and we assign a color (or a gray level) to each point $z_0\in D$ according to the root at which Newton’s method starting from $z_0$ converges; and we mark the point as black (for instance) if the method does not converge. In this way, we distinguish the attraction basins by their colors. (ii) Instead of assigning the color according to the root reached by the method, we assign the color according to the number of iterations required to reach some root with a fixed precision. Again, black is used if the method does not converge. This does not single out the Julia sets, but it does generate nice pictures. (iii) This is a combination of the two previous strategies. Here, we assign a color to each attraction basin of a root. But we make the color lighter or darker according to the number of iterations needed to reach the root with the fixed precision required. As before, we use black if the method does not converge. In my opinion, this generates the most beautiful pictures. All these strategies have been extensively used for polynomials, mainly for polynomials of the form $z^n-1$ whose roots are well known. Of course, many other families of functions have been studied. Although Newton’s method is the best known, in the literature there are many other iterative methods devoted to finding roots of nonlinear equations. Thus, my aim in this article is to study some of these iterative methods for solving $f(z)= 0$, where $f:\bbfC\to \bbfC$, and to show the fractal pictures that they generate (mainly, in the sense described in (iii)). Not to neglect numerical analysis, I will compare the regions of convergence of the methods and their speeds.

65H05Single nonlinear equations (numerical methods)
65E05Numerical methods in complex analysis
65D18Computer graphics, image analysis, and computational geometry
30C15Zeros of polynomials, etc. (one complex variable)
68U05Computer graphics; computational geometry
Full Text: DOI
[1] C. Alexander, I. Giblin, and D. Newton, Symmetry groups on fractals,The Mathematical Intelligencer 14 (1992), no. 2, 32--38. · Zbl 0752.58020 · doi:10.1007/BF03025211
[2] I. K. Argyros, D. Chen, and Q. Qian, The Jarratt method in Banach space setting,J. Comput. Appl. Math. 51 (1994), 103--106. · Zbl 0809.65054 · doi:10.1016/0377-0427(94)90093-0
[3] I. K. Argyros and F. Szidarovszky,The Theory and Applications of Iteration Methods, CRC Press, Boca Raton, FL, 1993. · Zbl 0844.65052
[4] W. Bergweiler, Iteration of meromorphic functions,Bull. Am. Math. Soc. (N. S.) 29 (1993), 151--188. · Zbl 0791.30018 · doi:10.1090/S0273-0979-1993-00432-4
[5] P. Blanchard, Complex analytic dynamics on the Riemann sphere,Bull. Am. Math. Soc. (N. S.) 11 (1984), 85--141. · Zbl 0558.58017 · doi:10.1090/S0273-0979-1984-15240-6
[6] J. A. Ezquerro, J. M. Gutierrez, M. A. Hernandez, and M. A. Salanova, The application of an inverse-free Jarratt-type approximation to nonlinear integral equations of Hammerstein-type,Comput. Math. Appl. 36 (1998), 9--20. · Zbl 0932.65060 · doi:10.1016/S0898-1221(98)00137-0
[7] J. A. Ezquerro and M. A. Hernández, On a convex acceleration of Newton’s method,J. Optim. Theory Appl. 100 (1999), 311--326. · Zbl 0915.90235 · doi:10.1023/A:1021730118905
[8] W. Gander, On Halley’s iteration method,Am. Math. Monthly 92 (1985), 131--134. · Zbl 0574.65041 · doi:10.2307/2322644
[9] W. Gautschi,Numerical Analysis: An Introduction, Birkhäuser, Boston, 1997. · Zbl 0877.65001
[10] J. M. Gutiérrez and M. A. Hernández, A family of Chebyshev- Halley type methods in Banach spaces,Bull. Austral. Math. Soc. 55 (1997), 113--130. · Zbl 0893.47043 · doi:10.1017/S0004972700030586
[11] M. A. Hernández, An acceleration procedure of the Whittaker method by means of convexity,Zb. Rad. Phrod.-Mat. Fak. Ser. Mat. 20 (1990), 27--38.
[12] P. Jarratt, Some fourth order multipoint iterative methods for solving equations,Math. Comp. 20 (1966), 434--437. · Zbl 0229.65049 · doi:10.1090/S0025-5718-66-99924-8
[13] D. Kincaid and W. Cheney,Numerical Analysis: Mathematics of Scientific Computing, 2nd ed., Brooks/Cole, Pacific Grove, CA, 1996. · Zbl 0877.65002
[14] R. F. King, A family of fourth order methods for nonlinear equations,SIAM J. Numer. Anal. 10 (1973), 876--879. · Zbl 0266.65040 · doi:10.1137/0710072
[15] J. M. Ortega and W. C. Rheinboldt,Iterative Solution of Nonlinear Equations in Several Variables, Monographs Textbooks Comput. Sci. Appl. Math., Academic Press, New York, 1970. · Zbl 0241.65046
[16] H. O. Peitgen and P. H. Richter,The Beauty of Fractals, Springer-Verlag, New York, 1986. · Zbl 0601.58003
[17] M. Shub, Mysteries of mathematics and computation,The Mathematical Intelligencer 16 (1994), no. 2, 10--15. · Zbl 0806.68037 · doi:10.1007/BF03026609
[18] J. F. Traub,Iterative Methods for the Solution of Equations, Prentice-Hall, Englewood Cliffs, NJ, 1964. · Zbl 0121.11204
[19] W. Werner, Some improvements of classical iterative methods for the solution of nonlinear equations, inNumerical Solution of Nonlinear Equations (Proa, Bremen, 1980), E. L. Allgower, K. Glashoff and H. O. Peitgen, eds., Lecture Notes in Math. 878 (1981), 427--440.
[20] S. Wolfram,The Mathematica Book, 3rd ed., Wolfram Media/Cambridge University Press, 1996. · Zbl 0878.65001
[21] J. W. Neuberger,The Mathematical Intelligencer, 21(1999), no. 3, 18--23. · Zbl 1052.30502 · doi:10.1007/BF03025411