External approximation of nonlinear operator equations

Size: px
Start display at page:

Download "External approximation of nonlinear operator equations"

Transcription

1 External approximation of nonlinear operator equations Etienne Emmric a a TU Berlin, Institut für Matematik, Straße des 17. Juni 136, Berlin January 4, 2009) Based upon an external approximation sceme for te underlying Banac space, a nonlinear operator equation is approximated by a sequence of coercive problems. Te equation is supposed to be governed by te sum of two nonlinear operators acting between a reflexive Banac space and its dual. Under suitable stability assumptions and if te underlying operators can be approximated consistently, weak convergence of a subsequence of approximate solutions is sown. Tis also proves existence of solutions to te original equation. Keywords: Nonlinear operator equation; monotone operator; perturbation; external approximation sceme; convergence AMS Subject Classification: 65J15; 65N12; 47J25; 47H05 1. Introduction Let V be a real reflexive Banac space wit its dual V. We are concerned wit te approximate solution of te following problem: For f V find u V suc tat Au + Bu = f in V. 1) Here, A : V V and B : V V are given operators. A standard situation is A being monotone and emicontinuous, B being a strongly continuous perturbation of A and A + B being coercive. Many boundary value problems for quasilinear partial differential equations arising in pysics, fluid mecanics and oter areas of application can be formulated as 1) see, e.g., te monograps [6, 8, 19] and te references terein). For teir approximate solution, often Galerkin-type or finite difference metods are employed. Te study of all tese metods can be unified by considering so-called external approximation scemes. Tis concept covers in particular finite differences, nonconforming finite elements as well as fully discrete finite element metods wit quadrature see [15, 16] for several examples). External approximation scemes ave been studied in [13] in te context of te convergence of finite difference approximations for quasilinear partial differential equations and A-proper operators see [16], [19, C. 35] for introductions into te concept of external approximation scemes). Later on, extensions of te results obtained in [13] ave been studied in [17, 18], te focus being on te equivalence of unique solvability of te original and approximate problem. External approximations ave also been studied for eigenvalue problems and te penomenon of superconvergence see [10 12]) and, more recently, for te approx- emmric@mat.tu-berlin.de

2 2 E. Emmric imation of variational problems in spaces of piecewise constant functions see [5]). Te concept of external approximation as furter been employed in [15] for studying different numerical metods for solving te Navier-Stokes problem tat is, in te stationary case, indeed of te type 1) wit A being linear and strongly positive, B being strongly continuous and A + B being coercive. Te assumptions on te approximating operators studied so far in [13, 17, 18] in particular, an inverse stability tat would follow from stronger uniform monotonicity assumptions) are, owever, different from te assumptions on wic our studies are based. Indeed, we try to apply te concept of external approximation in order to generalise te often found standard situation for 1) wit A being monotone and emicontinuous, B being strongly continuous and A + B being coercive. It is well-known tat in tis situation Brézis teorem on pseudomonotone operators provides existence of solutions to 1). So, our approac is not based upon te concept of A-properness see [9] and te references cited terein for a discussion of tis concept) but on weaker assumptions yielding ten only convergence of a subsequence in a weak sense. In particular, we do not assume well-posedness of te approximate problems but only solvability and, in general, we do not ave a continuous inverse of te approximate operator for tis case, see also te exaustive work [3]). Anoter approac for studying approximations of monotone operator equations employs projection metods as in [1, 2, 6], wic can be interpreted as internal approximation scemes. Te essential advantage of external approximation scemes, owever, is tat te function spaces approximating V need not to be subspaces of V. Tis allows muc more flexibility in te coice of te numerical metod and often simplifies te numerical analysis. We sould mention tat, besides te concept of external approximation, also te concept of discrete convergence and discrete approximation as introduced in [14], wic goes witout prolongation and restriction operators, provides a frame for considering rater different numerical metods in a unifying way. Tis concept as been applied in [7] to te study of nonlinear operator equations based upon te notion of approximation-regular operators, wic is a generalisation of A-properness. Te results in [7] also cover quasilinear elliptic problems leading to a coercive and strictly monotone operator equation of te type 1)) under perturbation of te domain or coefficients. Te main result in tis paper will be a general convergence result for te case tat tere is a stable and admissible external approximation sceme and tat A, B, f in 1) can be approximated in a consistent way. Te required assumption on te sequence of approximations of A can be seen as a discrete analogue of te property M). Moreover, our convergence result is based upon an a priori estimate for te sequence of approximate solutions wic follows from uniform coercivity. Te Galerkin metod in te standard situation as described above is sown to be a special case of our approximation sceme. Te paper is organised as follows: In Section 2, we describe te external approximation sceme, present te necessary notation, and prove some results on te consistency and solvability of te approximation. Te main result is stated and proven in Section 3. Section 4 provides an example. 2. Te external approximation sceme For a normed space X, we always denote its norm by X, its dual space by X wit standard norm X and te dual pairing by,. Let V be a given real reflexive Banac space. Let H be a countable infinite

3 External approximation of nonlinear operator equations 3 sequence of indices and let {V, p, r )} H be a sequence of real normed spaces V, prolongation operators p : V F and restriction operators r : V V. Te prolongation operators are assumed to be linear and bounded. Here, F is a suitably cosen real reflexive Banac space suc tat tere is a so-called syncronisation operator ω : V F tat is linear, bounded and injective. Te family {V, p, r )} H ten is said to be an external approximation sceme for V. In some situations, te restriction operators are only defined on a dense subset of V but can be extended on V see [15, Prop. 3.1 on p. 30], [16, Prop. 4 on p. 28]). Definition 2.1: An external approximation sceme {V, p, r )} H for V is said to be stable iff tere is a constant c > 0 suc tat for all H It is said to be admissible iff it fulfills i) te compatibility condition: p v F c v V v V. p r v ωv in F H ) v V, ii) te syncronisation condition: for any subsequence H H of indices and {v } H {V }, g F wit p v g in F H ) tere is an element v V suc tat ωv = g. Note tat te use of te foregoing notions is not consistent in te literature. We now consider te sequence of approximate problems: For f V find u V suc tat A u + B u = f in V. 2) Here, {A } H, {B } H and {f } H are sequences of operators and functionals approximating A, B and f, respectively. Definition 2.2: Let {V, p, r )} H be a stable and admissible external approximation sceme for V. A sequence {A, B, f )} H of operators A : V V, B : V V and functionals f V is said to be a consistent approximation of A, B, f) iff for any subsequence H H and any {v } H {V }, v V wit p v ωv in F H ) tere olds i) if tere is an element g F suc tat ten Av = g in V ; A v, r w g, w w V, lim sup A v, v g, v ii) B v, r w Bv, w w V, lim inf B v, v Bv, v ; iii) f, r w f, w w V, lim sup f, v f, v. We remark tat condition i) in te foregoing definition is a discrete counterpart of te property M) see [8, p. 173]). A standard example is given by Proposition 2.3: Let {V } H be a Galerkin sceme for V, p : V V be te identity and r : V V suc tat r v is a best approximation of v V in V. Ten {V, p, r )} H is a stable and admissible external approximation sceme wit F = V. Let A = p Ap wit p : V V denoting te dual operator of p ), B = p Bp and f = p f. If A : V V is monotone and

