Gibbs Phenomenon for Wavelets

Size: px
Start display at page:

Download "Gibbs Phenomenon for Wavelets"

Transcription

1 APPLIED AND COMPUTATIONAL HAMONIC ANALYSIS 3, (1996) ATICLE NO. 6 Gibbs Phenoenon for Wavelets Susan E. Kelly 1 Departent of Matheatics, University of Wisconsin La Crosse, La Crosse, Wisconsin 5461 Counicated by Wolfgang Dahen eceived March 4, 1994; revised May 25, 1995 When a Fourier series is used to approxiate a function with a jup discontinuity, an overshoot at the discontinuity occurs. This phenoenon was noticed by Michelson [6] and explained by Gibbs [3] in This phenoenon is known as the Gibbs effect. In this paper, possible Gibbs effects will be looked at for wavelet expansions of functions at points with jup discontinuities. Certain conditions on the size of the wavelet kernel will be exained to deterine if a Gibbs effect occurs and what agnitude it is. An if and only if condition for the existence of a Gibbs effect is presented, and this condition is used to prove existence of Gibbs effects for soe copactly supported wavelets. Since wavelets are not translation invariant, effects of a discontinuity will depend on its location. Also, coputer estiates on the sizes of the overshoots and undershoots were coputed for soe copactly supported wavelets with sall support. c 1996 Acadeic Press, Inc. 1. GIBBS PHENOMENON FO FOUIE SEIES To illustrate what is happening in the Gibbs effect, let us exaine the partial sus of a Fourier series. Let g(x) be a periodic, piecewise sooth function with a jup discontinuity at x. For any fixed x 1, not equal to x, the partial sus of g(x) at x 1 approach g(x 1 ). That is, if s n is the partial su of g, then s n(x 1 )g(x 1 ). n However, if x is allowed to approach the discontinuity as the partial sus are taken to the it, an overshoot, or undershoot, ay occur. That is, are possible. This overshoot, or undershoot, is called the Gibbs phenoenon. Proposition 1.1 Let f be a function of bounded variation, 2π-periodic function. At each jup discontinuity x of f, the Fourier series for f will overshoot (undershoot) f(x + ) and undershoot (overshoot) f(x ) if f(x + ) f(x ) is positive (negative). The overshoot and undershoot will be approxiately 9% of the agnitude of the jup f(x + ) f(x ). For further details for the Fourier series, see [8]. 2. GENEAL WAVELET STUCTUE AND COMPACTLY SUPPOTED WAVELETS A general structure, called a ultiresolution analysis, for wavelet bases in L 2 () was described by Mallat [5]. Let V 2 V 1 V V 1 V 2 be a faily of of closed subspaces in L 2 () V {}, V L 2 (), Z Z f V f(2 ) V +1, and there is a φ V such that {φ,n } is an orthonoral basis of V, φ,n (x) 2 /2 φ(2 x n). (1) and n xn x + s n (x n ) g(x + ) Define W such that V +1 V W. Thus, L 2 () W. Then there exists a ψ W such that {ψ,n } is an orthonoral basis of W, and {ψ,n }, is a wavelet basis of L 2 (), 1 E-ail: kelly@ath.uwlax.edu. n s n (x n ) g(x ) xn x ψ,n (x) 2 /2 ψ(2 x n). (2) The function φ is called the scaling function, and ψ is called the other function /96 $12. Copyright c 1996 by Acadeic Press, Inc. All rights of reproduction in any for reserved.

2 GIBBS PHENOMENON 73 Two special sus will be used in this paper. For f L 2 (), the projection ap of L 2 () onto V is : L 2 () V defined by f(x) 1 j ψ j,k ψ j,k (x) k f, f, φ,n φ,n (x), and Π f(x) will be called a dyadic su of f. Also, a general partial su of f will be defined by a projection of L 2 () into V +1, naely, is defined by S lσ f(x) 1 j k S lσ : L 2 () V +1 f, ψ j,k ψ j,k (x) + l f, ψ,σ(k) ψ,σ(k) (x), {σ(k)} l k is a set of l +1distinct integers. Copactly supported wavelets will be used to illustrate the Gibbs effect. The basic structure and properties needed for this paper are provided below. Further details can be found in Daubechies s paper [1]. Based on a decoposition and reconstruction algorith of Mallat which utilizes wavelet s ultiresolution analysis structure, Daubechies extracted the necessary conditions for constructing wavelets fro a sequence of nubers {h(n)} without reference to a ultiresolution analysis. Proposition 2.1. Define (ξ) (1/ 2) h(n)e inξ, the h(n) s satisfy h(n) n ɛ < for soe ɛ>, (3) and k h(n) 2, (4), k h(n)h(n +2k)δ,k. (5) 1,k Also, (ξ) can be written in the following for: (ξ) [ 1 (1 + N )] 2 e iξ F(ξ),N Z+, with F(ξ) f(n)e inξ, f(n) n ɛ < for soe ɛ>, (6) and sup F(ξ) < 2 N 1. (7) ξ Then define g(n) ( 1) n h( n +1), and let ˆφ(ξ) Π j1 (2 j ξ), η l (x) 2 h(n)η l 1 (2x n) φ(x) l η l(x), (8) and η (x) χ [ 1 2,1 2 ) (x). (9) Also, define ψ(x) 2 ( 1) n h( n+1)φ(2x n). Then, the set of φ,n (x) 2 /2 φ(2 x n) defines a ultiresolution analysis, and the {ψ,n (x)}, is the associated wavelet basis. eark. Condition (3) guarantees that ˆφ is well defined; (4) akes φ(x) dx 1; (5) gives the orthonorality to the {φ,n }; and (6) and (7) ensure that φ is continuous. Note that if N 1and F(ξ) 1in the above proposition, then φ(x) χ [,1) (x), and one gets the Haar syste. In this case, the continuity condition (7) fails. Daubechies showed that φ(x) and ψ(x) have copact support if and only if only a finite nuber of the h(n) s in Proposition (2.1) are nonzero. The following definition of Daubechies will be used in the following sections. Definition 2.2. Let N φ and N ψ be the function defined by {h(n)} satisfying the conditions of Theore (2.1), h(n) for n<and n>2n 1,h() and h(2n 1). With these assuptions, the support size of N φ can be deterined. Proposition 2.3. The sallest interval which contains the support of N φ is [, 2N 1]. eark. In this paper, the fact that this is the sallest such interval is needed. A proof of this was not provided in [1], so a proof of this will be provided here. Proof. Fro (8), it follows that the supp N φ [, 2N 1]. It is left to show that this interval is the sallest such interval. Clai: There does not exist an ɛ>such that Nφ [,ɛ]. Assue there does exist such an ɛ, and let ɛ be the largest such ɛ; a largest ust exist since N φ is continuous. By (8), Nφ(x) 2N 1 2 h(n) N φ(2x n), (1) and for x in(ɛ, 1/2+ɛ /2), N φ(x) 2h()φ(2x). (11)

