Weak Imposition Of Boundary Conditions For. The Navier-Stokes Equations

Size: px
Start display at page:

Download "Weak Imposition Of Boundary Conditions For. The Navier-Stokes Equations"

Transcription

1 Weak Imposton Of Boundary Condtons For The Naver-Stokes Equatons Atfe Çağlar Ph.D. Student Department of Mathematcs Unversty of Pttsburgh Pttsburgh, PA 15260, USA November 23, 2002 Abstract We prove the convergence of a fnte element method for the Naver- Stokes equatons n whch the no-slp condton, u τ = 0 on Γ for = 1, 2 s mposed by a penalty method and the no-penetraton condton, u n = 0 on Γ, s mposed by Lagrange multplers. Ths approach has been studed for the Stokes problem n [2]. In most flows the Reynolds number s not Ths work partally supported by NSF grants DMS , INT , and INT atcst11@ptt.edu, atfe 1

2 neglgable so the u u nertal effects are mportant. Thus the extenson beyond the Stokes problem to the Naver-Stokes equatons s crtcal. We show exstence and unqueness of the approxmate soluton and optmal order of convergence can be acheved f the computatonal mesh follows the real boundary. Our results for the (nonlnear) Naver-Stokes equatons mprove known results for ths approach for the Stokes problem. Keywords. Naver-Stokes equatons, Lagrange multpler, slp wth frcton. AMS Subject classfcatons. 65N30. 1 Introducton The problem of predctng the equlbrum flow of a vscous ncompressble flud s one of solvng approxmately the statonary, ncompressble Naver-Stokes equatons: 2Re 1 (D(u)) u u p = f n Ω, u = 0 on Γ = Ω, (1.1) u = 0 n Ω, n a bounded polyhedral doman Ω R d d=2,3, where D s the deformaton tensor gven by D j (u) = 1 2 ( u u ) j x j x for 1, j d. The boundary Γ s assumed to be the unon of k flat parts Γ j : Γ = k Γ j. 2

3 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 3 The boundary condton u = 0 s decomposed of two separate condtons: no penetraton : u n = 0 on Γ, no slp : u τ = 0 on Γ, where n be the unt normal vector on Γ and τ, = 1,..., d 1, a system of orthonormal tangental vectors. There are physcal and computatonal reasons why these two boundary condtons should sometmes be separated and mposed usng dfferent technques see, e.g. the dscussons n [2]. For example, the Lagrange multpler mplementaton of the no-penetraton condton allows slght, but locally balancng n and out flow capturng some aspects of surface roughness. For the no-slp condton, the penalty formulaton (as we shall see) s equvalent to the Naver slp law. Thus, t s natural to use t for problems n whch large tangental stress mght occur. The numercal analyss of technques for mposng essental boundary condtons weakly was begun n [3], see also [4], [5, 6], [7], [2] and the references theren. In many flows nertal effects are mportant and thus the extenson beyond the Stokes problem, of [7,10] to the Naver-Stokes equatons s mportant. The purpose of ths report s to begn ths extenson. Our analyss both extends the work of [2] and [7] from the (lnear) Stokes problem to nonlnear Naver-Stokes problem and mproves the basc results of [2] even n the lnear case.

4 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 4 2 The Contnuous Problem For our mathematcal formulaton we ntroduce the followng spaces: X = [H 1 (Ω)] d, X 0 = [H 1 0 (Ω)] d, V = {v X v, q Ω = 0, q L 2 0(Ω)}, V 0 = { v X 0 v, q Ω = 0, q L 2 0 (Ω)}, Y = L 2 0 (Ω) = { q L 2 (Ω) q, 1 Ω = 0 }, Z = k H 1/2 (Γ j ), where k s the number of edges n 2d or faces n 3d of the boundary Γ..,. Ω s the usual L 2 nner product, H k (Ω) the usual W k,2 (Ω) Sobolev space wth norm. k,ω, and the space H k (Ω) s the dual of H0 k (Ω), the space of functons n H k (Ω) that vansh on Γ. The spaces H k 1/2 (Γ) consst of the traces of all functons n H k (Ω). Analogously, we denote by H (k 1/2) (Γ) the dual space of H k 1/2 (Γ) wth.,. Γ beng the dualty parng. A norm. Γ of a functon ϕ k H1/2 (Γ j ) s defned by ϕ Γ = ϕ 2 1/2,Γ j 1/2 wth the dual norm. Γ =:. Z. In addton, we set. Γj =. H 1/2 (Γ j) and. Γ j =. H 1/2 (Γ j). The most common formulaton of the Naver-Stokes equatons n (X 0, Y ) s

5 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 5 gven by (see e.g. [8], [9]) : Fnd (u, p) (X 0, Y ) such that: a 0 (u, v) a 1 (u; u, v) a 2 (v, p) = f, v Ω, v X 0, a 2 (u, q) = 0, q Y, where a 0 (u, v) = 2Re 1 D(u) : D(v) dx, Ω a 1 (u; v, w) = (u v) w dx, Ω b(u; v, w) = 1 2 [a 1(u; v, w) a 1 (u; w, v)], a 2 (u, p) = p( u) dx. Ω Lemma 2.1 For u V 0 and v, w X 0, b(u; v, w) = u v, w Ω. Snce a 1 (u; v, w) = a 1 (u; w, v) then b(u; v, v) = 0. Proof It follows from ntegral by parts. If we mpose the boundary condtons weakly we must seek a formulaton wth veloctes n X rather than X 0. Usng Green s formula, the defnton of deformaton and stress tensor we arrve at the followng weak formulaton of (1.1) n (X, Y ): Fnd (u, p) (X, Y ) such that: a 0 (u, v) b(u; u, v) a 2 (v, p) n j I(u, p), v Γj = f, v Ω, v X, a 2 (u, q) = 0, q Y. (2.1) Here, the tensor I(.,.) s defned by I k (u, p) = pδ k 2Re 1 D k (u) 1 2 u u k, for 1, k d,

6 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 6 and for all v X, q Y. Remark: I(.,.) s a modfcaton of the stress tensor where the pressure p s replaced by the Bernoull pressure pδ k 1 2 u u k Splt the fourth term of the left hand sde of equaton (2.1) to ts normal and tangental parts to obtan Lagrange multplers: ρ Γj := n j I(u, p) n j, λ 1 Γj := n j I(u, p) τ (j) 1, λ 2 Γj := n j I(u, p) τ (j) 2, Thus, ρ, λ 1, λ 2 are the ndvdual components of the normal stress on Γ j and 1 j k, where k s the number of boundary peces of Γ. Then we get 2Re 1 Ω Ω D(u) : D(v) dx 1 2 p( v) dx Ω(u u)v dx 1 2 Γ j ρ (v n j ) ds Defne c(.;.,.,.,.) on X Y Z Z Z as: Ω (u v)u dx Γ j λ 1 (v τ (j) 1 ) ds λ 2 (v τ (j) 2 ) ds = f v dx, (2.2) Γ j Ω q( u) dx = 0, Ω c(u; p, ρ, λ 1, λ 2 ) := p, u Ω ρ, u n j Γj λ, u τ (j) Γj. The correspondng weak formulaton of (2.1) s : a(u; u, v) c(v; p, ρ, λ 1, λ 2 ) = f, v Ω, c(u; q, σ, χ 1, χ 2 ) = 0, (2.3)

7 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 7 for all v X, q Y, σ, χ 1, χ 2 Z, where a(u; u, v) = a 0 (u; v) b(u; u, v). Defne the space K by K = {u X c(u; p, ρ, λ 1, λ 2 ) = 0 p Y, ρ, λ 1, λ 2 Z}. Lemma 2.2 The mult-lnear form c( ;,,, ) s contnuous on X Y Z Z. Proof Defne. as: u := [ u 2 u n j 2 Γ u τ 1 2 Γ u τ 2 2 ] 1/2 Γ whch s equal to. 1 on X, and apply Cauchy-Schwartz nequalty to c(. :.,.,.,.) we obtan: c(u; p, ρ, λ 1, λ 2 ) p u ρ Z u n j Γj λ Z u τ j 1 Γ j p u ρ 2 Z λ 2 Z 1/2 1/2 u n j 2 Γ j u τ j 2 Γ j 1/2 1/2 = p u ρ Z u n j Γ λ Z u τ Γ = ( p, ρ Z, λ 1 Z, λ 2 Z ), ( u, u n j Γ, u τ 1 Γ, u τ 2 Γ ) [ p 2 ρ 2 Z [ = p 2 ρ 2 Z ] 1/2 [ λ 2 Z u 2 u n j 2 Γ 1/2 λ Z] 2 u. u τ 2 Γ ] 1/2

