Additive Schwarz Method for DG Discretization of Anisotropic Elliptic Problems

Size: px
Start display at page:

Download "Additive Schwarz Method for DG Discretization of Anisotropic Elliptic Problems"

Transcription

1 Addtve Schwarz Method for DG Dscretzaton of Ansotropc Ellptc Problems Maksymlan Dryja 1, Potr Krzyżanowsk 1, and Marcus Sarks 2 1 Introducton In the paper we consder a second order ellptc problem wth dscontnuous ansotropc coeffcents defned on a polygonal regon Ω. The problem s dscretzed by a Dscontnuous Galerkn (DG) fnte element method wth trangular elements and pecewse lnear functons. Our goal s to desgn and analyze an addtve Schwarz method (ASM), see the book by Tosell and Wdlund [4], for solvng the resultng dscrete problem wth rate of convergence ndependent of the jumps of the coeffcents. The method s two-level and wthout overlap of Ω l, the substructures nto whch the orgnal regon Ω s parttoned. It s proved that the convergence of the method s ndependent of the jumps of the coeffcents appearng on trangles nsde of Ω l, see [3]. It s the same for the jumps appearng on trangles whch touch Ω l under addtonal assumptons on the coeffcents, lke monotoncty or quasmonotoncty. The ASM dscussed here s a generalzaton of method presented n [1]. Numercal experments confrm the theoretcal results. The paper s organzed as follows. In Secton 2, dfferental and dscrete DG problems are formulated. In Secton 3, ASM for solvng the dscrete problem s desgned and analyzed. Numercal experments are presented n Secton 4. 2 Dfferental and dscrete DG problems We consder the followng ellptc problem: fnd u H0 1 (Ω) such that a(u,v) = f (v), v H 1 0 (Ω) (1) where a(u,v) = ρ(x) u vdx, f (v) = Ω ( ) ρ11 (x) ρ ρ(x) = 12 (x). ρ 21 (x) ρ 22 (x) Ω f vdx, 1 Unversty of Warsaw, Poland; e-mal: {m.dryja,p.krzyzanowsk}@mmuw.edu.pl 2 Worcester Polytechnc Insttute, USA and Insttuto Naconal de Matemátca Pura e Aplcada, Brasl; e-mal: msarks@wp.edu 1