3 74 SUSAN E. KELLY Since h(), (11) iplies that φ(x) for x in(2ɛ, 1+ɛ ). This violates the axiality of ɛ, hence there does not exist such an ɛ and the clai is true. To show that there does not exist an ɛ>such that Nφ [2N 1 ɛ,2n 1], the sae procedure can be carried out, using x 2N 1 in(ɛ, 1/2 +ɛ /2) in (1) and using the fact that h(2n 1). 3. GIBBS PHENOMENON AT THE OIGIN To study the Gibbs effect of functions of bounded variation with a jup discontinuity at zero, it suffices to look at wavelet expansions of the function 1 x, 1 x< f(x) 1 x, <x 1 (12), else since other functions with a jup discontinuity at zero can be written in ters of f plus a function which is continuous at the origin A General Forula for Dyadic Sus We first restrict attention to the study of dyadic su wavelet expansions of f(x) : L p () V f(x) f(y)k (x, y) dy (13) The absolute value of the arguent of the integral is bounded by K (a, u) + K (a, u), which is an integrable function because of the rate of decay of wavelets. Also, the it of this arguent as tends to infinity is χ [, ) (u){k (a, u) K (a, u)}. Thus, applying the Doinated Convergence Theore to (14), one has Π f(2 a) {K (a, u) K (a, u)} du 2 K (a, u) du 1, since integrating the kernel over all reals is one. eark. If instead of choosing a as a fixed nuber, we had a sequence 2 a, there would be two possibilities: If a, then we would end up with Eq. (15) with a, and we would have the sae expression as if we had chosen a.ifa, since 2 a ust tend to zero, a ust tend to infinity slower than 2. Thus, because of the decay conditions of φ, the expression of Eq. (14) would tend to zero, and there would be no overshoot. This explains our choice of x 2 a. The following theore has now been obtained. Theore 3.1. For f defined in (12), a and using the notation of (13) f(2 a)2 K (a, u) du 1. (15) Thus, studying a Gibbs phenoenon reduces to looking at the above integral of the wavelet kernel. Specifically, a Gibbs effect occurs near the origin if and only if K (x, y) φ,n (x)φ,n (y), and φ is the scaling function. Now, 1 f(x) ( 1 y)k (x, y) dy + (1 y)k (x, y) dy 1 χ [,2 ] (u)(1 2 u){k (2 x, u) and (or) K (a, u) du > 1, for soe a > K (a, u) du <, for soe a<. K (2 x, u)} du. Since what is of interest is the region about the origin as tends to infinity, x will be set to 2 a, a isafixed real nuber (see reark below). The above expression then becoes f(2 a) χ [,2 ] (u)(1 2 u){k (a, u) K (a, u)} du. (14) A siilar result was proved independently by Goes and Cortina [4] for a ore general class of expansions. So far, results pertain to all wavelets. We will now look at wavelets which have copact support. It is easy to see fro Theore (3.1) that for the Haar syste, φ(x) χ [,1) (x), there is no Gibbs effect at the origin. The existence of a Gibbs effect near the origin for wavelet expansions of f can be proved for certain copactly supported wavelets using the following result. Theore 3.2. A Gibbs phenoenon for a dyadic wavelet expansion of f(x) generated by the function N φ, defined in Definition (2.2), occurs at the right hand side of

4 GIBBS PHENOMENON 75 f(x) if and only if there exists an a>such that 1 2 Nφ(a +1) Nφ(t)dt + N φ(a +2) Nφ(t)dt + since Nφ(t) dt 1, Nφ(t)dt 1 (19) + N φ(a+()) Nφ(t) dt <. (16) Proof. Fro Theore (3.1), there exists a Gibbs effect at the right hand side of the origin if and only if there exists an a>such that ( ) K (a, u) du > 1 K (a, u) du. (17) Since the support of N φ is contained in [, 2N 1] and the integral of N φ over the reals is one, (17) reduces to finding an a>such that n Nφ(a + n) > n Nφ(t) dt Nφ(a + n) Nφ(t) dt. (18) Subtracting the appropriate ters of (18) yields (16). Thus, the theore is proved. To prove the existence of a Gibbs effect for soe copactly supported wavelets the following technical leas will be needed. Lea 3.3. For N φ, N > 2,h()+h(2N 1) 2. Proof. Assue the Lea is false and h(2n 2) + h(2n 1) 2. That would iply that h 2 (2N 2) + 2h(2N 2)h(2N 1) + h 2 (2N 1)2. Equation (5) iplies that the su of the first and last ter is less than or equal to 1. Thus, h(2n 2)h(2N 1) 1 2, which by the assuption of the proof can be rewritten as [ h(2n 1) 1 2 ] 2. This stateent is only true if h(2n 1)1/ 2. By the assuption, this iplies that h()1/ 2and then by Eq. (5), h(n) would have to be zero for N 2N 3. This last stateent is false since h(), fro the construction requireents for these wavelets. Hence, the assuption in the proof is false and the Lea is proved. Lea 3.4. For N φ, N > 2, there exists a positive integer n<2n 1such that n Nφ(t) dt. Proof. Assue that the lea is false; that is, assue that n Nφ(t) dt for all integers n<2n 1. Then, and k k 1 Nφ(t) dt for k,...,. (2) Using Eq. (19) and (2), and integrating Eq. (1) over [2N 2, 2N 1], one obtains 1 Nφ(t)dt { 2 h(2n 2) + h(2n 1) { 2 Nφ(2t (2N 2)) dt } Nφ(2t (2N 1)) dt h(2n 2) Nφ(t) dt 2 } 2N 1 + h(2n 1) Nφ(t) dt 2N 3 2 {h(2n 2) + h(2n 1)}. 2 Thus, h()+h(2n 1) 2, which is false by Lea (3.3). The assuption ade in the proof is incorrect, and the lea is true. The following result can now be proved. Theore 3.5. If h(2n 1) <, then there exists a Gibbs phenoenon on the right hand side of the origin for the dyadic su wavelet expansion of f(x) generated by N φ. Proof. Letting n be the sallest integer to satisfy Lea (3.4), equation (16) reduces to looking for an a> such that n n+1 Nφ(a + n) Nφ(t) dt + N φ(a +(n+1)) Nφ(t) dt + + N φ(a+()) Nφ(t) dt <. (21) To siplify the above expression, a can be chosen such that 2N 2 a+n<2n 1. Then, Eq. (21) reduces to Nφ(a + n) n Nφ(t) dt <. (22) By the assuption on n, n Nφ(t) dt, and (22) can be verified if two nubers x 1,x 2 [2N 2, 2N 1] can be found such that N φ(x 1 ) and N φ(x 2 ) have opposite signs.

