Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Julia sets and Mandelbrot-like sets associated with higher order Schröder rational iteration functions: a computer assisted study
HTML articles powered by AMS MathViewer

by Edward R. Vrscay PDF
Math. Comp. 46 (1986), 151-169 Request permission

Abstract:

Schröder iteration functions ${S_m}(z)$, a generalization of Newton’s method (for which $m = 2$), are constructed so that the sequence ${z_{n + 1}} = {S_m}({z_n})$ converges locally to a root ${z^\ast }$ of $g(z) = 0$ as $O(|{z_n} - {z^\ast }{|^m})$. For $g(z)$ a polynomial, this involves the iteration of rational functions over the complex Riemann sphere, which is described by the classical theory of Julia and Fatou and subsequent developments. The Julia sets for the ${S_m}(z)$, as applied to the simple cases ${g_n}(z) = {z^n} - 1$, are examined for increasing m with the help of microcomputer plots. The possible types of behavior of ${z_n}$ iteration sequences are catalogued by examining the orbits of free critical points of the ${S_m}(z)$, as applied to a one-parameter family of cubic polynomials.
References
Similar Articles
Additional Information
  • © Copyright 1986 American Mathematical Society
  • Journal: Math. Comp. 46 (1986), 151-169
  • MSC: Primary 58F08; Secondary 30D05, 65E05
  • DOI: https://doi.org/10.1090/S0025-5718-1986-0815837-5
  • MathSciNet review: 815837