2 2 Maksymlan Dryja, Potr Krzyżanowsk, and Marcus Sarks We assume that Ω s a polygonal regon, f L 2 (Ω) and ρ(x), the dffusvty tensor, s a symmetrc matrx, unformly postve defnte wth respect to x, and ρ j L (Ω),. j = 1,2. Under these assumptons problem (1) s well posed. Let T h (Ω) be a trangulaton of Ω wth trangular elements K and the mesh parameter h. We assume that T h (Ω) s shape regular and quasunform. Let X (K ) denote a space of lnear functons on K and N X h (Ω) = Π=1 N X (K ), Ω = K =1 be the space n whch problem (1) s approxmated. Note that X h (Ω) H 1 (Ω) and ts elements do not vansh on Ω, n general. The dscrete problem for (1) s of the form: fnd u h X h(ω) such that â h (u h,v h) = f (v h ), v h X h (Ω), (2) where for u,v X h (Ω),u = {u } N =1,u X (K ), and and ρ () kl â h (u,v) = N =1 ρ () = ρ K, â (u,v), f (v) = N =1 ρ () = {ρ () kl }2 k,l=1, K f v dx are constants on K whch can always be assumed for lnear elements. Here wth symmetrc forms s (u,v) = E j K â (u,v) = a (u,v) + s (u,v) + p (u,v), p (u,v) = a (u,v) = ρ () u v dx, K E j ω [n T ρ () u (v j v ) + n T ρ () v (u j u )]ds, σ h E j K E j γ j (u u j )(v v j )ds where E j = E j = K K j,e j K and E j K j ; n = n E j s the unt normal vector to E j pontng from K to K j ; and ω ω E j = δ ( j) ρ n δ () ρ n + δ ( j) ρ n, ω j ω E j = δ () ρ n δ () j) ρn + ρ( ρ n

3 Addtve Schwarz Method for DG Ansotropc Ellptc Problems 3 δ () ρ n = nt ρ () n, δ ( j) ρ n = nt j ρ ( j) n j ; γ j γ E j = 2δ () ρ n δ ( j) ( j) ρn /(δ ρ n + δ () ρn ); σ s a postve (suffcently large, cf. Lemma 1) penalty parameter, whch ensures the ellptcty of â (, ). To analyze problem (2) we ntroduce some auxlary blnear forms and a broken norm. Let the ellptc symmetrc form d h (, ) be defned as d h (u,v) = N =1 d (u,v), d (u,v) = a (u,v) + p (u,v) (3) and let the weghted broken norm n X h (Ω) be defned by u 2 1,h d h(u,u) = N =1 { (ρ () ) 1/2 u 2 L 2 (K ) + σ h γ j u u j 2 L 2 (E }. j) E j K Lemma 1. There exsts σ 0 > 0 such that for σ σ 0 there exst postve constants C 0 and C 1 ndependent of ρ () and h such tha C 0 d (u,u) â (u,u) C 1 d (u,u) (4) and for all u X h. C 0 d h (u,u) â(u,u) C 1 d h (u,u) For the proof we refer for example to [1] for sotropc cases and [2] for ansotropc cases. Lemma 1 mples that the dscrete problem (2) s well posed f the penalty parameter σ σ 0. Below σ s fxed and assumed to satsfy the above condton. The error bound s gven by Theorem 1. Let u and u h be the solutons of (1) and (2). For u K H 2 (K ) holds u u N h 2 1,h Mh2 λ max (ρ () ) u 2 H 2 (K ) =1 where M s ndependent of h,u and ρ ; λ max (ρ () ) s a maxmum egenvalue of ρ (). The proof follows from Lemma 1, for detals see for example [2]. 3 Addtve Schwarz method We desgn and analyze ASM for solvng problem (2) followng to the abstract theory of ASMs, see for example, [4].

4 4 Maksymlan Dryja, Potr Krzyżanowsk, and Marcus Sarks 3.1 Decomposton of X h (Ω) Let Ω = L l=1 Ω l, Ω l Ω m = {/0}, l m where Ω l s a unon of trangulaton elements K and H l = dam(ω l ). The decomposton of X h (Ω) s where for l = 1,...,L and for l = 0 X h (Ω) = X (0) (Ω) + X (1) (Ω) X (L) (Ω), X (l) (Ω) = {v = {v } N =1 X h(ω) : v = 0 on K Ω l } V (0) (Ω) = span{φ (l) } L l=1 wth φ (l) = 1 on Ω l and φ (l) = 0 otherwse. 3.2 Inexact local solvers For u (l) = {u (l) } N =1 X (l) (Ω) and v (l) = {v (l) } N =1 X (l) (Ω),l = 1,...,L, we defne b l (u (l),v (l) ) = d h (u (l),v (l) ). The overlap between local subproblems s very small (only through the subdoman nterface), reducng communcaton cost to a level smlar to substructurng methods. Instead of solvng exact subproblems wth form â h (, ) on subdomans, we solve problems wth smplfed form d h (, ). Note that on X (l) (Ω) X (l) (Ω) d h (u (l),v (l) ) = {(ρ () u (l), v (l) ) L 2 (K ) + σ K Ω l E j K h γ j(u (l) u (l) j,v (l) v (l) j ) L 2 (E j ) }. For l = 0 and u (0) = {u (0) } N =1 X (0) (Ω) and v (0) = {v (0) } N =1 X (0) (Ω) we set b 0 (u (0),v (0) ) = d h (u (0),v (0) ) L l=1 σ h γ j (u (0) u (0) j,v (0) v (0) j ) L 2 (E j ). E j Ω l 3.3 Operator equaton For l = 0,...,L, let us defne T l : X h (Ω) X (l) (Ω) by

5 Addtve Schwarz Method for DG Ansotropc Ellptc Problems 5 b l (T l u,v) = â h (u,v), v X (l) (Ω). Then problem (2) s replaced by Tu h = g h, g h = L l=0 g l, g l = T l u h. (5) wth T = T 0 + T T L. Note that n order to compute g l we do not need to know u h. From the theorem below t follows that problems (2) and (5) have the same unque soluton. 3.4 Analyss Let Ω l h denote a layer around Ω l. It s a unon of K Ω l whch touch Ω l by edge or/and vertex. Let ᾱ l := max λ max (ρ () ), α l := mn λ mn (ρ () ) K Ω l h K Ω l h where λ max (ρ () ) and λ mn (ρ () ) are maxmum and mnmum egenvalues of ρ () on K. Theorem 2 (man result). For any u X h (Ω) there holds where C 2 β 1 â h (u,u) â h (Tu,u) C 3 â h (u,u) (6) ᾱ l Hl 2 β = max 1 l L α l h 2 and C 2 and C 3 are postve constants ndependent of ρ (),ᾱ l and α l for = 1,...,N and l = 1,...,L. To prove Theorem 2 we need to check three key assumptons of the abstract theory of ASMs, see Tosell and Wdlund book [4]. The proof s omtted here due to the lmt of pages and wll be publshed elsewhere. Remark 1. Note that the convergence of the method s ndependent of the jumps of ρ () on Ω l \Ω h l for all l = 1,...,L,.e. of the jumps of ρ () on K whch do not touch Ω l. Remark 2. Let us menton several specfc cases when the above estmate can be mproved. When ρ s sotropc and subdomanwse constant, then we can prove that β = max l (H l /h) n (6). When ᾱ l and α l are the same order and α l max K Ω l λ mn (ρ () ),

6 6 Maksymlan Dryja, Potr Krzyżanowsk, and Marcus Sarks then β = max l (H l /h),.e. the convergence s ndependent of the jumps of ρ (). Estmate (6) can be also mproved n the case when λ max (ρ () ) on K whch touch Ω l by edges are monotonc or quas-monotonc on Ω l for l = 1,...,L. 4 Numercal experments Let us choose the unt square as the doman Ω and for some prescrbed nteger m dvde t nto L = 2 m 2 m smaller squares Ω l (l = 1,...,L) of equal sze. Ths decomposton of Ω s then further refned nto a unform trangulaton T h (Ω) based on a square 2 M 2 M grd (M m) wth each square splt nto two trangles of dentcal shape. Hence, the fne mesh parameter h = 2 M, whle the coarse grd parameter s H = 2 m. We dscretze system (1) on the fne trangulaton usng method (2) wth σ = 7. In tables below we report the number of Precondtoned Conjugate Gradent teratons for operator T (defned n Secton 3.3) whch are requred to reduce the ntal Eucldean norm of the resdual by a factor of 10 6 and (n parentheses) the condton number estmate for T. We consder two sets of test problems: wth ether ansotropc or dscontnuous coeffcents matrx ρ. We wll always choose a random vector for the rght hand sde and a zero as the ntal guess. Dscontnuous, elementwse constant sotropc coeffcents. Let us consder dffuson coeffcent of the form ρ(x) = ρ 11 (x) I (7) where ρ 11 equals 1 on even numbered elements (of fne trangulaton) and equals 10 2 on odd ones. Table 1 shows the dependence on the rato between H and h n ths case. Fne (M) Coarse (m) 2 33 (32) 82 (300) 133 (530) 164 (840) 237 (2000) 3 45 (41) 140 (370) 189 (700) 225 (1100) 4 48 (42) 155 (470) 186 (690) 5 41 (48) 155 (470) 6 49 (44) Table 1 Dependence of the number of teratons and the condton number (n parentheses) on the rato H/h, where H = 2 m and h = 2 M. Isotropc, elementwse constant coeffcent. Next, let us fx the number of subdomans and the fne mesh sze so that M = 3 and m = 5 and thus H/h = 4. Table 2 shows the dependence of the convergence rate and the condton number as we vary the value of ρ 11 on odd-numbered trangles; on even trangles t remans equal to 1 as prevously.

7 Addtve Schwarz Method for DG Ansotropc Ellptc Problems 7 ρ ter (cond) 61 (80) 72 (10 2 ) 167 ( ) 335 ( ) 485 ( ) 613 ( ) 743 ( ) Table 2 Dependence of the number of teratons and the condton number (n parentheses) on the dscontnuty n the sotropc, elementwse constant coeffcent. Fxed H/h = 4. Indeed, the condton number estmates agree well wth our theory regardng the dependence on the dscontnuty of the coeffcent. In our testcase the ncrease n the condton number s rather lnear than quadratc n H/h, as reported n Table 1. Ths behavour s n agreement wth our Remark 2. Let us also explan that low teraton numbers n Table 2 are due to a very rapd resdual n the resdual durng the ntal phase of the teraton. Dscontnuous, domanwse constant sotropc coeffcents. Here we consder ρ as n (7), wth dscontnutes algned wth an auxlary parttonng of Ω nto 4 4 squares. Precsely, we ntroduce a red black checkerboard colorng of ths parttonng and set ρ = 1 n red regons, and the value of ρ 11 reported n Table 3 n black ones. In ths way, our decomposton of the doman wth M = 5 and m = 3 wll always be algned wth the dscontnutes and Table 3 shows the dependence on ρ 11 n ths case. ρ ter (cond) 61 (80) 60 (70) 58 (67) 58 (68) 62 (68) 64 (68) 67 (68) Table 3 Dependence of the number of teratons and the condton number (n parentheses) on the dscontnuty when the coeffcent s sotropc and constant nsde subdomans. Red black 4 4 dstrbuton of ρ, algned wth doman decomposton. Fxed H/h = 4. As predcted n Remark 2, there s no dependence on the dscontnuty n the coeffcents n ths case untl the coeffcent remans contnuous (constant) nsde subdoman. Ths behavour s not observed when the red black parttonng s not algned wth the subdomans Ω l : correspondng numbers for a 3 3 parttonng are shown n Table 4. ρ ter (cond) 62 (80) 68 (130) 85 (710) 96 ( ) 113 ( ) 126 ( ) 140 ( ) Table 4 Dependence of the number of teratons and the condton number (n parentheses) on the dscontnuty when the coeffcent s sotropc and dscontnuous across subdoman boundares. Red black 3 3 dstrbuton of ρ, not algned wth the doman decomposton. Fxed H/h = 4. Ansotropc, dscontnuous coeffcents. Let us contnue wth the 4 4 red black parttonng and let us set the coeffcent matrx ρ equal to ρ R n red regons and ρ B n black ones, where ρ R (x) = ( 10 + ρ22 0 ) 0 ρ 22, ( ) ρ B ρ22 0 (x) =, ρ 22

8 8 Maksymlan Dryja, Potr Krzyżanowsk, and Marcus Sarks wth constant ρ 22 as specfed n Table 5. In ths way ρ s constant n both red and black regons, but t suffers from dscontnuty across the parttonng borders; the jump s always equal to 10, whle the ansotropy rato s /ρ 22. The condton numbers grow lnearly wth the growth of ρ 22, whch agrees wth Theorem 2. ρ ter (cond) 60 (82) 94 (210) 222 (10 3 ) 463 (10 4 ) 680 (10 5 ) 782 (10 6 ) 897 (10 7 ) Table 5 Dependence on the ansotropy for dscontnuous, pecewse constant coeffcent. Fxed H/h = 4. Ansotropc, constant coeffcents. Fnally, let us consder ( ) 1 0 ρ(x) = 0 ρ 22 wth ρ 22 constant throughout entre Ω, assumng values specfed n Table 6. ρ ter (cond) 60 (82) 74 (10 2 ) 159 ( ) 159 ( ) 144 ( ) 143 ( ) 124 ( ) Table 6 Dependence on the ansotropy. Fxed H/h = 4. Contnuous, constant coeffcent. It turns out that after ntal lnear ncrease n the condton number for moderate ρ 22, the condton number s nsenstve to further growth of the ansotropy rato ρ 22. Ths observaton can also be explaned on the ground of our theory; the detals wll be provded elsewhere. Acknowledgements The research of the frst two authors has been partally supported by the Polsh Natonal Scence Centre grant 2011/01/B/ST1/ References 1. Dryja, M., Sarks, M.: Addtve average Schwarz methods for dscretzaton of ellptc problems wth hghly dscontnuous coeffcents. Comput. Methods Appl. Math. 10(2), (2010) 2. Ern, A., Stephansen, A.F., Zunno, P.: A dscontnuous Galerkn method wth weghted averages for advecton-dffuson equatons wth locally small and ansotropc dffusvty. IMA J. Numer. Anal. 29(2), (2009). DOI /manum/drm050. URL /manum/drm Graham, I.G., Lechner, P.O., Schechl, R.: Doman decomposton for multscale PDEs. Numer. Math. 106(4), (2007). DOI /s URL org/ /s Tosell, A., Wdlund, O.: Doman decomposton methods algorthms and theory, Sprnger Seres n Computatonal Mathematcs, vol. 34. Sprnger-Verlag, Berln (2005)

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

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

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

RESTRICTED ADDITIVE SCHWARZ METHOD WITH HARMONIC OVERLAP

RESTRICTED ADDITIVE SCHWARZ METHOD WITH HARMONIC OVERLAP RESTRICTED ADDITIVE SCHWARZ METHOD WITH HARMONIC OVERLAP XIAO-CHUAN CAI, MAKSYMILIAN DRYJA, AND MARCUS SARKIS Abstract. In ths paper, we ntroduce a new Schwarz precondtoner and wth a new coarse space.

More information

Non shape regular domain decompositions: an analysis using a stable decomposition in H 1 0

Non shape regular domain decompositions: an analysis using a stable decomposition in H 1 0 Non shape regular doman decompostons: an analyss usng a stable decomposton n H 1 0 Martn Gander 1, Laurence Halpern, and Kévn Santugn Repquet 3 Abstract In ths paper, we establsh the exstence of a stable

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

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information

High resolution entropy stable scheme for shallow water equations

High resolution entropy stable scheme for shallow water equations Internatonal Symposum on Computers & Informatcs (ISCI 05) Hgh resoluton entropy stable scheme for shallow water equatons Xaohan Cheng,a, Yufeng Ne,b, Department of Appled Mathematcs, Northwestern Polytechncal

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

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

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

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

Non shape regular domain decompositions: an analysis using a stable decomposition in H 1 0

Non shape regular domain decompositions: an analysis using a stable decomposition in H 1 0 on shape regular doman decompostons: an analyss usng a stable decomposton n 1 0 Martn J. Gander 1, Laurence alpern, and Kévn Santugn Repquet 3 1 Unversté de Genève, Secton de Mathématques, Martn.Gander@unge.ch

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

Non-overlapping Domain Decomposition Applied to Incompressible Flow Problems

Non-overlapping Domain Decomposition Applied to Incompressible Flow Problems Contemporary Mathematcs Volume 218, 1998 B 0-8218-0988-1-03050-8 Non-overlappng Doman Decomposton Appled to Incompressble Flow Problems Frank-Chrstan Otto and Gert Lube 1. Introducton A non-overlappng

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

Report on Image warping

Report on Image warping Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.

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

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

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

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k) ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of