5 76 SUSAN E. KELLY Choose x 1 2N 1.5 such that N φ(x 1 ). Then, Nφ(x 1 ) 2h(2N 1) N φ(2x 1 (2N 1)). Since h(2n 1) <, letting x 2 2x 1 (2N 1), the needed nubers x 1 and x 2 have been found. The theore is now proved. The question now is for what values of N is h(2n 1) negative? To answer this question, we need to look at Daubechies s construction of her copactly supported wavelets, [1]. In Section 4C of her paper, Daubechies defines a specific faily of copactly supported wavelets. The coefficients, h(n) of N φ satisfy the following condition N 1 N 1 2N 1 [1/2(1 + e iξ )] N q(n)e inξ 2 1/2 h(n)e inξ, (23) q(n)e inξ 2 N 1 ( N 1+n n )[ ] n 4 (eiξ + e iξ ). (24) See [1] for details. In Eq. (24), the highest exponential ter on the left hand side is q(n 1)q()e i(n 1)ξ, and on the right hand side, the coefficient on e i(n 1)ξ is negative when N is even. Thus, for N even, q() and q(n 1) have opposite signs. In looking at the lowest and highest exponential ters in (23), we see that h() and h(2n 1) have the sae signs as q() and q(n 1) respectively. Thus, when N is even, h() and h(2n 1) have opposite signs. Since the coefficients can be reversed without effecting the wavelet properties, we can choose h() to be positive, as done in [1]. Thus, h(2n 1) is negative, and we can use Theore (3.5) to get the following result. Corollary 3.6. If N is even, then there exists a Gibbs phenoenon on the right hand side of the origin for the dyadic su wavelet expansion of f(x) generated by N φ. eark. In [1], the coefficients h(n) were listed for the copactly supported wavelets N 2,3,...1 and it can be seen that h() and h(2n 1) do not have opposite signs for the odd N wavelets listed. eark. The proofs for these arguents have only worked for Gibbs effects on the right hand side of the discontinuity. To illustrate why this arguent does not work for the left hand side, we can exaine the wavelets generated by 2 φ and we would need to show that K (a, u) du <, K (a, u) k Z 2φ(a+ k) 2 φ(u+k). Since the support of 2 φ is in [, 3], our work siplifies to showing that 2 φ(a +1) 3 1 2φ(t)dt + 2 φ(a + 2) 3 2 2φ(t) dt <. Using the arguent of the above proof, we would restrict a between 2 and 1 and wish to show 2φ(a +2) 3 2 2φ(t)dt < by showing that the integral is nonzero and that 2 φ(a 1 +2) and 2 φ(a 2 +2) have opposite signs for soe a 1 and a 2 in ( 2, 1). This can not be done with arguents used above. In fact, on the interval (, 1), 2φ does not change sign; this can be seen in Daubechies s paper [1]. In the nuerical estiates of Gibbs effects which follow, Gibbs effects were observed on the left hand side, but the author has been unable to prove the existence. Theore (3.1) has been used to prove the existence of a Gibbs phenoenon. Now, sizes of Gibbs effects for soe of Daubechies copactly supported wavelets will be approxiated by values obtained in FOTAN progras based on Theore (3.1). It is first necessary to deterine a possible Gibbs phenoenon could occur. To do this, Theore (3.1) will be used to deterine a Gibbs effect could not occur for copactly supported wavelets. Let K (a, u) For a>, when is K (a, u) du 1 Nφ(a+n) N φ(u+n). ( ) K (a, u) du true? Since the support of N φ is contained in [, 2N 1], Also, K (a, u) du K (a, u) du n n Nφ(a + n) n Nφ(a + n) (25) Nφ(t) dt. (26) Nφ(t) dt. The two above sus are equal if N φ(a + n) for n 1. This will at least be true if a +n 2N 1, and thus, (25) is satisfied when a. Thus, there is no Gibbs effect, as defined in Theore (3.1), for a for the wavelet expansion generated by N φ. Siilarly, for a<, a Gibbs effect will not occur if K (a, u) du. (27) As seen fro the su of this integral, Eq. (26), Eq. (27) is true if N φ(a + n) for 1 n. This is true if a + n, which iplies that there is no Gibbs effect for a (2N 2). Thus, in searching for a Gibbs effect of dyadic wavelet expansions of f generated by N φ, one only needs to exaine the region {2 a : a ( (2N 2), 2N 2)} as tends to infinity.

6 GIBBS PHENOMENON 77 The next step is to use coputer analysis to approxiate the value of the integral K (a, u) du for values of a in [ (2N 2), 2N 2]. Fro (8), N φ(x) will be approxiated by N η l (x) 2 2N 1 h(n) N η l 1 (2x n) for various values of l, N η (x) χ [ 1/2,1/2](x). Several values of l were used until little change was noted in the output and coputer tie ited going any further. esults fro this coputer analysis are approxiate, but they do give a good idea of the size of the Gibbs effect. For any expansion by copactly supported wavelets, the Gibbs phenoenon on each side of the origin ay differ because of the lack of syetry of these wavelets. This is reflected in the results given in Table 1. It can also be noted that the net Gibbs effect of both sides of the discontinuity sees to be decreasing with higher order wavelets. This agrees with work on periodic spline approxiations done by ichards [7]. He exained higher order splines in approxiating the function 1 1 x< g(x) 1 x<1 (28) in L 2 [ 1, 1]. ichard nuerically calculated the overshoot at g( + ) for splines of degree one through seven, and found that the overshoot was larger than that of the Fourier series. He conjectured that this overshoot approaches the Fourier overshoot as the order of the splines goes to infinity. In a later paper with Foster [2], this conjecture was proved A General Forula for Partial Sus For general wavelet expansions, again, f(x) will be defined as in (12), and S lσ f(x) is defined as its general partial su, S lσ f(x) G lσ (x, y) f(x)+ f(y)g lσ (x, y) dy l ψ,σ(k) (x)ψ,σ(k) (y). (29) k It follows as in the dyadic sus case that { } Slσ f(2 a) 2 K (a, u) du 1 { } + G lσ (a, u) du G lσ (a, u) du. Since ψ, the following result is obtained. Corollary 3.7. For f defined in (12), a, and using the notation of (29), Slσ f(2 a) 2 +2 K (a, u) du 1 G lσ (a, u) du f(2 a)+g lσ (a). The ter G lσ (a) gives the value of the it dependent on which additional ters are added to the dyadic su. The G lσ (a) ter could shift the peak of the Gibbs effect, and could also change the size of it. It is easy to see fro Corollary (3.7) that there is no Gibbs phenoenon for partial su Haar expansions of f. To exaine the addition of ore ters for copactly supported wavelets, let us begin by exaining our new ter. l G lσ (a) 2 Nφ(a + σ(k)) Nψ(t) dt. σ(k) k Since the support of N φ is [ N/2,N], as shown in ([1]), and Nψ(t) dt, σ(k) Nψ(t)dt iplies that N/2 < σ(k) <N, and G lσ (a) iplies that N/2 <a+σ(k)< N. Thus, in looking for values of G lσ (a), the only tie that a nonzero value is obtained is when N N/2 <a< N+N/2, and N/2 <σ(k)<n. For the wavelets generated by 2 φ, σ(k) and 1 are the only values of concern. To illustrate that there is a change in the Gibbs effect, one can exaine the case σ(k) is the only ter added. In this case, in looking at the value of G lσ (a) 2 2 ψ(a) 2ψ(t)dt, when a.99, the right hand Gibbs effect was observed in the nuerical coputations above, it can be seen fro values in [1] that TABLE 1 Approxiate Maxiu Overshoot and Undershoot for Dyadic Su Wavelet Expansions Π f(2 a) Generated by Nφ Left side of origin ight side of origin Nφ Nφ N η 1 a Π f(2 a) a Π f(2 a) 2φ 2η φ 3η φ 4η φ 5η