8 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 8 Lemma 2.3 The space K s a closed subspace of the Hlbert space X. Proof Ths follows provded c(.;.,.,.) s contnuous on X Y Z Z Z whch was proven n Lemma 2.2 Lemma 2.4 For u K, Korn s nequalty u C K (Ω) D(u) and the Poncaré nequalty u C P (Ω) u hold. Proof If u K then c(v, q, ρ, λ 1, λ 2 ) = 0 for all q Y, ρ, λ 1, λ 2 Z. If we pck ρ = 0, q = 0, then u satsfes 2 k λ, u τ Γj = 0 for λ 1, λ 1 Z. Ths means that u τ = 0 n H 1/2 (Γ j ) for all j = 1,..., k, and thus u τ j = 0 a.e on Γ j. Smlarly, u n = 0 a.e on each Γ j. These mply for all 1 j k so that u = 0 a.e on Γ j wth meas(γ j ) s strctly postve. By Korn s nequaltes see [10], [11], [9] or [12] there exst C K > 0 such that u C K (Ω)(γ(u) D(u) ) for all u X. In partcular, for all u K, where γ(u) s a semnorm on L 2 (Ω) whch s a norm on the constants. Snce measure of Γ j are strctly postve, defne γ(u) = u Γj then, we get γ(u) = 0 f u s constant on Ω. The result thus follows. By the same argument, for the same γ(u) we get: u C P (Ω) (u)

9 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 9 for all u K. Corollary 2.1 The blnear form a 0 (, ) s coercve on K: α u 2 1 a 0(u, u) wth α = Re 1 mn{c 2 K (Ω), C 2 K (Ω)C 2 P (Ω)}. Proof Ths follows from the Korn and Poncaré nequaltes on K. Also note that the problem assocated wth problem (2.3) has the followng form n K. Fnd u K such that: a(u; u, v) = f, v Ω, v K. (2.4) Remark: The problem (2.3) s dfferent than the standard weak formulaton of the Naver Stokes equatons. Thus, we need to guarantee that the weak formulaton s correct. Lemma 2.5 (Exstence) There exsts a soluton to the formulaton (2.4) n K. Proof By the abstract theory developed n [8], the formulaton (2.4) has a soluton n K provded: 1) The form a(u; u, v) s coercve n K but snce b(u; u, u) = 0 t s suffcent to show that a 0 (u, v) s coercve. Ths was done n the Corollary ) The space K s separable and u a(u; u, v) s weakly contnuous.the space K s separable snce t s a closed subset of the Hlbert space X. Next, we prove that u a(u; u, v) s weakly contnuous n K. Let u be a functon n K

10 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 10 and let u m be a sequence n K so that u m u weakly as m. It s known by Rellch s theorem that H 1 (Ω) can be embedded compactly n L 2 (Ω). Then u m converges strongly to u L 2 (Ω) d as m. Let v be n a dense subset L of K, L = {w D(Ω) V : c(v, q, ρ, λ 1, λ 2 ) = 0, for all λ 1, λ 2, ρ Z}. b(u m ; u m, v) = 1 2 u m u m, v Ω 1 2 u m v, u m Ω. Snce u m K so s n V. Thus, we have u m u m, v Ω = u m v, u m Ω. Hence we can actually wrte b(.;.,.) as: d b(u m ; u m, v) = u m v, u m Ω = u m u mj v,j dx., Ω v,j L (Ω) snce v s nfntely many tmes dfferentable. Ths mples that lm u mu mj = u u j L 1 (Ω). m Thus, lm b(u m; u m, v) = m d, = b(u; v, u). Ω u u j v,j dx Snce u K V, b(u; v, u) = u; u, v Ω. The form a 0 (.,.) s contnuous and u m u n L 2 (Ω) mples that So we get lm a 0(u m, v) = a 0 (u, v) m lm a(u m; u m, v) = a(u; u, v) m

11 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 11 for all v L. By densty of L n K and contnuty of the forms a 0 (.,.) and b(.;.,.) the result follows. In order to prove unqueness we follow the approach of [8]. We defne the fnte constant as N := sup u,v,w K b(u; v, w) u 1 v 1 w 1. Lemma 2.6 (Unqueness) Suppose that the form a 0 (.,.) s coercve and the form b(.;.,.) s locally Lpschtz contnuous n K. Then, under the condton 1 α 2 N f < 1 where f f, v Ω := sup v K v 1 problem (2.4) has a unque soluton u K. Proof Suppose there are two solutons u 1 and u 2 to the problem (2.4) then a 0 (u 1, v) b(u 1 ; u 1, v) = f, v Ω, v K and a 0 (u 2, v) b(u 2 ; u 2, v) = f, v Ω, v K. Addng, subtractng the term b(u 1 ; u 2, v) and settng v = u 1 u 2 we obtan: a 0 (u 1 u 2, u 1 u 2 )b(u 1 ; u 1 u 2, u 1 u 2 )b(u 1 u 2 ; u 2, u 1 u 2 ) = 0. (2.7) The second term n (2.7) vanshes by the skew-symmetrc property of the form b(.;.,.). Thus a 0 (u 1 u 2, u 1 u 2 ) b(u 1 u 2 ; u 2, u 1 u 2 ). (2.8) Coercvty of the form a 0 (.,.) and the defnton of N mply that α u 1 u N u 2 1 u 1 u

