AD FIXED POINTS OF ANALYTIC FUNCTIONS Peter Henrici Stanford University Stanford, California July 1969

Similar documents
PETER HENR IC I TECHNICAL REPORT NO. CS 137 JULY COMPUTER SCIENCE DEPARTMENT School of Humanities and Sciences STANFORD UN IVERS ITY

AD THE MAXIMUM AND MINIMUM OF A POSITIVE DEFINITE QUADRATIC POLYNOMIAL ON A SPHERE ARE CONVEX FUNCTIONS OF THE RADIUS

A0A TEXAS UNIV AT AUSTIN DEPT OF CHEMISTRY F/G 7/5 PHOTOASSISTED WATER-GAS SHIFT REACTION ON PLATINIZED T7TANIAI T--ETCIUI

SYSTEMS OPTIMIZATION LABORATORY DEPARTMENT OF OPERATIONS RESEARCH STANFORD UNIVERSITY STANFORD, CALIFORNIA

Knü. ADOAOll 835 ON PACKING SQUARES WITH EQUAL SQUARES. P. Erdos, et al. Stanford University. Prepared for:

A MARTINGALE INEQUALITY FOR THE SQUARE AND MAXIMAL FUNCTIONS LOUIS H.Y. CHEN TECHNICAL REPORT NO. 31 MARCH 15, 1979

3. 4. Uniformly normal families and generalisations

Accumulation constants of iterated function systems with Bloch target domains

OFFICE OF NAVAL RESEARCH. Contract Nonr-4756(07) Task No. NR Determination of the Rate Constants

THE COVARIANCE MATRIX OF NORMAL ORDER STATISTICS. BY C. S. DAVIS and M. A. STEPHENS TECHNICAL REPORT NO. 14 FEBRUARY 21, 1978

Technical Note

OF NAVAL RESEARCH. Technical Report No. 87. Prepared for Publication. in the.. v.. il and/or -- c Spocial Journal of Elactroanalytical Chemistry it

THE STÄTIONARITY OF AN ESTIMATED AUTOREGRESSIVE PROCESS BY T. W. ANDERSON TECHNICAL REPORT NO. 7 NOVEMBER 15, 1971

An Introduction to Complex Function Theory

A TALE OF TWO CONFORMALLY INVARIANT METRICS

Economics 204 Fall 2011 Problem Set 2 Suggested Solutions

PERIODS IMPLYING ALMOST ALL PERIODS FOR TREE MAPS. A. M. Blokh. Department of Mathematics, Wesleyan University Middletown, CT , USA

1. The COMPLEX PLANE AND ELEMENTARY FUNCTIONS: Complex numbers; stereographic projection; simple and multiple connectivity, elementary functions.

THE MINIMUM NUMBER OF LINEAR DECISION FUNCTIONS TO IMPLEMENT A DECISION PROCESS DECEMBER H. Joksch D. Liss. Prepared for

RD-R14i 390 A LIMIT THEOREM ON CHARACTERISTIC FUNCTIONS VIA RN ini EXTREMAL PRINCIPLE(U) TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES A BEN-TAL

2 Simply connected domains

THE HYPERBOLIC METRIC OF A RECTANGLE

8. Relax and do well.

, i, ~. '~~~* a F- WI W U V U S S S S S S It

W Hw «-»»"«"-r. AD A NOTE ON EXCHANGES IN MATROID BASES Harold Gabow, et al Texas University

NOL UNITED STATES NAVAL ORDNANCE LABORATORY, WHITE OAK, MARYLAND NOLTR ^-z ^ /

geeeo. I UNCLASSIFIED NO 814-B5-K-88 F/G 716 NL SCENCESECTION L F HANCOCK ET AL 81 AUG 87 TR-i

ERRATA: Probabilistic Techniques in Analysis

EXISTENCE AND UNIQUENESS THEOREMS FOR ORDINARY DIFFERENTIAL EQUATIONS WITH LINEAR PROGRAMS EMBEDDED

An alternative proof of Mañé s theorem on non-expanding Julia sets

Rota s Conjecture. Jim Geelen, Bert Gerards, and Geoff Whittle

Math 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative

Math 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative

CONSEQUENCES OF POWER SERIES REPRESENTATION

LENGTH AND AREA ESTIMATES OF THE DERIVATIVES OF BOUNDED HOLOMORPHIC FUNCTIONS

Lecture 1- The constrained optimization problem

I N A C O M P L E X W O R L D

