Non shape regular domain decompositions: an analysis using a stable decomposition in H 1 0
|
|
- Gervase Pope
- 5 years ago
- Views:
Transcription
1 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 decomposton n the Sobolev space H 1 0 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 ndependant 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 [1987]. Even before the seres of nternatonal conferences on doman decomposton methods started, Dryja and Wdlund [1987] presented a varant of the classcal alternatng Schwarz method see Schwarz [1870], whch has the advantage of beng symmetrc for symmetrc problems, and t also contans a coarse space component. In a fully dscrete analyss, Dryja and Wdlund [1987] 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 as a functon of H δ, where H s the subdoman dameter, and δ s the overlap between subdomans. Martn Gander Unversté de Genève e-mal: Martn.Gander@unge.ch Laurence Halpern Unversté Pars 13 e-mal: halpern@math.unv-pars13.fr Kévn Santugn Repquet Insttut Mathmatques de Bordeaux, CNRS UMR551, MC, INRIA Bordeaux - Sud-Ouest e-mal: Kevn.Santugn@math.u-bordeaux1.fr 1
2 Martn Gander, Laurence Halpern, and Kévn Santugn Repquet 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 Smth et al. [1996], Quarteron and Vall [1999], Tosell and Wdlund [004], or the monographs Xu [199], Chan and Mathew [1994], 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 be consderably larger than the smallest subdoman. In such a doman decomposton, the rato H δ can be gven at least two dfferent meanngs: let H refer to the dameter of subdoman number and δ refer to the wdth of the overlap around subdoman number. Is the explct upper bound of the stable decomposton lnear n max H δ or s t only lnear n maxh mn δ? The latter estmate s much more pessmstc than the former when the subdomans are of wldly dfferent sze, and the general analyss based on a shape regular decomposton of the addtve Schwarz method does not permt to answer ths queston. In Gander et al. [011], we establshed the exstence of a stable decomposton n the contnuous settng wth an explct upper bound and a quanttatve defnton of shape regularty. The explct upper bound s also lnear n H δ, 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. Havng 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 H mn H. We provde an explct upper bound whch s lnear n max H /δ. To get ths result, only a few of the nequaltes establshed n Gander et al. [011] 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 Gander et al. [011]. 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. The U 1 N are a non overlappng doman decomposton of Ω,.e. N U = Ω. The U are bounded connected open sets of R and for all subdomans U the measure of U \ U s zero. We set H := damu.
3 Non shape regular doman decomposton 3 Two dstnct subdomans U and U j are sad to be neghbors f U U j. For each subdoman U, let δ > 0 be such that δ mn dstu j,u U j=, 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 δ s = mn j,u δ U j j and δ l = max j,u δ U j j. The doman decomposton has N c colors: there exsts a partton of N [1, N] nto N 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 Ω. Let θ mn be the mnmum of all angles of mesh T. No 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 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 h, as the mnmum of H 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 star-shaped wth respect to any pont n the ball Bx, r. We also suppose r H h, 4K+1 and r H h, /. For all, we set l = 1 πr Bx,r uxdx = 1 π B0,1 ux + r ydy. 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 now state our man result, the exstence of a stable decomposton of H 1 0 Ω whose upper bound s ndependant of maxh mn H. Theorem 1. For u n H 1 0 Ω, there exsts a stable decomposton u 0 N of u,.e. u = N =0 u, u 0 n P 1 T and u H 1 0 Ω such that
4 4 Martn Gander, Laurence Halpern, and Kévn Santugn Repquet u L Ω C u L Ω, where C = C C 1 C and max r H C 1 = h, K 5 6π max d r + π tan θ mn 1 K K + 1 max r H h, max r H h,, C = + 8λ N c max λ N c max max H r wth λ beng a unversal constant. ˆR δ l max R + 1 δ s max ˆR δ l max R δ s max H 4 r ˆR δ s sn θ X r δ s ˆR sn θ X 4 1 H r H4 r 4 Note that the condton r H h, 4K+1 ensures that 1 K K + 1 max r /H h, max r /H h, remans postve., 3 Proof of Theorem Constructng the fne component We begn by establshng a stable decomposton when there s no coarse mesh. Lemma 1. Let u be n H0 1 Ω. Then, there exst u 1 N, u n H0 1 Ω such that u = N u, and u L Ω u L Ω + N 8λ N c ˆR δl ˆR R δ s δ s sn θ u L U X N + 8λ N c ˆR δl 1 R δ s ˆR u L sn θ U, X where λ s a unversal constant that depends only on the dmenson. We further have, for all η > 0, δ s 1
5 Non shape regular doman decomposton 5 u L Ω u L Ω + 8λ N c η + λ 3 N c 1 H r + 1 N H 4 r N 1 + ˆR R δl δ s 1 + ˆR δl r R δ s ˆR sn θ X δ s 4 1 H r δ s ˆR δ s sn θ u L U X H4 r 4 u L U N η πλ N c ˆR δl H R δ s ˆR l u. sn θ X Proof. We follow the proof of [Gander et al., 011, 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 φ ρ L1 R /δ. For n N [1, N], 1 let ψ = φ k=1 1 φ k. We have 0 ψ 1, ψ zero n Ω\Ω and ψ = 1 n Ω. Set u = ψ u. The functon u s n H0 1 Ω and u = u. Followng the proof of [Gander et al., 011, Lemma 4.3], we get N ψ x N C 1 N φ x. Therefore, for all x n Ω, ψ x 8N c 1 ρ L 1 R 1 Ω\U x δ. Snce u L Ω u L Ω dx + Ω ux ψ x dx, we get u L Ω u L Ω dx+4λ N c 1 N U 1{dstx, U < δ wth λ := ρ L1 R. To get 1, we apply Lemma 4.5 n Gander et al. [011] 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. l} ux δ s dx,
6 6 Martn Gander, Laurence Halpern, and Kévn Santugn Repquet 3. Constructng the coarse component To construct u 0, we follow the deas of [Gander et al., 011, 5.]. Frst, we defne a specal norm. Defnton 1. Let T be the coarse mesh of doman Ω. Let V be the set of pars of neghborng nodes n T, and B be the set of boundary nodes 1 of T. We defne V,B : R N R +, y y j,j V y + y. B When u s n P 1 T H 1 0 Ω, set u V,B := ux 1 N V,B, where the x are the nteror nodes of the mesh T. Lemma. For u n H 1 0 Ω, there exsts u 0 n P 1 T H 1 0 Ω such that, for all n {1,..., N}, l u 0 = l u and u 0 L Ω 1 tan θ mn 1 + max r H h, K 5 6π max d r + π 1 K K + 1 max r H h, max r H h,. Proof. The results of [Gander et al., 011, Lemmas 5.6,and 5.8] stand wthout modfcatons. Therefore u 0 exsts, and we have u 0 L Ω max H h, tan θ mn 1 K K + 1 max r H h, max r H h, u V,B. Note that the condton r H h, 4K+1 ensures that 1 K K + 1 max r /H h, max r /H h, remans postve. It remans to compare u V,B and u L Ω. We need to adapt the proof of [Gander et al., 011, Lemma 5.7]. We can suppose wthout any loss of generalty that u s n C Ω. Let, j n {1,..., N} be ndces of neghborng nodes of T. Let d j = x x j, and d j = d j. We have for all, j V r 1 The nodes that are located on Ω are not numbered among {1,..., N}, and B contans only the nodes whch are neghbor to a node located on Ω.
7 Non shape regular doman decomposton 7 l u l j u = 1 π B0,1ux + r y ux j + r j ydy 1 π B0,1 d j + r r j π d j + r r j π 0 u tx + r y + 1 tx j + r j y x x j + r r j y dtdy B0,1 0 T,j uy u tx + r y + 1 tx j + r j y dtdy 0 1{ y tx 1 tx j tr + 1 tr j } tr + 1 tr j dtdy, where the tube T,j s the convex hull of Bx, r Bx j, r j. We get max y R 0 = max s,σ R = max = 1{ y tx 1 tx j tr + 1 tr j } tr + 1 tr j dt 0 s [ r j,d j+r ] max s [ r j,d j+r ] 1{ s td j + σ tr + 1 tr j } tr + 1 tr j dt 1{ s td j tr + 1 tr j } 0 tr + 1 tr j dt d j r j + sr r j mnr, r j d j r r j. Snce d j H h, 4 maxr, r j, l u l j u 5d j /6π mnr, r j u L T. j If s n the boundary set of the coarse mesh, then the node x s neghbor to a node x located on Ω. Note that les outsde of the range {1,..., N}. Usng [Gander et al., 011, Eqs 5.7 and 5.9], we get l u B B 4 x x πr T ux dx + Kπ u L Ω, 3 where T s the convex hull of Bx, r Bx, r. We sum l u l j u 5d j /6π mnr, r j u L T j over all, j n the neghbor set and combne t wth equaton 3. Snce maxr, r j H h, / mnh h,, H h,j /, no pont can belong to more than K tubes T,j or T. Therefore u V,B K 5 max 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.
8 8 Martn Gander, Laurence Halpern, and Kévn Santugn Repquet Concluson We have proven the exstence of a stable decomposton of the Sobolev space H 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 H / mn H, nor on the number of subdomans. Establshng the exstence of a stable decomposton wth a unform upper bound that does not explode when max H / mn H does would not have been possble wthout the explct upper bounds provded n Gander et al. [011]. Ths shows that dervng such explct upper bounds can be mportant for problems arsng naturally n applcatons,.e. load balanced doman decompostons wth local refnement. References Tony F. Chan and Tarek P. Mathew. Doman decomposton algorthms. In Acta Numerca 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 Note 131, Department of Computer Scence, Courant Insttute, Martn Gander, Laurence Halpern, and Kévn Santugn-Repquet. Contnuous Analyss of the Addtve Schwarz Method: a Stable Decomposton n H 1. Submtted, 011. URL hal /fr/. Alfo Quarteron and Alberto Vall. Doman Decomposton Methods for Partal Dfferental Equatons. Oxford Scence Publcatons, H. A. Schwarz. Über enen Grenzübergang durch alternerendes Verfahren. Verteljahrsschrft der Naturforschenden Gesellschaft n Zürch, 15:7 86, May Barry F. Smth, Petter E. Bjørstad, and Wllam Gropp. Doman Decomposton: Parallel Multlevel Methods for Ellptc Partal Dfferental Equatons. Cambrdge Unversty Press, Andrea Tosell and Olof Wdlund. Doman Decomposton Methods - Algorthms and Theory, volume 34 of Sprnger Seres n Computatonal Mathematcs. Sprnger, 004. 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
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 informationNonlinear 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 informationUsing 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 informationMaximizing 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 informationDeriving 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 informationAPPENDIX 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 informationNumerical 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 informationRESTRICTED 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 informationAdditive 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 informationREAL 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 informationn α 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 informationSUCCESSIVE 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 informationSTEINHAUS 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 informationThe 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 informationModule 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 informationMore 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 informationRobust 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 informationNP-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 informationThe 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 informationGeometry 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 informationThe 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 informationProblem 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 informationReport 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 informationA 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 informationCase 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 informationGlobal 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 informationNUMERICAL 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 informationA 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 information7. 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 informationDomain 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 informationDirichlet 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 informationPerron 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 informationNeryškioji dichotominių testo klausimų ir socialinių rodiklių diferencijavimo savybių klasifikacija
Neryškoj dchotomnų testo klausmų r socalnų rodklų dferencjavmo savybų klasfkacja Aleksandras KRYLOVAS, Natalja KOSAREVA, Julja KARALIŪNAITĖ Technologcal and Economc Development of Economy Receved 9 May
More informationAnti-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 informationAppendix 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 informationYong 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 informationUniqueness 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 informationAsymptotics 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 informationNumerical Solution of Ordinary Differential Equations
Numercal Methods (CENG 00) CHAPTER-VI Numercal Soluton of Ordnar Dfferental Equatons 6 Introducton Dfferental equatons are equatons composed of an unknown functon and ts dervatves The followng are examples
More informationSpectral 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 informationBé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 informationLinear, 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 informationBezier 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 informationGroup 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 informationRelaxation Methods for Iterative Solution to Linear Systems of Equations
Relaxaton Methods for Iteratve Soluton to Lnear Systems of Equatons Gerald Recktenwald Portland State Unversty Mechancal Engneerng Department gerry@pdx.edu Overvew Techncal topcs Basc Concepts Statonary
More informationON 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 informationStanford 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 informationOverlapping 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 informationVector 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 informationSupplement 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 informationGeometric 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 informationA 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 informationComplete 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 informationAffine 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 informationTAIL 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 informationOn 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 informationThe Quadratic Trigonometric Bézier Curve with Single Shape Parameter
J. Basc. Appl. Sc. Res., (3541-546, 01 01, TextRoad Publcaton ISSN 090-4304 Journal of Basc and Appled Scentfc Research www.textroad.com The Quadratc Trgonometrc Bézer Curve wth Sngle Shape Parameter Uzma
More information2.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 informationThe 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 informationVolume 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 informationSharp 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 informationConvexity 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 informationSCHWARZ 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 informationALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul LIX, 013, f.1 DOI: 10.478/v10157-01-00-y ALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION BY ION
More informationThe 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 informationChapter 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 informationErrors 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 informationPolynomial 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 informationLecture 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 information10-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 informationExistence results for a fourth order multipoint boundary value problem at resonance
Avalable onlne at www.scencedrect.com ScenceDrect Journal of the Ngeran Mathematcal Socety xx (xxxx) xxx xxx www.elsever.com/locate/jnnms Exstence results for a fourth order multpont boundary value problem
More informationAn efficient algorithm for multivariate Maclaurin Newton transformation
Annales UMCS Informatca AI VIII, 2 2008) 5 14 DOI: 10.2478/v10065-008-0020-6 An effcent algorthm for multvarate Maclaurn Newton transformaton Joanna Kapusta Insttute of Mathematcs and Computer Scence,
More informationExercise 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 informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationFinding 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 informationFACTORIZATION 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 informationLecture 5.8 Flux Vector Splitting
Lecture 5.8 Flux Vector Splttng 1 Flux Vector Splttng The vector E n (5.7.) can be rewrtten as E = AU (5.8.1) (wth A as gven n (5.7.4) or (5.7.6) ) whenever, the equaton of state s of the separable form
More informationA 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 informationThe 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 informationn ). 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 informationNew 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 informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More informationHongyi 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 informationFirst 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 informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationc 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 informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationChapter 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 informationTR 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 informationMAT 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 informationA 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 informationBOUNDEDNESS 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 informationLecture 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 informationLecture 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 informationOn the symmetric character of the thermal conductivity tensor
On the symmetrc character of the thermal conductvty tensor Al R. Hadjesfandar Department of Mechancal and Aerospace Engneerng Unversty at Buffalo, State Unversty of New York Buffalo, NY 146 USA ah@buffalo.edu
More informationIntroduction. - The Second Lyapunov Method. - The First Lyapunov Method
Stablty Analyss A. Khak Sedgh Control Systems Group Faculty of Electrcal and Computer Engneerng K. N. Toos Unversty of Technology February 2009 1 Introducton Stablty s the most promnent characterstc of
More informationAppendix 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 informationTHE 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 informationarxiv: 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