4 4 E. Emmric emicontinuous and B : V V is strongly continuous ten A, B, f ) H consistent approximation of A, B, f). Proof : Stability and admissibility of te external approximation sceme built by a Galerkin sceme is evident. For proving consistency, let H H and {v } H {V }, v V wit p v ωv = v in F = V H ) be given. In wat follows, all convergence is meant for H. i) Wit A = p Ap, we find from te definition of te dual operator A v, w = Ap v, p w w V. Let w V be arbitrary. Te monotonicity of A : V V ten provides is a A v, v = Ap v, p v Ap v, p v Ap v Aw, p v w = Aw, p v w + Ap v, p r w + Ap v, w p r w. 3) Te first term on te rigt-and side of 3) converges towards Aw, v w since p v v in V. Te second term Ap v, p r w = A v, r w converges towards g, w by te assumption in Definition 2.2 i). For te tird term, we observe tat {Ap v } H is bounded in V, wic follows see, e.g., [6, Folg. 1.2 on p. 65]) from te boundedness of { Ap v, p v } H by te assumption in Definition 2.2 i)), te boundedness of {p v } H in V te sequence is weakly convergent) and te monotonicity of A : V V. Te tird term tus vanises in te limit since p r w w in V compatibility). In te limit, we finally obtain from 3) togeter wit te assumption in Definition 2.2 i) g, v lim sup A v, v lim Aw, p v w + Ap v, p r w + Ap v, w p r w = Aw, v w + g, w. ) 4) Taking w = v ± sz for arbitrary z V and s 0, 1] yields Av + sz), z g, z and Av sz), z g, z, and wit s 0+, te emicontinuity of A : V V sows Av, z = g, z and ence Av = g. ii) Wit B = p Bp, we find for all w V B v, r w = Bp v, p r w. Since B : V V is strongly continuous and p v v in V, it follows Bp v Bv in V. Because of p r w w in V, we come up wit Moreover, we ave B v, r w Bv, w. B v, v = Bp v, p v Bv, v.

5 External approximation of nonlinear operator equations 5 iii) Wit respect to te approximation of f V, we observe for all w V f, r w = f, p r w f, w as well as remember p v v in V ) f, v = f, p v f, v. Note tat a best approximation r v of v V in V always exists if dim V < but r migt be nonlinear. Instead of te best approximation, one may also take a suitable projection. In [16, p. 28], te restriction operator on V is constructed from its definition on te dense subset H V. It arises te question, from wic assumptions one can derive condition i) in Definition 2.2. An answer is given by Proposition 2.4: Let {V, p, r )} H be a stable and admissible external approximation sceme for V and let A : V V be emicontinuous. Assume tat all A : V V H ) are monotone and tat for any subsequence H H and any {v } H {V }, v V wit p v ωv in F H ) lim sup A r w, v Aw, v w V. 5) Ten condition i) in Definition 2.2 is fulfilled. Proof : Te monotonicity of A H ) yields for arbitrary w V A v, v A v, v A v A r w, v r w = A r w, v r w + A v, r w. In te limit, we tus obtain by te assumption in Definition 2.2 i) and wit 5) g, v lim sup A v, v lim sup A r w, v r w + lim A v, r w Aw, v w + g, w. Here, we ave employed tat p v ωv, p r w ωw in F H ). Te emicontinuity of A implies Av = g in V as in 4). We will also make use of te following notion. Definition 2.5: Let {V } H be a sequence of normed spaces. A sequence {T } H of operators T : V V is said to be coercive uniformly in iff tere is a function γ : R + 0 R wit γz) as z suc tat for all H T v, v γ v V ) v V v V. We end tis section by presenting a criterion for te existence of solutions to te approximate problem.

6 6 E. Emmric Lemma 2.6: Let Φ : R N R N be continuous. If tere is R > 0 suc tat Φv) v 0 for all v R N wit v R N = R ten tere exists u R N wit u R N R and Φu) = 0. Proof : Te proof follows by contradiction from Brouwer s fixed point teorem see, e.g., [6, Lemma 2.1 on p. 74]). Teorem 2.7 : Let V be a normed space wit dim V = N < and let A, B : V V be continuous operators suc tat A + B is coercive. For any f V, equation 2) ten possesses a solution. Proof : Let {e i } N be a basis in V. Ten tere is a bijective mapping between V and R N given by te representation v = N v i e i V, v = [v 1,..., v N ] R N. On R N, we define te norm v R N := v V and te mapping Φv) = [Φ 1,..., Φ N ] wit Φ i v) := A v + B v f, e i i = 1,..., N). Obviously, Φ : R N R N is continuous if A, B : V V are continuous. Because of te coercivity of A + B, we find wit a function γ : R + 0 R wit γz) as z ) Φv) v = A v + B v f, v γ v V ) v V f V v V 0 if v V = v R N is sufficiently large. Lemma 2.6 now yields te existence of u R N and tus of u V suc tat Φu) = 0. But ten u solves 2). In applications, te continuity of te approximate operators in a finite dimensional space often follows already from te emicontinuity of te operators A, B. 3. Convergence Te main result can be formulated as follows. Teorem 3.1 : Suppose tere is a consistent approximation of A, B, f). Assume furter tat 2) possesses a solution u V for any H, tat te operators A + B : V V H ) are coercive uniformly in and tat te sequence { f V } H is bounded. Ten tere is a subsequence H H and an element u V suc tat p u ωu in F H ) ; te limit u satisfies 1). Proof : Wit te coercivity assumption, we immediately find γ u V ) u V A u + B u, u = f, u f V u V.