12 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 12 Snce the form s coercve and contnuous n K by Lax-Mlgram lemma we have u α f. Substtutng (2.8) n (2.7) we obtan: α u 1 u N α f u 1 u Ths mples that: (α N α 2 f ) u 1 u Thus, u 1 = u 2 f ( 1 N α 2 f ) > 0. We have shown that the problem (2.4) has a unque soluton n K. Theorem 2.1 Assume that the multlnear form c(.;.,.,.) satsfes the nf-sup condton. There s a constant β > 0 such that: nf χ 1,χ 2,σ Z p Y c(v; q, σ, χ 1, χ 2 ) sup v X v ( p 2 0 χ 1 2 Z χ 2 2 Z β. (2.9) σ 2 Z )1/2 Then, for each soluton u of problem (2.4), there exst a unque p Y, ρ, λ 1, λ 2 Z such that (u, p, ρ, λ 1, λ 2 ) s a soluton of problem (2.3). Proof It follows from [13]. For error analyss we need the followng lemma. Lemma 2.7 There s a constant β > 0 such that: ) k nf sup ( χ 1, v τ (j) 1 Γ j χ 2, v τ (j) 2 Γ j σ, v n j Γj σ,χ 1,χ 2 Z v V v 1 ( χ 1 2 Z χ 2 2 Z β. σ 2 Z )1/2 Proof See [2].

13 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 13 3 Penalty-Lagrange Multpler Method It has been observed by [14] that slp wth frcton boundary condtons match the expermental behavor of real fluds at hgher Reynolds number better than no-slp condton. Consequently, we propose to mpose u τ (j) Γj = 0 for = 1, 2 usng a penalty technque that s equvalent to such a condton. We choose small, postve penalty parameters ɛ 1, ɛ 2 whose selecton wll be guded by the followng analyss. We consder the followng problem: Fnd u ɛ V and ρ ɛ Z such that: 2 a 0 (u ɛ, v) b(u ɛ ; u ɛ, v) 1 u ɛ, v τ (j) 2 Γ j u ɛ, v τ (j) 1 Γ j ρ ɛ, v n j Γj = f, v, v V, (3.1) σ, u ɛ n j Γj = 0, σ Z. Suppose that nstead of consderng penalty methods to weaken the condton u τ (j) Γj = 0, we consder slp wth non-lnear resstance to slp,.e.: u ɛ τ (j) 2Re 1 D(u ɛ ) u ɛ u ɛ p ɛ = f n Ω, (3.2) u ɛ = 0 n Ω, Γ j u ɛ n j ds = 0 on Γ = Ω, ɛ n j (D(u ɛ ) 1 2 u ɛ u ɛ ) τ (j) = 0 on Γ j, = 1, 2, 1 j k. Lemma 3.1 The varatonal formulaton of equaton (3.2) s the same as equaton (3.1).

14 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 14 Proof We multply equaton n (3.2) by v X, ζ Y, ρ Z, respectvely, and ntegrate by parts yeld: 2Re 1 D(u ɛ ) : D(v) Ω 1/2 u ɛ u ɛ, v Ω 1/2 u ɛ v, u ɛ Ω D(u ɛ ) n j, v Γj p ɛ, v Ω u ɛ τ (j) ρ ɛ, v n j Γj = f, v Ω, v X. σ, u ɛ n j Γj = 0, σ Z. ζ, u ɛ Ω = 0, ζ Y., v τ (j) Γj The lemma mples that the penalty method captures the dea of slp wth nonlnear resstance to slp.to smplfy the notaton we defne: λ ɛ 1 Γ j : = 1 u ɛ τ (j) 1, λ ɛ 2 Γ j : = 2 u ɛ τ (j) 2 ; where λ ɛ 1, λɛ 2 Z. Then equaton (3.1) takes the followng form: λ ɛ 2, v τ (j) 2 Γ j a 0 (u ɛ, v) b(u ɛ ; u ɛ, v) λ ɛ 1, v τ (j) 1 Γ j ρ ɛ, v n j Γj = f, v, v V, σ, u ɛ n j Γj = 0, σ Z, (3.3) u ɛ τ (j) 1, χ 1 Γj = ɛ 1 u ɛ τ (j) 2, χ 2 Γj = ɛ 2 λ ɛ 1, χ 1 Γj, χ 1 Z, λ ɛ 2, χ 2 Γj, χ 2 Z.

15 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 15 Proposton 3.1 Let (u, λ 1, λ 2, ρ) be the soluton of the Naver-Stokes equatons (2.1) and let (u ɛ, λ ɛ 1, λɛ 2, ρ ɛ) be the soluton to (3.2) Then: e ɛ (λ 1, λ 2, ρ) u u ɛ 1,Ω C[ɛ 2 1 λ 1 2 Γ ɛ 2 2 λ 2 2 Γ] 1/2, (3.4) where e ɛ (λ 1, λ 2, ρ) := [ λ 1 λ ɛ 1 2 Z λ 2 λ ɛ 2 2 Z ρ ρ ɛ 2 Z ]1/2 and C depends on Re, α, β, and f. Proof Subtractng equaton (3.3) from equaton (2.3) yelds: a 0 (u u ɛ, v) b(u u ɛ ; u ɛ, v) b(u; u u ɛ, v) λ λ ɛ, v τ (j) Γj ρ ρ ɛ, v n j Γj = 0, v V, (3.5) σ, (u u ɛ ) n j Γj = 0, σ Z, (u u ɛ ) τ (j), χ Γj = ɛ λ ɛ, χ Γj, χ Z, for = 1, 2. From Lemma 2.7 gven λ 1, λ 2, ρ Z we have: β e ɛ (λ 1, λ 2, ρ) sup 0 v V a 0 (u u ɛ, v) b(u u ɛ ; u ɛ, v) b(u; u u ɛ, v) v 1 2Re 1 u u ɛ 1 v 1 M u u ɛ 1 u ɛ 1 v 1 M u u ɛ 1 v 1 u 1 v 1 u u ɛ 1 (2Re 1 2Mα 1 f ) 2(Re 1 α) u u ɛ 1 (3.6)

16 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 16 where M := sup 0 u,v,w V b(u; v, w) u 1 v 1 w 1. In equaton (3.5) we take v = u u ɛ. Then, Thus, a 0 (u u ɛ, u u ɛ ) b(u u ɛ ; u ɛ, u u ɛ ) ɛ λ ɛ, λ λ ɛ Γ j ρ ρ ɛ, (u u ɛ ) n j Γj = 0. (3.7) a 0 (u u ɛ, u u ɛ ) = b(u u ɛ ; u u ɛ, u ɛ ) ɛ λ ɛ, λ λ ɛ Γ j. Add and subtract the terms 2 ɛ k λ, λ λ ɛ Γ j, and droppng the postve term 2 ɛ k λ λ ɛ, λ λ ɛ Γ j we get: a 0 (u u ɛ, u u ɛ ) b(u u ɛ ; u u ɛ, u ɛ ) Applyng Cauchy-Schwarz nequalty and defnton of M we get: a 0 (u u ɛ, u u ɛ ) b(u u ɛ ; u ɛ, u u ɛ ) ɛ λ, λ λ ɛ Γ j. ɛ λ, λ λ ɛ Γj Mα 1 f u u ɛ 2 1 ɛ λ λ ɛ Z λ Γ. By the arthmetc geometrc mean nequalty for n = 2, we have a 0 (u u ɛ, u u ɛ ) Mα 1 f u u ɛ 2 1 ( ) 1/2 ( 1/2 λ λ ɛ 2 Γ ɛ 2 λ Γ) 2. Usng the coercvty of a 0 (.,.) and nequalty (3.6) we get [ 2(Re 1 ] ( 1/2 α) u u ɛ 1 β α(1 Mα 2 f ɛ 2 ) λ Γ) 2.

17 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 17 Thus e ɛ (λ 1, λ 2, ρ) u u ɛ 1 2(Re 1 α) β u u ɛ 1 u u ɛ 1. Combnng the latter nequaltes we obtan: ( 1/2 e ɛ (λ 1, λ 2, ρ) u u ɛ 1 C ɛ 2 λ Γ) 2. (3.8) 4 Fnte Element Spaces The polyhedral doman Ω s subdvded nto d-smplces wth sdes of length less than h wth T h beng the famly of parttons. We wll assume that T h satsfes the usual regularty assumptons, see e.g. [15] that: 1. Each vertex of Ω s a vertex of a T T h, 2. Each T T h has at least one vertex n the nteror of Ω, 3. Any two d-smplces T, T T h may meet n a vertex, a whole edge, or a whole face, The constants c 0, c 1 denote dfferent constants whch are ndependent of h. 1. Each T T h contans a ball wth radus c 0 h and s contaned n a ball wth radus c 1 h. Denote by O h j the partton of Γ j whch s nduced by T h. Let X h X, Y h Y, Z h Z. Also let X h 0 = { u h X h u h = 0 on Γ }.

18 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 18 The spaces X h and Y h are assumed to satsfy the followng propertes: I. There s a constant β > 0 ndependent of h for whch: II. nf 0 p h Y h sup 0 u h X h 0 Ω ph dvu h dx p h 0,Ω u h 1,Ω β, (4.1) nf p p h 0,Ω ch p 1,Ω, p h Y h p H 1 (Ω), whch: III. There exsts a contnuous lnear operator Π h : H 1 (Ω) d X h for Π h (H 1 0 (Ω) d ) X h 0, u Π h u s,ω ch t s u t,ω, u H t (Ω) wth s = 0, 1 and t = 1, 2, u Π h u 0,Γ ch 1/2 u 1,Ω, where. 0,Γ = ( k. 0,Γ j ) 1/2. Assumpton I balances the nfluence of the constrant dvu = 0 and also mples that the space: V h 0 = { v h X h 0 qh, v h = 0, q h Y h}, V h = { v h X h q h, v h = 0, q h Y h} V h 0, s also not empty. As usual V h s not a subset of V and n partcular, the functons of V h are not dvergence free. Hence we ntroduce ant-symmetrc form b(.;.,.,.), N h = b(u h ; v h, w h ) sup 0 u h,v h,w h X u h h 1 v h 1 w h (4.2) 1 and f h = sup v h V h f, v h Ω v h 1.

19 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 19 Wth the above notaton, the dscrete analogue of problem (2.3) s: Fnd u h X h, p h Y h, ρ h, λ h 1, λh 2 Zh such that: a(u h ; u h, v h ) c(v h ; p h, ρ h, λ h 1, λ h 2 ) = f, v h Ω (4.3) c(u h ; q h, σ h, χ h 1, χ h 2) = 0 for all v h X h, q h Y h, σ h, χ h 1, χh 2 Zh. By assumpton I ths s equvalent to the followng problem n V h : Fnd u h X h, p h Y h, ρ h, λ h 1, λ h 2 Z h such that: a(u h, u h, v h ) = f, v h Ω (4.4) By the abstract theory developed n [8] the dscrete problem wll have unque soluton provded: α 2 N h f h < 1 (4.5) and, there s a constant β > 0, ndependent of h such that nf ρ h,λ h 1,λh 2 Zh p h Y h c(v h ; p h, ρ h, λ h 1, λ h sup 2) ] 1/2 0 v h X h v h 1 [ λ β. (4.6) h 1 2 Z λh 2 2 Z ρh 2 Z ph 2 0,Ω Now we need to fnd rght spaces X h, Y h, Z h so that they hold (4.6). An example of spaces X h, Y h, Z h satsfyng (4.6) and the classcal nf-sup condton are gven n [7]. Lemma 4.1 There exsts a constant β > 0 ndependent of h, such that: ) k ( λ h 1, vh τ (j) 1 Γ j λ h 2, vh τ (j) 2 Γ j ρ h, v h n j Γj nf ρ h Z h sup 0 v h X h λ h 1,λh 2 Zh [ v h 1 λ h 1 2 Z λh 2 2 Z ] ρh 2 1/2 β. Z (4.7)

20 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 20 Lemma 4.2 There s a constant β > 0, ndependent of h such that: nf ρ h,λ h 1,λh 2 Zh p h Y h c(v h ; p h, ρ h, λ h 1 sup, λh 2 ) ] 1/2 0 v h X h v h 1 [ λ β. (4.8) h 1 2 Z λh 2 2 Z ρh 2 Z ph 2 0,Ω Proof The last two lemmas are proven n [2]. 5 The Dscrete Penalty-Lagrange Multpler Method We can now wrte the dscrete analogue of the equaton (3.1) as: Fnd u h ɛ Xh satsfyng: a 0 (u h ɛ, vh ) b(u h ɛ ; uh ɛ, vh ) u h ɛ τ (j), v h τ (j) Γj ρ h ɛ, vh n j Γj p h ɛ, vh Ω = f, v h, (5.1) q h, u h ɛ Ω = 0, σ h, u h ɛ n j Γj = 0, for all v h X h, q h Y h, σ h Z h. Ths s equvalent to fndng u h ɛ V h such that: a 0 (u h ɛ, v h ) b(u h ɛ ; u h ɛ, v h ) for all v h V h, σ h Z h. u h ɛ τ (j), v h τ (j) Γj (5.2) ρ h ɛ, vh n j Γj = f, v h, σ h, u h ɛ n j Γj = 0,

21 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 21 Snce λ ɛ,h for = 1, 2 are not necessarly n Z h equaton (5.2) s not equvalent to (5.3). In fact λ ɛ,h Z h := X h τ (j) Γj, = 1, 2, 1 j k. a 0 (u h ɛ, v h ) b(u h ɛ ; u h ɛ, v h ) λ ɛ,h, v h τ (j) Γj ρ h ɛ, vh n j Γj = f, v h, v h V h, σ h, u h ɛ n j Γj = 0, σ h Z h, (5.3) u h ɛ τ (j), χ h Γ j = ɛ λ ɛ,h, χ h Γ j, χ h Zh, for = 1, 2. The latter problem wll be equvalent f we make the followng assumpton: There exsts β > 0 nf λ h Z h ρ h Z h sup 0 v h X h k λɛ,h 1, vh τ (j) 1 Γ j λ ɛ,h 2, vh τ (j) v h 1 [ λ ɛ,h 1 2 Z λɛ,h 2 2 Z ρh 2 Z 2 Γ j ρ h, v h n j Γj ] 1/2 β. (5.4) We shall now study the error u u h ɛ n 1 norm where (u, λ 1, λ 2, p, ρ) s the soluton of (2.3) and (u h ɛ, λ ɛ,h 1, λ ɛ,h 2, p h, ρ h ɛ ) s the soluton of the fnte element problem (5.3). We estmate the error n two cases. In the frst case the computatonal boundary Γ h does not follow the flud boundary Γ. For example, suppose the doman Ω has smooth boundary and we use quadratc elements for our approxmaton. Then by approxmatng the flud velocty u by penalzed velocty u ɛ and u ɛ by dscrete penalzed velocty u h ɛ. We wll conclude that the error n

22 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 22 1 norm has order h convergence. Ths requres that the penalty parameter ɛ should be scaled by h. In the second case, Γ h follows Γ exactly. Our doman s polygonal (n 2d) wth the choce of quadratc elements we approxmate u by dscrete velocty u h and u h by u h ɛ. Ths leads order h 2 convergence n the error 1 norm. Ths mples scalng ɛ by h 2. Thus, t has mproved the basc results of [2] even n the lnear case. CASE I: In ths case, the approxmaton u h ɛ satsfes (5.3). We need smlar equatons for the contnous u ɛ n the velocty space. For the reason we multply by v V to obtan (3.1), nstead we multply by v h V h. It gves: a 0 (u ɛ, v h ) b(u u ɛ ; u ɛ, v h ) p ɛ q h, v h Ω u ɛ τ (j), v h τ (j) Γj ρ ɛ, v h n j Γj = f, v h, (5.5) σ h, u ɛ n j Γj = 0, for all v h V h and σ h Z h, snce Z h Z. Subtractng (5.2) from (5.5) yelds: a 0 (u ɛ u h ɛ, v h ) b(u h ɛ ; u ɛ u h ɛ, v h ) b(u ɛ u h ɛ ; u ɛ, v h ) p ɛ q h, v h Ω (u ɛ u h ɛ ) τ (j), v h τ (j) Γj for all v h V h. We wrte: ρ ɛ ρ h ɛ, vh n j Γj = 0, (5.6) u ɛ u h ɛ = (u ɛ v h ) (u h ɛ v h ), (5.7) wth v h beng the best approxmaton of u ɛ n V h. Let η := u ɛ v h, φ h := u h ɛ vh.

23 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 23 Then equaton (5.6) becomes: a 0 (η φ h, v h ) b(η φ h ; u ɛ, v h ) b(u h ɛ ; η φh, v h ) p ɛ q h, v h Ω (η φ h ) τ (j), v h τ Γj ρ ɛ ρ h ɛ, v h n j Γj = 0, (5.8) for all v h V h. Equaton (5.8) can be rewrtten as: a 0 (φ h, v h ) b(φ h ; u ɛ, v h ) b(u h ɛ ; φ h, v h ) φ h τ, v h τ (j) = a 0 (η, v h ) b(η; u ɛ, v h ) b(u h ɛ ; η, v h ) p ɛ q h, v h Ω (5.9) ρ ɛ ρ h ɛ, vh n j Γj Set v h = φ h. Then: 2Re 1 D(φ h ) 2 0 b(φh ; u h ɛ, φh ) η τ (j), v h τ (j) Γj φ h τ 2 = 0,Γ = a 0 (η, φ h ) b(u h ɛ ; η, φh ) b(η; u ɛ, φ h ) p ɛ q h, φ h Ω η τ (j), φ h τ (j) Γj Γj ρ ɛ ρ h ɛ, φ h n j Γj. (5.10) But for each j, φ h n j Z h snce Z h Z. Thus we can replace ρ h ɛ n (5.10) wth any test functon, say σ h Z h. Then we have 2Re 1 D(φ h ) 2 φ h τ 2 0,Γ 2Re 1 η 1 φ h 1 N h u ɛ h 1 φ h 1 η 1 N h u ɛ φ h 1 η 1 2 η τ 2 0,Γ 2 φh τ 2 0,Γ ρ ɛ σ h Z φ h 1 p ɛ q h φ h 1 (5.11)

24 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 24 Re 1 D(φ h ) 2 2 φh τ 2 0,Γ Re 1 η 2 1 N h φ h 1 η 1 ( u h ɛ 1 u 1 ) p ɛ q h 2 φh η τ 2 0,Γ ρ ɛ σ h 2 Z φh (5.12) By Korn s nequalty we have: C 1 φ h 2 1 Re 1 D(φ h ) 2 2 φh τ 2 0,Γ Re 1 η 2 1 (N h f α 1 u ɛ 1 )( η 2 1 φh ) 1 p ɛ q h 2 C 1 2 η τ 2 0,Γ 1 ρ ɛ σ h 2 Z C C φ h (5.13) where C 1 depends on Re, α, and ɛ Snce N f α 2 < 1, we can choose h suffcently small so that: N h f h α 1 < α. Usng ths we obtan: Thus we get: C 1 φ h 2 1 Re 1 η 2 1 (α u ɛ 1 ) φh p ɛ q h 2 4 C 1 2 η τ 2 0,Γ 1 ρ ɛ σ h 2 0 C C φ h (5.14) C 2 φ h 2 1 C 3 η C 1 ( p ɛ q h 2 ρ ɛ σ h 2 ) where C 2 and C 3 are depend on Re, ɛ, α and u ɛ but not on h. 2 η τ 2 0,Γ (5.15)

25 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 25 Addng and subtractng η n every norm of the left hand sde of equaton (5.15) yelds: η φ h 2 1 C 4 η 2 1 C 5 η τ 2 0,Γ C 6 ( ρ ɛ σ h 2 Z p ɛ q h 2 ). Applyng the trangle nequalty and takng nfma we have: u ɛ u h ɛ 2 1 C 4 nf u ɛ v h 2 0 v h V h 1 C 5 C 6 ( nf ρ ɛ σ h 2 0 σ h Z h Z nf p ɛ q h 2 ), 0 q h Y h nf (u ɛ v h ) τ 2 0,Γ 0 v h V h where, for ɛ 1, ɛ 2 small. Now we have to derve a bound for the error n the Lagrange multpler. From Lemma 4.1 we take λ h 1 = λh 2 = 0 : nf sup 0 ρ h Z h 0 v h X h nf ρ h Z h sup 0 v h X h λ h 1,λh 2 Zh Equaton (5.16) mples that: k ρh, v h n j Γj v h 1 ρ h = Z k λh 1, v h τ (j) 1 Γ j λ h 2, v h τ (j) 2 Γ j ρ h, v h n j Γj [ v h 1 λ h 1 2 Z λh 2 2 Z ] ρh 2 1/2 β. Z (5.16) β ρ h ɛ σ h Z sup v h X h k ρh ɛ σ h, v h n j Γj v h 1. (5.17)

26 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 26 From (5.6) we have: ρ h ɛ σ h, v h n j Γj = a 0 (u ɛ u h ɛ, v h ) b(u ɛ u h ɛ ; u ɛ, v h ) b(u h ɛ ; u ɛ u h ɛ, vh ) p ɛ q h, v h Ω (u ɛ u h ɛ ) τ (j), v h τ (j) Γj ρ ɛ σ h, v h n j Γj 2Re 1 uɛ u h ɛ v h 1 1 2α v h uɛ 1 u h ɛ 1 pɛ q h v h 0 1 (u ɛ u h ɛ ) τ 0,Γ v h 1 ρ ɛ σ h Z v h 1 (C u ɛ u h ɛ 1 p ɛ q h where C := 2(α Re 1 ). (u ɛ u h ɛ ) τ 0,Γ ρ ɛ σ h Z ) v h 1 (5.18) Thus dvdng (5.18) by v h 1, combnng t wth (5.17), applyng the trangle nequalty and takng nfma yelds: ρɛ ρ h ɛ Z C uɛ u h ɛ β 1 1 β nf pɛ q h q h Y h β (uɛ u h ɛ ) τ 0,Γ 1 β β nf ρɛ σ h σ h Z h Z. Squarng both sdes of (5.19) and boundng the mxed terms yelds: ρ ɛ ρ h ɛ 2 Z 5C2 β 2 u ɛ u h 2 ɛ 5 1 5ɛ 2 β 2 β 2 nf q h Y h p ɛ q h 2 (5.19) (u ɛ u h ɛ ) τ 2 10 ( 0,Γ β 2 nf ρɛ σ h ) 2 Z. σ h Z h (5.20)

27 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 27 Combnng (5.20) wth (??) yelds the followng theorem for the total error. Theorem 5.1 Assume that the dscrete spaces satsfy condton (4.7). Then the error n the dscrete soluton of the penalty-lagrange multpler method s as follows: u ɛ u h ɛ 2 1 C 1 nf u ɛ v h 2 C 0 v h V h 1 2 ( nf uɛ v h) τ 2 0 v h V h 0,Γ ( C 3 nf ρ ɛ σ h 2 0 σ h Z h Z nf p ɛ q h ) 2. (5.21) 0 q h Y h 0 Incorporatng (3.6) nto (5.21) yelds the followng corollary for the total error for the penalty-lagrange multpler method: Corollary 5.1 Assume that the dscrete spaces satsfy condton (4.7). Then the error n the dscrete soluton of the penalty-lagrange multpler method s as follows: u u h ɛ 2 1 C 1 nf v h V h u v h 2 1,Ω C 2 ɛ ( C 3 nf ρ σ h 2 σ h Z h Z nf p q h 2 q h Y h 0 C 1 u u ɛ 2 1,Ω C 3 ρ ρ ɛ 2 Z p p ɛ 2 0 C 4 nf (u v h ) τ 2 v h V h 0,Γ ) C 2 ɛ (u u ɛ ) τ 2 0,Γ (5.22) ɛ 2 λ 2 Γ. Proof Squarng both sdes of (3.4) yelds the followng: u u ɛ 2 1,Ω λ λ ɛ 2 Z ρ ρ ɛ 2 Z C 1 ɛ 2 λ 2 Γ. (5.23) In (5.21) we replace the. 0,Γ norm on the left hand sde by. Z, add ( u u), ( p p), ( ρ ρ) n the approprate terms of the rght hand sde and add t to (5.22) to get the stated result.

28 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 28 Remark: The error bound that ncludes the dfference n the value of the stress vector between the true and the dscrete penalty-lagrange multpler solutons s as follows: u u h ɛ 2 1 λ λ ɛ,h 2 Z ρ ρh ɛ 2 Z { 1 C 1 nf } u v h 2 mn ɛ v h V h 1 C 2 nf (u v h ) τ 2 ɛ v h V h 0,Γ ( ) ( C 3 mn ɛ C 0 nf ρ σ h 2 σ h Z h Z nf ) p q h 2 q h Y h 0 ) ) C 1 u u ɛ 2 1 (C 3 mn ɛ C 0 ( ρ ρ ɛ 2 Z p p ɛ 2 0 C 2 (u u ɛ ) τ 2 0,Γ ɛ C 4 ɛ 2 λ 2 Γ. β To obtan a bound on p p ɛ 0 we use (1.12) wth χ = λ λ ɛ, σ = ρ ρ ɛ: ( ρ ρ ɛ 2 Z p p ɛ 2 0 λ λ ɛ 2 Z p p ɛ, v Ω 2 sup v X ) 1/2 a 0 (u u ɛ, v) b(u u ɛ ; u ɛ, v) sup C u u ɛ v X v 1, where C depends on Re and α. Thus: k λ λ ɛ, v τ (j) Γj k ρ ρ ɛ, v n j Γj v p p ɛ 2 0 C β 2 u u ɛ 2 1,Ω. (5.24) To get a bound on (u u ɛ ) τ 2 0,Γ we set χ = (u u ɛ ) τ (j) n (2.8): (u u ɛ ) τ 0,Γ ɛ λ ɛ 0,Γ. (5.25)

29 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 29 Add and subtract λ n the norm n the rght hand sde of (5.25) to yeld: (u u ɛ ) τ 0,Γ ɛ ( λ 0,Γ λ λ ɛ 0,Γ ( ) ɛ λ Γ λ λ ɛ 0,Γ, ) or ) (u u ɛ ) τ 2 0,Γ ɛ C 2 ( λ 2 Γ λ λ ɛ 2 0,Γ. (5.26) C 2 Now we must bound λ λ ɛ 2 0,Γ. Take v = u u ɛ n (3.7): a 0 (u u ɛ, u u ɛ ) b(u u ɛ ; u ɛ, u u ɛ ) Add 2 ɛ k λ λ ɛ, λ Γj to both sdes: ɛ λ λ ɛ 2 0,Γ ɛ λ λ ɛ, λɛ Γ j = 0. ɛ λ Γ λ λ ɛ Z a 0 (u u ɛ, u u ɛ )b(u u ɛ ; u ɛ, u u ɛ ). Defnton of N and the Cauchy-Schwarz nequalty: Thus overall: ɛ λ λ ɛ 2 0,Γ ɛ ( ) λ 2 1/2,Γ 2 λ λ ɛ 2 Z. C 2 ) (u u ɛ ) τ 2 0,Γ ɛ C 2 ɛ ( λ 2 Γ λ λ ɛ 2 Z. (5.27) Under the approxmaton assumpton: nf ( u v h v h V h 1 nf p q h 2 q h Y h 0 ) 1/2 nf ρ ρ h 2 ρ h Z h Z Ch k max { f 1, u 2 }, (5.28) where k s the degree of the polynomal space we are usng. If we let ɛ = ɛ 1 = ɛ 2 then corollary 5.1 ndcates that proper choce of ɛ n (5.22) s ɛ = h k/2.

30 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 30 Theorem 5.2 Assume that the dscrete spaces satsfy condton (4.7) and let ɛ = h k/2. Then the error n the soluton of the penalty-lagrange multpler method and the dscrete soluton of the penalty-lagrange multpler method s as follows: u u h ɛ 1 Cɛ. CASE II: Let (u, λ 1, λ 2, ρ, p) be the soluton of (2.3) and (u h, λ h 1, λ h 2, ρ h, p h ) be the fnte element approxmaton of (2.3), that s (4.3) then substractng (4.3) from (2.3) we get: a 0 (u u h, v h ) b(u; u u h, v h ) b(u u h ; u h, v h ) p p h, v h Ω (u u h ) τ (j), v h τ (j) Γj for all v h V h. We wrte: ρ ρ h, v h n j Γj = 0, (5.29) u u h = (u v h ) (u h v h ), wth v h beng the best approxmaton of u n V h. Let η := u v h, φ h := u h v h. Snce Γ h = Γ error terms whch come from approxmatng boundary vansh, then equaton (5.29) becomes: a 0 (η φ h, v h ) b(u; η φ h, v h ) b(η φ h ; u h, v h ) p p h, v h Ω = 0, for all v h V h. (5.31)

31 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 31 Equaton (5.31) can be rewrtten as: a 0 (φ h, v h ) b(u; φ h, v h ) b(φ h ; u h, v h ) = a 0 (η, v h ) b(u; η, v h ) b(η; u h, v h ) p p h, v h Ω (5.32) Settng v h = φ h n (5.32), applyng Cauchy-Schwartz nequalty and defnton of N h. We obtan: 2Re 1 D(φ h ) 2 2Re 1 D(η) D(φ h ) 2N h f h α 1 φ h 1 η 1 N h f h α 1 φ h 2 1 p ph φ h 1 (5.33) By Korn s nequalty we have: 2Re 1 D(φ h ) 2Re 1 D(η) 2α D(η) α D(φ h ) p p h Thus we get: C 1 D(φ h ) C 2 D(η) p p h. (5.34) where C 1 and C 2 are depend on Re, α,and f. Addng and substractng η from the left hand sde of (5.34) we get: D(u u h ) (1 C 1 /C 2 ) D(u v h ) 1/C 1 p p h. Takng nfma we get: D(u u h ) (1 C 1 /C 2 ) nf D(u v h ) 1/C 1 nf p p h. 0 v h V h 0 p h Y h (5.35) Under the approxmaton assumpton (5.30) we get u u h 1 h k. In order to bound u u h ɛ 1 besdes (5.35) we also need a bound on u h u h ɛ 1. For the

32 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 32 reason we substract equaton (5.3) from (4.3) then we set v h = u h u h ɛ and we obtan: a 0 (u h u h ɛ, u h u h ɛ ) b(u h u h ɛ ; u h ɛ, u h u h ɛ ) ɛ λ h, λ λ ɛ,h ρ h ρ h ɛ, (u h u h ɛ ) n j Γj = 0. (5.36) From Lemma 3.1 we have: where e h ɛ (λ ɛ,h 1, λɛ,h 2, ρ ɛ h ) 2(Re 1 α) u h u h ɛ β 1 (5.37) [ 1/2 e h ɛ (λ ɛ,h 1, λɛ,h 2, ρh ɛ ) := λ h 1 λ ɛ,h 1 2 Z λ h 2 λ ɛ,h 2 2 Z ρ h ρ h ɛ Z] 2. Γj Snce Γ h = Γ addng and substractng ɛ λ, λ λ ɛ,h Γj, and ρ, (u h u h ɛ ) n j Γj n (5.36) gves: a 0 (u h u h ɛ, u h u h ɛ ) b(u h u h ɛ ; u h ɛ, u h u h ɛ ) (5.38) ɛ λ, λ λ ɛ,h Γj ρ ρ h ɛ, (uh u h ɛ ) n j Γj = 0. By the same argument as n the proof of Proposton 2.1 we obtan: u h u h ɛ 1 C 1 [ ɛ 2 1 λ 1 2 Γ ɛ2 2 λ 2 2 Γ] 1/2, (5.39) where C 1 depends on Re, α, β, and f. Then combnng (5.37) and (5.39). We get: u h u ɛ h 1 ɛ

33 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 33 Thus from (5.35) and (5.38) u u ɛ h 1 h k ɛ. (5.40) where C depends on C 1 and λ Γ for = 1, 2. Thus (5.40) ndcates that the proper choce of ɛ n (5.40) s ɛ = h k. Theorem 5.3 Assume that the dscrete spaces satsfy condton (4.7) and let ɛ = h k. Then the error n the soluton of the penalty-lagrange multpler method and the dscrete soluton of the penalty-lagrange multpler method s as follows: u u h ɛ 1 Cɛ. Concluson. Weak mposton of essental boundary condtons by penalty- Lagrange multplers method lessens the ll-effects of domans wth non-smooth boundares. In ths paper we have shown that the optmal order of convergence can be acheved f the computatonal boundary follows the real flow boundary exactly. We dd not nclude numercal results because of the dffculty n mplementaton of the Lagrange multplers method. Tradtonally, Lagrange multplers method s used as a model problem. However, we have done smlar analyss by usng the penalty- penalty method and verfed our results numercally n [20]. Acknowledgments. I would lke to thank Prof. W. J. Layton and Dr. T. Lakos for ther valuable contrbutons to ths paper.

34 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 34 References [1] R. A. Adams Sobolev Spaces. Academc Press, [2] T. Lakos. Weak mposton of boundary condtons n the Stokes problem. Ph.D. Thess, Unv. of Pttsburgh, PA, 1999 [3] I. Babuška. The fnte element method wth lagrangan multplers. Numer. Math., [4] J. Ptkäranta. The fnte element method wth lagrange multplers for doman wth corners. Math. Comput., 37:13-30 (1981). [5] R. Verfürth. Fnte element approxmaton of ncompressble Naver- Stokes equatons wth slp boundary condton. Numer. Math., 50: (1987). [6] R. Verfürth. Fnte element approxmaton of ncompressble Naver- Stokes equatons wth slp boundary condtonii. Numer. Math., 59: (1991). [7] W. J. Layton. Weak Imposton of no-slp condtons n fnte element methods. Computers and Mathematcs wth Applcatons, 38: (1999). [8] V. Grault, P.A. Ravart. Fnte Element Approxmaton of The Naver-Stokes equatons, Lecture notes n Mathematcs v.749, Sprnger- Verlag, Berln, Hedelberg, New York,1979, p.106.

35 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 35 [9] R. Temam. Naver-stokes Equatons: Theory and Numercal Analyss. North-Holland, Amsterdam, [10] P. Gald. An Introducton to the Mathematcal Theory of the Naver- Stokes Equatons I., Volume38 of Sprnger Tracts n Natural Phlosophy. Sprnger, [11] J. Gobert. Sur une négalté de coercvté, J. Math. Anal. Appl. 36: (1971). [12] G. Fchera. Exstence Theorems n elastcty, Volume IV. a/2 of Handbook de Physk. Sprnger, Berln, [13] V. Grault, P.A. Ravart. Fnte Element Methods for Naver-Stokes equatons; Theory and Algorthms. Sprnger Seres n Computtaonal Mathematcs,v.5, Sprnger-Verlag, Berln, Hedelberg, New York,1986,p.108. [14] J. Serrn Mathematcal Prncples of Classcal Flud Mechancs. Encyclopeda of Physcs VII/1. Sprnger, Berln, [15] P. G. Carlet. Fnte Element Methods For Elptc Problems. North Holland, Amsterdam, [16] I. Babuška. The fnte element method wth penalty. Math. Comp. 27: (1973). [17] R. S. Falk, J. T. Kng. A penalty and extrapolaton method for the statonary Stokes equatons. SIAM J. Numer. Anal., 13 No.5: (1976).

36 WEAK IMPOSITION OF B.C. IN NAVIER-STOKES 36 [18] G. F. Carey, R. Krshnan. Contnuaton technques for a penalty approxmaton of the Naver-Stokes equatons. Comput. Methods Appl. Mech. Engrg. 60 No.1:1-29(1987). [19] D. Arnold,F. Brezz,and M. Fortn. A stable element for the Stokes equatons., Calcolo 21: (1984). [20] A. Çağlar, V. John. Weak mposton of boundary condtons for the Naver-Stokes equatons by a Penalty-Penalty Method (submtted)

The Finite Element Method: A Short Introduction

The Finite Element Method: A Short Introduction Te Fnte Element Metod: A Sort ntroducton Wat s FEM? Te Fnte Element Metod (FEM) ntroduced by engneers n late 50 s and 60 s s a numercal tecnque for solvng problems wc are descrbed by Ordnary Dfferental

More information

Uniqueness of Weak Solutions to the 3D Ginzburg- Landau Model for Superconductivity

Uniqueness of Weak Solutions to the 3D Ginzburg- Landau Model for Superconductivity Int. Journal of Math. Analyss, Vol. 6, 212, no. 22, 195-114 Unqueness of Weak Solutons to the 3D Gnzburg- Landau Model for Superconductvty Jshan Fan Department of Appled Mathematcs Nanjng Forestry Unversty

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION

More information

Exercise Solutions to Real Analysis

Exercise Solutions to Real Analysis xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

Deriving the X-Z Identity from Auxiliary Space Method

Deriving the X-Z Identity from Auxiliary Space Method Dervng the X-Z Identty from Auxlary Space Method Long Chen Department of Mathematcs, Unversty of Calforna at Irvne, Irvne, CA 92697 chenlong@math.uc.edu 1 Iteratve Methods In ths paper we dscuss teratve

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

Homogenization of reaction-diffusion processes in a two-component porous medium with a non-linear flux-condition on the interface

Homogenization of reaction-diffusion processes in a two-component porous medium with a non-linear flux-condition on the interface Homogenzaton of reacton-dffuson processes n a two-component porous medum wth a non-lnear flux-condton on the nterface Internatonal Conference on Numercal and Mathematcal Modelng of Flow and Transport n

More information

Numerical Heat and Mass Transfer

Numerical Heat and Mass Transfer Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and

More information

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

General viscosity iterative method for a sequence of quasi-nonexpansive mappings Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,

More information

Appendix B. Criterion of Riemann-Stieltjes Integrability

Appendix B. Criterion of Riemann-Stieltjes Integrability Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for

More information

Robust Norm Equivalencies and Preconditioning

Robust Norm Equivalencies and Preconditioning Robust Norm Equvalences and Precondtonng Karl Scherer Insttut für Angewandte Mathematk, Unversty of Bonn, Wegelerstr. 6, 53115 Bonn, Germany Summary. In ths contrbuton we report on work done n contnuaton

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

Randić Energy and Randić Estrada Index of a Graph

Randić Energy and Randić Estrada Index of a Graph EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL

More information

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2 Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to

More information

Some basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C

Some basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

More information

Curvature and isoperimetric inequality

Curvature and isoperimetric inequality urvature and sopermetrc nequalty Julà ufí, Agustí Reventós, arlos J Rodríguez Abstract We prove an nequalty nvolvng the length of a plane curve and the ntegral of ts radus of curvature, that has as a consequence

More information

Lecture 21: Numerical methods for pricing American type derivatives

Lecture 21: Numerical methods for pricing American type derivatives Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

More information

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,

More information

The Second Anti-Mathima on Game Theory

The Second Anti-Mathima on Game Theory The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player

More information

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution. Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,

More information

In this section is given an overview of the common elasticity models.

In this section is given an overview of the common elasticity models. Secton 4.1 4.1 Elastc Solds In ths secton s gven an overvew of the common elastcty models. 4.1.1 The Lnear Elastc Sold The classcal Lnear Elastc model, or Hooean model, has the followng lnear relatonshp

More information

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton

More information

PHYS 705: Classical Mechanics. Calculus of Variations II

PHYS 705: Classical Mechanics. Calculus of Variations II 1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary

More information

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

First day August 1, Problems and Solutions

First day August 1, Problems and Solutions FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve

More information

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1 P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the

More information

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

More information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016 U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and

More information

Math 217 Fall 2013 Homework 2 Solutions

Math 217 Fall 2013 Homework 2 Solutions Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has

More information

STEINHAUS PROPERTY IN BANACH LATTICES

STEINHAUS PROPERTY IN BANACH LATTICES DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS

More information

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13 CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 13 GENE H GOLUB 1 Iteratve Methods Very large problems (naturally sparse, from applcatons): teratve methods Structured matrces (even sometmes dense,

More information

A new Approach for Solving Linear Ordinary Differential Equations

A new Approach for Solving Linear Ordinary Differential Equations , ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of

More information

Affine and Riemannian Connections

Affine and Riemannian Connections Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

Another converse of Jensen s inequality

Another converse of Jensen s inequality Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout

More information

A new family of high regularity elements

A new family of high regularity elements A new famly of hgh regularty elements Jguang Sun Abstract In ths paper, we propose a new famly of hgh regularty fnte element spaces. The global approxmaton spaces are obtaned n two steps. We frst buld

More information

REAL ANALYSIS I HOMEWORK 1

REAL ANALYSIS I HOMEWORK 1 REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α

More information

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs

More information

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011 Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected

More information

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

Appendix B. The Finite Difference Scheme

Appendix B. The Finite Difference Scheme 140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

A Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function

A Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function A Local Varatonal Problem of Second Order for a Class of Optmal Control Problems wth Nonsmooth Objectve Functon Alexander P. Afanasev Insttute for Informaton Transmsson Problems, Russan Academy of Scences,

More information

A Hybrid Variational Iteration Method for Blasius Equation

A Hybrid Variational Iteration Method for Blasius Equation Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method

More information

CSCE 790S Background Results

CSCE 790S Background Results CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each

More information

Implicit Integration Henyey Method

Implicit Integration Henyey Method Implct Integraton Henyey Method In realstc stellar evoluton codes nstead of a drect ntegraton usng for example the Runge-Kutta method one employs an teratve mplct technque. Ths s because the structure

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

Spectral Graph Theory and its Applications September 16, Lecture 5

Spectral Graph Theory and its Applications September 16, Lecture 5 Spectral Graph Theory and ts Applcatons September 16, 2004 Lecturer: Danel A. Spelman Lecture 5 5.1 Introducton In ths lecture, we wll prove the followng theorem: Theorem 5.1.1. Let G be a planar graph

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

The Minimum Universal Cost Flow in an Infeasible Flow Network Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran

More information

SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N)

SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N) SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) S.BOUCKSOM Abstract. The goal of ths note s to present a remarably smple proof, due to Hen, of a result prevously obtaned by Gllet-Soulé,