More information

TR A BDDC ALGORITHM FOR PROBLEMS WITH MORTAR DISCRETIZATION. September 4, 2005

TR A BDDC ALGORITHM FOR PROBLEMS WITH MORTAR DISCRETIZATION. September 4, 2005 TR2005-873 A BDDC ALGORITHM FOR PROBLEMS WITH MORTAR DISCRETIZATION HYEA HYUN KIM, MAKSYMILIAN DRYJA, AND OLOF B WIDLUND September 4, 2005 Abstract A BDDC balancng doman decomposton by constrants algorthm

More information

The interface control domain decomposition (ICDD) method for the Stokes problem. (Received: 15 July Accepted: 13 September 2013)

The interface control domain decomposition (ICDD) method for the Stokes problem. (Received: 15 July Accepted: 13 September 2013) Journal of Coupled Systems Multscale Dynamcs Copyrght 2013 by Amercan Scentfc Publshers All rghts reserved. Prnted n the Unted States of Amerca do:10.1166/jcsmd.2013.1026 J. Coupled Syst. Multscale Dyn.

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

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

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

Polynomial Regression Models

Polynomial Regression Models LINEAR REGRESSION ANALYSIS MODULE XII Lecture - 6 Polynomal Regresson Models Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Test of sgnfcance To test the sgnfcance

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

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc

More information

DUE: WEDS FEB 21ST 2018

DUE: WEDS FEB 21ST 2018 HOMEWORK # 1: FINITE DIFFERENCES IN ONE DIMENSION DUE: WEDS FEB 21ST 2018 1. Theory Beam bendng s a classcal engneerng analyss. The tradtonal soluton technque makes smplfyng assumptons such as a constant

More information

Chapter Newton s Method

Chapter Newton s Method Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve

More information

THE STURM-LIOUVILLE EIGENVALUE PROBLEM - A NUMERICAL SOLUTION USING THE CONTROL VOLUME METHOD

THE STURM-LIOUVILLE EIGENVALUE PROBLEM - A NUMERICAL SOLUTION USING THE CONTROL VOLUME METHOD Journal of Appled Mathematcs and Computatonal Mechancs 06, 5(), 7-36 www.amcm.pcz.pl p-iss 99-9965 DOI: 0.75/jamcm.06..4 e-iss 353-0588 THE STURM-LIOUVILLE EIGEVALUE PROBLEM - A UMERICAL SOLUTIO USIG THE

More information

First Year Examination Department of Statistics, University of Florida

First Year Examination Department of Statistics, University of Florida Frst Year Examnaton Department of Statstcs, Unversty of Florda May 7, 010, 8:00 am - 1:00 noon Instructons: 1. You have four hours to answer questons n ths examnaton.. You must show your work to receve

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

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

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