7 External approximation of nonlinear operator equations 7 Since γz) z as z and since { f V } H is bounded, tis sows also te boundedness of { u V } H. Because of te stability of te external approximation sceme, ten also te sequence {p u } H F is bounded. In view of te reflexivity of F, tere is a subsequence H H suc tat {p u } H is weakly convergent in F see, e.g., [4, Tm. III.27]). Togeter wit te syncronisation condition in Definition 2.1 ii), tere is an element u V suc tat p u ωu in F H ). Wit Definition 2.2 ii), iii), we now find for all w V f B u, r w f Bu, w, lim sup f B u, u f Bu, u. Wit 2), it follows for all w V as well as A u, r w = f B u, r w f Bu, w lim sup A u, u = lim sup f B u, u f Bu, u. Definition 2.2 i) now provides Au = f Bu in V. 4. Example In order to keep te presentation sort, we only consider a somewat simple example: a linear finite element metod wit quadrature for a one-dimensional quasilinear Diriclet problem witout perturbation suc tat B = B 0. Let ψ = ψx, t) : [0, 1] R + 0 R be a given continuous function. We suppose tat t ψx, t)t is monotonically increasing for all x [0, 1] and tat tere is a number p 1, ) and constants µ, c > 0 suc tat ψx, t)t 2 µt p, ψx, t) c1 + t p 2 ) x, t) [0, 1] R + 0. Tis setting covers, e.g., te one-dimensional p-laplacian. For a given rigt-and side f L p 0, 1) 1/p + 1/p = 1), ten consider te problem ψx, u x) )u x)) = fx) x 0, 1)), u0) = u1) = 0. 6) Te weak formulation of 6) leads to te operator equation 1) wit te standard Sobolev space V = W 1,p 1 1/p 0 0, 1) wit norm v V := 0 v x) dx) p and an operator A : V V, defined for v, w V via Av, w := 1 0 ψx, v x) )v x)w x)dx.

8 8 E. Emmric Te growt condition for ψ ensures tat A maps V into V. Te emicontinuity of A is a direct consequence of te continuity of ψ. Te rigt-and side in 1) is te functional v 1 0 fx)vx)dx. We partition [0, 1] equidistantly into M N subintervals [x i, x i+1 ] x i = i/m, i = 0,..., M) of lengt = 1/M and employ linear finite elements. Wen also applying a simple rectangular rule taking te rigt value) for te numerical evaluation of te appearing integrals, we end up wit a fully discrete approximation of 6) tat can be written in te form 2). Tis finite element metod wit quadrature is equivalent to a finite difference sceme. We take V as te space of grid functions v = [v,0,..., v,m ] T R M+1, v,0 = v,m = 0, and endow it wit te norm ) 1/p v V := Di v p, were Di v := v i v i 1 )/. Te dual V can be identified wit te M 1)- dimensional space of grid functions g = [g,1,..., g,m 1 ] T R M 1 suc tat g i = D i + w := w,i+1 w,i )/ i = 1,..., M 1) for some w V, te dual pairing is given by M 1 M 1 g, v = g,i v,i = w,i Di v. Te prolongation p v of v V is te piecewise linear interpolation of te points x 0, v,0 ),..., x M, v,m ). Te restriction is defined via r v) i := vx i ) i = 0,..., M) wic is well-defined since W 1,p 0 0, 1) is continuously embedded in C [0, 1]). It is easy to sow tat te sequence {V, p, r )} M=1/ N builds a stable and admissible external approximation sceme for V wit F = V. In particular, we find for all v V p v V = v V, and te compatibility condition, i.e. p r v v in V, is easily sown by density. If we would take a simpler prolongation suc as te piecewise constant interpolation of te values of v as well as of teir divided differences ten we would come up wit ωv = v, v ) F = L p 0, 1) L p 0, 1). A simple calculation sows for v, w V A v, w = ψx i, Di v )Di v Di w, and, loosely written, we ave A v ) i = D i + ψxi, Di v )Di v ) for i = 1,..., M 1. Te assumptions on ψ allow to prove in particular tat A maps V into V and is monotone. In view of Teorem 2.7, te discrete problem is solvable: Te continuity of A : V V is a direct consequence of te continuity of ψ. Te coercivity uniform

9 External approximation of nonlinear operator equations 9 in ) follows from A v, v = ψx i, Di v )Di v ) 2 µ Di v p = µ v p V, v V. We now prove condition 5). Let p v v in V for an arbitrary null sequence of mes sizes wit 1/ = M N) and let w V be arbitrary. We set Di w := wx i ) wx i 1 ))/ i = 1,..., M) remember w V = W 1,p 0 0, 1) C [0, 1])). A straigtforward calculation sows A r w, v Aw, v = xi x i 1 ) ψx i, Di w )D i w ψx, w x) )w x) dx Di v ψx, w x) )w x) p v ) x) v x) ) dx =: a 1, + a 2,. 7) Denoting by ψ te w.r.t. te first argument piecewise constant approximation of ψ suc tat ψ x, t) = ψx i, t) for x x i 1, x i ] i = 1,..., M) and t R + 0 and upon noting tat p r w) x) = Di w for x x i 1, x i ) i = 1,..., M), we find for te first term a 1, by applying Hölder s inequality wit 1/p + 1/p = 1 a 1, M 1 xi x i 1 xi x i 1 ) ψx i, Di w )D i w ψx, w x) )w p) 1/p x) dx v V ψx i, Di w )D i w ψx, w x) )w x) p dx ) 1/p 1 = ψ x, p r w) x) )p r w) x) ψx, w x) )w x) p dx 0 v V ) 1/p v V. Since te sequence {p v } is weakly convergent in V it is also bounded in V suc tat v V = p v V c for some c > 0. It remains to analyse te integral on te rigt-and side of te foregoing estimate. Tis integral, owever, converges towards zero, wic follows from te continuity of ψ, te continuity of te Nemyzkii operator corresponding to ψ as a mapping from L p 0, 1) into L p 0, 1) see [19, Prop on p. 561] and remember te growt condition for ψ) as well as p r w w in V = W 1,p 0 0, 1), i.e. p r w) w in L p 0, 1). For te second term a 2, in 7), we immediately ave in view of p v v in V ) a 2, = Aw, p v v 0. Wit respect to te rigt-and side, we ave to be somewat careful as f L p 0, 1) does not allow to take point values. Instead, we may take f,i = 1 xi+1 x i fx)dx, i = 1,..., M 1.