More information

Inexact Newton Methods for Inverse Eigenvalue Problems

Inexact Newton Methods for Inverse Eigenvalue Problems Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.

More information

MAT 578 Functional Analysis

MAT 578 Functional Analysis MAT 578 Functonal Analyss John Qugg Fall 2008 Locally convex spaces revsed September 6, 2008 Ths secton establshes the fundamental propertes of locally convex spaces. Acknowledgment: although I wrote these

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

More information

The Finite Element Method

The Finite Element Method The Fnte Element Method GENERAL INTRODUCTION Read: Chapters 1 and 2 CONTENTS Engneerng and analyss Smulaton of a physcal process Examples mathematcal model development Approxmate solutons and methods of

More information

Economics 101. Lecture 4 - Equilibrium and Efficiency

Economics 101. Lecture 4 - Equilibrium and Efficiency Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng

More information

Vector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.

Vector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence. Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm

More information

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 ) Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often

More information

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton

More information

Perfect Competition and the Nash Bargaining Solution

Perfect Competition and the Nash Bargaining Solution Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange

More information

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem. prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove

More information

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class

More information

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014) 0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes

More information

COMPUTATIONAL METHODS AND ALGORITHMS Vol. II - Finite Element Method - Jacques-Hervé SAIAC

COMPUTATIONAL METHODS AND ALGORITHMS Vol. II - Finite Element Method - Jacques-Hervé SAIAC COMPUTATIONAL METHODS AND ALGORITHMS Vol. II - Fnte Element Method - Jacques-Hervé SAIAC FINITE ELEMENT METHOD Jacques-Hervé SAIAC Départment de Mathématques, Conservatore Natonal des Arts et Méters, Pars,

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Lecture Note 3. Eshelby s Inclusion II

