Feedback in Iterative Algorithms
|
|
- Melvin Richardson
- 5 years ago
- Views:
Transcription
1 Feedback i Iterative Algorithms Charles Byre (Charles Byre@uml.edu), Departmet of Mathematical Scieces, Uiversity of Massachusetts Lowell, Lowell, MA October 17, 2005 Abstract Whe the oegative system of liear equatios y = Px has o oegative exact solutios, block-iterative methods fail to coverge, exhibitig, istead, subsequetial covergece leadig to a limit cycle of two or more distict vectors. From the vectors of the limit cycle we extract ew data, replace the data vector y with this ew data vector, ad restart the iterative process. Success with this approach as applied to the algebraic recostructio techique (ART) prompts us to apply feedback to other block-iterative methods. We cosider here several questios pertaiig to this feedback approach: Ca we show the existece of limit cycles for these other block-iterative algorithms? Does the sequece of successive limit cycles coverge to a sigle vector? If so, which vector is it? 1 Itroductio Whe the oegative system of liear equatios y = Px has o oegative solutios we say that we are i the icosistet case. I this case the SMART ad EMML algorithms still coverge, to a oegative miimizer of KL(Px, y) ad KL(y, Px), respectively. O the other had, the rescaled block-iterative versios of these algorithms, RBI-SMART ad RBI-EMML, do ot coverge. Istead they exhibit cyclic subsequetial covergece; for each fixed = 1,..., N, with N the umber of blocks, the subsequece {x mn+ } coverges to their ow limits. These limit vectors the costitute the limit cycle (LC). The LC for RBI-SMART is ot the same as for RBI- EMML, geerally, ad the LC varies with the choice of blocks. Our problem is to fid a way to calculate the SMART ad EMML limit vectors usig the RBI methods. More specifically, how ca we calculate the SMART ad EMML limit vectors from their associated RBI limit cycles? For details cocerig these algorithms see [3]. As is ofte the case with the algorithms based o the KL distace, we ca tur to the ART algorithm for guidace. What happes with the ART algorithm i the 1
2 icosistet case is ofte closely related to what happes with RBI-SMART ad RBI-EMML, although proofs for the latter methods are more difficult to obtai. For example, whe the system Ax = b has o solutio we ca prove that ART exhibits cyclic subsequetial covergece to a limit cycle. The same behavior is see with the RBI methods, but o oe kows how to prove this. Whe the system Ax = b has o solutio we usually wat to calculate the least squares (LS) approximate solutio. The problem the is to use the ART to fid the LS solutio. There are several ways to do this, as discussed i [2, 3]. We would like to be able to borrow some of these methods ad apply them to the RBI problem. I this article we focus o oe specific method that works for ART ad we try to make it work for RBI; it is the feedback approach. 2 Feedback i ART Suppose that the system Ax = b has o solutio. We apply the ART ad get the limit cycle {z 1, z 2,..., z M }, where M is the umber of equatios ad z 0 = z M. We assume that the rows of A have bee ormalized so that their legths are equal to oe. The the ART iterative step gives z m = z m 1 + A m (b m (Az m 1 ) m ) or z m z m 1 = A m (b m (Az m 1 ) m ). Summig over the idex m ad usig z 0 = z M we obtai zero o the left side, for each. Cosequetly A T b = A T c, where c is the vector with etries c m = (Az m 1 ) m. It follows that the systems Ax = b ad Ax = c have the same LS solutios ad that it may help to use both b ad c to fid the LS solutio from the limit cycle. The article [2] cotais several results alog these lies. Oe approach is to apply the ART agai to the system Ax = c, obtaiig a ew LC ad a ew cadidate for the right side of the system of equatios. If we repeat this feedback procedure, each time usig the LC to defie a ew right side vector, does it help us fid the LS solutio? Yes, as Theorem 4 of [2] shows. Our goal i this article is to explore the possibility of usig the same sort of feedback i the RBI methods. Some results i this directio are i [2]; we review those ow. 2
3 3 Feedback i RBI methods Oe issue that makes the KL methods more complicated tha the ART is the support of the limit vectors, meaig the set of idices for which the etries of the vector are positive. I [1] it was show that whe the system y = Px has o oegative solutios ad P has the full rak property there is a subset S of { = 1,..., J} with cardiality at most I 1, such that every oegative miimizer of KL(Px, y) has zero for its -th etry wheever is ot i S. It follows that the miimizer is uique. The same result holds for the EMML, although it has ot bee prove that the set S is the same as i the SMART case. The same result holds for the vectors of the LC for both RBI-SMART ad RBI-EMML. A simple, yet helpful, example to refer to as we proceed is the followig. P = [ ] [ ] 1.5.5, y = There is o oegative solutio to this system of equatios ad the support set S for SMART, EMML ad the RBI methods is S = { = 2}. 3.1 The RBI-SMART Our aalysis of the SMART ad EMML methods has show that the theory for SMART is somewhat icer tha that for EMML ad the resultig theorems for SMART are a bit stroger. The same is true for RBI-SMART, compared to RBI- EMML. For that reaso we begi with RBI-SMART. Recall that the iterative step for RBI-SMART is x k+1 = x k exp( s 1 P i log(y i /(Px k ) i )), where = k(modn) + 1, s = I i=1 P i, s = P i ad m = max{s /s, = 1,..., J}. For each let G (x, z) = J =1 s KL(x, z ) Exercise 1: Show that J =1 KL((Px) i, (Pz) i ) + s KL(x, z ) KL((Px) i, (Pz) i ) 0, 3 KL((Px) i, y i ).
4 so that G (x, z) 0. Exercise 2: Show that where J G (x, z) = G (z, z) + s KL(x, z ), =1 z = z exp( s 1 P i log(y i /(Pz) i ). We assume that there are o oegative solutios to the oegative system y = Px. We apply the RBI-SMART ad get the limit cycle {z 1,..., z N }, where N is the umber of blocks. We also let z 0 = z N ad for each i let w i = (Pz 1 ) i where i B, the -th block. Prompted by what we leared cocerig the ART, we ask if the oegative miimizers of KL(Px, y) ad KL(Px, w) are the same. This would be the correct questio to ask if we were usig the slower urescaled block-iterative SMART, i which the m are replaced by oe. For the rescaled case it turs out that the proper questio to ask is: Are the oegative miimizers of the fuctios ad N =1 N =1 KL((Px) i, y i ) KL((Px) i, w i ) the same? The aswer is Yes, probably. The difficulty has to do with the support of these miimizers; specifically: Are the supports of both miimizers the same as the support of the LC vectors? If so, the we ca prove that the two miimizers are idetical. This is our motivatio for the feedback approach. The feedback approach is the followig: begiig with y 0 = y we apply the RBI- SMART ad obtai the LC, from which we extract the vector w, which we also call w 0. We the let y 1 = w 0 ad apply the RBI-SMART to the system y 1 = Px. From the resultig LC we extract w 1 = y 2, ad so o. I this way we obtai a ifiite sequece of data vectors {y k }. We deote by {z k,1,..., z k,n } the LC we obtai from the system y k = Px, so that y k+1 i = (Pz k, ) i, fori B. Oe issue we must cofrot is how we use the support sets. At the first step of feedback we apply RBI-SMART to the system y = y 0 = Px, begiig with a positive vector 4
5 x 0. The resultig limit cycle vectors are supported o a set S 0 with cardiality less tha I. At the ext step we apply the RBI-SMART to the system y 1 = Px. Should we begi with a positive vector (ot ecessarily the same x 0 as before) or should our startig vector be supported o S 0? Exercise 3: Show that the RBI-SMART sequece {x k } is bouded. Hits: For each let M = max{y i /P i, P i > 0} ad let C = max{x 0, M }. Show that x k C for all k. Exercise 4: Let S be the support of the LC vectors. Show that N =1 P i log(y i /w i ) 0 (3.1) for all, with equality for those S. Coclude from this that N =1 KL((Px) i, y i ) N =1 N =1 (y i w i ), KL((Px) i, w i ) with equality if the support of the vector x lies withi the set S. Hits: For S cosider log(z /z 1 ) ad sum over the idex, usig the fact that z N = z 0. For geeral assume there is a for which the iequality does ot hold. Show that there is M ad ɛ > 0 such that for m M log(x (m+1)n /x mn ) ɛ. Coclude that the sequece {x mn } is ubouded. Exercise 5: Show that N N G (z k,, z k, 1 ) = =1 =1 (yi k yi k+1 ), ad coclude that the sequece { N =1 ( y k i )} is decreasig ad that the sequece { N =1 G (z k,, z k, 1 )} 0 as k. Hits: Calculate G (z k,, z k, 1 ) usig Exercise 2. 5
6 Exercise 6: Show that for all vectors x 0 the sequece N { =1 is decreasig ad the sequece as k. Hits: Calculate N { =1 N =1 ad use the previous exercise. KL((Px) i, y k i )} (yi k yi k+1 ) 0, N KL((Px) i, yi k )} { =1 KL((Px) i, yi k+1 )} Exercise 7: Exted the boudedess result obtaied earlier to coclude that for each fixed the sequece {z k, } is bouded. Sice the sequece {z k,0 } is bouded there is a subsequece {z kt,0 } covergig to a limit vector z,0. Sice the sequece {z kt,1 } is bouded there is subsequece covergig to some vector z,1. Proceedig i this way we fid subsequeces {z km, } covergig to z, for each fixed. Our goal is to show that, with certai restrictios o P, z, = z for each. We the show that the sequece {y k } coverges to Pz ad that z miimizes N KL((Px) i, y i ). =1 It follows from Exercise 5 that N { G (z,, z, 1 )} = 0. =1 Exercise 8: Fid suitable restrictios o the matrix P to permit us to coclude from above that z, = z, 1 = z for each. Exercise 9: Show that the sequece {y k } coverges to Pz. Hits: Sice the sequece { N =1 m 1 KL((Pz ) i, yi k )} is decreasig ad a subsequece coverges to zero, it follows that the whole sequece coverges to zero. Exercise 10: Use Exercise 4 to obtai coditios that permit us to coclude that the vector z is a oegative miimizer of the fuctio N =1 KL((Px) i, y i ). 6
7 3.2 The RBI-EMML We tur ow to the RBI-EMML method, havig the iterative step x k+1 = (1 s 1 s )x k + s 1 x k P i y i /(Px k ) i, with = k(modn)+1. As we wared earlier, developig the theory for feedback with respect to the RBI-EMML algorithm appears more difficult tha i the RBI-SMART case. Applyig the RBI-EMML algorithm to the system of equatios y = Px havig o oegative solutio, we obtai the LC {z 1,..., z N }. As before, for each i we let w i = (Pz 1 ) i where i B. There is a subset S of { = 1,..., J} with cardiality less tha I such that for all we have z = 0 if is ot i S. ad The first questio that we ask is: Are the oegative miimizers of the fuctios the same? N =1 N =1 KL(y i, (Px) i ) KL(w i, (Px) i ) As before, the feedback approach ivolves settig y 0 = y, w 0 = w = y 1 ad for each k defiig y k+1 = w k, where w k is extracted from the limit cycle LC(k) = {z k,1,..., z k,n = z k,0 } obtaied from the system y k = Px as w k i = (Pz k, 1 ) i where is such that i B. Agai, we must cofrot the issue of how we use the support sets. At the first step of feedback we apply RBI-EMML to the system y = y 0 = Px, begiig with a positive vector x 0. The resultig limit cycle vectors are supported o a set S 0 with cardiality less tha I. At the ext step we apply the RBI-EMML to the system y 1 = Px. Should we begi with a positive vector (ot ecessarily the same x 0 as before) or should our startig vector be supported o S 0? Oe approach could be to assume first that J < I ad that S = { = 1,..., J} always ad the see what ca be discovered. Our coectures, subect to restrictios ivolvig the support sets, are as follows: 1: The sequece {y k } coverges to a limit vector y ; 2: The system y = Px has a oegative solutio, say x ; 7
8 3: The LC obtaied for each k coverge to the sigleto x ; 4: The vector x miimizes the fuctio over oegative x. N =1 KL(y i, (Px) i ) Some results cocerig feedback for RBI-EMML were preseted i [2]. We sketch those results ow. Exercise 11: Show that the quatity is the same for k = 0, 1,... N =1 y k i Hits: Show that J N s (z k, =1 =1 ad rewrite it i terms of y k ad y k+1. z k, 1 ) = 0 Exercise 12: Show that there is a costat B > 0 such that z k, ad. B for all k, Exercise 13: Show that s log(z k, 1 /z k, ) m 1 P i log(yi k+1 /yi k ). Hits: Use the covexity of the log fuctio ad the fact that the terms 1 s ad P i, i B sum to oe. Exercise 14: Use the previous exercise to prove that the sequece N { =1 KL((Px) i, y k i )} is decreasig for each oegative vector x ad the sequece is icreasig. N { =1 P i log(y k i )} 8
9 Refereces [1] Byre, C. (1993) Iterative image recostructio algorithms based o crossetropy miimizatio. IEEE Trasactios o Image Processig IP-2, pp [2] Byre, C. (1997) Coverget block-iterative algorithms for image recostructio from icosistet data. IEEE Trasactios o Image Processig IP-6, pp [3] Byre, C. (2005) Sigal Processig: A Mathematical Approach, AK Peters, Publ., Wellesley, MA. 9
6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationAssignment 5: Solutions
McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece
More informationMA131 - Analysis 1. Workbook 3 Sequences II
MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationsin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =
60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationMath 140A Elementary Analysis Homework Questions 3-1
Math 0A Elemetary Aalysis Homework Questios -.9 Limits Theorems for Sequeces Suppose that lim x =, lim y = 7 ad that all y are o-zero. Detarime the followig limits: (a) lim(x + y ) (b) lim y x y Let s
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationThe Method of Least Squares. To understand least squares fitting of data.
The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve
More informationComplex Analysis Spring 2001 Homework I Solution
Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle
More informationMA131 - Analysis 1. Workbook 2 Sequences I
MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................
More informationMA131 - Analysis 1. Workbook 10 Series IV
MA131 - Aalysis 1 Workbook 10 Series IV Autum 2004 Cotets 4.19 Rearragemets of Series...................... 1 4.19 Rearragemets of Series If you take ay fiite set of umbers ad rearrage their order, their
More informationAdvanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology
Advaced Aalysis Mi Ya Departmet of Mathematics Hog Kog Uiversity of Sciece ad Techology September 3, 009 Cotets Limit ad Cotiuity 7 Limit of Sequece 8 Defiitio 8 Property 3 3 Ifiity ad Ifiitesimal 8 4
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationSeries III. Chapter Alternating Series
Chapter 9 Series III With the exceptio of the Null Sequece Test, all the tests for series covergece ad divergece that we have cosidered so far have dealt oly with series of oegative terms. Series with
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationIt is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.
Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable
More informationNEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE
UPB Sci Bull, Series A, Vol 79, Iss, 207 ISSN 22-7027 NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE Gabriel Bercu We itroduce two ew sequeces of Euler-Mascheroi type which have fast covergece
More informationM17 MAT25-21 HOMEWORK 5 SOLUTIONS
M17 MAT5-1 HOMEWORK 5 SOLUTIONS 1. To Had I Cauchy Codesatio Test. Exercise 1: Applicatio of the Cauchy Codesatio Test Use the Cauchy Codesatio Test to prove that 1 diverges. Solutio 1. Give the series
More information4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3
Exam Problems (x. Give the series (, fid the values of x for which this power series coverges. Also =0 state clearly what the radius of covergece is. We start by settig up the Ratio Test: x ( x x ( x x
More informationSequences I. Chapter Introduction
Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which
More informationDefinition An infinite sequence of numbers is an ordered set of real numbers.
Ifiite sequeces (Sect. 0. Today s Lecture: Review: Ifiite sequeces. The Cotiuous Fuctio Theorem for sequeces. Usig L Hôpital s rule o sequeces. Table of useful its. Bouded ad mootoic sequeces. Previous
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationMath 113 Exam 3 Practice
Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationMa 530 Introduction to Power Series
Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More informationACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory
1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.
More informationChapter 10: Power Series
Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More information2 Banach spaces and Hilbert spaces
2 Baach spaces ad Hilbert spaces Tryig to do aalysis i the ratioal umbers is difficult for example cosider the set {x Q : x 2 2}. This set is o-empty ad bouded above but does ot have a least upper boud
More informationd) If the sequence of partial sums converges to a limit L, we say that the series converges and its
Ifiite Series. Defiitios & covergece Defiitio... Let {a } be a sequece of real umbers. a) A expressio of the form a + a +... + a +... is called a ifiite series. b) The umber a is called as the th term
More informationMa 530 Infinite Series I
Ma 50 Ifiite Series I Please ote that i additio to the material below this lecture icorporated material from the Visual Calculus web site. The material o sequeces is at Visual Sequeces. (To use this li
More information10.6 ALTERNATING SERIES
0.6 Alteratig Series Cotemporary Calculus 0.6 ALTERNATING SERIES I the last two sectios we cosidered tests for the covergece of series whose terms were all positive. I this sectio we examie series whose
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationTopics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.
MATH 301 Itroductio to Aalysis Chapter Four Sequeces Topics 1. Defiitio of covergece of sequeces. 2. Fidig ad provig the limit of sequeces. 3. Bouded covergece theorem: Theorem 4.1.8. 4. Theorems 4.1.13
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationArkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan
Arkasas Tech Uiversity MATH 94: Calculus II Dr Marcel B Fia 85 Power Series Let {a } =0 be a sequece of umbers The a power series about x = a is a series of the form a (x a) = a 0 + a (x a) + a (x a) +
More informationMA541 : Real Analysis. Tutorial and Practice Problems - 1 Hints and Solutions
MA54 : Real Aalysis Tutorial ad Practice Problems - Hits ad Solutios. Suppose that S is a oempty subset of real umbers that is bouded (i.e. bouded above as well as below). Prove that if S sup S. What ca
More information1+x 1 + α+x. x = 2(α x2 ) 1+x
Math 2030 Homework 6 Solutios # [Problem 5] For coveiece we let α lim sup a ad β lim sup b. Without loss of geerality let us assume that α β. If α the by assumptio β < so i this case α + β. By Theorem
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS
MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak
More informationRead carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.
THE UNIVERSITY OF WARWICK FIRST YEAR EXAMINATION: Jauary 2009 Aalysis I Time Allowed:.5 hours Read carefully the istructios o the aswer book ad make sure that the particulars required are etered o each
More informationStochastic Matrices in a Finite Field
Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices
More informationProblem Cosider the curve give parametrically as x = si t ad y = + cos t for» t» ß: (a) Describe the path this traverses: Where does it start (whe t =
Mathematics Summer Wilso Fial Exam August 8, ANSWERS Problem 1 (a) Fid the solutio to y +x y = e x x that satisfies y() = 5 : This is already i the form we used for a first order liear differetial equatio,
More informationRandomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)
Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black
More informationThe Ratio Test. THEOREM 9.17 Ratio Test Let a n be a series with nonzero terms. 1. a. n converges absolutely if lim. n 1
460_0906.qxd //04 :8 PM Page 69 SECTION 9.6 The Ratio ad Root Tests 69 Sectio 9.6 EXPLORATION Writig a Series Oe of the followig coditios guaratees that a series will diverge, two coditios guaratee that
More informationMATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and
MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More informationMATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1
MATH 2: HOMEWORK 6 SOLUTIONS CA PRO JIRADILOK Problem. If s = 2, ad Problem : Rudi, Chapter 3, Problem 3. s + = 2 + s ( =, 2, 3,... ), prove that {s } coverges, ad that s < 2 for =, 2, 3,.... Proof. The
More informationMath 113, Calculus II Winter 2007 Final Exam Solutions
Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this
More informationAlternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.
0_0905.qxd //0 :7 PM Page SECTION 9.5 Alteratig Series Sectio 9.5 Alteratig Series Use the Alteratig Series Test to determie whether a ifiite series coverges. Use the Alteratig Series Remaider to approximate
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationPROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.
Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6
More informationE. Incorrect! Plug n = 1, 2, 3, & 4 into the general term formula. n =, then the first four terms are found by
Calculus II - Problem Solvig Drill 8: Sequeces, Series, ad Covergece Questio No. of 0. Fid the first four terms of the sequece whose geeral term is give by a ( ) : Questio #0 (A) (B) (C) (D) (E) 8,,, 4
More informationMath 116 Practice for Exam 3
Math 6 Practice for Exam Geerated October 0, 207 Name: SOLUTIONS Istructor: Sectio Number:. This exam has 7 questios. Note that the problems are ot of equal difficulty, so you may wat to skip over ad retur
More information3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials
Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered
More informationA 2nTH ORDER LINEAR DIFFERENCE EQUATION
A 2TH ORDER LINEAR DIFFERENCE EQUATION Doug Aderso Departmet of Mathematics ad Computer Sciece, Cocordia College Moorhead, MN 56562, USA ABSTRACT: We give a formulatio of geeralized zeros ad (, )-discojugacy
More informationPart A, for both Section 200 and Section 501
Istructios Please write your solutios o your ow paper. These problems should be treated as essay questios. A problem that says give a example or determie requires a supportig explaatio. I all problems,
More informationSolutions to Tutorial 3 (Week 4)
The Uiversity of Sydey School of Mathematics ad Statistics Solutios to Tutorial Week 4 MATH2962: Real ad Complex Aalysis Advaced Semester 1, 2017 Web Page: http://www.maths.usyd.edu.au/u/ug/im/math2962/
More informationCHAPTER 1 SEQUENCES AND INFINITE SERIES
CHAPTER SEQUENCES AND INFINITE SERIES SEQUENCES AND INFINITE SERIES (0 meetigs) Sequeces ad limit of a sequece Mootoic ad bouded sequece Ifiite series of costat terms Ifiite series of positive terms Alteratig
More informationINFINITE SEQUENCES AND SERIES
INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is
More informationMath 104: Homework 2 solutions
Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does
More informationLecture 10 October Minimaxity and least favorable prior sequences
STATS 300A: Theory of Statistics Fall 205 Lecture 0 October 22 Lecturer: Lester Mackey Scribe: Brya He, Rahul Makhijai Warig: These otes may cotai factual ad/or typographic errors. 0. Miimaxity ad least
More informationChapter 2 The Solution of Numerical Algebraic and Transcendental Equations
Chapter The Solutio of Numerical Algebraic ad Trascedetal Equatios Itroductio I this chapter we shall discuss some umerical methods for solvig algebraic ad trascedetal equatios. The equatio f( is said
More informationMA131 - Analysis 1. Workbook 9 Series III
MA3 - Aalysis Workbook 9 Series III Autum 004 Cotets 4.4 Series with Positive ad Negative Terms.............. 4.5 Alteratig Series.......................... 4.6 Geeral Series.............................
More informationSequence A sequence is a function whose domain of definition is the set of natural numbers.
Chapter Sequeces Course Title: Real Aalysis Course Code: MTH3 Course istructor: Dr Atiq ur Rehma Class: MSc-I Course URL: wwwmathcityorg/atiq/fa8-mth3 Sequeces form a importat compoet of Mathematical Aalysis
More informationMath 299 Supplement: Real Analysis Nov 2013
Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality
More informationis also known as the general term of the sequence
Lesso : Sequeces ad Series Outlie Objectives: I ca determie whether a sequece has a patter. I ca determie whether a sequece ca be geeralized to fid a formula for the geeral term i the sequece. I ca determie
More informationNUMERICAL METHODS FOR SOLVING EQUATIONS
Mathematics Revisio Guides Numerical Methods for Solvig Equatios Page 1 of 11 M.K. HOME TUITION Mathematics Revisio Guides Level: GCSE Higher Tier NUMERICAL METHODS FOR SOLVING EQUATIONS Versio:. Date:
More informationMulti parameter proximal point algorithms
Multi parameter proximal poit algorithms Ogaeditse A. Boikayo a,b,, Gheorghe Moroşau a a Departmet of Mathematics ad its Applicatios Cetral Europea Uiversity Nador u. 9, H-1051 Budapest, Hugary b Departmet
More informationThe Gamma function Michael Taylor. Abstract. This material is excerpted from 18 and Appendix J of [T].
The Gamma fuctio Michael Taylor Abstract. This material is excerpted from 8 ad Appedix J of [T]. The Gamma fuctio has bee previewed i 5.7 5.8, arisig i the computatio of a atural Laplace trasform: 8. ft
More information17. Joint distributions of extreme order statistics Lehmann 5.1; Ferguson 15
17. Joit distributios of extreme order statistics Lehma 5.1; Ferguso 15 I Example 10., we derived the asymptotic distributio of the maximum from a radom sample from a uiform distributio. We did this usig
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More informationk-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction
Acta Math. Uiv. Comeiaae Vol. LXXXVI, 2 (2017), pp. 279 286 279 k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c N. IRMAK ad M. ALP Abstract. The k-geeralized Fiboacci sequece { F (k)
More informationMetric Space Properties
Metric Space Properties Math 40 Fial Project Preseted by: Michael Brow, Alex Cordova, ad Alyssa Sachez We have already poited out ad will recogize throughout this book the importace of compact sets. All
More information7 Sequences of real numbers
40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are
More informationb i u x i U a i j u x i u x j
M ath 5 2 7 Fall 2 0 0 9 L ecture 1 9 N ov. 1 6, 2 0 0 9 ) S ecod- Order Elliptic Equatios: Weak S olutios 1. Defiitios. I this ad the followig two lectures we will study the boudary value problem Here
More informationn=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n
Series. Defiitios ad first properties A series is a ifiite sum a + a + a +..., deoted i short by a. The sequece of partial sums of the series a is the sequece s ) defied by s = a k = a +... + a,. k= Defiitio
More informationUniversity of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!
Uiversity of Colorado Dever Dept. Math. & Stat. Scieces Applied Aalysis Prelimiary Exam 13 Jauary 01, 10:00 am :00 pm Name: The proctor will let you read the followig coditios before the exam begis, ad
More informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
More information2.4.2 A Theorem About Absolutely Convergent Series
0 Versio of August 27, 200 CHAPTER 2. INFINITE SERIES Add these two series: + 3 2 + 5 + 7 4 + 9 + 6 +... = 3 l 2. (2.20) 2 Sice the reciprocal of each iteger occurs exactly oce i the last series, we would
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013 Large Deviatios for i.i.d. Radom Variables Cotet. Cheroff boud usig expoetial momet geeratig fuctios. Properties of a momet
More information1 Lecture 2: Sequence, Series and power series (8/14/2012)
Summer Jump-Start Program for Aalysis, 202 Sog-Yig Li Lecture 2: Sequece, Series ad power series (8/4/202). More o sequeces Example.. Let {x } ad {y } be two bouded sequeces. Show lim sup (x + y ) lim
More informationMath 116 Practice for Exam 3
Math 6 Practice for Eam 3 Geerated April 4, 26 Name: SOLUTIONS Istructor: Sectio Number:. This eam has questios. Note that the problems are ot of equal difficulty, so you may wat to skip over ad retur
More informationSOLUTIONS TO EXAM 3. Solution: Note that this defines two convergent geometric series with respective radii r 1 = 2/5 < 1 and r 2 = 1/5 < 1.
SOLUTIONS TO EXAM 3 Problem Fid the sum of the followig series 2 + ( ) 5 5 2 5 3 25 2 2 This series diverges Solutio: Note that this defies two coverget geometric series with respective radii r 2/5 < ad
More informationSection 11.6 Absolute and Conditional Convergence, Root and Ratio Tests
Sectio.6 Absolute ad Coditioal Covergece, Root ad Ratio Tests I this chapter we have see several examples of covergece tests that oly apply to series whose terms are oegative. I this sectio, we will lear
More informationThe Riemann Zeta Function
Physics 6A Witer 6 The Riema Zeta Fuctio I this ote, I will sketch some of the mai properties of the Riema zeta fuctio, ζ(x). For x >, we defie ζ(x) =, x >. () x = For x, this sum diverges. However, we
More informationMachine Learning for Data Science (CS 4786)
Machie Learig for Data Sciece CS 4786) Lecture & 3: Pricipal Compoet Aalysis The text i black outlies high level ideas. The text i blue provides simple mathematical details to derive or get to the algorithm
More informationMath 113 Exam 4 Practice
Math Exam 4 Practice Exam 4 will cover.-.. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for
More informationSection 1 of Unit 03 (Pure Mathematics 3) Algebra
Sectio 1 of Uit 0 (Pure Mathematics ) Algebra Recommeded Prior Kowledge Studets should have studied the algebraic techiques i Pure Mathematics 1. Cotet This Sectio should be studied early i the course
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationLinear Regression Demystified
Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to
More informationLecture 7: October 18, 2017
Iformatio ad Codig Theory Autum 207 Lecturer: Madhur Tulsiai Lecture 7: October 8, 207 Biary hypothesis testig I this lecture, we apply the tools developed i the past few lectures to uderstad the problem
More informationOn the Variations of Some Well Known Fixed Point Theorem in Metric Spaces
Turkish Joural of Aalysis ad Number Theory, 205, Vol 3, No 2, 70-74 Available olie at http://pubssciepubcom/tjat/3/2/7 Sciece ad Educatio Publishig DOI:0269/tjat-3-2-7 O the Variatios of Some Well Kow
More informationFall 2013 MTH431/531 Real analysis Section Notes
Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters
More information