KULTIWAVELENGTH LASER PROPAGATION STUDY ~ III. Quarterly Progress Report No. h March 16, June 15, J. Richard Kerr

SCHWARZIAN DERIVATIVES OF CONVEX MAPPINGS

IUNCLSSIME N E F/G 11?2 NL

1.0~ O. 1*1.8.2IIII II5 uuu11~ I 1 I6 MICROCOPY RESOLUTION TEST CHART NATIONAL BUREAU OF STANDARDS 1963-A

4.6 Montel's Theorem. Robert Oeckl CA NOTES 7 17/11/2009 1

Hartogs Theorem: separate analyticity implies joint Paul Garrett garrett/

UNCLASSIFIED AD NUMBER LIMITATION CHANGES

PICARD S THEOREM STEFAN FRIEDL

Lebesgue Measure on R n

UNCLASSIFIED AD NUMBER LIMITATION CHANGES

^z^=ff] log " x+0 ( lo8t " lx )-

DYNAMIC ONE-PILE NIM Arthur Holshouser 3600 Bullard St., Charlotte, NC, USA, 28208

A FINITE CAPACITY ANALOGUE OF THE KOEBE ONE-QUARTER THEOREM

Part IB Complex Analysis

2 Sequences, Continuity, and Limits

Boundary Behavior of Excess Demand Functions without the Strong Monotonicity Assumption

Metric Spaces and Topology

Hadamard s Theorem and Entire Functions of Finite Order For Math 331

* alllllllllli ADAI 3 OT4NMHOSTNI DALLAS TEX DEPT OF STATISTICS F/6 12/1

Qualifying Exam Complex Analysis (Math 530) January 2019

Continuity. Chapter 4

UN MADISON MATHEMSTICS RESEARCH CENTER A P SUMS UNCLASSIFIE FER4 MONSRR2648 DAAG29-0C04 RDr C91 04

THE k SHORTEST ROUTES AND THE k SHORTEST CHAINS IN A GRAPH. Michel Sakorovitch

Technical Note

Mapping the disk to convex subregions

u(e iθ )K(e iθ,z)dθ, z (1). (126) h(e iθ )K(e iθ,z)dθ, z (1),

Two-Step Iteration Scheme for Nonexpansive Mappings in Banach Space

INTRODUCTION TO REAL ANALYTIC GEOMETRY

Solutions for Math 217 Assignment #3

RIEMANN MAPPING THEOREM

8. Relax and do well.

Convex Sets with Applications to Economics

P. L. DUREN AND A. L. SHIELDS

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Homework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4

Schwarz lemma and automorphisms of the disk

173 ENERGETIC ION BERN-PLASMA INTERACTIONS(U) PRINCETON i/i UNIV N J PLASMA PHYSICS LAB P KULSRUD 09 MAR 84 RFOSR-TR AFOSR

THE FUNDAMENTAL GROUP AND BROUWER S FIXED POINT THEOREM AMANDA BOWER

NATIONAL UNIVERSITY OF SINGAPORE Department of Mathematics MA4247 Complex Analysis II Lecture Notes Part II

Some Background Math Notes on Limsups, Sets, and Convexity

Computability of Koch Curve and Koch Island

ON GENERATING FUNCTIONS OF THE JACOBI POLYNOMIALS

The Measure Problem. Louis de Branges Department of Mathematics Purdue University West Lafayette, IN , USA

DYNAMICAL DESSINS ARE DENSE

THE OBSERVED HAZARD AND MULTICONPONENT SYSTEMS. (U) JAN 80 M BROWN- S M R OSS N0001R77-C I~OREE80-1 he UNCLASSIFIED CA-

AD-A ROCHESTER UNIV NY GRADUATE SCHOOL OF MANAGEMENT F/B 12/1. j FEB 82.J KEILSON F C-0003 UNCLASSIFIED AFGL-TR NL

On Tricomi and Hermite-Tricomi Matrix Functions of Complex Variable

Complex Analysis Problems

8. Relax and do well.

7. Relax and do well.

Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem

A NOTE ON THE DEGREE OF POLYNOMIAL APPROXIMATION*

S 3 j ESD-TR W OS VL, t-i 1 TRADE-OFFS BETWEEN PARTS OF THE OBJECTIVE FUNCTION OF A LINEAR PROGRAM

ON SOME ELLIPTIC PROBLEMS IN UNBOUNDED DOMAINS

DATE ~~~ 6O 300 N1. nbc OF / END FJLIEEO

Richard F. Bass Krzysztof Burdzy University of Washington

