Banach Journal of Mathematical Analysis ISSN: (electronic)

Size: px
Start display at page:

Download "Banach Journal of Mathematical Analysis ISSN: (electronic)"

Transcription

1 Bnch J. Mth. Anl. 4 (2010), no. 1, Bnch Journl of Mthemticl Anlysis ISSN: (electronic) GENERALIZATIONS OF OSTROWSKI INEQUALITY VIA BIPARAMETRIC EULER HARMONIC IDENTITIES FOR MEASURES AMBROZ ČIVLJAK1 AND LJUBAN DEDIĆ2 Dedicted to Professor Lrs-Erik Persson on the occsion of his 65th birthdy Communicted by Z. Páles Abstrct. Some generliztions of Ostrowski inequlity re given by using biprmetric Euler identities involving rel Borel mesures nd hrmonic sequences of functions. 1. Introduction The following Ostrowski inequlity, see [5], is well known: f(x) 1 b [ ( ) f(t)dt b 1 x +b 2 ] (b )M, x b, (b ) 2 where f : [, b] R is differentible function such tht f (x) M, for every x [, b]. The constnt 1 is the best possible. In other words, Ostrowski s 4 inequlity gives us n estimte for the devition of the vlues of smooth function from its men vlue. It hs been generlized in recent yers in number of wys. In this pper we shll present some new generliztions of Ostrowskitype inequlities by using biprmetric Euler identities which involve rel Borel mesures nd hrmonic sequences of functions. Dte: Received: 25 September 2009; Revised: 1 Mrch 2010; Accepted: 11 April Corresponding uthor Mthemtics Subject Clssifiction. Primry 26D15. Secondry 28A25, 26D20, 26D99. Key words nd phrses. Ostrowski inequlity, hrmonic sequences, biprmetric Euler identities. 170

2 BIPARAMETRIC EULER HARMONIC IDENTITIES 171 For, b R < b, let C[, b] be the Bnch spce of ll continuous functions f : [, b] R with the mx norm, nd M[, b] the Bnch spce of ll rel Borel mesures on [, b] with the totl vrition norm. In the rest of the pper we use the nottion F (s)dµ(s) to denote the Lebesgue integrl of F over [, b] with respect to the mesure µ, while for given function ϕ : [, b] R of bounded vrition F (s)dϕ(s) denotes Lebesgue Stieltjes integrl of F over [, b] with respect to ϕ. Also, by b F (s)ds we denote the usul Lebesgue integrl of F over [, b]. For µ M[, b] define the function ˇµ n : [, b] R, n 1, by 1 ˇµ n (t) (t s) n 1 dµ(s). (n 1)! For n 1, ˇµ 1 (t) [,t] [,t] dµ(s) µ([, t]), t b, which mens tht ˇµ 1 is equl to the distribution function of µ. Substituting ˇµ n (s) 1 (n 1)! [,s] (s u)n 1 dµ(u) in t ˇµ n(s)ds nd using the Fubini theorem we esily get the formul ˇµ n+1 (t) t ˇµ n (s)ds, t b, n 1. It mens tht for n 1, ˇµ n+1 is differentible t lmost ll points of [, b] nd ˇµ n+1 ˇµ n lmost everywhere on [, b] with respect to Lebesgue mesure. Substituting ˇµ 1 (s) dµ(u) in t (t s)n 2ˇµ [,s] 1 (s)ds nd using the Fubini theorem once gin we esily get the following formul ˇµ n (t) 1 (n 2)! t (t s) n 2ˇµ 1 (s)ds, t b, n 2. From this formul we get immeditely tht ˇµ n () 0, n 2. Also, note tht function g(s) (t s) n 1 is nonincresing on [, t] so tht from the first expression for ˇµ n (t) we get the estimte ˇµ n (t) (t )n 1 (n 1)! µ, t b, n 1, where µ denotes the totl vrition of µ. A sequence of functions P n : [, b] R, n 1, is clled µ-hrmonic sequence of functions on [, b] if for some c R, nd P n+1 (t) P n+1 () + P 1 (t) c + ˇµ 1 (t), t b, t P n (s)ds, t b, n 1. Since P n+1, n 1 is defined s n indefinite Lebesgue integrl of P n, it is well known tht P n+1, n 1 is bsolutely continuous function, P n+1 P n,.e. on [, b] with respect to Lebesgue mesure,

3 172 A. ČIVLJAK, LJ. DEDIĆ nd for every f C[, b] we hve f(t)dp n+1 (t) b f(t)p n (t)dt, n 1. The sequence (ˇµ n, n 1) is n exmple of µ-hrmonic sequence of functions on [, b]. Assume tht (P n, n 1) is µ-hrmonic sequence of functions on [, b]. Define P n, for n 1, to be periodic function of period 1, relted to P n s nd P n(t) P n( + (b )t) (b ) n, 0 t < 1, P n(t + 1) P n(t), t R. Thus, for n 2, P n is continuous on R\Z nd hs jump of α n P n() P n (b) (b ) n t every k Z, whenever α n 0. Note tht for n 1, ( Pn+1) P n.e. on R. Let f : [, b] R be such tht f (n 1) is continuous function of bounded vrition on [, b] for some n 1. In recent pper [1] the following identity hs been proved: µ([, b])f(x) f x (t)dµ(t) + S n (x) + R n (x), (1.1) where S m (x) m P k (x) [ f (k 1) (b) f (k 1) () ] + m [P k () P k (b)] f (k 1) (x), for 1 m n, with convention S 1 (x) P 1 (x) [f(b) f()], nd f( + x t), t x f x (t) f(b + x t), x < t b, while R n (x) (b ) n Pn k2 ( ) x t df (n 1) (t) b for every x [, b]. Identity (1.1) is clled the generlized Euler hrmonic identity. It hs been used in [1] to prove some generliztions of Ostrowski s inequlity. The reder cn find further references to some recent results on generliztions nd pplictions of Euler identities in [2], [4] nd [3]. The ( im of this pper is to generlize formul (1.1) by replcing the sequence (Pn x t b ), n 1) with more generl sequence of functions, nd using them to prove some further generliztions of Ostrowski s inequlity.

4 BIPARAMETRIC EULER HARMONIC IDENTITIES Biprmetric Euler hrmonic identities For µ M[, b] let (P n, n 1) be µ-hrmonic sequence of functions on [, b]. For x, y [, b], x y, define function K n : [, b] 3 R, for n 1, by Pn (b + x y + t), t + y x K n (x, y, t) P n (x y + t), + y x < t b, (2.1) for y x < b, nd Pn (t), t < b K n (, b, t) P n (), t b. (2.2) Thus, for n 2, K n (x, y, ) is continuous on [, b] \ + y x} nd hs jump of P n () P n (b) t +y x. Note tht K n (x, y, ), n 1 is function of bounded vrition nd for n 1 K n+1(x, y, ) K n (x, y, ).e. on [, b] with respect to Lebesgue mesure. Also note tht K n (x, y, ) K n (x, y, b) P n (b + x y), n 1. Lemm 2.1. For every f C[, b] nd n 2 we hve b f(t)dk n (x, y, t) f(t)k n 1 (x, y, t)dt + f( + y x) [P n () P n (b)]. Proof. Follows directly from properties of Lebesgue-Stieltjes integrl of continuous function f over [, b] with respect to K n, nd given properties of the function K n. Nmely, the function K n (x, y, ), n 2 is lmost everywhere differentible on [, b] nd its derivtive is equl to K n 1 (x, y, ).e. on [, b] with respect to Lebesgue mesure. Further, it hs jump t +y x of mgnitude P n () P n (b), which proves our ssertion. Lemm 2.2. For every µ M[, b] nd f C[, b] we hve f(t)dk 1 (x, y, t) f x,y (t)dµ(t) f( + y x)µ([, b]), (2.3) where f x,y (t) f(y x + t), t b + x y f( b + y x + t), b + x y < t b. (2.4) Proof. Define I, J : C[, b] M[, b] R by I(f, µ) f(t)dk 1 (x, y, t) nd J(f, µ) f x,y (t)dµ(t) f( + y x)µ([, b]). Then I nd J re continuous biliner functionls with I(f, µ) f µ, J(f, µ) 2 f µ. Let us prove tht I(f, µ) J(f, µ) for every f C[, b] nd every µ M[, b]. Since P 1 (t) c + µ([, t]), t b, for some constnt c, nd obviously the integrl on the left hnd side of (2.3) is independent of the choice of the constnt

