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

Size: px
Start display at page:

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

Transcription

1 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 Unversté Pars 13, LAGA UMR 7539 CRS halpern@math.unv-pars13.fr 3 Unversté Bordeaux, IMB, UMR 551 CRS, IRIA, F Talence, France. Kevn.Santugn@math.u-bordeaux1.fr hal , verson - 10 Feb 01 Summary. In ths paper, we establsh the exstence of a stable decomposton n the Sobolev space 0 1 for doman decompostons whch are not shape regular n the usual sense. In partcular, we consder doman decompostons where the largest subdoman s sgnfcantly larger than the smallest subdoman. We provde an explct upper bound for the stable decomposton that s ndependent of the rato between the dameter of the largest and the smallest subdoman. 1 Introducton One of the great success stores n doman decomposton methods s the nventon and analyss of the addtve Schwarz method by Dryja and Wdlund n []. Even before the seres of nternatonal conferences on doman decomposton methods started, Dryja and Wdlund presented a varant of the hstorcal alternatng Schwarz method nvented by Schwarz n [5] to prove the Drchlet prncple on general domans. Ths varant, called the addtve Schwarz method, has the advantage of beng symmetrc for symmetrc problems, and t also contans a coarse space component. In a fully dscrete analyss n [], Dryja and Wdlund proved, based on a stable decomposton result for shape regular decompostons, that the condton number of the precondtoned operator wth a decomposton nto many subdomans only grows lnearly as a functon of δ, where s the subdoman dameter, and the overlap between subdomans. Ths analyss nspred a generaton of numercal analysts, who used these technques n order to analyze many other doman decomposton methods, see the reference books [6, 4, 7], or the monographs [8, 1], and references theren. The key assumpton that the decomposton s shape regular s, however, often not satsfed n practce: because of load balancng, hghly refned subdomans are often physcally much smaller than subdomans contanng less refned elements, and t s therefore of nterest to consder doman decompostons that are only locally shape regular,.e., doman decompostons where the largest subdoman can

2 Martn J. Gander, Laurence alpern, and Kévn Santugn Repquet hal , verson - 10 Feb 01 be consderably larger than the smallest subdoman, and therefore the subdoman dameter and overlap parameters depend strongly on the subdoman ndex. In such a doman decomposton, the generc rato δ from the classcal convergence result of the addtve Schwarz method can be gven at least two dfferent meanngs: let refer to the dameter of subdoman number and δ refer to the wdth of the overlap around subdoman number. Then n the classcal convergence result from [], one could replace the generc rato δ by max mn δ, but ths s lkely to lead to a very pessmstc estmate for the condton number growth. The general analyss of the addtve Schwarz method based on a shape regular decomposton does unfortunately not permt to answer the queston f the condton number growth for a locally shape regular decomposton s n fact only lnear n the quantty max δ, whch s much smaller than max mn δ n the case of subdomans and overlaps of wdely dfferent szes, a case of great nterest n applcatons. In [3], we establshed the exstence of a stable decomposton n the contnuous settng wth an explct upper bound and a quanttatve defnton of shape regularty n two spatal dmensons. The explct upper bound s also lnear n the generc quantty δ, and the result s lmted to shape regular doman decompostons where all subdomans have smlar sze and where the overlap wdth s unform over all subdomans. avng explct upper bounds, however, allows us now, usng smlar technques, to establsh the exstence of a stable decomposton n the contnuous settng wth explct upper bounds when max mn, and we provde an explct upper bound whch s lnear n max /δ for problems n two spatal dmensons. To get ths result, only a few of the nequaltes establshed n [3] need to be reworked, and t would be very dffcult to obtan such a result wthout the explct upper bounds from the contnuous analyss n [3]. We state frst n our man theorem along wth the assumptons we make on the doman decomposton. We then prove the man theorem n 3 n two steps: frst, we show n Lemma 1 how to construct the fne component n 3.1, whch s an extenson of the result [3, Theorem 4.6] for the case where subdoman szes and overlaps δ can strongly depend on the subdoman ndex. The major contrbuton s however n the second step, presented n Lemma n 3., where we show how to construct the coarse component n the case of strongly varyng and δ between subdomans. Ths result s a substantal generalzaton of [3, Lemma 5.7]. Usng these two new results, and the remanng estmates from [3] whch are stll vald, we can prove our man theorem. We fnally summarze our results n the conclusons n 4. Geometrc parameters and man theorem In the remander of ths paper, we always consder a doman decomposton that has the followng propertes: Ω s a bounded doman of R.