A PROCEDURE FOR SIMULATING THE NONLINEAR CONDUCTION HEAT TRANSFER IN A BODY WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY.

A PROCEDURE FOR SIMULATING THE NONLINEAR CONDUCTION HEAT TRANSFER IN A BODY WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY. Proceedngs of the th Brazlan Congress of Thermal Scences and Engneerng -- ENCIT 006 Braz. Soc. of Mechancal Scences and Engneerng -- ABCM, Curtba, Brazl,- Dec. 5-8, 006 A PROCEDURE FOR SIMULATING THE NONLINEAR

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

Nonlinear Overlapping Domain Decomposition Methods

Nonlinear Overlapping Domain Decomposition Methods Nonlnear Overlappng Doman Decomposton Methods Xao-Chuan Ca 1 Department of Computer Scence, Unversty of Colorado at Boulder, Boulder, CO 80309, ca@cs.colorado.edu Summary. We dscuss some overlappng doman

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

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

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

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

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

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

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

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

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

Finding Dense Subgraphs in G(n, 1/2)

Finding Dense Subgraphs in G(n, 1/2) Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng

More information

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16 STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran

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

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

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

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

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES

VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue

More information

PART 8. Partial Differential Equations PDEs

PART 8. Partial Differential Equations PDEs he Islamc Unverst of Gaza Facult of Engneerng Cvl Engneerng Department Numercal Analss ECIV 3306 PAR 8 Partal Dfferental Equatons PDEs Chapter 9; Fnte Dfference: Ellptc Equatons Assocate Prof. Mazen Abualtaef

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