7 78 SUSAN E. KELLY this ter is nonzero. Thus, either the size of the Gibbs effect is changed, or the value a for which the axiu jup occurs ust be oved. To further look at this case, we shall investigate the nuerical values obtained on the coputer. Fro the above work, when σ(k), the values of 1 <a<2are of interest, and when σ(k) 1, the interval 2 <a<1is what needs to be exained. Thus, the coputer progras for this part will copute values for S lσ f(2 a) over the region 2 <a<2; this includes estiating the values for G lσ (a), σ(k) or 1 or both. esults are given in Table 2. In this case, the data suggests that adding additional ters in the partial su has lessened the Gibbs effect, but that the effect appears to occur in the sae location. 4. GIBBS PHENOMENON AT A GENEAL POINT Because of the translation and dilation procedure used to generate wavelets, wavelets are not translation invariant. With this fact, it is iportant to study Gibbs effects for wavelet expansions of functions with a discontinuity at a general point. We will work with the function (b+1) x, b < x (1 + b) g(x) f(x b) (b 1) x, b 1 x<b (3), else which has a discontinuity at the point b A General Forula for Dyadic Sus A dyadic su expansion for the function g, defined in (3) will now be found. : L p () V (31) g(x) g(y)k (x, y) dy b [(b 1) y]k (x, y) dy b 1 b+1 + [(b +1) y]k (x, y) dy b 2 b + [(b 1) 2 t]k (2 x, t) dt 2 (b 1) 2 (b+1) 2 b [(b +1) 2 t]k (2 x, t) dt. As tends to infinity, points close to b are of interest, so we will let x 2 a+b, a is a fixed real nuber. With soe changes of variables and cobining, one gets 2 g(2 a + b) (1 2 u){k (a +2 b, u +2 b) K (a+2 b, u +2 b)}du. (32) As approaches infinity, the 2 b ter in the arguent of the kernels causes soe difficulty. We want to reove the dependence in the kernels. Note that K (x, y) φ(x+n)φ(y+n) φ(x+n +n)φ(y+n +n), n is any integer. Thus, K (a +2 b, u+2 b)k (a+2 b [[2 b]],u+2 b [[2 b]]), [[x]] is the greatest integer less than or equal to x. Since, as varies, the value of 2 b [[2 b]] ay vary, we will restrict values to a set J such that this expression will be fixed for all in J. Ifbis a rational nuber, there will be a finite nuber of such sets of values; if b is irrational, there will be an infinite nuber of such sets and each will contain one value of. The notation used is the following: b J 2 b [[2 b]], for J. (33) Using the convention of (33), (32) becoes 2 g(2 a + b) (1 2 u){k (a + b J,u+b J ) K (a+b J, u+b J )}du for J. Since the dependence has been taken out of the above kernel s arguent, the it as tends to infinity TABLE 2 Approxiate Maxiu Overshoot and Undershoot for the General Partial Wavelet Sus S lσ f (2 a) Generated by 2 φ for Various Values of l and σ(k) ing lσ (a)( 2 φis Approxiated by 2 η 11 ) Left side of origin ight side of origin l σ(k) a S lσ f(2 a) a S lσ f(2 a) σ(1) σ(1) σ(1) σ(2)

8 GIBBS PHENOMENON 79 TABLE 3 Approxiate Maxiu Overshoot and Undershoot for Dyadic Su Wavelet Expansions Π g(2 a+b) Generated by 2 φ, Where b 1 3 ( 2φ Is Approxiated by 2 η 11 ) Left side of origin ight side of origin J a Π g(2 a + b) a Π g(2 a + b) Even Odd a a Coputer calculated nuber saller, but digits insignificant. can now be taken, as was done in Section 3.1. J g(2 a + b) {K (a+b J,u+b J ) K (a+b J, u+b J )}du b J bj K (a + b J,u)du K (a + b J,u)du. This yields a stateent ore general than that of Theore (3.1). Theore 4.1. If g is defined as in (3), a, and using the notation of (31), J g(2 a + b) 2 K (a+b J,u)du 1, b J 2 b [[2 b]] b J for J. eark. If b 2 k for soe integer k, then Theore (4.1) siplifies to the case b, which is Theore (3.1). Again, using Theore (4.1) it is easy to show that there is no Gibbs phenoenon in this case. The next exaples we look at are the copactly supported wavelets. Again, as done previously, it can be shown that in looking for a Gibbs phenoenon, the region that needs to be checked is (2N 1) <a<2n 1, a is the nuber fro Theore (4.1). Coputer coputations were done for the wavelet expansions of g generated by 2 φ, the point of discontinuity is b 1. In this case, b 3 J 1/3when J { : is even}, and b J 2 when J { : is odd}. The function 3 2φ was approxiated by 2 η 11, and the Gibbs phenoenon was checked for 3 <a<3. esults are given in Table A General Forula for Partial Sus The last type of expansion that will be looked at is general partial sus of a function with a jup discontinuity at any point. This can be done by looking at partial su of g. We will write, S lσ g(x) g(x)+ g(y)g lσ (x, y) dy, (34) G lσ (x, y) l ψ,σ(k) (x)ψ,σ(k) (y). k TABLE 4 Approxiate Maxiu Overshoot and Undershoot for General Partial Wavelet Sus J,, S lσ g(2 a+b) Generated by 2 φ, Where J { : Even} and b 1 3 ( 2φ Is Approxiated by 2 η 11 ) J l σ(n) a S lσ g a a S lσ g a Even Even 1 σ(1) Even 1 σ(1) Even 1 σ(1) Even 2 σ(1) 1 σ(2) Even 2 σ(1) 1 σ(2) Even 2 σ(1) σ(2) Even 3 σ(1) 1 σ(2) σ(3) a Stands for J, S lσ g(2 a + b).