5 174 A. ČIVLJAK, LJ. DEDIĆ c, we my ssume tht c 0. Therefore, from (2.1) nd (2.2) we esily see tht for n 1 µ([, b + x y + t]), t + y x K 1 (x, y, t) µ([, x y + t]), + y x < t b, (2.5) for y x < b, nd µ([, t]), t < b K 1 (, b, t) µ(}), t b. (2.6) (1) For z [, b] let µ δ z be the Dirc mesure t z, i.e., the mesure defined by f(t)dδ z (t) f(z). If z [, b] nd z b + x y, from (2.5) nd (2.6) we get 0, + y x < t < z + y x K 1 (x, y, t) 1, ( t + y x) or (z + y x t b), for y x < b, nd Now, by simple clcultion we hve K 1 (, b, t) 1, t b. I(f, δ z ) f(y x + z) f( + y x) f(y x + t)dδ z (t) f( + y x)δ z ([, b]) for y x < b, nd f x,y (t)dδ z (t) f( + y x)δ z ([, b]) J(f, δ z ), I(f, δ z ) I(f, δ ) 0 f(b) f( + b ) f(b)dδ (t) f( + b )δ z ([, b]) f,b (t)dδ (t) f( + y x)δ ([, b]) J(f, δ ) J(f, δ z ), for y x b. Similrly, if z [, b] nd b + x y < z b, from (2.5) nd (2.6) we find K 1 (x, y, t) 0, ( t < + y x b + z) or ( + y x < t b) 1, + y x b + z t + y x, for y x < b, nd K 1 (, b, t) 0, ( t < z) or (t b) 1, z t < b.

6 BIPARAMETRIC EULER HARMONIC IDENTITIES 175 Now, by nlogous clcultion we hve I(f, δ z ) f( b + y x + z) f( + y x) f( b + y x + t)dδ z (t) f( + y x)δ z ([, b]) for y x < b, nd f x,y (t)dδ z (t) f( + y x)δ z ([, b]) J(f, δ z ), I(f, δ z ) f(z) f(b) f(t)dδ z (t) f( + b )δ z ([, b]) f,b (t)dδ z (t) f( + y x)δ z ([, b]) J(f, δ z ), for y x b. Therefore, for every f C [, b] nd every z [, b] we hve I(f, δ z ) J(f, δ z ). (2) Every discrete mesure µ M[, b], with finite support, is liner combintion of Dirc mesures, i.e., it hs the form µ n c kδ xk, for some rel numbers c k, nd x k [, b]. By linerity of I nd J, we get I(f, µ) I(f, c k δ xk ) c k I(f, δ xk ) c k J(f, δ xk ) J(f, c k δ xk ) J(f, µ). for every f C[, b] nd every discrete mesure µ M[, b] with finite support. (3) Let T be the miniml topology on M[, b] such tht liner functionls µ F dµ re continuous, for every bounded Borel function F : [, b] R. By the definition we see tht T contins the wek topology on M[, b] nd is contined in the wek topology on M[, b]. Further, the curve x δ x is bounded nd T - mesurble since x F dδ x F (x) is mesurble by ssumption. Therefore, the integrl δ x dµ(x) exists in the T topology, for every µ M[, b]. It is esy to see tht this integrl is equl to µ, i.e. δx dµ(x) µ, for every mesure µ M[, b], which mens tht µ is T -limit of sequence of discrete mesures with finite support. Thus, we conclude tht the subspce of ll discrete mesures with finite support is T -dense in M[, b], nd therefore the functionls I(f, ) nd J(f, ) re equl, for every f C[, b], since they re equl on dense subspce nd they re T -continuous. This completes the proof. Theorem 2.3. For µ M[, b] let (P n, n 1) be µ-hrmonic sequence of functions on [, b] nd f : [, b] R such tht f (n 1) is continuous function of bounded vrition for some n 1. Then we hve f x,y (t)dµ(t) µ(})f( + y x) + S n (x, y) R n (x, y),

7 176 A. ČIVLJAK, LJ. DEDIĆ for every x, y [, b], x y, where f x,y (t) is defined by (2.4), S n (x, y) ( 1) k P k (b + x y) [ f (k 1) (b) f (k 1) () ] + ( 1) k f (k 1) ( + y x) [P k (b) P k ()] nd R n (x, y) ( 1) n K n (x, y, t) df (n 1) (t). Proof. For 1 k n consider the integrl R k (x, y) ( 1) k K k (x, y, t) df (k 1) (t). Integrting by prts we get R k (x, y) ( 1) k K k (x, y, t) f (k 1) (t) b (2.7) ( 1) k f (k 1) (t)dk k (x, y, t). For every k 2, by Lemm 2.1, we get R k (x, y) ( 1) k P k (b + x y) [ f (k 1) (b) f (k 1) () ] ( 1) k f (k 1) ( + y x) [P k () P k (b)] b ( 1) k f (k 1) (t)k k 1 (x, y, t) dt ( 1) k P k (b + x y) [ f (k 1) (b) f (k 1) () ] (2.8) +( 1) k f (k 1) ( + y x) [P k (b) P k ()] +R k 1 (x, y), since K k (x, y, ) K k (x, y, b) P k (b + x y). By Lemm 2.2, for k 1, (2.7) becomes R 1 (x, y) P 1 (b + x y) [f(b) f()] + f(t)dk 1 (x, y, t) P 1 (b + x y) [f(b) f()] f( + y x)µ([, b]) (2.9) + f x,y (t)dµ(t)

8 BIPARAMETRIC EULER HARMONIC IDENTITIES 177 where f x,y (t) is defined by (2.4). From (2.8) nd (2.9) it follows, by itertion R n (x, y) since ( 1) k P k (b + x y) [ f (k 1) (b) f (k 1) () ] + ( 1) k f (k 1) ( + y x) [P k (b) P k ()] f( + y x)µ(}) + f x,y (t)dµ(t) f( + y x)µ([, b]) f( + y x) [P 1 (b) P 1 () + µ(})], which proves our ssertion. Corollry 2.4. Let f : [, b] R be such tht f (n 1) is continuous function of bounded vrition for some n 1. Then we hve f x,y (t)dµ(t) + Šn(x, y) Řn(x, y). for every x, y [, b], x y, where nd Š n (x, y) Ǩ n (x, y, t) for y x < b, while ( 1) k ˇµ k (b + x y) [ f (k 1) (b) f (k 1) () ] + ( 1) k f (k 1) ( + y x)ˇµ k (b), Ř n (x, y) ( 1) n Ǩ n (x, y, t) df (n 1) (t) ˇµn (b + x y + t), t + y x ˇµ n (x y + t), + y x < t b Ǩ n (, b, t) ˇµn (t), t < b ˇµ n (), t b. Proof. Apply the theorem bove to the specil cse P n ˇµ n, n 1, nd note tht ˇµ k () 0 for k 2. Corollry 2.5. Let f : [, b] R be such tht f (n 1) is continuous function of bounded vrition for some n 1. Then we hve b f(t)dt + S n (x, y) R n (x, y).