Estimation: Part 2. Chapter GREG estimation

Estimation: Part 2. Chapter GREG estimation Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the

More information

Min Cut, Fast Cut, Polynomial Identities

Min Cut, Fast Cut, Polynomial Identities Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.

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

Procedia Computer Science

Procedia Computer Science Avalable onlne at www.scencedrect.com Proceda Proceda Computer Computer Scence Scence 1 (01) 00 (009) 589 597 000 000 Proceda Computer Scence www.elsever.com/locate/proceda Internatonal Conference on Computatonal

More information

Global Sensitivity. Tuesday 20 th February, 2018

Global Sensitivity. Tuesday 20 th February, 2018 Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values

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

Chapter 12. Ordinary Differential Equation Boundary Value (BV) Problems

Chapter 12. Ordinary Differential Equation Boundary Value (BV) Problems Chapter. Ordnar Dfferental Equaton Boundar Value (BV) Problems In ths chapter we wll learn how to solve ODE boundar value problem. BV ODE s usuall gven wth x beng the ndependent space varable. p( x) q(

More information

Some modelling aspects for the Matlab implementation of MMA

Some modelling aspects for the Matlab implementation of MMA Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton

More information

1 Matrix representations of canonical matrices

1 Matrix representations of canonical matrices 1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:

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

On a direct solver for linear least squares problems

On a direct solver for linear least squares problems ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear

More information

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS) Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998

More information

On Finite Rank Perturbation of Diagonalizable Operators