9 8 SUSAN E. KELLY TABLE 5 Approxiate Maxiu Overshoot and Undershoot for General Partial Wavelet Sus J,, S lσ g(2 a+b) Generated by 2 φ, Where J { : Even} and b 1 3 ( 2φ Is Approxiated by 2 η 11 ) J l σ(n) a S lσ g a a S lσ g a Odd b Odd 1 σ(1) b Odd 1 σ(1) b Odd 1 σ(1) b Odd 2 σ(1) 1 σ(2) b Odd 2 σ(1) 1 σ(2) b Odd 2 σ(1) σ(2) b Odd 3 σ(1) 1 σ(2) σ(3) b a Stands for J,, S lσ g(2 a + b). b Last digits ay be insignificant. Siilar to the work done for Π g(2 a + b), and using the notation of Eq. (33), J g(y)g lσ (2 a + b, y) dy 2 b J bj b J G lσ (a + b J,u)du G lσ (a + b J,u)du G lσ (a + b J,u)du. This gives us the following corollary. Corollary 4.2. For g defined in (3), a, b, and using the notation of Eq. (34), J S lσ g(2 a + b) Π g(2 a + b)+gj,b(a), l,σ J GJ,b(a) l,σ 2 G lσ (a + b J,u)du. b J Again it can be verified that there is no Gibbs effect for the general partial Haar su expansion of a function with a jup discontinuity at any point. This shows that in all cases concerning the Haar syste, no Gibbs phenoenon occurs. For the specific case of 2 φ, nonzero GJ,b(a) l,σ ters ay occur for values of σ(k) equal to 1, and 1 and 3 <a< 3. This area for a is the sae area that was checked for a Gibbs phenoenon in the dyadic su case. The coputer progra for this part estiated the G l,σ J,b(a) ter for 3 < a<3,l,1,2or 3, σ(n) taking any one of the values 1,, and 1, and J being the set of odd or even values of. As with the dyadic case, b will be chosen to be 1 3. The results of the coputer estiates are given in Tables 4 and 5. This data sees to suggest that the size and the location of the axiu overshoot and undershoot ay vary with the addition of extra ters in a general partial su. In Section 3.2, the addition of extra ters to the dyadic su seeed to reduce the Gibbs effect. The results in this section see to show that the addition of ters can also increase the Gibbs phenoenon. Another point of interest occurs when J { : odd}. The value for a for the greatest undershoot appears to change. Both of these points appear to be true, but further analysis is needed here. The author hopes to get further details on the behavior of the Gibbs effect with additional ters in future work. To conclude, this paper has given an if and only if condition for a Gibbs phenoenon for wavelets. The existence of Gibbs effects has been deonstrated for soe copactly supported wavelets, and size estiates for Gibbs effects for soe copactly supported wavelets were found. ACKNOWLEDGMENTS The author thanks Dr. ichard ochberg and Dr. Mitchell Taibleson for their help as thesis advisors while working on ost of these results. EFEENCES 1. I. Daubechies, Orthonoral bases of copactly supported wavelets, Co. Pure Appl. Math XLI (1988), J. Foster and F. B. ichards, Gibbs Wilbraha Splines, Constr. Approx., to appear. 3. J. W. Gibbs, Letter to the editor, Nature 59 (1899), 66.

10 GIBBS PHENOMENON S. M. Goes and E. Cortina, Soe results on the convergence of sapling series based on convolution integrals, preprint 1992, SIAM J. Math. Anal., to appear. 5. S. Mallat, Multiresolution approxiations and wavelet orthonoral bases of L 2 (), Trans. Aer. Math. Soc. 315 No. 1, (1989), A. A. Michelson, Letter to the editor, Nature 58 (1898), F. B. ichards, A Gibbs phenoenon for spline functions, J. Approx. Theory, 66 (1991), A. Zygund, Trigonoetric Series, Cabridge Matheatical Library, 2nd ed., Cabridge Univ. Press, Cabridge, UK, 1959.

Rational Filter Wavelets*

Rational Filter Wavelets* Ž Journal of Matheatical Analysis and Applications 39, 744 1999 Article ID jaa19996550, available online at http:wwwidealibraryco on Rational Filter Wavelets* Kuang Zheng and Cui Minggen Departent of Matheatics,

More information

A Study on B-Spline Wavelets and Wavelet Packets

A Study on B-Spline Wavelets and Wavelet Packets Applied Matheatics 4 5 3-3 Published Online Noveber 4 in SciRes. http://www.scirp.org/ournal/a http://dx.doi.org/.436/a.4.5987 A Study on B-Spline Wavelets and Wavelet Pacets Sana Khan Mohaad Kaliuddin

More information

Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.

Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket. Generalized eigenfunctions and a Borel Theore on the Sierpinski Gasket. Kasso A. Okoudjou, Luke G. Rogers, and Robert S. Strichartz May 26, 2006 1 Introduction There is a well developed theory (see [5,

More information

Curious Bounds for Floor Function Sums

Curious Bounds for Floor Function Sums 1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International

More information

A := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint.

A := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint. 59 6. ABSTRACT MEASURE THEORY Having developed the Lebesgue integral with respect to the general easures, we now have a general concept with few specific exaples to actually test it on. Indeed, so far

More information

Biorthogonal Spline Type Wavelets

Biorthogonal Spline Type Wavelets PERGAMON Computers and Mathematics with Applications 0 (00 1 0 www.elsevier.com/locate/camwa Biorthogonal Spline Type Wavelets Tian-Xiao He Department of Mathematics and Computer Science Illinois Wesleyan

More information

Hermite s Rule Surpasses Simpson s: in Mathematics Curricula Simpson s Rule. Should be Replaced by Hermite s

Hermite s Rule Surpasses Simpson s: in Mathematics Curricula Simpson s Rule. Should be Replaced by Hermite s International Matheatical Foru, 4, 9, no. 34, 663-686 Herite s Rule Surpasses Sipson s: in Matheatics Curricula Sipson s Rule Should be Replaced by Herite s Vito Lapret University of Lublana Faculty of

More information

New upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.

New upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany. New upper bound for the B-spline basis condition nuber II. A proof of de Boor's 2 -conjecture K. Scherer Institut fur Angewandte Matheati, Universitat Bonn, 535 Bonn, Gerany and A. Yu. Shadrin Coputing

More information

Stability Ordinates of Adams Predictor-Corrector Methods

Stability Ordinates of Adams Predictor-Corrector Methods BIT anuscript No. will be inserted by the editor Stability Ordinates of Adas Predictor-Corrector Methods Michelle L. Ghrist Jonah A. Reeger Bengt Fornberg Received: date / Accepted: date Abstract How far

More information

Bernoulli Wavelet Based Numerical Method for Solving Fredholm Integral Equations of the Second Kind

Bernoulli Wavelet Based Numerical Method for Solving Fredholm Integral Equations of the Second Kind ISSN 746-7659, England, UK Journal of Inforation and Coputing Science Vol., No., 6, pp.-9 Bernoulli Wavelet Based Nuerical Method for Solving Fredhol Integral Equations of the Second Kind S. C. Shiralashetti*,

More information

arxiv: v1 [math.nt] 14 Sep 2014

arxiv: v1 [math.nt] 14 Sep 2014 ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row

More information

a a a a a a a m a b a b

a a a a a a a m a b a b Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice

More information

FAST DYNAMO ON THE REAL LINE

FAST DYNAMO ON THE REAL LINE FAST DYAMO O THE REAL LIE O. KOZLOVSKI & P. VYTOVA Abstract. In this paper we show that a piecewise expanding ap on the interval, extended to the real line by a non-expanding ap satisfying soe ild hypthesis

More information

The Weierstrass Approximation Theorem

The Weierstrass Approximation Theorem 36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined

More information

Necessity of low effective dimension

Necessity of low effective dimension Necessity of low effective diension Art B. Owen Stanford University October 2002, Orig: July 2002 Abstract Practitioners have long noticed that quasi-monte Carlo ethods work very well on functions that

More information

Closed-form evaluations of Fibonacci Lucas reciprocal sums with three factors

Closed-form evaluations of Fibonacci Lucas reciprocal sums with three factors Notes on Nuber Theory Discrete Matheatics Print ISSN 30-32 Online ISSN 2367-827 Vol. 23 207 No. 2 04 6 Closed-for evaluations of Fibonacci Lucas reciprocal sus with three factors Robert Frontczak Lesbank

More information

Feature Extraction Techniques

Feature Extraction Techniques Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that

More information

Numerically repeated support splitting and merging phenomena in a porous media equation with strong absorption. Kenji Tomoeda

Numerically repeated support splitting and merging phenomena in a porous media equation with strong absorption. Kenji Tomoeda Journal of Math-for-Industry, Vol. 3 (C-), pp. Nuerically repeated support splitting and erging phenoena in a porous edia equation with strong absorption To the eory of y friend Professor Nakaki. Kenji

More information

A Simple Regression Problem

A Simple Regression Problem A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where

More information

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN

More information

On Uniform Convergence of Sine and Cosine Series. under Generalized Difference Sequence of. p-supremum Bounded Variation Sequences

On Uniform Convergence of Sine and Cosine Series. under Generalized Difference Sequence of. p-supremum Bounded Variation Sequences International Journal of Matheatical Analysis Vol. 10, 2016, no. 6, 245-256 HIKARI Ltd, www.-hikari.co http://dx.doi.org/10.12988/ija.2016.510256 On Unifor Convergence of Sine and Cosine Series under Generalized

More information

M ath. Res. Lett. 15 (2008), no. 2, c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS. Van H. Vu. 1.

M ath. Res. Lett. 15 (2008), no. 2, c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS. Van H. Vu. 1. M ath. Res. Lett. 15 (2008), no. 2, 375 388 c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS Van H. Vu Abstract. Let F q be a finite field of order q and P be a polynoial in F q[x

More information

Perturbation on Polynomials

Perturbation on Polynomials Perturbation on Polynoials Isaila Diouf 1, Babacar Diakhaté 1 & Abdoul O Watt 2 1 Départeent Maths-Infos, Université Cheikh Anta Diop, Dakar, Senegal Journal of Matheatics Research; Vol 5, No 3; 2013 ISSN

More information

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential

More information

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,

More information

1 Bounding the Margin

1 Bounding the Margin COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost

More information

The degree of a typical vertex in generalized random intersection graph models

The degree of a typical vertex in generalized random intersection graph models Discrete Matheatics 306 006 15 165 www.elsevier.co/locate/disc The degree of a typical vertex in generalized rando intersection graph odels Jerzy Jaworski a, Michał Karoński a, Dudley Stark b a Departent

More information

A1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3

A1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3 A. Find all ordered pairs a, b) of positive integers for which a + b = 3 08. Answer. The six ordered pairs are 009, 08), 08, 009), 009 337, 674) = 35043, 674), 009 346, 673) = 3584, 673), 674, 009 337)