3 on shape regular doman decomposton 3 hal , verson - 10 Feb 01 The U 1 are a non-overlappng doman decomposton of Ω,.e., satsfy =1 U = Ω and U U j = /0 when j. The U are bounded connected open sets of R and for all subdomans U the measure of U \U s zero. We set := damu. Two dstnct subdomans U and U j are sad to be neghbors f U U j /0. For each subdoman U, let δ > 0 be such that δ mn j,u U j =/0 dstu,u j. We set Ω := {x Ω, dstx,u < δ }. The Ω form an overlappng doman decomposton of Ω. When subdomans U and U j are neghbors, then the overlap between Ω and Ω j s δ +δ j wde. The ntersecton Ω Ω j s empty f and only f the dstance between U and U j s postve. We set = mn j,u U j /0 δ j and δ l = max j,u U j /0 δ j. The doman decomposton has c colors: there exsts a partton of [1,] nto c sets I k such that Ω Ω j s empty whenever j and and j belong to the same color I k. T s a coarse trangular mesh of Ω: one node x per subdoman Ω not countng the nodes located on Ω. By P 1 T, we denote the standard fnte element space of contnuous functons that are pecewse lnear over each trangular cell of T. Let θ mn be the mnmum of all angles of mesh T. o node ncludng the nodes located on Ω of the coarse mesh has more than K neghbors. Let d be the length of the largest edge orgnatng from node x n the mesh T. Let h, be the length of the shortest heght through x of any trangle n the coarse mesh T that connects to x. We also set h, as the mnmum of h, j over and ts drect neghbors n mesh T. We suppose that for each subdoman U, there exsts r > 0 such that U s starshaped wth respect to any pont n the ball Bx,r. We also suppose r h, 4K+1 and r h, /. We also assume the exstence of both a pseudo normal X and of a pseudo curvature radus R for the doman U,.e., we suppose that for each U there exsts an open layer L contanng U, a vector feld X contnuous on L U, C on L U such that DX xx x = 0, X x = 1, and ε 0 > 0 such that for all postve ε < ε 0 and for all ˆx n U, ˆx+ε X ˆx U and ˆx ε X ˆx / U. We set, for all postve δ, U δ = {x U, dstx, U < δ }, and V δ = {ˆx+sX ˆx, ˆx U,0 < s < δ }. We assume there exst ˆR > 0, θ X, 0 < θ X π/, and δ 0, 0 < δ 0 ˆR snθ X such that V ˆR L U and U δ V δ /snθ X for all postve δ δ 0. Set R := 1/ dvx. We suppose δ 0 > δ l We fnally defne, for all, the lnear form on 0 1 Ω by l u := 1 πr uxdx = 1 ux + r ydy. Bx,r π B0,1 We can now state our man theorem, namely the exstence of a stable decomposton of 0 1Ω whose upper bound s ndependent of max mn. Ths theorem therefore leads to a substantally sharper condton number estmate n the mportant case.

4 4 Martn J. Gander, Laurence alpern, and Kévn Santugn Repquet of an only locally shape regular decomposton, and s a major mprovement of [3, Theorem 5.1], whch only consdered shape regular decompostons, albet at the contnuous level, n contrast to []. Theorem 1. For u n 1 0 Ω, there exsts a stable decomposton u 0 of u,.e., u = =0 u, u 0 n P 1 T 1 0 Ω and u 1 0 Ω such that =0 u L Ω C u L Ω, hal , verson - 10 Feb 01 where C = C C 1 C and 1 C 1 = tanθ mn 1 + max r K 5 h, 6π max d r + π 1 K K + 1max r max h, r, h, C = + 8λ c max λ c max r ˆR max R ˆR max R δ l δ l max max max r ˆR snθ X δ s 4 r ˆR snθ X 1 r 4 r 4, wth λ a unversal constant dependng only on the dmenson, and beng smaller than 6 n the two dmensonal case we consder here. ote that the condton r h, 4K+1 mples that the denomnator of C 1 s postve. The value of C s also always postve. 3 Proof of Theorem 1 The proof s based on the contnuous analyss n [3], but two results must be adapted to the stuaton of only locally shape regular decompostons: we frst show n 3.1 how to construct the fne component, whch s a techncal extenson of the result [3, Theorem 4.6] for the case where subdoman szes and overlaps δ can strongly depend on the subdoman ndex. Second, we explan n 3. the constructon of the coarse component n the case of strongly varyng and δ between subdomans, whch s a non-trval generalzaton of [3, Lemma 5.7]. Wth these two new results, and the remanng estmates from [3], the proof can be completed. 3.1 Constructng the fne component We begn by establshng a stable decomposton when there s no coarse mesh.