Lecture Note 3. Eshelby s Inclusion II ME340B Elastcty of Mcroscopc Structures Stanford Unversty Wnter 004 Lecture Note 3. Eshelby s Incluson II Chrs Wenberger and We Ca c All rghts reserved January 6, 004 Contents 1 Incluson energy n an nfnte

More information

Publication 2006/01. Transport Equations in Incompressible. Lars Davidson

Publication 2006/01. Transport Equations in Incompressible. Lars Davidson Publcaton 2006/01 Transport Equatons n Incompressble URANS and LES Lars Davdson Dvson of Flud Dynamcs Department of Appled Mechancs Chalmers Unversty of Technology Göteborg, Sweden, May 2006 Transport

More information

COMPUTING THE NORM OF A MATRIX

COMPUTING THE NORM OF A MATRIX COMPUTING THE NORM OF A MATRIX KEITH CONRAD 1. Introducton In R n there s a standard noton of length: the sze of a vector v = (a 1,..., a n ) s v = a 2 1 + + a2 n. We wll dscuss n Secton 2 the general

More information

Fixed point method and its improvement for the system of Volterra-Fredholm integral equations of the second kind

Fixed point method and its improvement for the system of Volterra-Fredholm integral equations of the second kind MATEMATIKA, 217, Volume 33, Number 2, 191 26 c Penerbt UTM Press. All rghts reserved Fxed pont method and ts mprovement for the system of Volterra-Fredholm ntegral equatons of the second knd 1 Talaat I.