On Finite Rank Perturbation of Diagonalizable Operators Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable

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

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

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

A new construction of 3-separable matrices via an improved decoding of Macula s construction

A new construction of 3-separable matrices via an improved decoding of Macula s construction Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula

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

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

Downloaded 07/31/13 to Redistribution subject to SIAM license or copyright; see

Downloaded 07/31/13 to Redistribution subject to SIAM license or copyright; see SIAM J NUMER ANAL Vol 47, No 1, pp 136 157 c 2008 Socety for Industral and Appled Mathematcs A BDDC METHOD FOR MORTAR DISCRETIZATIONS USING A TRANSFORMATION OF BASIS HYEA HYUN KIM, MAKSYMILIAN DRYJA, AND

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

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

One-sided finite-difference approximations suitable for use with Richardson extrapolation

One-sided finite-difference approximations suitable for use with Richardson extrapolation Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,

More information

Overlapping additive and multiplicative Schwarz iterations for H -matrices

Overlapping additive and multiplicative Schwarz iterations for H -matrices Lnear Algebra and ts Applcatons 393 (2004) 91 105 www.elsever.com/locate/laa Overlappng addtve and multplcatve Schwarz teratons for H -matrces Rafael Bru a,1, Francsco Pedroche a, Danel B. Szyld b,,2 a

More information

Lecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES

Lecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES COMPUTATIONAL FLUID DYNAMICS: FDM: Appromaton of Second Order Dervatves Lecture APPROXIMATION OF SECOMD ORDER DERIVATIVES. APPROXIMATION OF SECOND ORDER DERIVATIVES Second order dervatves appear n dffusve

More information

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur Analyss of Varance and Desgn of Experment-I MODULE VII LECTURE - 3 ANALYSIS OF COVARIANCE Dr Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Any scentfc experment s performed

More information

Case A. P k = Ni ( 2L i k 1 ) + (# big cells) 10d 2 P k.

Case A. P k = Ni ( 2L i k 1 ) + (# big cells) 10d 2 P k. THE CELLULAR METHOD In ths lecture, we ntroduce the cellular method as an approach to ncdence geometry theorems lke the Szemeréd-Trotter theorem. The method was ntroduced n the paper Combnatoral complexty

More information

Application of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems

Application of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &

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

2.29 Numerical Fluid Mechanics

2.29 Numerical Fluid Mechanics REVIEW Lecture 10: Sprng 2015 Lecture 11 Classfcaton of Partal Dfferental Equatons PDEs) and eamples wth fnte dfference dscretzatons Parabolc PDEs Ellptc PDEs Hyperbolc PDEs Error Types and Dscretzaton

More information

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur Analyss of Varance and Desgn of Exerments-I MODULE III LECTURE - 2 EXPERIMENTAL DESIGN MODELS Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 2 We consder the models

More information

New Method for Solving Poisson Equation. on Irregular Domains

New Method for Solving Poisson Equation. on Irregular Domains Appled Mathematcal Scences Vol. 6 01 no. 8 369 380 New Method for Solvng Posson Equaton on Irregular Domans J. Izadan and N. Karamooz Department of Mathematcs Facult of Scences Mashhad BranchIslamc Azad

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

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

NP-Completeness : Proofs

NP-Completeness : Proofs NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem

More information

A BDDC ALGORITHM WITH DELUXE SCALING FOR H(CURL) IN TWO DIMENSIONS WITH IRREGULAR SUBDOMAINS

A BDDC ALGORITHM WITH DELUXE SCALING FOR H(CURL) IN TWO DIMENSIONS WITH IRREGULAR SUBDOMAINS A BDDC ALGORITHM WITH DLUX SCALING FOR HCURL IN TWO DIMNSIONS WITH IRRGULAR SUBDOMAINS JUAN G. CALVO TR2014-965 Abstract. A bound s obtaned for te condton number of a BDDC algortm for problems posed n

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

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

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

ACTM State Calculus Competition Saturday April 30, 2011

ACTM State Calculus Competition Saturday April 30, 2011 ACTM State Calculus Competton Saturday Aprl 30, 2011 ACTM State Calculus Competton Sprng 2011 Page 1 Instructons: For questons 1 through 25, mark the best answer choce on the answer sheet provde Afterward

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