Constructive Analysis of Iterated Rational Functions
نویسنده
چکیده
We develop the elementary theory of iterated rational functions over the Riemann sphere C∞ in a constructive setting. We use Bishop-style constructive proof methods throughout. Starting from the development of constructive complex analysis presented in [Bishop and Bridges 1985], we give constructive proofs of Montel’s Theorem along with necessary generalisations, and use them to prove elementary facts concerning the Julia set of a general continuous rational function with complex coefficients. We finish with a construction of repelling cycles for these maps, thereby showing that Julia sets are always inhabited.
منابع مشابه
Further growth of iterated entire functions in terms of its maximum term
In this article we consider relative iteration of entire functions and studycomparative growth of the maximum term of iterated entire functions withthat of the maximum term of the related functions.
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملOn the Number of Rational Iterated Pre-Images of -1 under Quadratic Dynamical Systems
For the class of functions fc x = x 2 + c, we prove a conditional bound on the number of rational solutions to fc N x = −1 and make computational conjectures for a bound on the number of rational solutions to fc N x = a for a in a specific subset of the rationals.
متن کاملOn Some Constructive Method of Rational Approximation
We study a constructive method of rational approximation of analytic functions based on ideas of the theory of Hankel operators. Some properties of the corresponding Hankel operator are investigated. We also consider questions related to the convergence of rational approximants. Analogues of Montessus de Ballore’s and Gonchars’s theorems on the convergence of rows of Padé approximants are proved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. UCS
دوره 11 شماره
صفحات -
تاریخ انتشار 2005