5 on shape regular doman decomposton 5 Lemma 1. Let u be n 0 1Ω. Then, there exst u 1, u n 0 1Ω such that u = =1 u, and =1 u L Ω u L Ω + 8λ c ˆR δ l ˆR =1 R δ s snθ u L X U + 8λ c ˆR δ l 1 =1 R δ s u ˆR L snθ U, X where λ s the unversal constant of Theorem 1. We further have, for all η > 0, 1 hal , verson - 10 Feb 01 =1 u L Ω u L Ω + 8λ c ˆR δ l R = η + λ c ˆR δ l =1 R δ s r r 4 δ s 1 r η πλ c ˆR δ l =1 R δ s ˆR snθ X r ˆR snθ X u L U 4 r 4 u L U l u ˆR. snθ X Proof. We follow the proof of [3, Th. 4.6]. Let ρ be a C non-negatve functon whose support s ncluded n the closed unt ball of R and whose L 1 norm s 1. Let ρ ε x = ρx/ε/ε for all ε > 0. Let h be the characterstc functon of the set {x R,dstx,U < δ /}. Let φ = ρ δ / h. The functon φ s equal to 1 nsde U, vanshes outsde of {x R,dstx,U < δ }, and φ L R ρ L 1 R ;R, /δ. ere, ρ L 1 R ;R, means R =1 ρ dx. For n [1,], let ψ = φ 1 k=1 1 φ k. We have 0 ψ 1, ψ zero n Ω \Ω and ψ = 1 n Ω. Set u = ψ u. The functon u s n 1 0 Ω and u = u. Followng the proof of [3, Lemma 4.3], we get =1 ψ x C 1 =1 φ x. Therefore, for all x n Ω, =1 ψ x 8 c 1 ρ L 1 R ;R, =1 1 Ω \U x, where 1 O s the ndcator functon for the set O. Snce u L Ω u L Ω + Ω ux ψ x dx, we get =1 u L Ω u L Ω + 4λ c 1 =1 δ U 1 {dstx, U <δ l ux } dx,

6 6 Martn J. Gander, Laurence alpern, and Kévn Santugn Repquet wth λ := ρ L 1 R ;R,. Usng the W 1,1 R functon ρx = 1 x, we obtan the estmate λ = 6. To get 1, we apply Lemma 4.5 n [3] to each U, and to obtan, we apply Lemma 5.10 from the same reference. To obtan a stable decomposton wth a coarse component, we want to construct u 0 n P 1 T such that for all, l u 0 = l u. 3. Constructng the coarse component To construct u 0, we follow the deas of [3, 5.]. Frst, we defne a specal norm. Defnton 1. Let T be the coarse mesh of the doman Ω. Let B be the set of ndces of the nodes of T located on the boundary 4 Ω. Let B be the set of the ndces of the nodes that are neghbors to the nodes wth ndex n B. Let V be the set of pars of ndces of neghborng nodes n T whch are not on Ω. We defne hal , verson - 10 Feb 01 V,B : R R +, y, j V y y j + y. B When u s n P 1 T 1 0 Ω, set u V,B := ux 1 V,B, where the x are the nteror nodes of the mesh T. Lemma. For u n 0 1Ω, there exsts u 0 n P 1 T 0 1 Ω such that, for all n {1,...,}, l u 0 = l u and u 0 L Ω 1 tanθ mn 1 + max r K 5 h, 6π max d r + π 1 K K + 1max r max h, r. h, Proof. The results of [3, Lemmas 5.6,and 5.8] stand wthout modfcatons. Therefore u 0 exsts, and we have r h, u 0 L Ω max tanθ mn 1 K K + 1max r max h, r u V,B. h, ote that the condton r h, 4K+1 mples the second denomnator n the above equaton postve. It remans to compare u V,B and u L. We need to adapt the proof of [3, Ω Lemma 5.7]. We can suppose wthout any loss of generalty that u s n C Ω. Let, j n {1,...,} be ndces of neghborng nodes of T. Let d j = x x j, and d j = d j. We have for all, j V 4 Because of the homogenous Drchlet condton on the boundary Ω, the nodes whose ndces are n B are not assocated to a degree of freedom, therefore B and {1,...,} have empty ntersecton.