10 10 REFERENCES One can easily prove tat f is in V. Moreover, for arbitrary v V, we ave f, v = M 1 xi+1 and tus wit 1/p + 1/p = 1) x i fx)dx v,i = 1 x i fx)dx D i v f, v f V = sup v V \{0} v V 1 x i fx)dx p ) 1/p f L p 0,1), wic sows te boundedness of te sequence { f V } as required in Teorem 3.1. It remains to prove condition iii) in Definition 2.2. Let p v v in V, wic implies tat te sequence {p v } is bounded in V. Since and tus f, v f, p v = f, v f, p v we obtain 1 0 = M 1 M 1 xi x i 1 fx)v,i p v )x))dx xi x i 1 fx)p v ) x)x i x)dx fx)p v ) x) dx f L p 0,1) p v V 0, f, v f, v = f, v f, p v + f, p v v 0. After all, Proposition 2.4 and Teorem 3.1 can be applied. Tis sows te existence of a weak solution u V = W 1,p 0 0, 1) to 6) and a subsequence, denoted by, suc tat te piecewise linear interpolations of te discrete solutions u converge weakly in V towards u. References [1] P.M. Anselone and J.-G. Lei, Te approximate solution of monotone nonlinear operator equations, Rocky Mt. J. Mat ) 4, [2] P.M. Anselone and J.-G. Lei, Nonlinear operator approximation teory based on demiregular convergence, Acta Mat. Sci ), [3] J.-P. Aubin, Approximation des espaces de distributions et des opérateurs différentiels. Mémoires de la S.M.F ), [4] H. Brézis, Analyse fonctionnelle: Téorie et applications, Dunod, Paris, [5] C. Davini and R. Paroni, External approximation of first order variational problems via W 1,p estimates, ESAIM Control Optim. Calc. Var ) 4, [6] H. Gajewski, K. Gröger and K. Zacarias, Nictlineare Operatorgleicungen und Operatordifferentialgleicungen, Akademie-Verlag, Berlin, [7] R.D. Grigorieff, Über diskrete Approximationen nictlinearer Gleicungen 1. Art, Mat. Nacr ) [8] J.-L. Lions, Quelques métodes de résolution des problèmes aux limites non linéaires, Dunod, Gautier-Villars, Paris, 1969.

11 REFERENCES 11 [9] W.V. Petrysin, Approximation-solvability of nonlinear functional and differential equations, M. Dekker, New York, [10] T. Regińska, External approximation of eigenvalue problems in Banac spaces, RAIRO Anal. Numér ), [11] T. Regińska, Superconvergence of external approximation of eigenvalues of ordinary differential operators, IMA J. Numer. Anal ) 3, [12] T. Regińska, Superconvergence of external approximation for two-point boundary problems, Apl. Mat ) 1, [13] R. Scumann and E. Zeidler, Te finite difference metod for quasilinear elliptic equations of order 2m, Numer. Funct. Anal. Optimization ), [14] F. Stummel, Diskrete Konvergenz linearer Operatoren I, Mat. Ann ) [15] R. Temam, Navier-Stokes equations: Teory and numerical analysis, AMS Celsea Publ., American Matematical Society, Providence, Rode Island, [16] R. Temam, Numerical analysis, D. Reidel Publ. Company, Dordrect, [17] R.U. Verma, On te external approximation-solvability of nonlinear equations, Panam. Mat. J ) 3, [18] R.U. Verma, Stable discretization metods wit external approximation scemes, J. Appl. Mat. Stocastic Anal ) 4, [19] E. Zeidler, Nonlinear functional analysis and its applications, II/A: Linear monotone operators, II/B: Nonlinear monotone operators, Springer, New York, 1990.

FINITE DIFFERENCE METHODS

FINITE DIFFERENCE METHODS FINITE DIFFERENCE METHODS LONG CHEN Te best known metods, finite difference, consists of replacing eac derivative by a difference quotient in te classic formulation. It is simple to code and economic to

More information

Verifying Numerical Convergence Rates

Verifying Numerical Convergence Rates 1 Order of accuracy Verifying Numerical Convergence Rates We consider a numerical approximation of an exact value u. Te approximation depends on a small parameter, suc as te grid size or time step, and

More information

OPTIMAL DISCONTINUOUS GALERKIN METHODS FOR THE ACOUSTIC WAVE EQUATION IN HIGHER DIMENSIONS

OPTIMAL DISCONTINUOUS GALERKIN METHODS FOR THE ACOUSTIC WAVE EQUATION IN HIGHER DIMENSIONS OPTIMAL DISCONTINUOUS GALERKIN METHODS FOR THE ACOUSTIC WAVE EQUATION IN HIGHER DIMENSIONS ERIC T. CHUNG AND BJÖRN ENGQUIST Abstract. In tis paper, we developed and analyzed a new class of discontinuous

More information

f(a + h) f(a) f (a) = lim

f(a + h) f(a) f (a) = lim Lecture 7 : Derivative AS a Function In te previous section we defined te derivative of a function f at a number a (wen te function f is defined in an open interval containing a) to be f (a) 0 f(a + )

More information

Distances in random graphs with infinite mean degrees

Distances in random graphs with infinite mean degrees Distances in random graps wit infinite mean degrees Henri van den Esker, Remco van der Hofstad, Gerard Hoogiemstra and Dmitri Znamenski April 26, 2005 Abstract We study random graps wit an i.i.d. degree

More information

Geometric Stratification of Accounting Data

Geometric Stratification of Accounting Data Stratification of Accounting Data Patricia Gunning * Jane Mary Horgan ** William Yancey *** Abstract: We suggest a new procedure for defining te boundaries of te strata in igly skewed populations, usual

More information

Derivatives Math 120 Calculus I D Joyce, Fall 2013

Derivatives Math 120 Calculus I D Joyce, Fall 2013 Derivatives Mat 20 Calculus I D Joyce, Fall 203 Since we ave a good understanding of its, we can develop derivatives very quickly. Recall tat we defined te derivative f x of a function f at x to be te