Menelaus Theorem, Weil Reciprocity, and a Generalisation to Algebraic Curves. School of Mathematics, Trinity College, University of Dublin

Birgit Heydenreich, Rudolf Müller, Marc Uetz, Rakesh Vohra. Characterization of Revenue Equivalence RM/07/017. JEL code: D71, C72, C69

UNIFORMLY PERFECT ANALYTIC AND CONFORMAL ATTRACTOR SETS. 1. Introduction and results

CORTONA SUMMER COURSE NOTES

SOLID PROPELLANT KINETICS II. THEORETICAL ANALYSIS OF THE HETEROGENEOUS OPPOSED FLOW DIFFUSION FLAME* +

MATH5685 Assignment 3

7. Relax and do well.

Transcription:

AD 698 801 FIXED POINTS OF ANALYTIC FUNCTIONS Peter Henrici Stanford University Stanford, California July 1969 OittribitM...'to foster, serve and promote the nation's economic development and technological advancement.' U.S. DEPARTMENT OF COMMERCE/National Bureau of Standards This document has been approved lor public release aud sale. i

I I * < CS 137 i 8 ^ FIXED POINTS OF ANALYTIC FUNCTIONS \ BY PETER HENRICI TECHNICAL REPORT NO. CS 137 JULY 1969 CLEAWlNt, HOUSE COMPUTER SCIENCE DEPARTMENT School of Humanities and Sciences STANFORD UNIVERSITY I 1

-in m f.im-: n r r-^^ ^- FIXED POINTS OF ANALYTIC FUNCTIONS* By Peter Henrici Reproduction in whole or in part is permitted for any purpose of the United States Government. This work was supported in part by the National Science Foundation and the Office of Naval Research. Eidgenössische Technische Hochschule, Zürich, Switzerland. -Uta

^J Abstract A continuous mapping of a simply connected, closed, bounded set of the euclldean plane Into Itself Is known to have at least one fixed point. It Is shown that the usual condition for the fixed point to be unique, and for convergence of the Iteration sequence to the fixed point, can be relaxed if the mapping is defined by an analytic function of a complex variable. ii

wmm*r ' We consider the problems of the existence and of the construction cf solutions of the equation (1) z = F(z), where the function F is analytic in some domain S of the complex plane. Such solutions are called fixed points of F. By standard results in real numerical analysis, it follows immediately that F has at least one fixed point if S is bounded and simply connected, F is continuous on the closure S' of S, and Fes') c S'. If the mapping defined by F is contracting, then there is a unique fixed point, and the iteration sequence defined by 0- J ) z n+l = F^ZJ ; n = 0, 1, i J,..., converges to the fixed point for every choice of z 0 6 S'. If S is convex, a necessary and sufficient condition for the mapping to be contracting is that the derivative F' of F satisfies 0) \F'{z)\ = k, z S, where k < 1. It is the purpose of this note to show that the hypothesis that F is contracting can be dispensed with due to the analyticity of F. The argument provides an opportunity to apply some basic facts of complex variable theory in a constructive setting. THEOREM. Let S denote the interior of a Jordan curve F, let F be analytjc in S and continuous on S U F, and let F(S U l) <= S. Then F has exactly one fixed point, and the iteration sequence defined by (J) con-

verges to the fixed point for arbitrary z 0 E S u I' IF'\ Clearly, there are functions F s atis~lng the hypotheses for which is arbitrarily large, e.g., F(z) 1 100 =? z in!22 We first rove the Theorem in the case where S is t.he unit disk. Here the hypothesis implies (4) r : = ma.x \F(z)\ < 1 \ z \~1 The oint is a fixed oint if a.nd onl y if it is a zero of z - F(z). To ove the exin enc:e of a zero, we ai;pl J' Rouch"e' s theorem {{1], P 124) with,. l n t he role of the "big" function and F( z ) in the r ole of the "small".~. unc ti n he e"'sential hypothesis of Roucht!' s 'Che rem i s atisfied i n vie\~.f' ) It follo ts that z - F(z) has exactly E1s many zero.., inside \ z \ = 1 ::., namel y one. Ll~ t denote t he w1ique fixed point. In order to prove the convergence of tht! iter ation sequtnce, let; t( :.: ) = z - " 1- z 3 H.:::: i~ u inc r tran fo:nnation which ma \zl < 1 onto i tself and ~ ends s i t o I e; nd e t l.. function has the fixea point 0 It is < c \z\ = ~ onto a clos d subset of \ z \ < 1, hence k : = sup \ z \~1 \G(z)\ < l. L::.., t., :.J.t.., ) : n at k > 0, for otherwise G, and consequently F, i s con- Lakes place in cne tep. The function -1 k G vani shes ounded y 1, hence by th~ Lemma of Schwarz ( [l ] 1 11 ) ' 2