More information

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,

More information

Polygonal Designs: Existence and Construction

Polygonal Designs: Existence and Construction Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G

More information

When Short Runs Beat Long Runs

When Short Runs Beat Long Runs When Short Runs Beat Long Runs Sean Luke George Mason University http://www.cs.gu.edu/ sean/ Abstract What will yield the best results: doing one run n generations long or doing runs n/ generations long

More information

MA304 Differential Geometry

MA304 Differential Geometry MA304 Differential Geoetry Hoework 4 solutions Spring 018 6% of the final ark 1. The paraeterised curve αt = t cosh t for t R is called the catenary. Find the curvature of αt. Solution. Fro hoework question

More information

EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS

EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS Zhi-Wei Sun Departent of Matheatics, Nanjing University Nanjing 10093, People s Republic of China zwsun@nju.edu.cn Abstract In this paper we establish soe explicit

More information

The accelerated expansion of the universe is explained by quantum field theory.

The accelerated expansion of the universe is explained by quantum field theory. The accelerated expansion of the universe is explained by quantu field theory. Abstract. Forulas describing interactions, in fact, use the liiting speed of inforation transfer, and not the speed of light.

More information

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay

More information

1 Proof of learning bounds

1 Proof of learning bounds COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a

More information

Algebraic Montgomery-Yang problem: the log del Pezzo surface case

Algebraic Montgomery-Yang problem: the log del Pezzo surface case c 2014 The Matheatical Society of Japan J. Math. Soc. Japan Vol. 66, No. 4 (2014) pp. 1073 1089 doi: 10.2969/jsj/06641073 Algebraic Montgoery-Yang proble: the log del Pezzo surface case By DongSeon Hwang

More information

ON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS

ON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS Palestine Journal of Matheatics Vol 4) 05), 70 76 Palestine Polytechnic University-PPU 05 ON SEQUENCES OF NUMBERS IN GENERALIZED ARITHMETIC AND GEOMETRIC PROGRESSIONS Julius Fergy T Rabago Counicated by

More information

The Methods of Solution for Constrained Nonlinear Programming

The Methods of Solution for Constrained Nonlinear Programming Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 01-06 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.co The Methods of Solution for Constrained

More information

Note on generating all subsets of a finite set with disjoint unions

Note on generating all subsets of a finite set with disjoint unions Note on generating all subsets of a finite set with disjoint unions David Ellis e-ail: dce27@ca.ac.uk Subitted: Dec 2, 2008; Accepted: May 12, 2009; Published: May 20, 2009 Matheatics Subject Classification:

More information

APPROXIMATION BY MODIFIED SZÁSZ-MIRAKYAN OPERATORS

APPROXIMATION BY MODIFIED SZÁSZ-MIRAKYAN OPERATORS APPROXIMATION BY MODIFIED SZÁSZ-MIRAKYAN OPERATORS Received: 23 Deceber, 2008 Accepted: 28 May, 2009 Counicated by: L. REMPULSKA AND S. GRACZYK Institute of Matheatics Poznan University of Technology ul.

More information

arxiv: v1 [math.co] 19 Apr 2017

arxiv: v1 [math.co] 19 Apr 2017 PROOF OF CHAPOTON S CONJECTURE ON NEWTON POLYTOPES OF q-ehrhart POLYNOMIALS arxiv:1704.0561v1 [ath.co] 19 Apr 017 JANG SOO KIM AND U-KEUN SONG Abstract. Recently, Chapoton found a q-analog of Ehrhart polynoials,

More information

Infinitely Many Trees Have Non-Sperner Subtree Poset