More information

In other words the graph of the polynomial should pass through the points

In other words the graph of the polynomial should pass through the points Capter 3 Interpolation Interpolation is te problem of fitting a smoot curve troug a given set of points, generally as te grap of a function. It is useful at least in data analysis (interpolation is a form

More information

Lecture 10: What is a Function, definition, piecewise defined functions, difference quotient, domain of a function

Lecture 10: What is a Function, definition, piecewise defined functions, difference quotient, domain of a function Lecture 10: Wat is a Function, definition, piecewise defined functions, difference quotient, domain of a function A function arises wen one quantity depends on anoter. Many everyday relationsips between

More information

ACT Math Facts & Formulas

ACT Math Facts & Formulas Numbers, Sequences, Factors Integers:..., -3, -2, -1, 0, 1, 2, 3,... Rationals: fractions, tat is, anyting expressable as a ratio of integers Reals: integers plus rationals plus special numbers suc as

More information

A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS. In memory of Rou-Huai Wang

A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS. In memory of Rou-Huai Wang A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS XAVIER CABRÉ, MANEL SANCHÓN, AND JOEL SPRUCK In memory of Rou-Huai Wang 1. Introduction In this note we consider semistable

More information

Chapter 7 Numerical Differentiation and Integration

Chapter 7 Numerical Differentiation and Integration 45 We ave a abit in writing articles publised in scientiþc journals to make te work as Þnised as possible, to cover up all te tracks, to not worry about te blind alleys or describe ow you ad te wrong idea

More information

Instantaneous Rate of Change:

Instantaneous Rate of Change: Instantaneous Rate of Cange: Last section we discovered tat te average rate of cange in F(x) can also be interpreted as te slope of a scant line. Te average rate of cange involves te cange in F(x) over

More information

M(0) = 1 M(1) = 2 M(h) = M(h 1) + M(h 2) + 1 (h > 1)

M(0) = 1 M(1) = 2 M(h) = M(h 1) + M(h 2) + 1 (h > 1) Insertion and Deletion in VL Trees Submitted in Partial Fulfillment of te Requirements for Dr. Eric Kaltofen s 66621: nalysis of lgoritms by Robert McCloskey December 14, 1984 1 ackground ccording to Knut

More information

BANACH AND HILBERT SPACE REVIEW

BANACH AND HILBERT SPACE REVIEW BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but

More information

MATHEMATICAL MODELS OF LIFE SUPPORT SYSTEMS Vol. I - Mathematical Models for Prediction of Climate - Dymnikov V.P.

MATHEMATICAL MODELS OF LIFE SUPPORT SYSTEMS Vol. I - Mathematical Models for Prediction of Climate - Dymnikov V.P. MATHEMATICAL MODELS FOR PREDICTION OF CLIMATE Institute of Numerical Matematics, Russian Academy of Sciences, Moscow, Russia. Keywords: Modeling, climate system, climate, dynamic system, attractor, dimension,

More information

1.6. Analyse Optimum Volume and Surface Area. Maximum Volume for a Given Surface Area. Example 1. Solution

1.6. Analyse Optimum Volume and Surface Area. Maximum Volume for a Given Surface Area. Example 1. Solution 1.6 Analyse Optimum Volume and Surface Area Estimation and oter informal metods of optimizing measures suc as surface area and volume often lead to reasonable solutions suc as te design of te tent in tis

More information

Part II: Finite Difference/Volume Discretisation for CFD

Part II: Finite Difference/Volume Discretisation for CFD Part II: Finite Difference/Volume Discretisation for CFD Finite Volume Metod of te Advection-Diffusion Equation A Finite Difference/Volume Metod for te Incompressible Navier-Stokes Equations Marker-and-Cell

More information

6. Differentiating the exponential and logarithm functions

6. Differentiating the exponential and logarithm functions 1 6. Differentiating te exponential and logaritm functions We wis to find and use derivatives for functions of te form f(x) = a x, were a is a constant. By far te most convenient suc function for tis purpose

More information

MATHEMATICS FOR ENGINEERING DIFFERENTIATION TUTORIAL 1 - BASIC DIFFERENTIATION

MATHEMATICS FOR ENGINEERING DIFFERENTIATION TUTORIAL 1 - BASIC DIFFERENTIATION MATHEMATICS FOR ENGINEERING DIFFERENTIATION TUTORIAL 1 - BASIC DIFFERENTIATION Tis tutorial is essential pre-requisite material for anyone stuing mecanical engineering. Tis tutorial uses te principle of

More information

CHAPTER 7. Di erentiation

CHAPTER 7. Di erentiation CHAPTER 7 Di erentiation 1. Te Derivative at a Point Definition 7.1. Let f be a function defined on a neigborood of x 0. f is di erentiable at x 0, if te following it exists: f 0 fx 0 + ) fx 0 ) x 0 )=.

More information

CONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian. Pasquale Candito and Giuseppina D Aguí

CONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian. Pasquale Candito and Giuseppina D Aguí Opuscula Math. 34 no. 4 2014 683 690 http://dx.doi.org/10.7494/opmath.2014.34.4.683 Opuscula Mathematica CONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian Pasquale

More information

Unemployment insurance/severance payments and informality in developing countries

Unemployment insurance/severance payments and informality in developing countries Unemployment insurance/severance payments and informality in developing countries David Bardey y and Fernando Jaramillo z First version: September 2011. Tis version: November 2011. Abstract We analyze

More information

SAT Subject Math Level 1 Facts & Formulas