7 on shape regular doman decomposton 7 l u l j u = 1 π ux + r y ux j + r j ydy B0,1 1 1 u tx + r y + 1 tx j + r j y π x x j + r r j y dtdy B0,1 0 d j + r r j 1 u tx + r y + 1 tx j + r j y π dtdy B0,1 0 d j + r r j 1 uy 1 { y tx 1 tx j tr +1 tr j } π T, j tr + 1 tr j dtdy, where the tube T, j s the convex hull of Bx,r Bx j,r j. We get 0 hal , verson - 10 Feb 01 1 max y R 0 1 { y tx 1 tx j tr +1 tr j } tr + 1 tr j dt 1 = max s,s R 0 = max s [ r j,d j +r ] max s [ r j,d j +r ] 1 { s td j +s tr +1 tr j } 1 0 tr + 1 tr j 1 { s td j tr +1 tr j } tr + 1 tr j dt s+r j d j r r j s r j d j +r r j = max 1 s [ r j,d j +r ] r r j = max s [ r j,d j +r ] = dt 1 tr + 1 tr j dt [ 1 tr + 1 tr j d j r j + sr r j mnr,r j d j r r j. Snce d j h, 4maxr,r j, we have l u l j u ] s+r j d j r r j s r j d j +r r j 5d j 6π mnr,r j u L T j. 3 If s n the boundary set of the coarse mesh, then the node x s neghbor to a node x located on Ω. ote that les outsde of the range {1,...,}. Usng [3, Eqs 5.7 and 5.9], we get l u B B 4 x x πr T ux dx + Kπ u L Ω, 4 where T s the convex hull of Bx,r Bx,r. We sum nequalty 3 over all, j n the neghbor set and combne the resultng nequalty wth equaton 4. Snce

8 8 Martn J. Gander, Laurence alpern, and Kévn Santugn Repquet maxr,r j h, / mn h,, h, j /, no pont can belong to more than K tubes T, j or T. Therefore, u V,B K 5max d /r /6π + π u L. Ths concludes the proof. Ω To prove Theorem 1, we use Lemma to construct the coarse component u 0. We then apply Lemma 1 to u u 0 to get the fne components u. The terms n l u vansh. 4 Concluson hal , verson - 10 Feb 01 We have proved the exstence of a stable decomposton of the Sobolev space 1 0 Ω n the presence of a coarse mesh when the doman decomposton s only guaranteed to be locally shape regular. We provded an explct upper bound for the stable decomposton that depends nether on max /mn, nor on the number of subdomans. Ths would not have been possble wthout the explct upper bounds provded n [3]. Ths shows that dervng such explct upper bounds can be mportant for problems arsng naturally n applcatons, e.g., load balanced doman decompostons wth local refnement. References [1] Tony F. Chan and Tarek P. Mathew. Doman decomposton algorthms. In Acta umerca 1994, pages Cambrdge Unversty Press, [] Maksymlan Dryja and Olof B. Wdlund. An addtve varant of the Schwarz alternatng method for the case of many subregons. Techncal Report 339, also Ultracomputer ote 131, Department of Computer Scence, Courant Insttute, [3] Martn J. Gander, Laurence alpern, and Kévn Santugn-Repquet. Contnuous Analyss of the Addtve Schwarz Method: a Stable Decomposton n 1. Submtted, 011. URL hal /fr/. [4] Alfo Quarteron and Alberto Vall. Doman Decomposton Methods for Partal Dfferental Equatons. Oxford Scence Publcatons, [5] ermann A. Schwarz. Über enen Grenzübergang durch alternerendes Verfahren. Verteljahrsschrft der aturforschenden Gesellschaft n Zürch, 15: 7 86, May [6] Barry F. Smth, Petter E. Bjørstad, and Wllam Gropp. Doman Decomposton: Parallel Multlevel Methods for Ellptc Partal Dfferental Equatons. Cambrdge Unversty Press, [7] Andrea Tosell and Olof Wdlund. Doman Decomposton Methods - Algorthms and Theory, volume 34 of Sprnger Seres n Computatonal Mathematcs. Sprnger, 004. [8] Jnchao Xu. Iteratve methods by space decomposton and subspace correcton. SIAM Revew, 344: , December 199.

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

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

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

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

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

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

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

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

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

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

