Robust Norm Equivalencies and Preconditioning
|
|
- Howard Leonard
- 6 years ago
- Views:
Transcription
1 Robust Norm Equvalences and Precondtonng Karl Scherer Insttut für Angewandte Mathematk, Unversty of Bonn, Wegelerstr. 6, Bonn, Germany Summary. In ths contrbuton we report on work done n contnuaton of [1, 2] where addtve multlevel methods for the constructon of precondtoners for the stffness matrx of the Rtz- Galerkn procedure were consdered wth emphass on the model problem ω u = f wth a scalar weght ω. We present an new approach leadng to a precondtoner based on a modfcaton of the constructon n [4] usng weghted scalar products thereby mprovng that one n [2]. Further we prove an upper bound n the underlyng norm equvalences whch s up to a fxed level completely ndependent of the weght ω, whereas the lower bound nvolves an assumpton about the local varaton the coeffcent functon whch s stll weaker than n [1]. More detals wll be presented n a forthcomng paper. 1 Prelmnares 1.1 Rtz -Galerkn-Method Let Ω be a bounded doman n R 2 and H0(Ω) 1 = Y be the Hlbert space defned as the closure of C0 (Ω) wth respect to the usual Sobolev norm. Further let A be an ellptc operator defned on H0(Ω) 1 wth an assocated coercve and symmetrc blnear form a(u, v). The Lax-Mlgram Theorem guarantees then a unque soluton u Y of a(u, v) = (f, v) := f v dx, v Y, for any f L 2(Ω). Defne the Rtz -Galerkn approxmaton u h V h Y by a(u h, v) = (f, v), v V h. If ψ 1,, ψ N s a bass of V h, u h s obtaned by the equatons: N N α a(ψ, ψ k ) = (f, ψ k ), 1 k N, u h := α ψ. =1 These equatons are solved teratvely n the form Ω =1
2 374 K. Scherer u (ν+1) = u (ν) ω Cr (ν), ν = 0, 1, 2, (1) ( ) where r (ν) := Au (ν) b wth stffness matrx A A ψ := a(ψ, ψ k ) and b := {(f, ψ k )}. Further ω denotes a relaxaton factor and C a precondtoner matrx. The goal s to acheve κ(ca) κ(a) or at least of order O(1) ndependent of N. A basc fact s: If C s the matrx assocated to operator C : V V satsfyng γ (u, C 1 u) a(u, u) Γ (u, C 1 u), u V, (2) then κ(ca) Γ/γ. Thus C can be taken as a dscrete analogue of C or an approxmatve nverse of B = C 1. In the theory of Addtve Mult-level-Methods an approach to construct the blnear form wth assocated B s to assume a herarchcal sequence of subspaces V 0 V 1 V J := V h Y X := L 2(Ω), (3) and construct bounded lnear projectons Q j : V V j wth β 0 a(u, u) d 2 j Q ju Q j 1u 2 X β 1 a(u, u), (4) wth Q 0u := 0 and sutable coeffcents {d j}. β 0, β 1 are constants not dependng on the d j, u V h or J. Then defne the postve defnte operator B = C 1 by (u, B u) := d 2 j Q ju Q j 1u 2 X, u V. (5) j=1,k 2 A Dffuson Problem as a Model Problem 2.1 Spectral Equvalences Let T 0 be an ntal coarse trangulaton of a regon Ω R 2. Regular refnement of trangles leads to trangulatons T 0 T 1 T J = T. Each trangle n T k s geometrcally smlar to a trangle of T 0. We defne then the {V j} J j=1 n (3) as spaces of pecewse lnear functons wth respect to these trangulatons. Also ts elements have to satsfy Drchlet boundary condtons. In partcular there exsts a nodal bass ψ (j) k for V j = span{ψ k }. In the followng we consder the model problem a(u, v) := ω ( u, v) (6) Ω whch correspond s to the dfferental operator A = ω. Observe that n case u, v V j, j = 0, 1,, J the blnear form a(u, v) reduces n vew of v = const. on T T j to
3 wth average weghts Robust Norm Equvalences and Precondtonng 375 a(u, v) = a j(u, v) := ( u, v) (7) := 1 µ(t) Ths leads to weghted norms v 2 j,ω := T ωdx, µ(t) = area of T. T T v 2, v ω := v J,ω. (8) Instead of the usual orthogonal projectons Q j : V V j we defne now n contrast to [1] operators Q ω j : V V j wth level-dependng weghts by and A ω j : V j V j for u V j by (Q ω j u, v) j,ω = (u, v), v V j (9) (A ω j u, v) j,ω = a(u, v), v V j. (10) Then the followng modfcaton of a well-known result n the theory of multlevel methods (cf. surveys [3, 5] of J. Xu and H. Yserentant) can be proved. Theorem 1. Suppose that there exsts a decomposton u = J u k for u V wth u k V k and postve defnte operators B ω k : V k V k satsfyng (Bk ω u k, u k ) k,ω K 1 a(u, u), (11) then C ω := J (Bω k ) 1 Q ω k satsfes λ mn (C ω A) 1/K 1. If the operators B ω k further satsfy a( w k, w l ) K 2 l=0 (Bk ω w k, w k ) k,ω, w k := (Bk ω ) 1 Q ω kau (12) then λ max (C ω A) K 2,.e. the operator C ω s spectrally equvalent to A. The proof wll be gven n a forthcomng paper by M. Grebel and M.A. Schwetzer. For the dffuson problem (6) we can choose the operator Bk ω B k u k := 4 k u k for u k V k, hence now smply as C u := 4 k Q ω ku. (13) Ths has several advantages over the approach n [1] whch uses drect norm equvalences lke n (4). For spectral equvalence of C wth A one needs to prove the upper nequalty (11) n the form
4 376 K. Scherer 4 k (u k, u k ) k,ω K 1 a(u, u), (14) only for some decomposton u = J u k. However (12) has to be verfed n the form a( w k, w l ) K 2 4 k (w k, w k ) k,ω, (15) l=0 for any decomposton v = J w k, w k V k. These weghted Jackson- and Bernsten nequaltes wll be verfed n the next sectons n a robust form,.e. the constants depend only weakly from the dffuson coeffcent ω. Another advantage of the above theorem s that (13) leads to a practcal form for the precondtonng matrx C n (1), namely one shows that the operator C above s spectrally equvalent to the operator C := 4 k Mk ω, Mk ω v := N k (k) (v, ψ (1, ψ (k) ) ψ (k) ) k,ω where {ψ (k) } N k =1 denotes the nodal bass of V k for k 1. Thus the operators Mk ω u replace the operators Q ω k defned as n (9). The reason for ths s that one can show (up to an absolute constant) (Q ω ku, u) N k (k) (u, ψ ) 2 ( = u, (1, ψ (k) ) k,ω (k) (u, ψ N k (1, ψ (k) )ψ (k) ) k,ω ) = (Mk ω u, u). Detals as well as the realzaton of ths condtoner n optmal complexty wll be presented n the forthcomng paper by M. Grebel and M.A. Schwetzer. We remark that t can be modfed stll further to obtan a precondtoner Ĉu := N k (k) (u, ψ ) a(ψ (k), ψ (k) ) ψ(k). 2.2 A Weghted Bernsten-Type Inequalty Accordng to (15) we consder here arbtrary decompostons u = w k, w k V k (16) of an element u V J. In the followng we employ the a orthogonal operators Q a j : V J V j defned by a(q a ju, v) = a(u, v), u V J, v V j, so that the elements v j := Q a ju Q a j 1u, v 0 := Q a 0u satsfy
5 Robust Norm Equvalences and Precondtonng 377 u = v j, a(v k, v j) = δ j,k, a(u, u) = =0 a(v j, v j). (17) =0 We ntroduce then the followng assumpton on the weght ω : there exsts a constant C ω ndependent of j and a number ρ < 2 such that for all T T j sup{ω U/ : U T k, U T } C ω ρ k j, j k. (18) Lemma 1. Under the above assumpton on the weght ω there holds the hybrd Bernsten type nequalty v j a 6 6 C 1 C2C ω (2/ρ) j/2 (2ρ) k/2 w k k,ω (19) where C 1 := max T T0 dam(t) max T T0 µ(t), and C 2 := max T T0 dam(t)/ µ(t) are constants whch depend on the ntal trangulaton T 0 only. k=j Proof. In vew of the representaton u = j 1 w k we have by (17) a(v j, v j) = a(v j, u) = a(v j, w k ). (20) By ntegraton by parts we obtan, keepng n mnd that w k, v j are constant on U T k and T T j, respectvely, a(v j, w k ) = = U T k ω U U T U ω U ( v j, w k ) = k=j U T k ω U w k ( v j, n ) = w k ( v j, n ) ω U w k ( v j, n ), where S k (T) denotes the boundary strp along T consstng of trangles U T k, U T. Applyng the Cauchy-Schwarz nequalty gves ( a(v j, w k ) ω U w k 2) 1/2 ( ω U v j 2) 1/2. Concernng the frst double sum we note that w k 2 dam(u)[b b b 2 3] 12 C 2C 1 2 k where we have used dam(u) C 2C 1 2 k µ(u) and the formula w k 2 = µ(u) 12 [b2 1 + b b (b 1 + b 2 + b 3) 2 ] U U w k 2, for lnear functons v on U wth vertces b 1, b 2, and b 3. It follows that (21)
6 378 K. Scherer w k 2 T U S k (T) w k 2 12C 2C 1 2 k w k 2 k,ω. (22) For the second factor n (21) note that by assumpton (19) and by the fact that µ(s k (T))/µ(T) 6 2 j k (cf. [5]) ω U v j 2 C ω ρ k j v j 2 3C 12 k C ω ρ k j 18C 12 k C ω (ρ/2) k j Insertng ths and (22) nto (21) nequalty (19) follows by (20). T U v j 2 v j 2 Wth the help of ths lemma the Bernsten-type nequalty (15) can be establshed. It mproves the correspondng ones n [1, 2] n that assumpton (18) s weaker and at the same tme more smple than those made there. Theorem 2. Consder a sequence of unformly refned trangulatons T j and the respectve sequence of nested spaces V j of lnear fnte elements. Then, under assumpton (18) on the weght ω wth ρ < 2 n (6) there holds the upper bound for w j gven n (16). a(u, u) 432C 2 1C 2C ω 2 ( 2 ρ) 2 Proof. By summng the estmate (18) accordng to (17) we get a(u, u) = 2 2j w j 2 j,ω (23) v j 2 a 216C1 2 C 2C ω (2/ρ) j( ) 2 (2ρ) k/2 w k k,ω. (24) From ths an upper bound for a(u, u) follows by applcaton of a Hardy nequalty to the latter double sum. If quanttes s j, c j are defned by s j := k=j a k, s 1 := 0, c j := wth a k 0 and b > 1 such an nequalty reads ( b j s 2 j k=j j b l, c J+1 := 0 l=0 ) 1/2 b b 1 ( b j a 2 j) 1/2. Applcaton of ths wth a k := (2ρ) k/2 w k k,ω and b = 2/ρ to yelds (2/ρ) j( ) 2 (2ρ) k/2 2 w k k,ω ( 2 ρ) 2 k=j and after nserton nto (24) the bound (23) for a(u, u). 2 2j w j 2 j,ω
7 2.3 A Weghted Jackson-Type Inequalty Robust Norm Equvalences and Precondtonng 379 The goal here s to establsh nequalty (11),.e. to prove 4 k v k k,ω K 1 a(u, u), u V J. (25) By Theorem 2.1 we can employ a partcular decomposton of u. We choose u = v k, v k := Q a ju Q a j 1u as n (17). (26) The basc dea s as n [1] to prove a local estmate for v j j,ω on subdomans U Ω by modfyng the dualty technque of Aubn-Ntsche. The followng result gves an estmate whch mproves the correspondng one n [1] n that the constant does not depend on the weght ω. Lemma 2. Let U = supp ψ (j 1) l be the support of a nodal functon n V j 1. There holds ) v j j,ω,u dam(u) ( v j j,ω,u + 18C R v j j,ω,u, (27) where C R s an absolute constant. Proof: We gve only a rough dea of t. For trangles S T j wth T U consder the Drchlet problems φ S = v j on S, φ S S = ψ (j 1) l S. Then v j 2 = v j φ S on U. Partal ntegraton on each S U gves v j 2 j,ω,u = ω S S, v j) S U S( φ ω S v j( φ S, n S ) S U S. The rest of the proof conssts n a careful estmate of both terms on the rght hand sde. Concernng detals we refer agan to the forthcomng paper wth by M. Grebel and M.A. Schwetzer. We menton only that the constant C R above arses from the well-known regularty result φ S 2,2,S C R v j 2 0,S. Now by the assumpton made on the trangulatons there holds dam(u) C 02 j wth a constant C 0 dependng only on the ntal trangulaton. Then choose j 0 as the smallest nteger wth 2 j 0 = 27 3C RC 0 and the second term on the rght hand sde n (27) s (2/3) v j j,ω,u for all j j 0. If we nsert ths, square and multply the resultng nequalty wth the factor 4 j, the summaton wth respect to U and j j 0 yelds
8 380 K. Scherer Theorem 3. There holds the Jackson-type nequalty j=j 0 4 j v j 2 j,ω 9C 2 0 a(v j, v j) U 9C0 2 j=j 0 U j=j 0 a(v j, v j) (28) for j 0 = log 2 (27 3C RC 0). If one solves at frst the Rtz-Galerkn equatons up to level j 0 1 the precondtonng to the levels j j 0 would be robust under condton (18) on the weght ω. Another possblty would be to establsh a bound of the remanng sum on the left hand sde up to level j 0 1. Here one has to use a dfferent argument at the expense of a dependence of the correspondng constant on ω. However one can acheve ths under a condton whch s weaker than (18). Corollary 1. Under the condton (18) on the weght ω the dscretzed verson of the operator C n (13) yelds a robust precondtonng n (1) for the dffuson problem. 3 Concludng Remarks The results represented here are concerned wth the classcal addtve mult-level method for solvng Rtz-Galerkn equatons wth pecewse lnear elements by precondtonng. The proofs gven or ndcated here for the necessary norm equvalences smplfy and mprove those n [1]. They show that for the dffuson problem a smple modfcaton (13) of the classcal precondtoner makes t robust for a large class of dffuson coeffcents ω. It covers all pecewse constant functons ndependent of the locaton of jumps, ther number or ther frequency. In partcular we do not requre the jumps to be algned wth the mesh on any level,.e. no mesh must resolve the jumps. However the constants n the Jackson- and Bernsten type nequaltes nvolve the heght of the maxmal jump. If we assume that m ω := mn x Ω ω(x) = 1, M ω := max x Ω ω(x) = ǫ 1 a bound for the constant C ω n assumpton (13) s gven by ǫ 1. For most practcal purposes t s therefore necessary to assume that M ω s not too bg. By the form of (13) one sees that even sngulartes of maxmal heght ρ J and exponental growth lmted by ρ are admssble. References [1] M. Grebel, K. Scherer, and M.A. Schwetzer. Robust norm-equvalences for dffuson problems. Math. Comp., 76: , [2] K. Scherer. Weghted norm-equvalences for precondtonng. In Doman Decomposton Methods n Scence and Engneerng, volume 40 of Lect. Notes Comput. Sc. Eng., pages Sprnger, Berln, [3] J. Xu. Iteratve methods by space decomposton and subspace correcton. SIAM Rev., 34(4): , [4] H. Yserentant. Two precondtoners based on the mult-level splttng of fnte element spaces. Numer. Math., 58(2): , [5] H. Yserentant. Old and new convergence proofs for multgrd methods. In Acta Numerca, 1993, pages Cambrdge Unv. Press, Cambrdge, 1993.
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 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 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 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 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 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 informationLectures - 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 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 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 informationCME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13
CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 13 GENE H GOLUB 1 Iteratve Methods Very large problems (naturally sparse, from applcatons): teratve methods Structured matrces (even sometmes dense,
More 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 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 informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More 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 informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More 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 information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
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 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 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 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 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 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 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 informationPerfect 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 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 informationIsogeometric Analysis with Geometrically Continuous Functions on Multi-Patch Geometries. Mario Kapl, Florian Buchegger, Michel Bercovier, Bert Jüttler
Isogeometrc Analyss wth Geometrcally Contnuous Functons on Mult-Patch Geometres Maro Kapl Floran Buchegger Mchel Bercover Bert Jüttler G+S Report No 35 August 05 Isogeometrc Analyss wth Geometrcally Contnuous
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 informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More 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 information3.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 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 informationHigh resolution entropy stable scheme for shallow water equations
Internatonal Symposum on Computers & Informatcs (ISCI 05) Hgh resoluton entropy stable scheme for shallow water equatons Xaohan Cheng,a, Yufeng Ne,b, Department of Appled Mathematcs, Northwestern Polytechncal
More informationCSCE 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 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 informationLecture 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 informationMatrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD
Matrx Approxmaton va Samplng, Subspace Embeddng Lecturer: Anup Rao Scrbe: Rashth Sharma, Peng Zhang 0/01/016 1 Solvng Lnear Systems Usng SVD Two applcatons of SVD have been covered so far. Today we loo
More information3 Basic boundary value problems for analytic function in the upper half plane
3 Basc boundary value problems for analytc functon n the upper half plane 3. Posson representaton formulas for the half plane Let f be an analytc functon of z throughout the half plane Imz > 0, contnuous
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 informationMATH 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 informationRandom Walks on Digraphs
Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected
More information5 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 informationNon 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 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 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 informationThe Finite Element Method
The Fnte Element Method GENERAL INTRODUCTION Read: Chapters 1 and 2 CONTENTS Engneerng and analyss Smulaton of a physcal process Examples mathematcal model development Approxmate solutons and methods of
More informationU.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 informationLecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES
COMPUTATIONAL FLUID DYNAMICS: FDM: Appromaton of Second Order Dervatves Lecture APPROXIMATION OF SECOMD ORDER DERIVATIVES. APPROXIMATION OF SECOND ORDER DERIVATIVES Second order dervatves appear n dffusve
More informationAnother converse of Jensen s inequality
Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationNon 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 informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
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 informationCombined Wronskian solutions to the 2D Toda molecule equation
Combned Wronskan solutons to the 2D Toda molecule equaton Wen-Xu Ma Department of Mathematcs and Statstcs, Unversty of South Florda, Tampa, FL 33620-5700, USA Abstract By combnng two peces of b-drectonal
More informationGELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n
GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n KANG LU FINITE DIMENSIONAL REPRESENTATIONS OF gl n Let e j,, j =,, n denote the standard bass of the general lnear Le algebra gl n over the feld of
More informationON THE BURGERS EQUATION WITH A STOCHASTIC STEPPING STONE NOISY TERM
O THE BURGERS EQUATIO WITH A STOCHASTIC STEPPIG STOE OISY TERM Eaterna T. Kolovsa Comuncacón Técnca o I-2-14/11-7-22 PE/CIMAT On the Burgers Equaton wth a stochastc steppng-stone nosy term Eaterna T. Kolovsa
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationEstimation: Part 2. Chapter GREG estimation
Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationLinear Algebra and its Applications
Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler
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 informationIn this section is given an overview of the common elasticity models.
Secton 4.1 4.1 Elastc Solds In ths secton s gven an overvew of the common elastcty models. 4.1.1 The Lnear Elastc Sold The classcal Lnear Elastc model, or Hooean model, has the followng lnear relatonshp
More informationLocal Mesh Refinement for the Discretisation of Neumann Boundary Control Problems on Polyhedra
Local Mesh Refnement for the Dscretsaton of Neumann Boundary Control Problems on Polyhedra homas Apel Johannes Pfefferer Max Wnkler October 20, 2014 Abstract hs paper deals wth optmal control problems
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 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 informationCOMPUTATIONAL METHODS AND ALGORITHMS Vol. II - Finite Element Method - Jacques-Hervé SAIAC
COMPUTATIONAL METHODS AND ALGORITHMS Vol. II - Fnte Element Method - Jacques-Hervé SAIAC FINITE ELEMENT METHOD Jacques-Hervé SAIAC Départment de Mathématques, Conservatore Natonal des Arts et Méters, Pars,
More 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 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 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 informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationNorms, Condition Numbers, Eigenvalues and Eigenvectors
Norms, Condton Numbers, Egenvalues and Egenvectors 1 Norms A norm s a measure of the sze of a matrx or a vector For vectors the common norms are: N a 2 = ( x 2 1/2 the Eucldean Norm (1a b 1 = =1 N x (1b
More informationNON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS
IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc
More informationChapter 7 Generalized and Weighted Least Squares Estimation. In this method, the deviation between the observed and expected values of
Chapter 7 Generalzed and Weghted Least Squares Estmaton The usual lnear regresson model assumes that all the random error components are dentcally and ndependently dstrbuted wth constant varance. When
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 informationPreconditioning techniques in Chebyshev collocation method for elliptic equations
Precondtonng technques n Chebyshev collocaton method for ellptc equatons Zh-We Fang Je Shen Ha-We Sun (n memory of late Professor Benyu Guo Abstract When one approxmates ellptc equatons by the spectral
More informationDiscrete Mathematics. Laplacian spectral characterization of some graphs obtained by product operation
Dscrete Mathematcs 31 (01) 1591 1595 Contents lsts avalable at ScVerse ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc Laplacan spectral characterzaton of some graphs obtaned
More informationExplct Extenson Operators on Herarchcal Grds G. Haase y S.V. Nepomnyaschh z Abstract Extenson operators extend functons dened on the boundary of a dom
JOHANNES KEPLER UNIVERSIT AT LINZ Explct Extenson Operators on Herarchcal Grds Gundolf Haase Department of Mathematcs Johannes Kepler Unversty, A{44 Lnz, Austra Sergej V. Nepomnyaschh omputng enter Sberan
More informationTime-Varying Systems and Computations Lecture 6
Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy
More informationTHE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS
Dscussones Mathematcae Graph Theory 27 (2007) 401 407 THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS Guantao Chen Department of Mathematcs and Statstcs Georga State Unversty,
More informationAn Introduction to Morita Theory
An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory
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 EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction
ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES TAKASHI ITOH AND MASARU NAGISA Abstract We descrbe the Haagerup tensor product l h l and the extended Haagerup tensor product l eh l n terms of
More informationConstruction of Serendipity Shape Functions by Geometrical Probability
J. Basc. Appl. Sc. Res., ()56-56, 0 0, TextRoad Publcaton ISS 00-0 Journal of Basc and Appled Scentfc Research www.textroad.com Constructon of Serendpty Shape Functons by Geometrcal Probablty Kamal Al-Dawoud
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationAn Inequality for the trace of matrix products, using absolute values
arxv:1106.6189v2 [math-ph] 1 Sep 2011 An Inequalty for the trace of matrx products, usng absolute values Bernhard Baumgartner 1 Fakultät für Physk, Unverstät Wen Boltzmanngasse 5, A-1090 Venna, Austra
More information14 The Postulates of Quantum mechanics
14 The Postulates of Quantum mechancs Postulate 1: The state of a system s descrbed completely n terms of a state vector Ψ(r, t), whch s quadratcally ntegrable. Postulate 2: To every physcally observable
More informationRepresentation theory and quantum mechanics tutorial Representation theory and quantum conservation laws
Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More 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 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 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 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 informationTHE 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 informationSome basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C
Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +
More informationMATH 5630: Discrete Time-Space Model Hung Phan, UMass Lowell March 1, 2018
MATH 5630: Dscrete Tme-Space Model Hung Phan, UMass Lowell March, 08 Newton s Law of Coolng Consder the coolng of a well strred coffee so that the temperature does not depend on space Newton s law of collng
More information