SAT Subject Math Level 1 Facts & Formulas Numbers, Sequences, Factors Integers:..., -3, -2, -1, 0, 1, 2, 3,... Reals: integers plus fractions, decimals, and irrationals ( 2, 3, π, etc.) Order Of Operations: Aritmetic Sequences: PEMDAS (Parenteses

More information

Solutions by: KARATUĞ OZAN BiRCAN. PROBLEM 1 (20 points): Let D be a region, i.e., an open connected set in

Solutions by: KARATUĞ OZAN BiRCAN. PROBLEM 1 (20 points): Let D be a region, i.e., an open connected set in KOÇ UNIVERSITY, SPRING 2014 MATH 401, MIDTERM-1, MARCH 3 Instructor: BURAK OZBAGCI TIME: 75 Minutes Solutions by: KARATUĞ OZAN BiRCAN PROBLEM 1 (20 points): Let D be a region, i.e., an open connected set

More information

1 if 1 x 0 1 if 0 x 1

1 if 1 x 0 1 if 0 x 1 Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

More information

Section 3.3. Differentiation of Polynomials and Rational Functions. Difference Equations to Differential Equations

Section 3.3. Differentiation of Polynomials and Rational Functions. Difference Equations to Differential Equations Difference Equations to Differential Equations Section 3.3 Differentiation of Polynomials an Rational Functions In tis section we begin te task of iscovering rules for ifferentiating various classes of

More information

Computer Science and Engineering, UCSD October 7, 1999 Goldreic-Levin Teorem Autor: Bellare Te Goldreic-Levin Teorem 1 Te problem We æx a an integer n for te lengt of te strings involved. If a is an n-bit

More information

Metric Spaces. Chapter 7. 7.1. Metrics

Metric Spaces. Chapter 7. 7.1. Metrics Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

More information

A New Cement to Glue Nonconforming Grids with Robin Interface Conditions: The Finite Element Case

A New Cement to Glue Nonconforming Grids with Robin Interface Conditions: The Finite Element Case A New Cement to Glue Nonconforming Grids wit Robin Interface Conditions: Te Finite Element Case Martin J. Gander, Caroline Japet 2, Yvon Maday 3, and Frédéric Nataf 4 McGill University, Dept. of Matematics

More information

Cyber Epidemic Models with Dependences

Cyber Epidemic Models with Dependences Cyber Epidemic Models wit Dependences Maocao Xu 1, Gaofeng Da 2 and Souuai Xu 3 1 Department of Matematics, Illinois State University mxu2@ilstu.edu 2 Institute for Cyber Security, University of Texas

More information

Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)

Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of

More information

Some stability results of parameter identification in a jump diffusion model

Some stability results of parameter identification in a jump diffusion model Some stability results of parameter identification in a jump diffusion model D. Düvelmeyer Technische Universität Chemnitz, Fakultät für Mathematik, 09107 Chemnitz, Germany Abstract In this paper we discuss

More information

Tangent Lines and Rates of Change

Tangent Lines and Rates of Change Tangent Lines and Rates of Cange 9-2-2005 Given a function y = f(x), ow do you find te slope of te tangent line to te grap at te point P(a, f(a))? (I m tinking of te tangent line as a line tat just skims

More information

A Multigrid Tutorial part two

A Multigrid Tutorial part two A Multigrid Tutorial part two William L. Briggs Department of Matematics University of Colorado at Denver Van Emden Henson Center for Applied Scientific Computing Lawrence Livermore National Laboratory

More information

Duality of linear conic problems

Duality of linear conic problems Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least

More information

Can a Lump-Sum Transfer Make Everyone Enjoy the Gains. from Free Trade?

Can a Lump-Sum Transfer Make Everyone Enjoy the Gains. from Free Trade? Can a Lump-Sum Transfer Make Everyone Enjoy te Gains from Free Trade? Yasukazu Icino Department of Economics, Konan University June 30, 2010 Abstract I examine lump-sum transfer rules to redistribute te

More information

Projective Geometry. Projective Geometry

Projective Geometry. Projective Geometry Euclidean versus Euclidean geometry describes sapes as tey are Properties of objects tat are uncanged by rigid motions» Lengts» Angles» Parallelism Projective geometry describes objects as tey appear Lengts,

More information

The finite element immersed boundary method: model, stability, and numerical results

The finite element immersed boundary method: model, stability, and numerical results Te finite element immersed boundary metod: model, stability, and numerical results Lucia Gastaldi Università di Brescia ttp://dm.ing.unibs.it/gastaldi/ INdAM Worksop, Cortona, September 18, 2006 Joint

More information

Note nine: Linear programming CSE 101. 1 Linear constraints and objective functions. 1.1 Introductory example. Copyright c Sanjoy Dasgupta 1

Note nine: Linear programming CSE 101. 1 Linear constraints and objective functions. 1.1 Introductory example. Copyright c Sanjoy Dasgupta 1 Copyrigt c Sanjoy Dasgupta Figure. (a) Te feasible region for a linear program wit two variables (see tet for details). (b) Contour lines of te objective function: for different values of (profit). Te

More information

ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction

ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE J.M. CALABUIG, J. RODRÍGUEZ, AND E.A. SÁNCHEZ-PÉREZ Abstract. Let m be a vector measure taking values in a Banach space X. We prove that

More information

Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1

Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing

More information

Separation Properties for Locally Convex Cones

Separation Properties for Locally Convex Cones Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

More information

The Derivative as a Function

The Derivative as a Function Section 2.2 Te Derivative as a Function 200 Kiryl Tsiscanka Te Derivative as a Function DEFINITION: Te derivative of a function f at a number a, denoted by f (a), is if tis limit exists. f (a) f(a+) f(a)

More information

Strategic trading in a dynamic noisy market. Dimitri Vayanos

Strategic trading in a dynamic noisy market. Dimitri Vayanos LSE Researc Online Article (refereed) Strategic trading in a dynamic noisy market Dimitri Vayanos LSE as developed LSE Researc Online so tat users may access researc output of te Scool. Copyrigt and Moral

More information

b i (x) u x i + F (x, u),

b i (x) u x i + F (x, u), Topological Methods in Nonlinear Analysis Journal of the Juliusz Schauder Center Volume 14, 1999, 275 293 TOPOLOGICAL DEGREE FOR A CLASS OF ELLIPTIC OPERATORS IN R n Cristelle Barillon Vitaly A. Volpert

More information

Equilibria in sequential bargaining games as solutions to systems of equations

Equilibria in sequential bargaining games as solutions to systems of equations Economics Letters 84 (2004) 407 411 www.elsevier.com/locate/econbase Equilibria in sequential bargaining games as solutions to systems of equations Tasos Kalandrakis* Department of Political Science, Yale

More information

An inquiry into the multiplier process in IS-LM model

An inquiry into the multiplier process in IS-LM model An inquiry into te multiplier process in IS-LM model Autor: Li ziran Address: Li ziran, Room 409, Building 38#, Peing University, Beijing 00.87,PRC. Pone: (86) 00-62763074 Internet Address: jefferson@water.pu.edu.cn

More information

Lecture 13 Linear quadratic Lyapunov theory

Lecture 13 Linear quadratic Lyapunov theory EE363 Winter 28-9 Lecture 13 Linear quadratic Lyapunov theory the Lyapunov equation Lyapunov stability conditions the Lyapunov operator and integral evaluating quadratic integrals analysis of ARE discrete-time

More information

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

More information

Matrix Representations of Linear Transformations and Changes of Coordinates

Matrix Representations of Linear Transformations and Changes of Coordinates Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under

More information

- 1 - Handout #22 May 23, 2012 Huffman Encoding and Data Compression. CS106B Spring 2012. Handout by Julie Zelenski with minor edits by Keith Schwarz

- 1 - Handout #22 May 23, 2012 Huffman Encoding and Data Compression. CS106B Spring 2012. Handout by Julie Zelenski with minor edits by Keith Schwarz CS106B Spring 01 Handout # May 3, 01 Huffman Encoding and Data Compression Handout by Julie Zelenski wit minor edits by Keit Scwarz In te early 1980s, personal computers ad ard disks tat were no larger

More information

The Heat Equation. Lectures INF2320 p. 1/88

The Heat Equation. Lectures INF2320 p. 1/88 The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)