More information

MATH 5630: Discrete Time-Space Model Hung Phan, UMass Lowell March 1, 2018

MATH 5630: Discrete Time-Space Model Hung Phan, UMass Lowell March 1, 2018 MATH 5630: Dscrete Tme-Space Model Hung Phan, UMass Lowell March, 08 Newton s Law of Coolng Consder the coolng of a well strred coffee so that the temperature does not depend on space Newton s law of collng

More information

Lecture 5.8 Flux Vector Splitting

Lecture 5.8 Flux Vector Splitting Lecture 5.8 Flux Vector Splttng 1 Flux Vector Splttng The vector E n (5.7.) can be rewrtten as E = AU (5.8.1) (wth A as gven n (5.7.4) or (5.7.6) ) whenever, the equaton of state s of the separable form

More information

Group Analysis of Ordinary Differential Equations of the Order n>2

Group Analysis of Ordinary Differential Equations of the Order n>2 Symmetry n Nonlnear Mathematcal Physcs 997, V., 64 7. Group Analyss of Ordnary Dfferental Equatons of the Order n> L.M. BERKOVICH and S.Y. POPOV Samara State Unversty, 4430, Samara, Russa E-mal: berk@nfo.ssu.samara.ru

More information

PHYS 705: Classical Mechanics. Canonical Transformation II