Additive Schwarz Method for DG Discretization of Anisotropic Elliptic Problems

Additive Schwarz Method for DG Discretization of Anisotropic Elliptic Problems 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

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

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

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

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

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

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Perron Vectors of an Irreducible Nonnegative Interval Matrix Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of

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

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

Geometry of Müntz Spaces

Geometry of Müntz Spaces WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.

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

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

Complete subgraphs in multipartite graphs

Complete subgraphs in multipartite graphs Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G

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

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

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

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

The Geometry of Logit and Probit

The Geometry of Logit and Probit The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.

More information

Geometric drawings of K n with few crossings

Geometric drawings of K n with few crossings Geometrc drawngs of K n wth few crossngs Bernardo M. Ábrego, Slva Fernández-Merchant Calforna State Unversty Northrdge {bernardo.abrego,slva.fernandez}@csun.edu ver 9 Abstract We gve a new upper bound

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

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

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

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

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

Lecture 4. Instructor: Haipeng Luo

Lecture 4. Instructor: Haipeng Luo Lecture 4 Instructor: Hapeng Luo In the followng lectures, we focus on the expert problem and study more adaptve algorthms. Although Hedge s proven to be worst-case optmal, one may wonder how well t would

More information

Dirichlet s Theorem In Arithmetic Progressions

Dirichlet s Theorem In Arithmetic Progressions Drchlet s Theorem In Arthmetc Progressons Parsa Kavkan Hang Wang The Unversty of Adelade February 26, 205 Abstract The am of ths paper s to ntroduce and prove Drchlet s theorem n arthmetc progressons,

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

Anti-van der Waerden numbers of 3-term arithmetic progressions.

Anti-van der Waerden numbers of 3-term arithmetic progressions. Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest

More information

Volume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].

Volume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2]. Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland

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

TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES

TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES SVANTE JANSON Abstract. We gve explct bounds for the tal probabltes for sums of ndependent geometrc or exponental varables, possbly wth dfferent

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

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

Supplement to Clustering with Statistical Error Control

Supplement to Clustering with Statistical Error Control Supplement to Clusterng wth Statstcal Error Control Mchael Vogt Unversty of Bonn Matthas Schmd Unversty of Bonn In ths supplement, we provde the proofs that are omtted n the paper. In partcular, we derve

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

Mathematical Preparations

Mathematical Preparations 1 Introducton Mathematcal Preparatons The theory of relatvty was developed to explan experments whch studed the propagaton of electromagnetc radaton n movng coordnate systems. Wthn expermental error the

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

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

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

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

Domain decomposition methods

Domain decomposition methods Doman decomposton methods Inspred by Martn J. Gander Laurence Halpern 13 mars 013 1 Block matrces 1.1 Generaltes Remember frst that two matrces A and B can be multpled f and only f the number of columns

More information

The Second Eigenvalue of Planar Graphs

The Second Eigenvalue of Planar Graphs Spectral Graph Theory Lecture 20 The Second Egenvalue of Planar Graphs Danel A. Spelman November 11, 2015 Dsclamer These notes are not necessarly an accurate representaton of what happened n class. The

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

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

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

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

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space. Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +

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

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

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

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

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

n ). This is tight for all admissible values of t, k and n. k t + + n t

n ). This is tight for all admissible values of t, k and n. k t + + n t MAXIMIZING THE NUMBER OF NONNEGATIVE SUBSETS NOGA ALON, HAROUT AYDINIAN, AND HAO HUANG Abstract. Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what

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