More information

Notes on metric spaces

Notes on metric spaces Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.

More information

Fuzzy Differential Systems and the New Concept of Stability

Fuzzy Differential Systems and the New Concept of Stability Nonlinear Dynamics and Systems Theory, 1(2) (2001) 111 119 Fuzzy Differential Systems and the New Concept of Stability V. Lakshmikantham 1 and S. Leela 2 1 Department of Mathematical Sciences, Florida

More information

NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

More information

F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein) Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p

More information

Math 113 HW #5 Solutions

Math 113 HW #5 Solutions Mat 3 HW #5 Solutions. Exercise.5.6. Suppose f is continuous on [, 5] and te only solutions of te equation f(x) = 6 are x = and x =. If f() = 8, explain wy f(3) > 6. Answer: Suppose we ad tat f(3) 6. Ten

More information

Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

More information

Høgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver

Høgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver Høgskolen i Narvik Sivilingeniørutdanningen STE637 ELEMENTMETODER Oppgaver Klasse: 4.ID, 4.IT Ekstern Professor: Gregory A. Chechkin e-mail: chechkin@mech.math.msu.su Narvik 6 PART I Task. Consider two-point

More information

Finite dimensional topological vector spaces

Finite dimensional topological vector spaces Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the

More information

Catalogue no. 12-001-XIE. Survey Methodology. December 2004

Catalogue no. 12-001-XIE. Survey Methodology. December 2004 Catalogue no. 1-001-XIE Survey Metodology December 004 How to obtain more information Specific inquiries about tis product and related statistics or services sould be directed to: Business Survey Metods

More information

The EOQ Inventory Formula

The EOQ Inventory Formula Te EOQ Inventory Formula James M. Cargal Matematics Department Troy University Montgomery Campus A basic problem for businesses and manufacturers is, wen ordering supplies, to determine wat quantity of

More information

Adaptive Online Gradient Descent

Adaptive Online Gradient Descent Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650

More information

SAT Math Must-Know Facts & Formulas

SAT Math Must-Know Facts & Formulas SAT Mat Must-Know Facts & Formuas Numbers, Sequences, Factors Integers:..., -3, -2, -1, 0, 1, 2, 3,... Rationas: fractions, tat is, anyting expressabe as a ratio of integers Reas: integers pus rationas

More information

INTEGRAL OPERATORS ON THE PRODUCT OF C(K) SPACES

INTEGRAL OPERATORS ON THE PRODUCT OF C(K) SPACES INTEGRAL OPERATORS ON THE PRODUCT OF C(K) SPACES FERNANDO BOMBAL AND IGNACIO VILLANUEVA Abstract. We study and characterize the integral multilinear operators on a product of C(K) spaces in terms of the

More information

Sections 3.1/3.2: Introducing the Derivative/Rules of Differentiation

Sections 3.1/3.2: Introducing the Derivative/Rules of Differentiation Sections 3.1/3.2: Introucing te Derivative/Rules of Differentiation 1 Tangent Line Before looking at te erivative, refer back to Section 2.1, looking at average velocity an instantaneous velocity. Here

More information

Mathematics for Econometrics, Fourth Edition

Mathematics for Econometrics, Fourth Edition Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents

More information

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied

More information

CHAPTER 8: DIFFERENTIAL CALCULUS

CHAPTER 8: DIFFERENTIAL CALCULUS CHAPTER 8: DIFFERENTIAL CALCULUS 1. Rules of Differentiation As we ave seen, calculating erivatives from first principles can be laborious an ifficult even for some relatively simple functions. It is clearly

More information

Some remarks on Phragmén-Lindelöf theorems for weak solutions of the stationary Schrödinger operator

Some remarks on Phragmén-Lindelöf theorems for weak solutions of the stationary Schrödinger operator Wan Boundary Value Problems (2015) 2015:239 DOI 10.1186/s13661-015-0508-0 R E S E A R C H Open Access Some remarks on Phragmén-Lindelöf theorems for weak solutions of the stationary Schrödinger operator

More information

Høgskolen i Narvik Sivilingeniørutdanningen

Høgskolen i Narvik Sivilingeniørutdanningen Høgskolen i Narvik Sivilingeniørutdanningen Eksamen i Faget STE6237 ELEMENTMETODEN Klassen: 4.ID 4.IT Dato: 8.8.25 Tid: Kl. 9. 2. Tillatte hjelpemidler under eksamen: Kalkulator. Bok Numerical solution

More information

Example 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x

Example 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x Lecture 4. LaSalle s Invariance Principle We begin with a motivating eample. Eample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum Dynamics of a pendulum with friction can be written

More information

University of Ostrava. Fuzzy Transforms

University of Ostrava. Fuzzy Transforms University of Ostrava Institute for Research and Applications of Fuzzy Modeling Fuzzy Transforms Irina Perfilieva Research report No. 58 2004 Submitted/to appear: Fuzzy Sets and Systems Supported by: Grant

More information

Multigrid computational methods are

Multigrid computational methods are M ULTIGRID C OMPUTING Wy Multigrid Metods Are So Efficient Originally introduced as a way to numerically solve elliptic boundary-value problems, multigrid metods, and teir various multiscale descendants,