PHYS 705: Classical Mechanics. Canonical Transformation II 1 PHYS 705: Classcal Mechancs Canoncal Transformaton II Example: Harmonc Oscllator f ( x) x m 0 x U( x) x mx x LT U m Defne or L p p mx x x m mx x H px L px p m p x m m H p 1 x m p m 1 m H x p m x m m

More information

5 The Rational Canonical Form

5 The Rational Canonical Form 5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces

More information

Modelli Clamfim Equazioni differenziali 7 ottobre 2013

Modelli Clamfim Equazioni differenziali 7 ottobre 2013 CLAMFIM Bologna Modell 1 @ Clamfm Equazon dfferenzal 7 ottobre 2013 professor Danele Rtell danele.rtell@unbo.t 1/18? Ordnary Dfferental Equatons A dfferental equaton s an equaton that defnes a relatonshp

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look

More information

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 7, Number 2, December 203 Avalable onlne at http://acutm.math.ut.ee A note on almost sure behavor of randomly weghted sums of φ-mxng

More information

Norms, Condition Numbers, Eigenvalues and Eigenvectors

Norms, Condition Numbers, Eigenvalues and Eigenvectors Norms, Condton Numbers, Egenvalues and Egenvectors 1 Norms A norm s a measure of the sze of a matrx or a vector For vectors the common norms are: N a 2 = ( x 2 1/2 the Eucldean Norm (1a b 1 = =1 N x (1b

More information

Mechanics Physics 151

Mechanics Physics 151 Mechancs Physcs 151 Lecture 3 Lagrange s Equatons (Goldsten Chapter 1) Hamlton s Prncple (Chapter 2) What We Dd Last Tme! Dscussed mult-partcle systems! Internal and external forces! Laws of acton and

More information

Module 1 : The equation of continuity. Lecture 1: Equation of Continuity

Module 1 : The equation of continuity. Lecture 1: Equation of Continuity 1 Module 1 : The equaton of contnuty Lecture 1: Equaton of Contnuty 2 Advanced Heat and Mass Transfer: Modules 1. THE EQUATION OF CONTINUITY : Lectures 1-6 () () () (v) (v) Overall Mass Balance Momentum

More information

The Two-scale Finite Element Errors Analysis for One Class of Thermoelastic Problem in Periodic Composites

The Two-scale Finite Element Errors Analysis for One Class of Thermoelastic Problem in Periodic Composites 7 Asa-Pacfc Engneerng Technology Conference (APETC 7) ISBN: 978--6595-443- The Two-scale Fnte Element Errors Analyss for One Class of Thermoelastc Problem n Perodc Compostes Xaoun Deng Mngxang Deng ABSTRACT

More information

DIFFERENTIAL FORMS BRIAN OSSERMAN

DIFFERENTIAL FORMS BRIAN OSSERMAN DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne

More information

ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction

ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES TAKASHI ITOH AND MASARU NAGISA Abstract We descrbe the Haagerup tensor product l h l and the extended Haagerup tensor product l eh l n terms of

More information

Physics 5153 Classical Mechanics. Principle of Virtual Work-1

Physics 5153 Classical Mechanics. Principle of Virtual Work-1 P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal

More information

Georgia Tech PHYS 6124 Mathematical Methods of Physics I

Georgia Tech PHYS 6124 Mathematical Methods of Physics I Georga Tech PHYS 624 Mathematcal Methods of Physcs I Instructor: Predrag Cvtanovć Fall semester 202 Homework Set #7 due October 30 202 == show all your work for maxmum credt == put labels ttle legends

More information

ON THE BURGERS EQUATION WITH A STOCHASTIC STEPPING STONE NOISY TERM

ON THE BURGERS EQUATION WITH A STOCHASTIC STEPPING STONE NOISY TERM O THE BURGERS EQUATIO WITH A STOCHASTIC STEPPIG STOE OISY TERM Eaterna T. Kolovsa Comuncacón Técnca o I-2-14/11-7-22 PE/CIMAT On the Burgers Equaton wth a stochastc steppng-stone nosy term Eaterna T. Kolovsa

More information