A proof of the dimension conjecture and of Jacobi's bound. François Ollivier (CNRS) LIX UMR CNRS École polytechnique

A proof of the dimension conjecture and of Jacobi's bound. François Ollivier (CNRS) LIX UMR CNRS École polytechnique A proof of the dmenson conjecture and of Jacob's bound Franços Ollver (CNRS) LIX UMR CNRS École polytechnque Jacob s bound Proposton. Let P 1,..., P n , a,j = ord xj P and = max σ S n Σ

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

On the correction of the h-index for career length

On the correction of the h-index for career length 1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat

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

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

7. Products and matrix elements

7. Products and matrix elements 7. Products and matrx elements 1 7. Products and matrx elements Based on the propertes of group representatons, a number of useful results can be derved. Consder a vector space V wth an nner product ψ

More information

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

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

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

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

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

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

Bezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0

Bezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0 Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the

More information

On the size of quotient of two subsets of positive integers.

On the size of quotient of two subsets of positive integers. arxv:1706.04101v1 [math.nt] 13 Jun 2017 On the sze of quotent of two subsets of postve ntegers. Yur Shtenkov Abstract We obtan non-trval lower bound for the set A/A, where A s a subset of the nterval [1,

More information

Lecture 3. Ax x i a i. i i

Lecture 3. Ax x i a i. i i 18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest

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

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

SCHWARZ ITERATIONS FOR SYMMETRIC POSITIVE SEMIDEFINITE PROBLEMS

SCHWARZ ITERATIONS FOR SYMMETRIC POSITIVE SEMIDEFINITE PROBLEMS SCHWARZ ITERATIONS FOR SYMMETRIC POSITIVE SEMIDEFINITE PROBLEMS REINHARD NABBEN AND DANIEL B. SZYLD Abstract. Convergence propertes of addtve and multplcatve Schwarz teratons for solvng lnear systems of

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

Bézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0

Bézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0 Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of

More information

On the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros

On the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros Appled Mathematcal Scences, Vol. 5, 2011, no. 75, 3693-3706 On the Interval Zoro Symmetrc Sngle-step Procedure for Smultaneous Fndng of Polynomal Zeros S. F. M. Rusl, M. Mons, M. A. Hassan and W. J. Leong

More information

Genericity of Critical Types

Genericity of Critical Types Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f

More information

arxiv: v1 [math.co] 1 Mar 2014

arxiv: v1 [math.co] 1 Mar 2014 Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest

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

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

Case Study of Markov Chains Ray-Knight Compactification

Case Study of Markov Chains Ray-Knight Compactification Internatonal Journal of Contemporary Mathematcal Scences Vol. 9, 24, no. 6, 753-76 HIKAI Ltd, www.m-har.com http://dx.do.org/.2988/cms.24.46 Case Study of Marov Chans ay-knght Compactfcaton HaXa Du and

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

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

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

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

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

Sharp integral inequalities involving high-order partial derivatives. Journal Of Inequalities And Applications, 2008, v. 2008, article no.

Sharp integral inequalities involving high-order partial derivatives. Journal Of Inequalities And Applications, 2008, v. 2008, article no. Ttle Sharp ntegral nequaltes nvolvng hgh-order partal dervatves Authors Zhao, CJ; Cheung, WS Ctaton Journal Of Inequaltes And Applcatons, 008, v. 008, artcle no. 5747 Issued Date 008 URL http://hdl.handle.net/07/569

More information

c 2006 Society for Industrial and Applied Mathematics

c 2006 Society for Industrial and Applied Mathematics SIAM J. MARIX ANAL. APPL. Vol. 29, No. 1, pp. 98 116 c 2006 Socety for Industral and Appled Mathematcs SCHWARZ IERAIONS FOR SYMMERIC POSIIVE SEMIDEFINIE PROBLEMS REINHARD NABBEN AND DANIEL B. SZYLD Abstract.

More information

arxiv: v1 [math.ho] 18 May 2008

arxiv: v1 [math.ho] 18 May 2008 Recurrence Formulas for Fbonacc Sums Adlson J. V. Brandão, João L. Martns 2 arxv:0805.2707v [math.ho] 8 May 2008 Abstract. In ths artcle we present a new recurrence formula for a fnte sum nvolvng the Fbonacc

More information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples

More information