More information

Computing divisors and common multiples of quasi-linear ordinary differential equations

Computing divisors and common multiples of quasi-linear ordinary differential equations Computing divisors and common multiples of quasi-linear ordinary differential equations Dima Grigoriev CNRS, Mathématiques, Université de Lille Villeneuve d Ascq, 59655, France Dmitry.Grigoryev@math.univ-lille1.fr

More information

ON LOCAL LIKELIHOOD DENSITY ESTIMATION WHEN THE BANDWIDTH IS LARGE

ON LOCAL LIKELIHOOD DENSITY ESTIMATION WHEN THE BANDWIDTH IS LARGE ON LOCAL LIKELIHOOD DENSITY ESTIMATION WHEN THE BANDWIDTH IS LARGE Byeong U. Park 1 and Young Kyung Lee 2 Department of Statistics, Seoul National University, Seoul, Korea Tae Yoon Kim 3 and Ceolyong Park

More information

2 Limits and Derivatives

2 Limits and Derivatives 2 Limits and Derivatives 2.7 Tangent Lines, Velocity, and Derivatives A tangent line to a circle is a line tat intersects te circle at exactly one point. We would like to take tis idea of tangent line

More information

100 Austrian Journal of Statistics, Vol. 32 (2003), No. 1&2, 99-129

100 Austrian Journal of Statistics, Vol. 32 (2003), No. 1&2, 99-129 AUSTRIAN JOURNAL OF STATISTICS Volume 3 003, Number 1&, 99 19 Adaptive Regression on te Real Line in Classes of Smoot Functions L.M. Artiles and B.Y. Levit Eurandom, Eindoven, te Neterlands Queen s University,

More information

Nonparametric adaptive age replacement with a one-cycle criterion

Nonparametric adaptive age replacement with a one-cycle criterion Nonparametric adaptive age replacement with a one-cycle criterion P. Coolen-Schrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK e-mail: Pauline.Schrijner@durham.ac.uk

More information

Optimized Data Indexing Algorithms for OLAP Systems

Optimized Data Indexing Algorithms for OLAP Systems Database Systems Journal vol. I, no. 2/200 7 Optimized Data Indexing Algoritms for OLAP Systems Lucian BORNAZ Faculty of Cybernetics, Statistics and Economic Informatics Academy of Economic Studies, Bucarest

More information

Mean Value Coordinates

Mean Value Coordinates Mean Value Coordinates Michael S. Floater Abstract: We derive a generalization of barycentric coordinates which allows a vertex in a planar triangulation to be expressed as a convex combination of its

More information

Inner Product Spaces

Inner Product Spaces Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

More information

UNIVERSITETET I OSLO

UNIVERSITETET I OSLO NIVERSITETET I OSLO Det matematisk-naturvitenskapelige fakultet Examination in: Trial exam Partial differential equations and Sobolev spaces I. Day of examination: November 18. 2009. Examination hours:

More information

Theory of Sobolev Multipliers

Theory of Sobolev Multipliers Vladimir G. Maz'ya Tatyana O. Shaposhnikova Theory of Sobolev Multipliers With Applications to Differential and Integral Operators ^ Springer Introduction Part I Description and Properties of Multipliers

More information

Systems with Persistent Memory: the Observation Inequality Problems and Solutions

Systems with Persistent Memory: the Observation Inequality Problems and Solutions Chapter 6 Systems with Persistent Memory: the Observation Inequality Problems and Solutions Facts that are recalled in the problems wt) = ut) + 1 c A 1 s ] R c t s)) hws) + Ks r)wr)dr ds. 6.1) w = w +

More information

Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization

Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative

More information

Determine the perimeter of a triangle using algebra Find the area of a triangle using the formula

Determine the perimeter of a triangle using algebra Find the area of a triangle using the formula Student Name: Date: Contact Person Name: Pone Number: Lesson 0 Perimeter, Area, and Similarity of Triangles Objectives Determine te perimeter of a triangle using algebra Find te area of a triangle using

More information

Optimal boundary control of quasilinear elliptic partial differential equations: theory and numerical analysis

Optimal boundary control of quasilinear elliptic partial differential equations: theory and numerical analysis Optimal boundary control of quasilinear elliptic partial differential equations: theory and numerical analysis vorgelegt von Dipl.-Math. Vili Dhamo von der Fakultät II - Mathematik und Naturwissenschaften

More information

LINEAR ALGEBRA W W L CHEN

LINEAR ALGEBRA W W L CHEN LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

More information

Extremal equilibria for reaction diffusion equations in bounded domains and applications.

Extremal equilibria for reaction diffusion equations in bounded domains and applications. Extremal equilibria for reaction diffusion equations in bounded domains and applications. Aníbal Rodríguez-Bernal Alejandro Vidal-López Departamento de Matemática Aplicada Universidad Complutense de Madrid,

More information

Writing Mathematics Papers

Writing Mathematics Papers Writing Matematics Papers Tis essay is intended to elp your senior conference paper. It is a somewat astily produced amalgam of advice I ave given to students in my PDCs (Mat 4 and Mat 9), so it s not

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

More information

The modelling of business rules for dashboard reporting using mutual information

The modelling of business rules for dashboard reporting using mutual information 8 t World IMACS / MODSIM Congress, Cairns, Australia 3-7 July 2009 ttp://mssanz.org.au/modsim09 Te modelling of business rules for dasboard reporting using mutual information Gregory Calbert Command, Control,

More information

Average and Instantaneous Rates of Change: The Derivative

Average and Instantaneous Rates of Change: The Derivative 9.3 verage and Instantaneous Rates of Cange: Te Derivative 609 OBJECTIVES 9.3 To define and find average rates of cange To define te derivative as a rate of cange To use te definition of derivative to

More information

Low upper bound of ideals, coding into rich Π 0 1 classes

Low upper bound of ideals, coding into rich Π 0 1 classes Low upper bound of ideals, coding into rich Π 0 1 classes Antonín Kučera the main part is a joint project with T. Slaman Charles University, Prague September 2007, Chicago The main result There is a low

More information

Mathematical Methods of Engineering Analysis

Mathematical Methods of Engineering Analysis Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................

More information

Properties of BMO functions whose reciprocals are also BMO

Properties of BMO functions whose reciprocals are also BMO Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and

More information

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

More information