k 1G(Z) - \Z\ and consequently, (5) lg( Z ) ^ k\z\ for all z such that Izl 11-1. Let w = t(a v ). Since n r/ 'Vl = t( Vl ) = r(f ( :: n )) = t ( F ( t " 1 ( w n))) = ü ( w n) i ^ folios from (5) that IVll " k l W nl and <, n hence that w = k jw^j, implying that w - 0. Hence z = t" 1 (v; ) - t' 1 (0) = s. n n To prove the Theorem for an arbitrary Jordan domain S, we require a less elementary tool, the Osgood-Caratheodory theorem {[2], p. 92-98) stating the existence of a function g that maps S conformally onto z < 1 and 3 U 1 continuously and one-to-one onto jzj = 1. The function J H=g 0 F 0 g" is easily seen to satisfy the hypotheses of the Theorem for 1- the unit disk. Furthermore; if the points z are defined by ( > L ) and w = g(z ) then w,, = H(w ). Thus the validity of the Theorem for the unit n ov v n' ' n+1 n' " disk implies the validity for a general S. i amplifying its content. In line with the paedagogical nature of this note, we add some problem?; 1) Show that k =., f r u i + r 2) In the case where S is the unit disk, show that 2 n - si = (1 + r) k n, n = 0, 1, 2,.... 5) Let F'Cs) = F"(s) =... = F^" 1^) = 0, F (in) (s) ^ 0 for some integer ra > 1. If S is the unit dink, establish the following error astlmate showing superlinear convergence: 3 -.--'>. -.. -......,,..T-

^ i = z n - c' = (1 + r) k i ( m i in +..# + m' n-1, n «1, 2 f 9 t Research problem. Can similar results be established for systems of analytic equations?

1 REFERENCES [1] L. Ahlfors, Complex Analysis, 1st edition. McJraw-Hlll, New York 1953. [2] C. Caratheodory, Theory of functions of a complex variable, vol. 2 (English edition). Chelsea, New York i960. i.

*p Unclassified Security CI«m>ific»tion DOCUMENT CONTROL DATA -R&D tsreurily rlimlllctllon el Ulla, body ol mbilfrl mid Indmlnt»nnoimlon nwl bt tnfrtd whtn lit» onrall rtpotl /» rlaithltd) 1 O«IOIN*TINO *CTIVITV (Cotportlt mulhot) Computer Science Department Stanford University- Stanford, California 9^305 J KEPOKT TITLE FIXED POINTS OF ANALYTIC FUNCTIONS a«. RCPOHT tccunity CLAi»IHC*TION Unclassified lb. GROUP 4 DESCniPTivE NOTES (Typt ol r»potl mnd Inclumivt dmitt) Manuscript for Publication (Technical Report) t AuTHOniil fftftf nam», mlddl» Initial, latl nam») Peter Henrici» REPOMT OATE July 1969 «. CONTRACT OR GRANT NC N000HI-67-A-0112-0029 6. PROJEC T NO. d. NR OU-211 f. TOTAL NO. OF PAGES 7b. NO. OF *EFS»a. ORICINATOR'S REPORT NUMBERISI CS-157 ab. OTHER REPORT NO(S) (A.iy oihtr numbart that may ba atalfnad Ihl» rapotl) none 2 10. DISTRIBUTION STATEMENT Releasaole without limitations on dissemination» II SUPPLEMENTARY NOTES 12. SPONSORING MILITARY ACTIVITY Office of Naval Research 11 ABSTRACT -, A continuous mapping of a simply connected, closed, bounded set of the euclidean plane into itself is known to have at least one fixed point. It is shown that the usual condition for the fixed point to be unique, and for convergence of the iteration sequence to the fixed point, can be relaxed if the mapping is defined by an analytic function of e complex variable. 1 DD,'r.,1473 S/N OtC 1-807.6801 l ',4GEI, Unclassified Security Classification

"W!" Unclassified Stcuftty "Uttiftcition K CV WORD: NOUt MT NOLI NOLI LINK C fixed point analytic function iteration sequence equations DD Zt.AA7Z BACK) (PAGE 2) Unclassified Security Clanlflcatlon