9 178 A. ČIVLJAK, LJ. DEDIĆ for every x, y [, b], x y, where ( 1) S k n (x, y) (b + x y) [ k f (k 1) (b) f (k 1) () ] k! ( 1) k + (b ) k f (k 1) ( + y x), k! R n (x, y) ( 1) n K n (x, y, t) df (n 1) (t) nd 1 K n (x, y, t) (b 2 + x y + n! t)n, t + y x 1 (x y + t n! )n, + y x < t b for y x < b, while K n (, b, t) 1 n! (t )n, < t < b 0, (t ) or (t b). Proof. Apply Corollry 2.4 in the specil cse when µ is the Lebesgue mesure on [, b]. In this cse (t )k ˇµ k (t), k 1 k! nd b b f x,y (t)dµ(t) f x,y (t)dt f(t)dt. 3. Generliztions of Ostrowski s inequlity In this section we use the identity obtined in Theorem 2.3 to prove number of Ostrowski-type inequlities which hold for clss of functions f whose derivtives f (n 1) re either L-Lipschitzin on [, b] or continuous nd of bounded vrition on [, b]. Anlogous results re obtined for clss of functions f possessing derivtives f (n) in L p [, b], 1 p. Throughout this section we use the sme nottions s bove. Lemm 3.1. For every µ-hrmonic sequence (P n, n 1) nd f C[, b] we hve b f(k n (x, y, t))dt b f(p n (t))dt. Proof. Follows from (2.1) nd (2.2) using simple clcultions, b f(k n (x, y, t))dt +y x b b+x y f(p n (b + x y + t))dt + f(p n (t))dt + b+x y b f(p n (t))dt +y x b f(p n (x y + t))dt f(p n (t))dt.

10 BIPARAMETRIC EULER HARMONIC IDENTITIES 179 Theorem 3.2. Let f : [, b] R be such tht f (n 1) is L-Lipschitzin on [, b] for some n 1. Then b f x,y (t)dµ(t) µ(})f( + y x) + S n (x, y) L P n (t) dt, for every x, y [, b], x y. Proof. By Lemm 3.1 we hve R n (x, y) L L b b K n (x, y, t) df (n 1) (t) K n (x, y, t) dt P n (t) dt. Therefore, our ssertion follows from Theorem 2.3. Corollry 3.3. If f is L-Lipschitzin on [, b], then for every x, y [, b], x y, nd c R we hve f x,y (t)dµ(t) µ([, b])f( + y x) [c + ˇµ 1 (b + x y)] [f(b) f()] L b c + ˇµ 1 (t) dt. Proof. Put n 1 in the theorem bove. Corollry 3.4. If f is L-Lipschitzin on [, b] nd µ 0, then for every x, y, z [, b], x y, we hve f x,y (t)dµ(t) µ([, b])f( + y x) [ˇµ 1 (b + x y) ˇµ 1 (z)] [f(b) f()] L [(2z b)ˇµ 1 (z) 2ˇµ 2 (z) + ˇµ 2 (b)]. Proof. Put c ˇµ 1 (z) in Corollry 3.3 nd note tht in this cse b ˇµ 1 (t) ˇµ 1 (z) dt (2z b)ˇµ 1 (z) 2ˇµ 2 (z) + ˇµ 2 (b). Corollry 3.5. Let f : [, b] R be such tht f (n 1) is L-Lipschitzin on [, b] for some n 1. Then for µ 0 we hve f x,y (t)dµ(t) + Šn(x, y) Lˇµ (b )n n+1(b) L µ, n! for every x, y [, b], x y.

11 180 A. ČIVLJAK, LJ. DEDIĆ Proof. Apply the theorem bove to the µ-hrmonic sequence (ˇµ n, n 1). Then b ˇµ n (t) dt b ˇµ n (t)dt ˇµ n+1 (b) (b )n n! µ. Corollry 3.6. Let f : [, b] R be such tht f (n 1) is L-Lipschitzin on [, b] for some n 1. Then we hve b f(t)dt + S n (x, y) )n+1 L(b, (n + 1)! for every x, y [, b], x y. Proof. Apply the corollry bove to the Lebesgue mesure on [, b]. Corollry 3.7. Let f : [, b] R be such tht f (n 1) is L-Lipschitzin on [, b] for some n 1. Then f(y x + z) + T n (x, y, z) L (b z)n, n! for every x, y, z [, b], x y nd z b + x y, where T n (x, y, z) k (b + x y z)k 1 [ ( 1) f (k 1) (b) f (k 1) () ] (k 1)! k (b z)k 1 + ( 1) f (k 1) ( + y x). (k 1)! Proof. Apply Corollry 3.5 to µ δ z, z b + x y. Corollry 3.8. Let f : [, b] R be such tht f (n 1) is L-Lipschitzin on [, b] for some n 1. Then f( b + y x + z) + T 2 n (x, y, z) (b z) n L, n! for every x, y, z [, b], x y nd b + x y < z b, where Tn(x, 2 k (b z)k 1 y, z) ( 1) f (k 1) ( + y x). (k 1)! Proof. Apply Corollry 3.5 to µ δ z, b + x y < z b. Theorem 3.9. Let f : [, b] R be such tht f (n 1) is continuous function of bounded vrition on [, b] for some n 1. Then f x,y (t)dµ(t) µ(})f( + y x) + S n (x, y) sup P n (t) V b (f (n 1) ), for every x, y [, b], x y. t

12 Proof. We hve BIPARAMETRIC EULER HARMONIC IDENTITIES 181 R n (x, y) K n (x, y, t) df (n 1) (t) sup K n (x, y, t) V b (f (n 1) ) t sup P n (t) V b (f (n 1) ). t Therefore, our ssertion follows from Theorem 2.3. Corollry If f is continuous function of bounded vrition on [, b], then for every x, y [, b], x y, nd c R we hve f x,y (t)dµ(t) µ([, b])f( + y x) for every x, y [, b], x y. [c + ˇµ 1 (b + x y)] [f(b) f()] sup c + ˇµ 1 (t) V b (f), t Proof. Put n 1 in the theorem bove. Corollry If f is continuous function of bounded vrition on [, b] nd µ 0, then for every x, y, z [, b], x y, we hve f x,y (t)dµ(t) µ([, b])f( + y x) [ˇµ 1 (b + x y) ˇµ 1 (z)] [f(b) f()] 1 2 [ˇµ 1(b) ˇµ 1 () + ˇµ 1 () + ˇµ 1 (b) 2ˇµ 1 (z) ] V b (f). Proof. Put c ˇµ 1 (z) in Corollry Then sup c + ˇµ 1 (t) sup ˇµ 1 (t) ˇµ 1 (z) t t 1 2 [ˇµ 1(b) ˇµ 1 () + ˇµ 1 () + ˇµ 1 (b) 2ˇµ 1 (z) ]. Corollry Let f : [, b] R be such tht f (n 1) is continuous function of bounded vrition on [, b] for some n 1. Then for µ 0 we hve f x,y (t)dµ(t) + Šn(x, y) ˇµ n (b)v b (f (n 1) ) for every x, y [, b], x y. (b )n 1 V b (f (n 1) ) µ, (n 1)!