Infinitely Many Trees Have Non-Sperner Subtree Poset Order (2007 24:133 138 DOI 10.1007/s11083-007-9064-2 Infinitely Many Trees Have Non-Sperner Subtree Poset Andrew Vince Hua Wang Received: 3 April 2007 / Accepted: 25 August 2007 / Published online: 2 October

More information

Computable Shell Decomposition Bounds

Computable Shell Decomposition Bounds Coputable Shell Decoposition Bounds John Langford TTI-Chicago jcl@cs.cu.edu David McAllester TTI-Chicago dac@autoreason.co Editor: Leslie Pack Kaelbling and David Cohn Abstract Haussler, Kearns, Seung

More information

Chapter 6 1-D Continuous Groups

Chapter 6 1-D Continuous Groups Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:

More information

Biostatistics Department Technical Report

Biostatistics Department Technical Report Biostatistics Departent Technical Report BST006-00 Estiation of Prevalence by Pool Screening With Equal Sized Pools and a egative Binoial Sapling Model Charles R. Katholi, Ph.D. Eeritus Professor Departent

More information

Chaotic Coupled Map Lattices

Chaotic Coupled Map Lattices Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each

More information

On the Navier Stokes equations

On the Navier Stokes equations On the Navier Stokes equations Daniel Thoas Hayes April 26, 2018 The proble on the existence and soothness of the Navier Stokes equations is resolved. 1. Proble description The Navier Stokes equations

More information

NON-COMMUTATIVE GRÖBNER BASES FOR COMMUTATIVE ALGEBRAS

NON-COMMUTATIVE GRÖBNER BASES FOR COMMUTATIVE ALGEBRAS PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volue 126, Nuber 3, March 1998, Pages 687 691 S 0002-9939(98)04229-4 NON-COMMUTATIVE GRÖBNER BASES FOR COMMUTATIVE ALGEBRAS DAVID EISENBUD, IRENA PEEVA,

More information

4 = (0.02) 3 13, = 0.25 because = 25. Simi-

4 = (0.02) 3 13, = 0.25 because = 25. Simi- Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =

More information

ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE

ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE CHRISTOPHER J. HILLAR Abstract. A long-standing conjecture asserts that the polynoial p(t = Tr(A + tb ] has nonnegative coefficients whenever is

More information

Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes

Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes Explicit solution of the polynoial least-squares approxiation proble on Chebyshev extrea nodes Alfredo Eisinberg, Giuseppe Fedele Dipartiento di Elettronica Inforatica e Sisteistica, Università degli Studi

More information

Sharp Time Data Tradeoffs for Linear Inverse Problems

Sharp Time Data Tradeoffs for Linear Inverse Problems Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used

More information

Fourier Series Summary (From Salivahanan et al, 2002)

Fourier Series Summary (From Salivahanan et al, 2002) Fourier Series Suary (Fro Salivahanan et al, ) A periodic continuous signal f(t), - < t

More information

THE SUPER CATALAN NUMBERS S(m, m + s) FOR s 3 AND SOME INTEGER FACTORIAL RATIOS. 1. Introduction. = (2n)!

THE SUPER CATALAN NUMBERS S(m, m + s) FOR s 3 AND SOME INTEGER FACTORIAL RATIOS. 1. Introduction. = (2n)! THE SUPER CATALAN NUMBERS S(, + s FOR s 3 AND SOME INTEGER FACTORIAL RATIOS XIN CHEN AND JANE WANG Abstract. We give a cobinatorial interpretation for the super Catalan nuber S(, + s for s 3 using lattice

More information

Distributed Subgradient Methods for Multi-agent Optimization

Distributed Subgradient Methods for Multi-agent Optimization 1 Distributed Subgradient Methods for Multi-agent Optiization Angelia Nedić and Asuan Ozdaglar October 29, 2007 Abstract We study a distributed coputation odel for optiizing a su of convex objective functions

More information

On the Use of A Priori Information for Sparse Signal Approximations

On the Use of A Priori Information for Sparse Signal Approximations ITS TECHNICAL REPORT NO. 3/4 On the Use of A Priori Inforation for Sparse Signal Approxiations Oscar Divorra Escoda, Lorenzo Granai and Pierre Vandergheynst Signal Processing Institute ITS) Ecole Polytechnique

More information

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone Characterization of the Line Coplexity of Cellular Autoata Generated by Polynoial Transition Rules Bertrand Stone Abstract Cellular autoata are discrete dynaical systes which consist of changing patterns

More information

arxiv: v2 [math.nt] 5 Sep 2012

arxiv: v2 [math.nt] 5 Sep 2012 ON STRONGER CONJECTURES THAT IMPLY THE ERDŐS-MOSER CONJECTURE BERND C. KELLNER arxiv:1003.1646v2 [ath.nt] 5 Sep 2012 Abstract. The Erdős-Moser conjecture states that the Diophantine equation S k () = k,

More information

Exponential sums and the distribution of inversive congruential pseudorandom numbers with prime-power modulus

Exponential sums and the distribution of inversive congruential pseudorandom numbers with prime-power modulus ACTA ARITHMETICA XCII1 (2000) Exponential sus and the distribution of inversive congruential pseudorando nubers with prie-power odulus by Harald Niederreiter (Vienna) and Igor E Shparlinski (Sydney) 1

More information

arxiv: v1 [math.pr] 17 May 2009

arxiv: v1 [math.pr] 17 May 2009 A strong law of large nubers for artingale arrays Yves F. Atchadé arxiv:0905.2761v1 [ath.pr] 17 May 2009 March 2009 Abstract: We prove a artingale triangular array generalization of the Chow-Birnbau- Marshall

More information

Construction of Biorthogonal B-spline Type Wavelet Sequences with Certain Regularities

Construction of Biorthogonal B-spline Type Wavelet Sequences with Certain Regularities Illinois Wesleyan University From the SelectedWorks of Tian-Xiao He 007 Construction of Biorthogonal B-spline Type Wavelet Sequences with Certain Regularities Tian-Xiao He, Illinois Wesleyan University

More information

Egyptian Mathematics Problem Set

Egyptian Mathematics Problem Set (Send corrections to cbruni@uwaterloo.ca) Egyptian Matheatics Proble Set (i) Use the Egyptian area of a circle A = (8d/9) 2 to copute the areas of the following circles with given diaeter. d = 2. d = 3

More information

An Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period

An Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period An Approxiate Model for the Theoretical Prediction of the Velocity... 77 Central European Journal of Energetic Materials, 205, 2(), 77-88 ISSN 2353-843 An Approxiate Model for the Theoretical Prediction

More information

arxiv: v1 [cs.ds] 3 Feb 2014

arxiv: v1 [cs.ds] 3 Feb 2014 arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/

More information

Lecture 21. Interior Point Methods Setup and Algorithm

Lecture 21. Interior Point Methods Setup and Algorithm Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and

More information

Bipartite subgraphs and the smallest eigenvalue

Bipartite subgraphs and the smallest eigenvalue Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.

More information

E0 370 Statistical Learning Theory Lecture 5 (Aug 25, 2011)

E0 370 Statistical Learning Theory Lecture 5 (Aug 25, 2011) E0 370 Statistical Learning Theory Lecture 5 Aug 5, 0 Covering Nubers, Pseudo-Diension, and Fat-Shattering Diension Lecturer: Shivani Agarwal Scribe: Shivani Agarwal Introduction So far we have seen how

More information

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths

More information

Physics 139B Solutions to Homework Set 3 Fall 2009

Physics 139B Solutions to Homework Set 3 Fall 2009 Physics 139B Solutions to Hoework Set 3 Fall 009 1. Consider a particle of ass attached to a rigid assless rod of fixed length R whose other end is fixed at the origin. The rod is free to rotate about

More information

A Bernstein-Markov Theorem for Normed Spaces

A Bernstein-Markov Theorem for Normed Spaces A Bernstein-Markov Theore for Nored Spaces Lawrence A. Harris Departent of Matheatics, University of Kentucky Lexington, Kentucky 40506-0027 Abstract Let X and Y be real nored linear spaces and let φ :

More information

DEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS

DEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS ISSN 1440-771X AUSTRALIA DEPARTMENT OF ECONOMETRICS AND BUSINESS STATISTICS An Iproved Method for Bandwidth Selection When Estiating ROC Curves Peter G Hall and Rob J Hyndan Working Paper 11/00 An iproved

More information

Introduction to Discrete Optimization

Introduction to Discrete Optimization Prof. Friedrich Eisenbrand Martin Nieeier Due Date: March 9 9 Discussions: March 9 Introduction to Discrete Optiization Spring 9 s Exercise Consider a school district with I neighborhoods J schools and

More information

The Transactional Nature of Quantum Information

The Transactional Nature of Quantum Information The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.

More information

On Conditions for Linearity of Optimal Estimation

On Conditions for Linearity of Optimal Estimation On Conditions for Linearity of Optial Estiation Erah Akyol, Kuar Viswanatha and Kenneth Rose {eakyol, kuar, rose}@ece.ucsb.edu Departent of Electrical and Coputer Engineering University of California at

More information

THE CONSTRUCTION OF GOOD EXTENSIBLE RANK-1 LATTICES. 1. Introduction We are interested in approximating a high dimensional integral [0,1]

THE CONSTRUCTION OF GOOD EXTENSIBLE RANK-1 LATTICES. 1. Introduction We are interested in approximating a high dimensional integral [0,1] MATHEMATICS OF COMPUTATION Volue 00, Nuber 0, Pages 000 000 S 0025-578(XX)0000-0 THE CONSTRUCTION OF GOOD EXTENSIBLE RANK- LATTICES JOSEF DICK, FRIEDRICH PILLICHSHAMMER, AND BENJAMIN J. WATERHOUSE Abstract.

More information

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds

More information

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and

More information

Computable Shell Decomposition Bounds

Computable Shell Decomposition Bounds Journal of Machine Learning Research 5 (2004) 529-547 Subitted 1/03; Revised 8/03; Published 5/04 Coputable Shell Decoposition Bounds John Langford David McAllester Toyota Technology Institute at Chicago

More information

THE POLYNOMIAL REPRESENTATION OF THE TYPE A n 1 RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n

THE POLYNOMIAL REPRESENTATION OF THE TYPE A n 1 RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n THE POLYNOMIAL REPRESENTATION OF THE TYPE A n RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n SHEELA DEVADAS AND YI SUN Abstract. We study the polynoial representation of the rational Cherednik algebra

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and This article appeared in a ournal published by Elsevier. The attached copy is furnished to the author for internal non-coercial research and education use, including for instruction at the authors institution

More information

Computational and Statistical Learning Theory

Computational and Statistical Learning Theory Coputational and Statistical Learning Theory Proble sets 5 and 6 Due: Noveber th Please send your solutions to learning-subissions@ttic.edu Notations/Definitions Recall the definition of saple based Radeacher

More information

Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.

Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J. Probability and Stochastic Processes: A Friendly Introduction for Electrical and oputer Engineers Roy D. Yates and David J. Goodan Proble Solutions : Yates and Goodan,1..3 1.3.1 1.4.6 1.4.7 1.4.8 1..6

More information

An l 1 Regularized Method for Numerical Differentiation Using Empirical Eigenfunctions

An l 1 Regularized Method for Numerical Differentiation Using Empirical Eigenfunctions Journal of Matheatical Research with Applications Jul., 207, Vol. 37, No. 4, pp. 496 504 DOI:0.3770/j.issn:2095-265.207.04.0 Http://jre.dlut.edu.cn An l Regularized Method for Nuerical Differentiation

More information

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation

More information

A Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair

A Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving

More information

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal

More information

arxiv:math/ v1 [math.nt] 15 Jul 2003

arxiv:math/ v1 [math.nt] 15 Jul 2003 arxiv:ath/0307203v [ath.nt] 5 Jul 2003 A quantitative version of the Roth-Ridout theore Toohiro Yaada, 606-8502, Faculty of Science, Kyoto University, Kitashirakawaoiwakecho, Sakyoku, Kyoto-City, Kyoto,

More information

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents

More information

In this chapter, we consider several graph-theoretic and probabilistic models

In this chapter, we consider several graph-theoretic and probabilistic models THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I Contents 1. Preliinaries 2. The ain result 3. The Rieann integral 4. The integral of a nonnegative

More information

arxiv:math/ v1 [math.nt] 6 Apr 2005

arxiv:math/ v1 [math.nt] 6 Apr 2005 SOME PROPERTIES OF THE PSEUDO-SMARANDACHE FUNCTION arxiv:ath/05048v [ath.nt] 6 Apr 005 RICHARD PINCH Abstract. Charles Ashbacher [] has posed a nuber of questions relating to the pseudo-sarandache function

More information

TWO VERSIONS OF THE NIKODYM MAXIMAL FUNCTION ON THE HEISENBERG GROUP

TWO VERSIONS OF THE NIKODYM MAXIMAL FUNCTION ON THE HEISENBERG GROUP TWO VERSIOS OF THE IKODYM MAXIMAL FUCTIO O THE HEISEBERG GROUP JOOIL KIM Abstract The ikody axial function on the Euclidean plane R 2 is defined as the supreu over averages over rectangles of eccentricity

More information

RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS MEMBRANE

RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS MEMBRANE Proceedings of ICIPE rd International Conference on Inverse Probles in Engineering: Theory and Practice June -8, 999, Port Ludlow, Washington, USA : RECOVERY OF A DENSITY FROM THE EIGENVALUES OF A NONHOMOGENEOUS

More information

MODULAR HYPERBOLAS AND THE CONGRUENCE ax 1 x 2 x k + bx k+1 x k+2 x 2k c (mod m)

MODULAR HYPERBOLAS AND THE CONGRUENCE ax 1 x 2 x k + bx k+1 x k+2 x 2k c (mod m) #A37 INTEGERS 8 (208) MODULAR HYPERBOLAS AND THE CONGRUENCE ax x 2 x k + bx k+ x k+2 x 2k c (od ) Anwar Ayyad Departent of Matheatics, Al Azhar University, Gaza Strip, Palestine anwarayyad@yahoo.co Todd

More information

Polytopes and arrangements: Diameter and curvature

Polytopes and arrangements: Diameter and curvature Operations Research Letters 36 2008 2 222 Operations Research Letters wwwelsevierco/locate/orl Polytopes and arrangeents: Diaeter and curvature Antoine Deza, Taás Terlaky, Yuriy Zinchenko McMaster University,

More information

Descent polynomials. Mohamed Omar Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA , USA,

Descent polynomials. Mohamed Omar Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA , USA, Descent polynoials arxiv:1710.11033v2 [ath.co] 13 Nov 2017 Alexander Diaz-Lopez Departent of Matheatics and Statistics, Villanova University, 800 Lancaster Avenue, Villanova, PA 19085, USA, alexander.diaz-lopez@villanova.edu

More information

Block designs and statistics

Block designs and statistics Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent

More information

Elementary properties of 1-isometries on a Hilbert space

Elementary properties of 1-isometries on a Hilbert space Eleentary properties of 1-isoetries on a Hilbert space Muneo Chō Departaent of Matheatics, Kanagawa University Hiratsua 259-1293, Japan Caixing Gu y Departent of Matheatics, California Polytechnic State

More information

THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT

THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. Let n be any integer and ( n ) X F n : a i z i : a i, ± i be the set of all polynoials of height and

More information