13 182 A. ČIVLJAK, LJ. DEDIĆ Proof. Apply the theorem bove to the µ-hrmonic sequence (ˇµ n, n 1). Then sup ˇµ n (t) ˇµ n (b) t (b )n 1 (n 1)! µ. Corollry Let f : [, b] R be such tht f (n 1) is continuous function of bounded vrition on [, b] for some n 1. Then b f(t)dt + S n (x, y) (b )n V b (f (n 1) ), n! for every x, y [, b], x y. Proof. Apply the corollry bove to the Lebesgue mesure on [, b]. Corollry Let f : [, b] R be such tht f (n 1) is continuous function of bounded vrition on [, b] for some n 1. Then f(y x + z) + T n (x, y, z) (b z)n 1 V b (f (n 1) ), (n 1)! for every x, y, z [, b], x y nd z b + x y, where T n (x, y, z) is from Corollry 3.7. Proof. Apply Corollry 3.12 to µ δ z, z b + x y. Corollry Let f : [, b] R be such tht f (n 1) is continuous function of bounded vrition on [, b] for some n 1. Then f( b + y x + z) + T 2 n (x, y, z) (b z) n 1 V b (f (n 1) ), (n 1)! for every x, y, z [, b], x y nd b + x y < z b, where T 2 n(x, y, z) is from Corollry 3.8. Proof. Apply Corollry 3.12 to µ δ z, b + x y < z b. Theorem Let f : [, b] R be such tht f (n) is integrble for some n 1. Then f x,y (t)dµ(t) µ(})f( + y x) + S n (x, y) sup P n (t) f (n) 1, for every x, y [, b], x y. t Proof. Note tht in this cse nd pply Theorem 3.9. V b (f (n 1) ) b f (n) (t) dt f (n) 1,

14 BIPARAMETRIC EULER HARMONIC IDENTITIES 183 Theorem Let f : [, b] R be such tht f (n) L [, b] for some n 1. Then b f x,y (t)dµ(t) µ(})f( + y x) + S n (x, y) P n (t) dt f (n), for every x, y [, b], x y. Proof. In this cse f (n 1) is L-Lipschitzin with L f (n). Theorem Let f : [, b] R be such tht f (n) L p [, b] for some n 1 nd 1 < p <. Then f x,y (t)dµ(t) µ(})f( + y x) + S n (x, y) P n q f (n) p, for every x, y [, b], x y, where 1/p + 1/q 1. Proof. By pplying the Hölder inequlity we hve R n (x, y) which proves our ssertion. b K n (x, y, t) f (n) (t) dt ( b 1/q K n (x, y, t) dt) q f (n) p ( b 1/q P n (t) dt) q f (n) p, Corollry Let f : [, b] R be such tht f (n) L p [, b] for some n 1 nd 1 < p <. Then f x,y (t)dµ(t) + Šn(x, y) µ f (n) p (b ) n 1+1/q (n 1)! [(n 1)q + 1], 1/q for every x, y [, b], x y, where 1/p + 1/q 1. Proof. Apply the theorem bove to the µ-hrmonic sequence (ˇµ n, n 1) nd note tht b [ ] q µ b ˇµ n (t) q dt (t ) (n 1)q dt (n 1)! [ ] q µ (b ) (n 1)q+1 (n 1)! (n 1)q + 1. Corollry Let f : [, b] R be such tht f (n) L p [, b] for some n 1 nd 1 < p <. Then b f(t)dt + S n (x, y) f (n) p (b ) n+1/q n! [nq + 1], 1/q for every x, y [, b], x y, where 1/p + 1/q 1.

15 184 A. ČIVLJAK, LJ. DEDIĆ Proof. Apply the theorem bove to the Lebesgue mesure on [, b]. Corollry Let f : [, b] R be such tht f (n) L p [, b] for some n 1 nd 1 < p <. Then f(y x + z) + T n (x, y, z) f (n) p (b z) n 1+1/q (n 1)! [(n 1)q + 1], 1/q for every x, y, z [, b], x y nd z b + x y, where T n (x, y, z) is from Corollry 3.7. Proof. Apply Corollry 3.19 to µ δ z, z b + x y. Corollry Let f : [, b] R be such tht f (n) L p [, b] for some n 1 nd 1 < p <. Then f( b + y x + z) + T 2 n (x, y, z) f (n) p (b z) n 1+1/q (n 1)! [(n 1)q + 1], 1/q for every x, y, z [, b], x y nd b + x y < z b, where T 2 n(x, y, z) is from Corollry 3.8. Proof. Apply Corollry 3.19 to µ δ z, b + x y < z b. References [1] A. Čivljk, Lj. Dedić nd M. Mtić, Euler hrmonic identities for mesures, Nonliner Funct. Anl. Appl. 12 (2007), no. 3, [2] Lj. Dedić, M. Mtić nd J. Pečrić, On generliztions of Ostrowski inequlity vi some Euler-type identities, Mth. Inequl. Appl. 3 (2000), no. 3, [3] Lj. Dedić, M. Mtić, J. Pečrić nd A. Aglić Aljinović, On weighted Euler hrmonic identities with pplictions, Mth. Inequl. Appl. 8 (2005), no. 2, [4] Lj. Dedić, M. Mtić, J. Pečrić nd A. Vukelić, On generliztions of Ostrowski inequlity vi Euler hrmonic identities, J. Inequl. Appl., 7 (2002), no. 6, [5] A. Ostrowski, Über die Absolutbweichung einer differentiebren Funktion von ihrem Integrlmittelwert, Comment. Mth. Helv. 10 (1938), Americn College of Mngement nd Technology, Rochester Institute of Technology, Don Frn Bulić 6, Dubrovnik, Croti. E-mil ddress: civljk@cmt.hr 2 Deprtment of mthemtics, University of Split, Teslin 12, Split, Croti. E-mil ddress: ljubn@pmfst.hr

ON SOME GRÜSS TYPE INEQUALITY IN 2-INNER PRODUCT SPACES AND APPLICATIONS. S.S. Kim, S.S. Dragomir, A. White and Y.J. Cho. 1.

ON SOME GRÜSS TYPE INEQUALITY IN 2-INNER PRODUCT SPACES AND APPLICATIONS. S.S. Kim, S.S. Dragomir, A. White and Y.J. Cho. 1. ON SOME GRÜSS TYPE INEQUALITY IN 2-INNER PRODUCT SPACES AND APPLICATIONS S.S. Kim, S.S. Drgomir, A. White nd Y.J. Cho Abstrct. In this pper, we shll give generliztion of the Grüss type inequlity nd obtin

More information

Pointwise convergence need not behave well with respect to standard properties such as continuity.

Pointwise convergence need not behave well with respect to standard properties such as continuity. Chpter 3 Uniform Convergence Lecture 9 Sequences of functions re of gret importnce in mny res of pure nd pplied mthemtics, nd their properties cn often be studied in the context of metric spces, s in Exmples

More information

A Fixed Point Approach of Quadratic Functional Equations

A Fixed Point Approach of Quadratic Functional Equations Int. Journl of Mth. Anlysis, Vol. 7, 03, no. 30, 47-477 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.988/ijm.03.86 A Fixed Point Approch of Qudrtic Functionl Equtions Mudh Almhlebi Deprtment of Mthemtics,

More information

such that the S i cover S, or equivalently S

such that the S i cover S, or equivalently S MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i

More information

MATH 25 CLASS 5 NOTES, SEP

MATH 25 CLASS 5 NOTES, SEP MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid

More information

A SIMPLICITY CRITERION FOR SYMMETRIC OPERATOR ON A GRAPH

A SIMPLICITY CRITERION FOR SYMMETRIC OPERATOR ON A GRAPH Methods of Functionl Anlysis nd Topology Vol. 20 (2014), no. 2, pp. 117 123 A SIMPLICITY CRITERION FOR SYMMETRIC OPERATOR ON A GRAPH E. N. ASHUROVA, A. N. KANDAGURA, AND I. I. KARPENKO To Professor Yu.

More information

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl

More information

Math 142, Exam 1 Information.

Math 142, Exam 1 Information. Mth 14, Exm 1 Informtion. 9/14/10, LC 41, 9:30-10:45. Exm 1 will be bsed on: Sections 7.1-7.5. The corresponding ssigned homework problems (see http://www.mth.sc.edu/ boyln/sccourses/14f10/14.html) At

More information

Math 35 Review Sheet, Spring 2014

Math 35 Review Sheet, Spring 2014 Mth 35 Review heet, pring 2014 For the finl exm, do ny 12 of the 15 questions in 3 hours. They re worth 8 points ech, mking 96, with 4 more points for netness! Put ll your work nd nswers in the provided

More information

1 The Definite Integral

1 The Definite Integral The Definite Integrl Definition. Let f be function defined on the intervl [, b] where

More information

Solutions to Math 41 Final Exam December 12, 2011

Solutions to Math 41 Final Exam December 12, 2011 Solutions to Mth Finl Em December,. ( points) Find ech of the following its, with justifiction. If there is n infinite it, then eplin whether it is or. ( ) / ln() () (5 points) First we compute the it:

More information

The Fundamental Theorem of Calculus

The Fundamental Theorem of Calculus MATH 6 The Fundmentl Theorem of Clculus The Fundmentl Theorem of Clculus (FTC) gives method of finding the signed re etween the grph of f nd the x-xis on the intervl [, ]. The theorem is: FTC: If f is

More information

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1 Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the

More information

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl

More information

Introduction to Integration

Introduction to Integration Introduction to Integrtion Definite integrls of piecewise constnt functions A constnt function is function of the form Integrtion is two things t the sme time: A form of summtion. The opposite of differentition.

More information

Lily Yen and Mogens Hansen

Lily Yen and Mogens Hansen SKOLID / SKOLID No. 8 Lily Yen nd Mogens Hnsen Skolid hs joined Mthemticl Myhem which is eing reformtted s stnd-lone mthemtics journl for high school students. Solutions to prolems tht ppered in the lst

More information

Double Integrals. MATH 375 Numerical Analysis. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Double Integrals

Double Integrals. MATH 375 Numerical Analysis. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Double Integrals Double Integrls MATH 375 Numericl Anlysis J. Robert Buchnn Deprtment of Mthemtics Fll 2013 J. Robert Buchnn Double Integrls Objectives Now tht we hve discussed severl methods for pproximting definite integrls

More information

The Basic Properties of the Integral

The Basic Properties of the Integral The Bsic Properties of the Integrl When we compute the derivtive of complicted function, like + sin, we usull use differentition rules, like d [f()+g()] d f()+ d g(), to reduce the computtion d d d to

More information

Improper Integrals. October 4, 2017

Improper Integrals. October 4, 2017 Improper Integrls October 4, 7 Introduction We hve seen how to clculte definite integrl when the it is rel number. However, there re times when we re interested to compute the integrl sy for emple 3. Here

More information

Math 464 Fall 2012 Notes on Marginal and Conditional Densities October 18, 2012

Math 464 Fall 2012 Notes on Marginal and Conditional Densities October 18, 2012 Mth 464 Fll 2012 Notes on Mrginl nd Conditionl Densities klin@mth.rizon.edu October 18, 2012 Mrginl densities. Suppose you hve 3 continuous rndom vribles X, Y, nd Z, with joint density f(x,y,z. The mrginl

More information

Available at ISSN: Vol. 4, Issue 2 (December 2009) pp (Previously Vol. 4, No.

Available at   ISSN: Vol. 4, Issue 2 (December 2009) pp (Previously Vol. 4, No. Avilble t http://pvmu.edu.edu/pges/398.sp ISSN: 93-9466 Vol. 4, Issue December 009 pp. 434 444 Previously Vol. 4, No. Applictions nd Applied Mthemtics: An Interntionl Journl AAM On -ry Subdivision for

More information

Introduction. Chapter 4: Complex Integration. Introduction (Cont d)

Introduction. Chapter 4: Complex Integration. Introduction (Cont d) Introduction Chpter 4: Complex Integrtion Li, Yongzho Stte Key Lbortory of Integrted Services Networks, Xidin University October 10, 2010 The two-dimensionl nture of the complex plne required us to generlize

More information

1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)

1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric

More information

CHAPTER 8 Quasi-interpolation methods

CHAPTER 8 Quasi-interpolation methods CHAPTER 8 Qusi-interpoltion methods In Chpter 5 we considered number of methods for computing spline pproximtions. The strting point for the pproximtion methods is dt set tht is usully discrete nd in the

More information

MATH 2530: WORKSHEET 7. x 2 y dz dy dx =

MATH 2530: WORKSHEET 7. x 2 y dz dy dx = MATH 253: WORKSHT 7 () Wrm-up: () Review: polr coordintes, integrls involving polr coordintes, triple Riemnn sums, triple integrls, the pplictions of triple integrls (especilly to volume), nd cylindricl

More information

AVolumePreservingMapfromCubetoOctahedron

AVolumePreservingMapfromCubetoOctahedron Globl Journl of Science Frontier Reserch: F Mthemtics nd Decision Sciences Volume 18 Issue 1 Version 1.0 er 018 Type: Double Blind Peer Reviewed Interntionl Reserch Journl Publisher: Globl Journls Online

More information

Ray surface intersections

Ray surface intersections Ry surfce intersections Some primitives Finite primitives: polygons spheres, cylinders, cones prts of generl qudrics Infinite primitives: plnes infinite cylinders nd cones generl qudrics A finite primitive

More information

Section 10.4 Hyperbolas

Section 10.4 Hyperbolas 66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol

More information

5/9/17. Lesson 51 - FTC PART 2. Review FTC, PART 1. statement as the Integral Evaluation Theorem as it tells us HOW to evaluate the definite integral

5/9/17. Lesson 51 - FTC PART 2. Review FTC, PART 1. statement as the Integral Evaluation Theorem as it tells us HOW to evaluate the definite integral Lesson - FTC PART 2 Review! We hve seen definition/formul for definite integrl s n b A() = lim f ( i )Δ = f ()d = F() = F(b) F() n i=! where F () = f() (or F() is the ntiderivtive of f() b! And hve seen

More information

Lecture 7: Integration Techniques

Lecture 7: Integration Techniques Lecture 7: Integrtion Techniques Antiderivtives nd Indefinite Integrls. In differentil clculus, we were interested in the derivtive of given rel-vlued function, whether it ws lgeric, eponentil or logrithmic.

More information

GENERALIZED SOME HERMITE-HADAMARD-TYPE INEQUALITIES FOR CO-ORDINATED CONVEX FUNCTIONS

GENERALIZED SOME HERMITE-HADAMARD-TYPE INEQUALITIES FOR CO-ORDINATED CONVEX FUNCTIONS Plestine Journl o Mthemtis Vol 7(2)(28), 537 553 Plestine Polytehni University-PPU 28 GENERALIZED SOME HERMITE-HADAMARD-TYPE INEQUALITIES FOR CO-ORDINATED CONVEX FUNCTIONS Mehmet Zeki Srıky nd Tub Tunç

More information

If f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve.

If f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve. Line Integrls The ide of line integrl is very similr to tht of single integrls. If the function f(x) is bove the x-xis on the intervl [, b], then the integrl of f(x) over [, b] is the re under f over the

More information

On Reduced Zagreb Indices of Polycyclic Aromatic Hydrocarbons and Benzenoid Systems

On Reduced Zagreb Indices of Polycyclic Aromatic Hydrocarbons and Benzenoid Systems Annls of Pure nd Applied Mthemtics Vol. 8, No., 08, 73-78 ISSN: 79-087X (P), 79-0888(online) Published on 0 August 08 www.reserchmthsci.org DOI: http://dx.doi.org/0.457/pm.v8n0 Annls of On Reduced Zgreb

More information

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html

More information

MTH 146 Conics Supplement

MTH 146 Conics Supplement 105- Review of Conics MTH 146 Conics Supplement In this section we review conics If ou ne more detils thn re present in the notes, r through section 105 of the ook Definition: A prol is the set of points

More information

Chapter 2 Sensitivity Analysis: Differential Calculus of Models

Chapter 2 Sensitivity Analysis: Differential Calculus of Models Chpter 2 Sensitivity Anlysis: Differentil Clculus of Models Abstrct Models in remote sensing nd in science nd engineering, in generl re, essentilly, functions of discrete model input prmeters, nd/or functionls

More information

arxiv: v2 [math.ho] 4 Jun 2012

arxiv: v2 [math.ho] 4 Jun 2012 Volumes of olids of Revolution. Unified pproch Jorge Mrtín-Morles nd ntonio M. Oller-Mrcén jorge@unizr.es, oller@unizr.es rxiv:5.v [mth.ho] Jun Centro Universitrio de l Defens - IUM. cdemi Generl Militr,

More information

MA 124 (Calculus II) Lecture 2: January 24, 2019 Section A3. Professor Jennifer Balakrishnan,

MA 124 (Calculus II) Lecture 2: January 24, 2019 Section A3. Professor Jennifer Balakrishnan, Wht is on tody Professor Jennifer Blkrishnn, jbl@bu.edu 1 Velocity nd net chnge 1 2 Regions between curves 3 1 Velocity nd net chnge Briggs-Cochrn-Gillett 6.1 pp. 398-46 Suppose you re driving long stright

More information

Research Announcement: MAXIMAL CONNECTED HAUSDORFF TOPOLOGIES

Research Announcement: MAXIMAL CONNECTED HAUSDORFF TOPOLOGIES Volume 2, 1977 Pges 349 353 http://topology.uburn.edu/tp/ Reserch Announcement: MAXIMAL CONNECTED HAUSDORFF TOPOLOGIES by J. A. Guthrie, H. E. Stone, nd M. L. Wge Topology Proceedings Web: http://topology.uburn.edu/tp/

More information

12-B FRACTIONS AND DECIMALS

12-B FRACTIONS AND DECIMALS -B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn

More information

1.5 Extrema and the Mean Value Theorem

1.5 Extrema and the Mean Value Theorem .5 Extrem nd the Men Vlue Theorem.5. Mximum nd Minimum Vlues Definition.5. (Glol Mximum). Let f : D! R e function with domin D. Then f hs n glol mximum vlue t point c, iff(c) f(x) for ll x D. The vlue

More information

Tries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries

Tries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries Tries Yufei To KAIST April 9, 2013 Y. To, April 9, 2013 Tries In this lecture, we will discuss the following exct mtching prolem on strings. Prolem Let S e set of strings, ech of which hs unique integer

More information

a(e, x) = x. Diagrammatically, this is encoded as the following commutative diagrams / X

a(e, x) = x. Diagrammatically, this is encoded as the following commutative diagrams / X 4. Mon, Sept. 30 Lst time, we defined the quotient topology coming from continuous surjection q : X! Y. Recll tht q is quotient mp (nd Y hs the quotient topology) if V Y is open precisely when q (V ) X

More information

Integration. October 25, 2016

Integration. October 25, 2016 Integrtion October 5, 6 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my hve

More information

Basic Geometry and Topology

Basic Geometry and Topology Bsic Geometry nd Topology Stephn Stolz Septemer 7, 2015 Contents 1 Pointset Topology 1 1.1 Metric spces................................... 1 1.2 Topologicl spces................................ 5 1.3 Constructions

More information

Some necessary and sufficient conditions for two variable orthogonal designs in order 44

Some necessary and sufficient conditions for two variable orthogonal designs in order 44 University of Wollongong Reserch Online Fculty of Informtics - Ppers (Archive) Fculty of Engineering n Informtion Sciences 1998 Some necessry n sufficient conitions for two vrile orthogonl esigns in orer

More information

)

) Chpter Five /SOLUTIONS Since the speed ws between nd mph during this five minute period, the fuel efficienc during this period is between 5 mpg nd 8 mpg. So the fuel used during this period is between

More information

F. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997.

F. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997. Forced convex n-gons in the plne F. R. K. Chung y University ofpennsylvni Phildelphi, Pennsylvni 19104 R. L. Grhm AT&T Ls - Reserch Murry Hill, New Jersey 07974 Mrch 2,1997 Astrct In seminl pper from 1935,

More information

Unit 5 Vocabulary. A function is a special relationship where each input has a single output.

Unit 5 Vocabulary. A function is a special relationship where each input has a single output. MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with

More information

A Transportation Problem Analysed by a New Ranking Method

A Transportation Problem Analysed by a New Ranking Method (IJIRSE) Interntionl Journl of Innovtive Reserch in Science & Engineering ISSN (Online) 7-07 A Trnsporttion Problem Anlysed by New Rnking Method Dr. A. Shy Sudh P. Chinthiy Associte Professor PG Scholr

More information

Engineer To Engineer Note

Engineer To Engineer Note Engineer To Engineer Note EE-169 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

Integration. September 28, 2017

Integration. September 28, 2017 Integrtion September 8, 7 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my

More information

Chapter Spline Method of Interpolation More Examples Electrical Engineering

Chapter Spline Method of Interpolation More Examples Electrical Engineering Chpter. Spline Method of Interpoltion More Exmples Electricl Engineering Exmple Thermistors re used to mesure the temperture of bodies. Thermistors re bsed on mterils chnge in resistnce with temperture.

More information

A dual of the rectangle-segmentation problem for binary matrices

A dual of the rectangle-segmentation problem for binary matrices A dul of the rectngle-segmenttion prolem for inry mtrices Thoms Klinowski Astrct We consider the prolem to decompose inry mtrix into smll numer of inry mtrices whose -entries form rectngle. We show tht

More information

Representation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation

Representation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation Representtion of Numbers Number Representtion Computer represent ll numbers, other thn integers nd some frctions with imprecision. Numbers re stored in some pproximtion which cn be represented by fixed

More information

50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula:

50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula: 5 AMC LECTURES Lecture Anlytic Geometry Distnce nd Lines BASIC KNOWLEDGE. Distnce formul The distnce (d) between two points P ( x, y) nd P ( x, y) cn be clculted by the following formul: d ( x y () x )

More information

2 Computing all Intersections of a Set of Segments Line Segment Intersection

2 Computing all Intersections of a Set of Segments Line Segment Intersection 15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design

More information

Applications of the Definite Integral ( Areas and Volumes)

Applications of the Definite Integral ( Areas and Volumes) Mth1242 Project II Nme: Applictions of the Definite Integrl ( Ares nd Volumes) In this project, we explore some pplictions of the definite integrl. We use integrls to find the re etween the grphs of two

More information

CHAPTER 5 Spline Approximation of Functions and Data

CHAPTER 5 Spline Approximation of Functions and Data CHAPTER 5 Spline Approximtion of Functions nd Dt This chpter introduces number of methods for obtining spline pproximtions to given functions, or more precisely, to dt obtined by smpling function. In Section

More information

Iterated Integrals. f (x; y) dy dx. p(x) To evaluate a type I integral, we rst evaluate the inner integral Z q(x) f (x; y) dy.

Iterated Integrals. f (x; y) dy dx. p(x) To evaluate a type I integral, we rst evaluate the inner integral Z q(x) f (x; y) dy. Iterted Integrls Type I Integrls In this section, we begin the study of integrls over regions in the plne. To do so, however, requires tht we exmine the importnt ide of iterted integrls, in which inde

More information

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.

If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs. Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online

More information

Class-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts

Class-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts Clss-XI Mthemtics Conic Sections Chpter-11 Chpter Notes Key Concepts 1. Let be fixed verticl line nd m be nother line intersecting it t fixed point V nd inclined to it t nd ngle On rotting the line m round

More information

International Journal of Scientific & Engineering Research, Volume 4, Issue 12, December ISSN

International Journal of Scientific & Engineering Research, Volume 4, Issue 12, December ISSN Interntionl Journl of Scientific & Engineering Reserch, Volume 4, Issue 1, December-1 ISSN 9-18 Generlised Gussin Qudrture over Sphere K. T. Shivrm Abstrct This pper presents Generlised Gussin qudrture

More information

Stained Glass Design. Teaching Goals:

Stained Glass Design. Teaching Goals: Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to

More information

Duality in linear interval equations

Duality in linear interval equations Aville online t http://ijim.sriu..ir Int. J. Industril Mthemtis Vol. 1, No. 1 (2009) 41-45 Dulity in liner intervl equtions M. Movhedin, S. Slhshour, S. Hji Ghsemi, S. Khezerloo, M. Khezerloo, S. M. Khorsny

More information

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1): Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters

More information

arxiv: v2 [math.ca] 14 Jan 2012

arxiv: v2 [math.ca] 14 Jan 2012 Generlized improper integrl definition for infinite it rxiv:85.3559v2 [mth.ca 14 Jn 212 Michel A. Blischke Abstrct. A generliztion of the definition of one-dimensionl improper integrl with n infinite it

More information

CS311H: Discrete Mathematics. Graph Theory IV. A Non-planar Graph. Regions of a Planar Graph. Euler s Formula. Instructor: Işıl Dillig

CS311H: Discrete Mathematics. Graph Theory IV. A Non-planar Graph. Regions of a Planar Graph. Euler s Formula. Instructor: Işıl Dillig CS311H: Discrete Mthemtics Grph Theory IV Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mthemtics Grph Theory IV 1/25 A Non-plnr Grph Regions of Plnr Grph The plnr representtion of

More information

Misrepresentation of Preferences

Misrepresentation of Preferences Misrepresenttion of Preferences Gicomo Bonnno Deprtment of Economics, University of Cliforni, Dvis, USA gfbonnno@ucdvis.edu Socil choice functions Arrow s theorem sys tht it is not possible to extrct from

More information

What are suffix trees?

What are suffix trees? Suffix Trees 1 Wht re suffix trees? Allow lgorithm designers to store very lrge mount of informtion out strings while still keeping within liner spce Allow users to serch for new strings in the originl

More information

A GENERALIZED PROCEDURE FOR DEFINING QUOTIENT SPACES. b y HAROLD G. LAWRENCE A THESIS OREGON STATE UNIVERSITY MASTER OF ARTS

A GENERALIZED PROCEDURE FOR DEFINING QUOTIENT SPACES. b y HAROLD G. LAWRENCE A THESIS OREGON STATE UNIVERSITY MASTER OF ARTS A GENERALIZED PROCEDURE FOR DEFINING QUOTIENT SPACES b y HAROLD G. LAWRENCE A THESIS submitted to OREGON STATE UNIVERSITY in prtil fulfillment of the requirements for the degree of MASTER OF ARTS June

More information

box Boxes and Arrows 3 true 7.59 'X' An object is drawn as a box that contains its data members, for example:

box Boxes and Arrows 3 true 7.59 'X' An object is drawn as a box that contains its data members, for example: Boxes nd Arrows There re two kinds of vriles in Jv: those tht store primitive vlues nd those tht store references. Primitive vlues re vlues of type long, int, short, chr, yte, oolen, doule, nd flot. References

More information

It is recommended to change the limits of integration while doing a substitution.

It is recommended to change the limits of integration while doing a substitution. MAT 21 eptember 7, 216 Review Indrjit Jn. Generl Tips It is recommended to chnge the limits of integrtion while doing substitution. First write the min formul (eg. centroid, moment of inerti, mss, work

More information

A Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards

A Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards A Tutology Checker loosely relted to Stålmrck s Algorithm y Mrtin Richrds mr@cl.cm.c.uk http://www.cl.cm.c.uk/users/mr/ University Computer Lortory New Museum Site Pemroke Street Cmridge, CB2 3QG Mrtin

More information

Section 3.1: Sequences and Series

Section 3.1: Sequences and Series Section.: Sequences d Series Sequences Let s strt out with the definition of sequence: sequence: ordered list of numbers, often with definite pttern Recll tht in set, order doesn t mtter so this is one

More information

Math/CS 467/667 Programming Assignment 01. Adaptive Gauss Quadrature. q(x)p 4 (x) = 0

Math/CS 467/667 Programming Assignment 01. Adaptive Gauss Quadrature. q(x)p 4 (x) = 0 Adptive Guss Qudrture 1. Find n orthogonl polynomil p 4 of degree 4 such tht 1 1 q(x)p 4 (x) = 0 for every polynomil q(x) of degree 3 or less. You my use Mple nd the Grm Schmidt process s done in clss.

More information

Determining Single Connectivity in Directed Graphs

Determining Single Connectivity in Directed Graphs Determining Single Connectivity in Directed Grphs Adm L. Buchsbum 1 Mrtin C. Crlisle 2 Reserch Report CS-TR-390-92 September 1992 Abstrct In this pper, we consider the problem of determining whether or

More information

1.1. Interval Notation and Set Notation Essential Question When is it convenient to use set-builder notation to represent a set of numbers?

1.1. Interval Notation and Set Notation Essential Question When is it convenient to use set-builder notation to represent a set of numbers? 1.1 TEXAS ESSENTIAL KNOWLEDGE AND SKILLS Prepring for 2A.6.K, 2A.7.I Intervl Nottion nd Set Nottion Essentil Question When is it convenient to use set-uilder nottion to represent set of numers? A collection

More information

SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES

SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES MARCELLO DELGADO Abstrct. The purpose of this pper is to build up the bsic conceptul frmework nd underlying motivtions tht will llow us to understnd ctegoricl

More information

INTRODUCTION TO SIMPLICIAL COMPLEXES

INTRODUCTION TO SIMPLICIAL COMPLEXES INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min

More information

Math 17 - Review. Review for Chapter 12

Math 17 - Review. Review for Chapter 12 Mth 17 - eview Ying Wu eview for hpter 12 1. Given prmetric plnr curve x = f(t), y = g(t), where t b, how to eliminte the prmeter? (Use substitutions, or use trigonometry identities, etc). How to prmeterize

More information

Definition of Regular Expression

Definition of Regular Expression Definition of Regulr Expression After the definition of the string nd lnguges, we re redy to descrie regulr expressions, the nottion we shll use to define the clss of lnguges known s regulr sets. Recll

More information

ANALYTICAL GEOMETRY. The curves obtained by slicing the cone with a plane not passing through the vertex are called conics.

ANALYTICAL GEOMETRY. The curves obtained by slicing the cone with a plane not passing through the vertex are called conics. ANALYTICAL GEOMETRY Definition of Conic: The curves obtined by slicing the cone with plne not pssing through the vertex re clled conics. A Conic is the locus directrix of point which moves in plne, so

More information

Lecture 5: Spatial Analysis Algorithms

Lecture 5: Spatial Analysis Algorithms Lecture 5: Sptil Algorithms GEOG 49: Advnced GIS Sptil Anlsis Algorithms Bsis of much of GIS nlsis tod Mnipultion of mp coordintes Bsed on Eucliden coordinte geometr http://stronom.swin.edu.u/~pbourke/geometr/

More information

Revisiting the notion of Origin-Destination Traffic Matrix of the Hosts that are attached to a Switched Local Area Network

Revisiting the notion of Origin-Destination Traffic Matrix of the Hosts that are attached to a Switched Local Area Network Interntionl Journl of Distributed nd Prllel Systems (IJDPS) Vol., No.6, November 0 Revisiting the notion of Origin-Destintion Trffic Mtrix of the Hosts tht re ttched to Switched Locl Are Network Mondy

More information

Expected Worst-case Performance of Hash Files

Expected Worst-case Performance of Hash Files Expected Worst-cse Performnce of Hsh Files Per-Ake Lrson Deprtment of Informtion Processing, Abo Akdemi, Fnriksgtn, SF-00 ABO 0, Finlnd The following problem is studied: consider hshfilend the longest

More information

WebAssign Lesson 1-3a Substitution Part 1 (Homework)

WebAssign Lesson 1-3a Substitution Part 1 (Homework) WeAssign Lesson -3 Sustitution Prt (Homework) Current Score : / 3 Due : Fridy, June 7 04 :00 AM MDT Jimos Skriletz Mth 75, section 3, Summer 04 Instructor: Jimos Skriletz. /.5 points Suppose you hve the

More information

f[a] x + f[a + x] x + f[a +2 x] x + + f[b x] x

f[a] x + f[a + x] x + f[a +2 x] x + + f[b x] x Bsic Integrtion This chpter contins the fundmentl theory of integrtion. We begin with some problems to motivte the min ide: pproximtion by sum of slices. The chpter confronts this squrely, nd Chpter 3

More information

Midterm 2 Sample solution

Midterm 2 Sample solution Nme: Instructions Midterm 2 Smple solution CMSC 430 Introduction to Compilers Fll 2012 November 28, 2012 This exm contins 9 pges, including this one. Mke sure you hve ll the pges. Write your nme on the

More information

Engineer To Engineer Note

Engineer To Engineer Note Engineer To Engineer Note EE-186 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

Lecture 12 : Topological Spaces

Lecture 12 : Topological Spaces Leture 12 : Topologil Spes 1 Topologil Spes Topology generlizes notion of distne nd loseness et. Definition 1.1. A topology on set X is olletion T of susets of X hving the following properties. 1. nd X

More information

Step-Voltage Regulator Model Test System

Step-Voltage Regulator Model Test System IEEE PES GENERAL MEETING, JULY 5 Step-Voltge Regultor Model Test System Md Rejwnur Rshid Mojumdr, Pblo Arboley, Senior Member, IEEE nd Cristin González-Morán, Member, IEEE Abstrct In this pper, 4-node

More information

9 Graph Cutting Procedures

9 Graph Cutting Procedures 9 Grph Cutting Procedures Lst clss we begn looking t how to embed rbitrry metrics into distributions of trees, nd proved the following theorem due to Brtl (1996): Theorem 9.1 (Brtl (1996)) Given metric

More information

6.2 Volumes of Revolution: The Disk Method

6.2 Volumes of Revolution: The Disk Method mth ppliction: volumes by disks: volume prt ii 6 6 Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem 6) nd the ccumultion process is to determine so-clled volumes

More information

Tilings of Sphere by Congruent Pentagons I

Tilings of Sphere by Congruent Pentagons I rxiv:1310.19v5 [mth.mg] 8 Mr 018 Tilings of Sphere by Congruent Pentgons I K Yue Cheuk, Ho Mn Cheung, Min Yn Hong Kong University of Science nd Technology Mrch 9, 018 Abstrct We develop some bsic tools

More information

Statistical classification of spatial relationships among mathematical symbols

Statistical classification of spatial relationships among mathematical symbols 2009 10th Interntionl Conference on Document Anlysis nd Recognition Sttisticl clssifiction of sptil reltionships mong mthemticl symbols Wl Aly, Seiichi Uchid Deprtment of Intelligent Systems, Kyushu University

More information

This notebook investigates the properties of non-integer differential operators using Fourier analysis.

This notebook investigates the properties of non-integer differential operators using Fourier analysis. Frctionl erivtives.nb Frctionl erivtives by Fourier ecomposition by Eric Thrne 4/9/6 This notebook investigtes the properties of non-integer differentil opertors using Fourier nlysis. In[]:=

More information

B. Definition: The volume of a solid of known integrable cross-section area A(x) from x = a

B. Definition: The volume of a solid of known integrable cross-section area A(x) from x = a Mth 176 Clculus Sec. 6.: Volume I. Volume By Slicing A. Introduction We will e trying to find the volume of solid shped using the sum of cross section res times width. We will e driving towrd developing

More information

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1. Answer on Question #5692, Physics, Optics Stte slient fetures of single slit Frunhofer diffrction pttern. The slit is verticl nd illuminted by point source. Also, obtin n expression for intensity distribution

More information

Text mining: bag of words representation and beyond it

Text mining: bag of words representation and beyond it Text mining: bg of words representtion nd beyond it Jsmink Dobš Fculty of Orgniztion nd Informtics University of Zgreb 1 Outline Definition of text mining Vector spce model or Bg of words representtion

More information