Convergence of The Multigrid Method With A Wavelet. Abstract. This new coarse grid operator is constructed using the wavelet
|
|
- Darren Goodwin
- 6 years ago
- Views:
Transcription
1 Convergence of The Multigrid Method With A Wavelet Coarse Grid Operator Bjorn Engquist Erding Luo y Abstract The convergence of the two-level multigrid method with a new coarse grid operator is studied. This new coarse grid operator is constructed using the wavelet transformation. For partial dierential equations with highly oscillatory coecients for which the homogenization theory is applicable, this operator is considered as being close to the corresponding homogenized operator. Under some regularity assumptions between the approximation spaces, a convergence of the method is established. The convergence rate is independent of the grid step size. Furthermore, we show that the convergence rate in general is larger than that of the two-level multigrid method with Garlerkin coarse grid operator. 1 Introduction For regular elliptic equations it is well known that the multigrid method is practically very ecient. There is a number of papers dealing with the theoretical issue of convergence with Garlerkin coarse grid operator. However, most of these papers focus on the nite element methods. Restricting to the variational form, Garlerkin form is a natural built-in construction under these methods. With the regularity assumption of the partial dierential equations, some convergence proofs are established, [, 7, 8, 9]. The nite element method induces a nested set of smooth function subspaces. The \Aubin-Nitsch" trick has been commonly used in these proofs. The multigrid method generated from nite dierence method no longer induces a nested set of smooth subspaces where similar regularity estimate Department of Mathematics, University of California at Los Angeles, LA, CA9004. Research supported by ARPA/ONR N J-1890 and NSF DMS y IMA, University of Minnesota, Mpls, MN Research supported by NSF through IMA. 1
2 can still be established. Discussions on this issue can be found in [8, 10]. For the convergence proof of the multigrid method, the regularity of the partial dierential equation is always needed. For the elliptic dierential equation with highly oscillatory coecients, standard multigrid method is not ecient. Using nite element method with smooth base functions, the convergence proof for the multigrid method in [7] does not require any regularity of the partial dierential operator. However, since the nite element method is used there, a nested set of smooth function subspaces are built in. Within such nice subspaces, one obtains easily an approximate solution, but such an approximation could be far away from the true solution of the oscillatory coecient problem, [1]. For the class of partial dierential equations with highly oscillatory coecients, for which the homogenization theory is applicable, in order to maintain a fast convergence rate for the multigrid method, a new coarse grid operator based on the corresponding homogenized operator is introduced in [3, 4, 5, 6] using nite dierence method. This operator has come to be called homogenized coarse grid operator. Since the dierence between the oscillatory solution and the homogenized solution is only of rst order of the grid step size, a large number of smoothing iteration (which depends on the grid step size) is needed to guarantee the multigrid method to converge in l-norm. The dierence of the rst derivative between both is of a constant order in general, and the use of energy norm is impossible to build a similar "approximate property". In this paper we study the convergence of the two-level multigrid method by constructing a new coarse grid operator. This operator arises from the wavelet transformation and we call it here the wavelet operator. As already discussed in [3, 4, 5, 6] for the class of partial dierential equations, this operator is assumed to approximate to the corresponding homogenized operator. It's therefore natural for us to try this operator instead of the homogenized operator directly in the multigrid method. An interesting property about this operator is that it can be explicitly written as a combination of the original operator and the operators between the grid transformation. Therefore, the use of projection theory is possible to analyze the convergence of the multigrid method with the wavelet coarse gird operator. By assuming the multigrid method with the Garlerkin variational coarse grid operator to satisfy both \approximation property" and \smoothing property" as in [8], we prove that the two-level multigrid method with the wavelet coarse grid operator is convergent independently of the grid step size. We also prove that in general the convergence rate is larger than that with Garlerkin coarse grid operator. The rest of the paper is organized as follows. In section, the wavelet operator is constructed. In section 3, the two-level multigrid method is briey introduced. The convergence of the two-level multigrid method with the wavelet operator is analyzed in section
3 4, and in section 5 the convergence rates of the two-level multigrid method with Garlerkin and wavelet coarse grid operators are compared. Wavelet Transformation Consider the following algebraic equation arising from the discretization of partial dierential equation, (.1) AU = F; where A is symmetric positive denite. To solve equation (.1) we introduce a transformation " L (.) M = ; H where and L = 1 p H = 1 p 0 0 Then M satises the following properties, (i) (ii) Multiplying M to equation (.1) becomes C A ; 1 C A : M T M = MM T = L T L+ H T H = I: LL T = HH T = I; LH T = HL T =0: MAM T MU = MF: 3
4 We have LAL T (.3) HAL T LAH T HAH T! LU HU! = LF HF Denote T = LAL T ;B = LAH T ;C = HAL T ;D = HAH T ;U L = LU; U H = HU;f L = LF, and f H = HF. From (.3),! : (.4) U L =(T BD 1 C) 1 (f L BD 1 f H ): Equation (.1) can be written as (.5) U = F: Applying the wavelet transformation (.) to (.5), we have MU = M M T Mf: That is, (.6)! UL U H L L T LA = 1 H T H L T H H T! fl f H Thus (.7) U L =(L L T )f L + L H T f H : We are now ready to establish Lemma.1! : (T BD 1 C) 1 = L L T : Proof. (T BD 1 C)(L L T ) = LAL T L L T BD 1 CL L T = LA(I H T H) L T BD 1 CL L T = I LAH T H L T BD 1 CL L T = I LAH T H L T LAH T (HAH T ) 1 HAL T L L T = I LAH T H L T LAH T (HAH T ) 1 HA(I H T H) L T = I LAH T H L T + LAH T (HAH T ) 1 HAH T H L T = I LAH T H L T + LAH T H L T = I: 4
5 3 Two-Level Multigrid Method In this section we consider only two-level multigrid method for a one dimensional problem. We discretize the partial dierential equation at a ne grid level h and obtain an algebraic equation as (.1) in a n-dimensional vector space < n.for the multigrid method we assume the simple Richardson iteration is used as the smoother G. The coarse grid operator of the Garlerkin variation form on the coarse grid level H is thus denoted by (3.8) A G = I H h AI h H ; where I H and h I h H denote the interpolation and prolongation respectively. Therefore, the two-level multigrid operator with pre- and post- smoothing iterations based on these coarse grid operators can be written as (3.9) M W = G( I h H W I H h )AG: By the analysis of the previous section, we induce the following new coarse grid operator from the wavelet transformation (3.10) where we set (3.11) A W =(I H h I h H) 1 ; I H h = 1 p L; L is a n (3.1) n matrix dened as in (.), and I h H =(IH h )T = p L: For the rest of the paper we always assume that the interpolation and prolongation are chosen to be of these forms. Furthermore, for simplicity, we only consider the one dimensional case here. However, the analysis can be extended to higher dimensional case. When the partial dierential equation belongs to the class mentioned above, the operator (3.10) is considered as an approximation to the corresponding homogenized operator. Hence, by the wavelet coarse grid operator (3.10), the operator of the two-level multigrid method with pre- and post- smoothing iterations can be written as follows, (3.13) M G = G( I h H G I H h )AG: The following lemma establishes a relationship between A G and A W. 5
6 Lemma 3.1 Proof. By Lemma.1, W G >O: A W = A G BD 1 C: Since A W ;A G and BD 1 C are symmetric and positive, A G A W >O: Therefore, W G >O: 4 Convergence Analysis Set R = L T L and consider the following two subspaces of the n-dimensional vector space < n (4.14) =Range(= R= ) and (4.15) =Range(= (I Lemma 4.1 The two subspaces (4.14) and (4.15) are A-orthogonal and form a direct sum of < n, < n = : Let S and T be the projections of < n onto and, respectively. Dene an energy norm for < n by kxk A = k= xk; 8x < n : R)): From Lemma 4.1, for any x < n,gx = SGx T Gx: Further, (4.16) kgxk A = ksgxk A + ktgxk A : Assumption 1: kgk < 1 and G and A are commute. 6
7 By Assumption 1, (4.17) kgk kgxk A A = max kxka6=0 kxk A x T GAGx = max kxka6=0 x T Ax = kgk ; we have which implies (4.18) and (4.19) Then Let operators M1 and D be dened by kgxk A kgk A kxk A <kxk A ; kgk A < 1: M1 = G(I h H W I H h A I h H G I H h A)G; D = = I h H W I H h A1= = I h H G I H h A1= : GDG = = M1= ; and by Lemma 3.1, the operator D dened in (4.19) is symmetric nonnegative denite. We now establish the following lemma. Lemma 4. Under Assumption 1, (4.0) km1k A = max kyk 6=0 y T GDGy : y T y Proof. Note rst that km1k = max km1xk A A kxka6=0 kxk A k= M1xk = max kxka6=0 k= xk x T M = max 1 T AM 1x kxka6=0 x T Ax = k= M1= k = kgdgk Since D is symmetric nonnegative denite (spd) and by Lemma 3.1, y T G(= IH h km1k A = max W I h HA1= = IH h G I h HA1= )Gy : kyk 6=0 y T y 7
8 Assumption : Set C G = I h H G I H h :C Gsatises the following approximate property, (4.1) kc G k = k I h H G I H h k C1h ; where is positive, and C1 is some constant independent of h. Remark. For regular dierential operator, this assumption is satised, [8]. Assumption 3: AG satises the smoothing property, kagk = kagk A C()h ; where is as in Assumption and C() goesto0asincreases. Lemma 4.3 Proof. k= S= k 1: Lemma 4.4 k= S= k x T = S T AS= x = max kxk 6=0 x T x y T S T ASy = max kyka6=0 y T Ay ksyk A = max kyka6=0 kyk A k= SGk C ()h : 1: Proof. By Lemma 4.3 and Assumptions 1 to 3, k= SGk k= S= k ka1= Gk k= Gk = max x T AG x = kag k C()h : kxk 6=0 x T x Lemma 4.5 (4.) km1k A C 1C(): 8
9 Proof. We have kc G k = jx T x x T IH h max G I h H xj kxk 6=0 x T x = jx T x x T = IH h max G I h H A1= xj : kxk 6=0 x T Ax Hence, by Assumption, for all x < n, (4.3) jx T x x T = I h H G IH h A1= xjc1h x T Ax: Meanwhile, for all s, we can write s = = Rx for x < n. s T Ds = x T R= (= I h H W I H h A1= = I h H G I H h A1= )= Rx = x T R(I h H W I H h I h H G I H h )Rx = x T (R R I h H G I H h )x = s T s x T = R= = I h H G I H h A1= = Rx = s T s s T = I h H G I H h A1= s: Combining with (4.3), we get s T Ds C1h s T As; 8s : Note that for y1 = SGx and y = TGx, Thus, by Lemma 4., (4.4) (Gx) T D(Gx) =(y T 1 +y T )D(y1+y)=y T 1 Dy 1: x T GDGx km1k A = max kxk 6=0 x T x C1h y max 1 T Ay 1 kxk 6=0 x T x = C1h max kxk 6=0 y = max 1 T Dy 1 kxk 6=0 x T x (SGx) T A(SGx) : x T x Together with Lemma 4.4 and Assumptions 1 to 3, (4.4) implies (4.5) km1k A C1 max kxk 6=0 k= SGxk kxk h = C1k= SGk h C1C(): 9
10 Lemma 4.6 Under the Assumptions and 3, (4.6) km G k A C1C(): Proof. Set ~ M = G(I A 1= I h H G I H h A1= )G = GQG: Then and ~ M is symmetric. Furthermore Thus That is, k M ~ jx T Mxj ~ k = max kxk 6=0 x T x jx T GQGxj = max kxk 6=0 x T x km G k A = k= M G = k = k ~ M k; jx T G= ( IH h = max kxk 6=0 k I h H G I H h k k= Gk : jx T G= ( IH h = max G I h H)A1= Gxj kxk 6=0 x T x G I H h )= Gxj x T GAGx k ~ Mk C1h C()h = C1C(): km G k A C1C(): x T GAGx Now, let's state the convergence theorem of the two-level method with wavelet coarse grid operator. Theorem 4.1 Under the Assumptions 1 to 3, x T x (4.7) km W k A C1C(): Proof. By (3.9) and (3.13) and, M W = G( I h H G I H h )AG + G(I h H G I H h I h H W I H h )AG; km W k A km G k A +km1k A : The rest of the proof is trivial. 10
11 5 Comparison of Convergence Rates In this section, we assume that the operators M W and M G of the two-level multigrid method under two dierent choices for the coarse grid operators without post-smoothing iteration G are given by M W =(I I h H W IH h A)G; M G =(I I h H G IH h A)G: Set C W = I = I h H W I H h A1= ; C G = I = I h H G I H h A1= : We are now ready to show that bychoosing the coarse grid operator to be the Garlerkin variational form, the two-level multigrid method is always convergent as long as the smoothing iteration operator kgk < 1. Note that the two-level multigrid method of M G is convergent if and only if km G k A < 1. Under the condition that kgk < 1, to show km G k A < 1it suces to show that kc G k A 1. Lemma 5.1 C G is symmetric nonnegative and (5.8) kc G k 1: Proof. Decompose the space < n into two orthogonal subspaces as (5.9) < n = S1 S; where S1 = = Range(I h H ); S = = null(i H h ): Thus for any x < n, it can be decomposed into x = x1 + x; with x1 = = IH h y 1 S1 for y1 < n and x S. Simple calculation shows C G x1 = 0; C G x = x: 11
12 Hence, Thus (x1) T (C G x1) = 0; (x) T (C G x1) = 0; (x) T (C G x) = x T x : x T C G x T = x T x 0: This shows C G is symmetric nonnegative. Furthermore x T C G x kc G k = max kxk 6=0 x T x = max x T (5.30) x kxk 6=0 x T 1 x1 + x T x 1: For the Wavelet operator, however, the above result is not true. To see this, decompose < n into two A orthogonal subspaces as where < n = S1 S; S1 = = Range(I h H); S = = null(i H h ): Then for any x < n, it can be decomposed into x = x1 + x; where x1 = = I h H y 1 S1 for y1 < n and x S. Simple calculation implies Hence, C W x1 = x1 = R= x1 =(I P)x1; C W x = x: (C W x1) T C W x1 = k(i P )x1k ; (C W x) T C W x1 = x T x 1; (C W x) T C W x = x T x : Moreover (5.31) kc W xk = k(i P )x 1k +xt x 1+x T x ; 1
13 where P = = R= is a projector which is not symmetric. The following property of Pis in general not true: k(i P )x1k kx 1k : This is because decomposing < n as above may imply that x T C W x is negative for some x < n. Hence the wavelet operator may not satisfy an analogous property to that in Lemma 5.1. We now show that the convergence rate of the two-level multigrid method with coarse grid operator of the Garlerkin variational form is always faster than that with the Wavelet operator. Theorem 5.1 (5.3) km G k A km W k A : Proof. Note rst Hence, which implies This in turn implies (5.33) = W A G= W + = W G A1= W : W A G W + G W ; W A G W G ( W G ) O: A G W A G W A G A G (A G W A G A G ) O: Decompose < n as (5.9) in the proof of Lemma 5.1. As before, for any x < n, x=x1+x; with x1 = = I h H y 1 S1 for y1 < n and x S. Wethus have Hence, C W x1 = x1 = I h H W A Gy1; C W x = x: (C W x1) T (C W x1) = x T 1 x 1 y1 T A G W A Gy1 + y1 T A G W A G W A Gy1; (C W x) T (C W x1) = 0; (C W x) T (C W x) = x T x : 13
14 This implies (5.34) (C W x) T (C W x)=x T x y T 1 A G W A Gy1+y T 1 A G W A G W A Gy10: Similarly, (5.35) (C G x) T (C G x)=x T x+y1 T A Gy1 y1 T A Gy10: (5.33) together with (5.34) and (5.35) implies (C W x) T (C W x) (C G x) T (C G x): Thus km W k A = k= M W = k = kc W Gk km G k A = k= M G = k=kc G Gk: References [1] I. Barbuska, Solution of Problems with Interfaces and Singularities, Mathematical Aspects of Finite Elements in Partial Dierential Equations, Carl de Boor, eds. 1974, pp [] R.E. Bank AND T. Dupont, An optimal order process for solving nite element equations. Math. Comp., 36(1981), pp [3] B. Engquist AND E. Luo, The Convergence of Multigrid Method For Elliptic Equation With Oscillatory Coecients, Preprint. [4] B. Engquist AND E. Luo, Multigrid Methods for Dierential Equations With Highly Oscillatory Coecients. Proceedings of the Sixth Copper Mountain Conference on Multigrid Methods, 1993, p [5] Engquist AND E. Luo, New Coarse Gird Operators For Highly Oscillatory Coecient Elliptic Problems, Preprint. [6] E. Luo, Multigrid Method for Elliptic Equation with Oscillatory Coecients. Ph. D. Thesis, Department of Mathematics, UCLA,
15 [7] J.H. Bramble, Multigrid Methods, Pitman Research Notes in Mathematics Series. Longman Scientic & Technical, [8] W. Hackbusch, Multigrid Convergence Theory, in Multi-Grid Methods, W. Hackbusch and U. Trottenberg, eds., Lecture Notes in Mathematics, Springer-Verlag, Berlin- Heidelberg-New York, 198. [9] S. McCormick AND J. Ruge, Multigrid methods for variational problems, SIAM J. Numer. Anal., Vol. 19(198), pp [10] P. Wesseling, The Rate of Convergence of A Multiple Grid Method, Lecture Note,
A MULTIGRID ALGORITHM FOR. Richard E. Ewing and Jian Shen. Institute for Scientic Computation. Texas A&M University. College Station, Texas SUMMARY
A MULTIGRID ALGORITHM FOR THE CELL-CENTERED FINITE DIFFERENCE SCHEME Richard E. Ewing and Jian Shen Institute for Scientic Computation Texas A&M University College Station, Texas SUMMARY In this article,
More informationMathematics Research Report No. MRR 003{96, HIGH RESOLUTION POTENTIAL FLOW METHODS IN OIL EXPLORATION Stephen Roberts 1 and Stephan Matthai 2 3rd Febr
HIGH RESOLUTION POTENTIAL FLOW METHODS IN OIL EXPLORATION Stephen Roberts and Stephan Matthai Mathematics Research Report No. MRR 003{96, Mathematics Research Report No. MRR 003{96, HIGH RESOLUTION POTENTIAL
More informationthe sum of two projections. Finally, in Section 5, we apply the theory of Section 4 to the case of nite element spaces. 2. Additive Algorithms for Par
ON THE SPECTRA OF SUMS OF ORTHOGONAL PROJECTIONS WITH APPLICATIONS TO PARALLEL COMPUTING PETTER E. BJRSTAD y AND JAN MANDEL z Abstract. Many parallel iterative algorithms for solving symmetric, positive
More informationGeometric Multigrid Methods
Geometric Multigrid Methods Susanne C. Brenner Department of Mathematics and Center for Computation & Technology Louisiana State University IMA Tutorial: Fast Solution Techniques November 28, 2010 Ideas
More informationPointwise convergence rate for nonlinear conservation. Eitan Tadmor and Tao Tang
Pointwise convergence rate for nonlinear conservation laws Eitan Tadmor and Tao Tang Abstract. We introduce a new method to obtain pointwise error estimates for vanishing viscosity and nite dierence approximations
More informationINTERGRID OPERATORS FOR THE CELL CENTERED FINITE DIFFERENCE MULTIGRID ALGORITHM ON RECTANGULAR GRIDS. 1. Introduction
Trends in Mathematics Information Center for Mathematical Sciences Volume 9 Number 2 December 2006 Pages 0 INTERGRID OPERATORS FOR THE CELL CENTERED FINITE DIFFERENCE MULTIGRID ALGORITHM ON RECTANGULAR
More informationThe Algebraic Multigrid Projection for Eigenvalue Problems; Backrotations and Multigrid Fixed Points. Sorin Costiner and Shlomo Ta'asan
The Algebraic Multigrid Projection for Eigenvalue Problems; Backrotations and Multigrid Fixed Points Sorin Costiner and Shlomo Ta'asan Department of Applied Mathematics and Computer Science The Weizmann
More informationQUADRATURES INVOLVING POLYNOMIALS AND DAUBECHIES' WAVELETS *
QUADRATURES INVOLVING POLYNOMIALS AND DAUBECHIES' WAVELETS * WEI-CHANG SHANN AND JANN-CHANG YAN Abstract. Scaling equations are used to derive formulae of quadratures involving polynomials and scaling/wavelet
More informationA Finite Element Method for an Ill-Posed Problem. Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D Halle, Abstract
A Finite Element Method for an Ill-Posed Problem W. Lucht Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D-699 Halle, Germany Abstract For an ill-posed problem which has its origin
More informationStability of implicit extrapolation methods. Abstract. Multilevel methods are generally based on a splitting of the solution
Contemporary Mathematics Volume 00, 0000 Stability of implicit extrapolation methods Abstract. Multilevel methods are generally based on a splitting of the solution space associated with a nested sequence
More informationThe Erwin Schrodinger International Pasteurgasse 6/7. Institute for Mathematical Physics A-1090 Wien, Austria
ESI The Erwin Schrodinger International Pasteurgasse 6/7 Institute for Mathematical Physics A-1090 Wien, Austria On the Point Spectrum of Dirence Schrodinger Operators Vladimir Buslaev Alexander Fedotov
More informationLocal Mesh Refinement with the PCD Method
Advances in Dynamical Systems and Applications ISSN 0973-5321, Volume 8, Number 1, pp. 125 136 (2013) http://campus.mst.edu/adsa Local Mesh Refinement with the PCD Method Ahmed Tahiri Université Med Premier
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More informationComparison of V-cycle Multigrid Method for Cell-centered Finite Difference on Triangular Meshes
Comparison of V-cycle Multigrid Method for Cell-centered Finite Difference on Triangular Meshes Do Y. Kwak, 1 JunS.Lee 1 Department of Mathematics, KAIST, Taejon 305-701, Korea Department of Mathematics,
More informationQUASI-UNIFORMLY POSITIVE OPERATORS IN KREIN SPACE. Denitizable operators in Krein spaces have spectral properties similar to those
QUASI-UNIFORMLY POSITIVE OPERATORS IN KREIN SPACE BRANKO CURGUS and BRANKO NAJMAN Denitizable operators in Krein spaces have spectral properties similar to those of selfadjoint operators in Hilbert spaces.
More informationMonte Carlo Methods for Statistical Inference: Variance Reduction Techniques
Monte Carlo Methods for Statistical Inference: Variance Reduction Techniques Hung Chen hchen@math.ntu.edu.tw Department of Mathematics National Taiwan University 3rd March 2004 Meet at NS 104 On Wednesday
More informationMultigrid absolute value preconditioning
Multigrid absolute value preconditioning Eugene Vecharynski 1 Andrew Knyazev 2 (speaker) 1 Department of Computer Science and Engineering University of Minnesota 2 Department of Mathematical and Statistical
More informationMultigrid Methods for Saddle Point Problems
Multigrid Methods for Saddle Point Problems Susanne C. Brenner Department of Mathematics and Center for Computation & Technology Louisiana State University Advances in Mathematics of Finite Elements (In
More informationVector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)
Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational
More informationRobust multigrid methods for nonsmooth coecient elliptic linear systems
Journal of Computational and Applied Mathematics 123 (2000) 323 352 www.elsevier.nl/locate/cam Robust multigrid methods for nonsmooth coecient elliptic linear systems Tony F. Chan a; ; 1, W.L. Wan b; 2
More informationOUTLINE 1. Introduction 1.1 Notation 1.2 Special matrices 2. Gaussian Elimination 2.1 Vector and matrix norms 2.2 Finite precision arithmetic 2.3 Fact
Computational Linear Algebra Course: (MATH: 6800, CSCI: 6800) Semester: Fall 1998 Instructors: { Joseph E. Flaherty, aherje@cs.rpi.edu { Franklin T. Luk, luk@cs.rpi.edu { Wesley Turner, turnerw@cs.rpi.edu
More information/00 $ $.25 per page
Contemporary Mathematics Volume 00, 0000 Domain Decomposition For Linear And Nonlinear Elliptic Problems Via Function Or Space Decomposition UE-CHENG TAI Abstract. In this article, we use a function decomposition
More informationNew Multigrid Solver Advances in TOPS
New Multigrid Solver Advances in TOPS R D Falgout 1, J Brannick 2, M Brezina 2, T Manteuffel 2 and S McCormick 2 1 Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, P.O.
More informationand P RP k = gt k (g k? g k? ) kg k? k ; (.5) where kk is the Euclidean norm. This paper deals with another conjugate gradient method, the method of s
Global Convergence of the Method of Shortest Residuals Yu-hong Dai and Ya-xiang Yuan State Key Laboratory of Scientic and Engineering Computing, Institute of Computational Mathematics and Scientic/Engineering
More informationON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, BAHMAN KALANTARI
ON THE ARITHMETIC-GEOMETRIC MEAN INEQUALITY AND ITS RELATIONSHIP TO LINEAR PROGRAMMING, MATRIX SCALING, AND GORDAN'S THEOREM BAHMAN KALANTARI Abstract. It is a classical inequality that the minimum of
More informationThe Mortar Wavelet Method Silvia Bertoluzza Valerie Perrier y October 29, 1999 Abstract This paper deals with the construction of wavelet approximatio
The Mortar Wavelet Method Silvia Bertoluzza Valerie Perrier y October 9, 1999 Abstract This paper deals with the construction of wavelet approximation spaces, in the framework of the Mortar method. We
More informationKasetsart University Workshop. Multigrid methods: An introduction
Kasetsart University Workshop Multigrid methods: An introduction Dr. Anand Pardhanani Mathematics Department Earlham College Richmond, Indiana USA pardhan@earlham.edu A copy of these slides is available
More informationThe following can also be obtained from this WWW address: the papers [8, 9], more examples, comments on the implementation and a short description of
An algorithm for computing the Weierstrass normal form Mark van Hoeij Department of mathematics University of Nijmegen 6525 ED Nijmegen The Netherlands e-mail: hoeij@sci.kun.nl April 9, 1995 Abstract This
More informationUniversity of Illinois at Urbana-Champaign. Multigrid (MG) methods are used to approximate solutions to elliptic partial differential
Title: Multigrid Methods Name: Luke Olson 1 Affil./Addr.: Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL 61801 email: lukeo@illinois.edu url: http://www.cs.uiuc.edu/homes/lukeo/
More informationarxiv: v1 [math.na] 11 Jul 2011
Multigrid Preconditioner for Nonconforming Discretization of Elliptic Problems with Jump Coefficients arxiv:07.260v [math.na] Jul 20 Blanca Ayuso De Dios, Michael Holst 2, Yunrong Zhu 2, and Ludmil Zikatanov
More informationOctober 7, :8 WSPC/WS-IJWMIP paper. Polynomial functions are renable
International Journal of Wavelets, Multiresolution and Information Processing c World Scientic Publishing Company Polynomial functions are renable Henning Thielemann Institut für Informatik Martin-Luther-Universität
More informationSpurious Chaotic Solutions of Dierential. Equations. Sigitas Keras. September Department of Applied Mathematics and Theoretical Physics
UNIVERSITY OF CAMBRIDGE Numerical Analysis Reports Spurious Chaotic Solutions of Dierential Equations Sigitas Keras DAMTP 994/NA6 September 994 Department of Applied Mathematics and Theoretical Physics
More informationon! 0, 1 and 2 In the Zienkiewicz-Zhu SPR p 1 and p 2 are obtained by solving the locally discrete least-squares p
Analysis of a Class of Superconvergence Patch Recovery Techniques for Linear and Bilinear Finite Elements Bo Li Zhimin Zhang y Abstract Mathematical proofs are presented for the derivative superconvergence
More information2 Ben Schweizer As Hocking describes in [5], a discussion focused on the following question: Can one assume that the dynamic contact angle is a consta
A well-posed model for dynamic contact angles Ben Schweizer February 27, 1998 Abstract We consider uid systems with a free boundary and with a point of contact of the free boundary with a solid wall. We
More informationMax-Planck-Institut fur Mathematik in den Naturwissenschaften Leipzig H 2 -matrix approximation of integral operators by interpolation by Wolfgang Hackbusch and Steen Borm Preprint no.: 04 200 H 2 -Matrix
More informationCOMPACT DIFFERENCE OF WEIGHTED COMPOSITION OPERATORS ON N p -SPACES IN THE BALL
COMPACT DIFFERENCE OF WEIGHTED COMPOSITION OPERATORS ON N p -SPACES IN THE BALL HU BINGYANG and LE HAI KHOI Communicated by Mihai Putinar We obtain necessary and sucient conditions for the compactness
More informationLecture 2: Review of Prerequisites. Table of contents
Math 348 Fall 217 Lecture 2: Review of Prerequisites Disclaimer. As we have a textbook, this lecture note is for guidance and supplement only. It should not be relied on when preparing for exams. In this
More informationLEBESGUE INTEGRATION. Introduction
LEBESGUE INTEGATION EYE SJAMAA Supplementary notes Math 414, Spring 25 Introduction The following heuristic argument is at the basis of the denition of the Lebesgue integral. This argument will be imprecise,
More informationA Finite Element Method Using Singular Functions for Poisson Equations: Mixed Boundary Conditions
A Finite Element Method Using Singular Functions for Poisson Equations: Mixed Boundary Conditions Zhiqiang Cai Seokchan Kim Sangdong Kim Sooryun Kong Abstract In [7], we proposed a new finite element method
More informationSolution of the Two-Dimensional Steady State Heat Conduction using the Finite Volume Method
Ninth International Conference on Computational Fluid Dynamics (ICCFD9), Istanbul, Turkey, July 11-15, 2016 ICCFD9-0113 Solution of the Two-Dimensional Steady State Heat Conduction using the Finite Volume
More informationMath 413/513 Chapter 6 (from Friedberg, Insel, & Spence)
Math 413/513 Chapter 6 (from Friedberg, Insel, & Spence) David Glickenstein December 7, 2015 1 Inner product spaces In this chapter, we will only consider the elds R and C. De nition 1 Let V be a vector
More information2 IVAN YOTOV decomposition solvers and preconditioners are described in Section 3. Computational results are given in Section Multibloc formulat
INTERFACE SOLVERS AND PRECONDITIONERS OF DOMAIN DECOMPOSITION TYPE FOR MULTIPHASE FLOW IN MULTIBLOCK POROUS MEDIA IVAN YOTOV Abstract. A multibloc mortar approach to modeling multiphase ow in porous media
More informationXIAO-CHUAN CAI AND MAKSYMILIAN DRYJA. strongly elliptic equations discretized by the nite element methods.
Contemporary Mathematics Volume 00, 0000 Domain Decomposition Methods for Monotone Nonlinear Elliptic Problems XIAO-CHUAN CAI AND MAKSYMILIAN DRYJA Abstract. In this paper, we study several overlapping
More informationusing the Hamiltonian constellations from the packing theory, i.e., the optimal sphere packing points. However, in [11] it is shown that the upper bou
Some 2 2 Unitary Space-Time Codes from Sphere Packing Theory with Optimal Diversity Product of Code Size 6 Haiquan Wang Genyuan Wang Xiang-Gen Xia Abstract In this correspondence, we propose some new designs
More informationMoment Computation in Shift Invariant Spaces. Abstract. An algorithm is given for the computation of moments of f 2 S, where S is either
Moment Computation in Shift Invariant Spaces David A. Eubanks Patrick J.Van Fleet y Jianzhong Wang ẓ Abstract An algorithm is given for the computation of moments of f 2 S, where S is either a principal
More informationComputational Linear Algebra
Computational Linear Algebra PD Dr. rer. nat. habil. Ralf-Peter Mundani Computation in Engineering / BGU Scientific Computing in Computer Science / INF Winter Term 2018/19 Part 4: Iterative Methods PD
More informationMultigrid Approaches to Non-linear Diffusion Problems on Unstructured Meshes
NASA/CR-2001-210660 ICASE Report No. 2001-3 Multigrid Approaches to Non-linear Diffusion Problems on Unstructured Meshes Dimitri J. Mavriplis ICASE, Hampton, Virginia ICASE NASA Langley Research Center
More information524 Jan-Olov Stromberg practice, this imposes strong restrictions both on N and on d. The current state of approximation theory is essentially useless
Doc. Math. J. DMV 523 Computation with Wavelets in Higher Dimensions Jan-Olov Stromberg 1 Abstract. In dimension d, a lattice grid of size N has N d points. The representation of a function by, for instance,
More informationFraction-free Row Reduction of Matrices of Skew Polynomials
Fraction-free Row Reduction of Matrices of Skew Polynomials Bernhard Beckermann Laboratoire d Analyse Numérique et d Optimisation Université des Sciences et Technologies de Lille France bbecker@ano.univ-lille1.fr
More informationChapter 3 Least Squares Solution of y = A x 3.1 Introduction We turn to a problem that is dual to the overconstrained estimation problems considered s
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology 1 1 c Chapter
More informationMath 1270 Honors ODE I Fall, 2008 Class notes # 14. x 0 = F (x; y) y 0 = G (x; y) u 0 = au + bv = cu + dv
Math 1270 Honors ODE I Fall, 2008 Class notes # 1 We have learned how to study nonlinear systems x 0 = F (x; y) y 0 = G (x; y) (1) by linearizing around equilibrium points. If (x 0 ; y 0 ) is an equilibrium
More informationwhere K e 2 h RN h e N h e is a symmetric positive denite (SPD) sparse system matrix, u h 2 R N h e the solution vector, and fh 2 R N h e the load vec
Algebraic Multigrid for Edge Elements Stefan Reitzinger y Joachim Schoberl z 15th June 2000 Abstract This paper presents an algebraic multigrid method for the ecient solution of the linear system arising
More informationConvergence of A Galerkin Method for 2-D Discontinuous Euler Flows Jian-Guo Liu 1 Institute for Physical Science andtechnology and Department of Mathe
Convergence of A Galerkin Method for 2-D Discontinuous Euler Flows Jian-Guo Liu 1 Institute for Physical Science andtechnology and Department of Mathematics University of Maryland College Park, MD 2742
More informationContents. 2.1 Vectors in R n. Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v. 2.50) 2 Vector Spaces
Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v 250) Contents 2 Vector Spaces 1 21 Vectors in R n 1 22 The Formal Denition of a Vector Space 4 23 Subspaces 6 24 Linear Combinations and
More informationAspects of Multigrid
Aspects of Multigrid Kees Oosterlee 1,2 1 Delft University of Technology, Delft. 2 CWI, Center for Mathematics and Computer Science, Amsterdam, SIAM Chapter Workshop Day, May 30th 2018 C.W.Oosterlee (CWI)
More informationGeneralized Shifted Inverse Iterations on Grassmann Manifolds 1
Proceedings of the Sixteenth International Symposium on Mathematical Networks and Systems (MTNS 2004), Leuven, Belgium Generalized Shifted Inverse Iterations on Grassmann Manifolds 1 J. Jordan α, P.-A.
More informationCORRELATION FUNCTIONS IN 2D SIMPLICIAL GRAVITY. Universite de Paris XI, b^atiment 211, Orsay Cedex, France
UNIVERSALITY IN THE CRITICAL BEHAVIOR OF THE CORRELATION FUNCTIONS IN 2D SIMPLICIAL GRAVITY J. Jurkiewicz 1 Laboratoire de Physiue Theoriue et Hautes Energies 2 Universite de Paris XI, b^atiment 211, 91405
More informationOn the Chvatál-Complexity of Binary Knapsack Problems. Gergely Kovács 1 Béla Vizvári College for Modern Business Studies, Hungary
On the Chvatál-Complexity of Binary Knapsack Problems Gergely Kovács 1 Béla Vizvári 2 1 College for Modern Business Studies, Hungary 2 Eastern Mediterranean University, TRNC 2009. 1 Chvátal Cut and Complexity
More informationNumerische Mathematik
Numer. Math. (1999) 82: 179 191 Numerische Mathematik c Springer-Verlag 1999 Electronic Edition A cascadic multigrid algorithm for the Stokes equations Dietrich Braess 1, Wolfgang Dahmen 2 1 Fakultät für
More information7. F.Balarin and A.Sangiovanni-Vincentelli, A Verication Strategy for Timing-
7. F.Balarin and A.Sangiovanni-Vincentelli, A Verication Strategy for Timing- Constrained Systems, Proc. 4th Workshop Computer-Aided Verication, Lecture Notes in Computer Science 663, Springer-Verlag,
More informationThe Deflation Accelerated Schwarz Method for CFD
The Deflation Accelerated Schwarz Method for CFD J. Verkaik 1, C. Vuik 2,, B.D. Paarhuis 1, and A. Twerda 1 1 TNO Science and Industry, Stieltjesweg 1, P.O. Box 155, 2600 AD Delft, The Netherlands 2 Delft
More informationEfficient smoothers for all-at-once multigrid methods for Poisson and Stokes control problems
Efficient smoothers for all-at-once multigrid methods for Poisson and Stoes control problems Stefan Taacs stefan.taacs@numa.uni-linz.ac.at, WWW home page: http://www.numa.uni-linz.ac.at/~stefant/j3362/
More informationON TRIVIAL GRADIENT YOUNG MEASURES BAISHENG YAN Abstract. We give a condition on a closed set K of real nm matrices which ensures that any W 1 p -grad
ON TRIVIAL GRAIENT YOUNG MEASURES BAISHENG YAN Abstract. We give a condition on a closed set K of real nm matrices which ensures that any W 1 p -gradient Young measure supported on K must be trivial the
More informationMultigrid and Domain Decomposition Methods for Electrostatics Problems
Multigrid and Domain Decomposition Methods for Electrostatics Problems Michael Holst and Faisal Saied Abstract. We consider multigrid and domain decomposition methods for the numerical solution of electrostatics
More informationINSTITUT F UR INFORMATIK. Sonderforschungsbereich 342: Methoden und Werkzeuge fur die Nutzung. Preconditioners based on. Coarsening and Algebraic-
TECHNISCHE UNIVERSIT AT M U N C H E N INSTITUT F UR INFORMATIK Sonderforschungsbereich 342: Methoden und Werkzeuge fur die Nutzung paralleler Rechnerarchitekturen Additive Multilevel- Preconditioners based
More informationE.G. KALNINS AND WILLARD MILLER, JR. The notation used for -series and -integrals in this paper follows that of Gasper and Rahman [3].. A generalizati
A NOTE ON TENSOR PRODUCTS OF -ALGEBRA REPRESENTATIONS AND ORTHOGONAL POLYNOMIALS E.G. KALNINSy AND WILLARD MILLER, Jr.z Abstract. We work out examples of tensor products of distinct generalized s`) algebras
More informationsatisfying ( i ; j ) = ij Here ij = if i = j and 0 otherwise The idea to use lattices is the following Suppose we are given a lattice L and a point ~x
Dual Vectors and Lower Bounds for the Nearest Lattice Point Problem Johan Hastad* MIT Abstract: We prove that given a point ~z outside a given lattice L then there is a dual vector which gives a fairly
More informationt x 0.25
Journal of ELECTRICAL ENGINEERING, VOL. 52, NO. /s, 2, 48{52 COMPARISON OF BROYDEN AND NEWTON METHODS FOR SOLVING NONLINEAR PARABOLIC EQUATIONS Ivan Cimrak If the time discretization of a nonlinear parabolic
More information2 ZHANGXIN CHEN AND PETER OSWALD Independently, the NR Q elements have been derived within the framework of mixed nite element methods [, ]. It has be
Series Logo Volume 00, 9xx MULTIGRID AND MULTILEVEL METHODS FOR NONCONFORMING ROTATED Q ELEMENTS ZHANGXIN CHEN AND PETER OSWALD Abstract. In this paper we systematically study multigrid algorithms and
More informationConvergence Behavior of a Two-Level Optimized Schwarz Preconditioner
Convergence Behavior of a Two-Level Optimized Schwarz Preconditioner Olivier Dubois 1 and Martin J. Gander 2 1 IMA, University of Minnesota, 207 Church St. SE, Minneapolis, MN 55455 dubois@ima.umn.edu
More informationFunctions: A Fourier Approach. Universitat Rostock. Germany. Dedicated to Prof. L. Berg on the occasion of his 65th birthday.
Approximation Properties of Multi{Scaling Functions: A Fourier Approach Gerlind Plona Fachbereich Mathemati Universitat Rostoc 1851 Rostoc Germany Dedicated to Prof. L. Berg on the occasion of his 65th
More informationAlgorithmic Lie Symmetry Analysis and Group Classication for Ordinary Dierential Equations
dmitry.lyakhov@kaust.edu.sa Symbolic Computations May 4, 2018 1 / 25 Algorithmic Lie Symmetry Analysis and Group Classication for Ordinary Dierential Equations Dmitry A. Lyakhov 1 1 Computational Sciences
More information2 FRED J. HICKERNELL the sample mean of the y (i) : (2) ^ 1 N The mean square error of this estimate may be written as a sum of two parts, a bias term
GOODNESS OF FIT STATISTICS, DISCREPANCIES AND ROBUST DESIGNS FRED J. HICKERNELL Abstract. The Cramer{Von Mises goodness-of-t statistic, also known as the L 2 -star discrepancy, is the optimality criterion
More informationThe WENO Method for Non-Equidistant Meshes
The WENO Method for Non-Equidistant Meshes Philip Rupp September 11, 01, Berlin Contents 1 Introduction 1.1 Settings and Conditions...................... The WENO Schemes 4.1 The Interpolation Problem.....................
More informationANDREA TOSELLI. Abstract. Two-level overlapping Schwarz methods are considered for nite element problems
OVERLAPPING SCHWARZ METHODS FOR MAXWELL'S EQUATIONS IN THREE DIMENSIONS ANDREA TOSELLI Abstract. Two-level overlapping Schwarz methods are considered for nite element problems of 3D Maxwell's equations.
More informationWhen does a planar bipartite framework admit a continuous deformation?
Theoretical Computer Science 263 (2001) 345 354 www.elsevier.com/locate/tcs When does a planar bipartite framework admit a continuous deformation? H. Maehara, N. Tokushige College of Education, Ryukyu
More information290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f
Numer. Math. 67: 289{301 (1994) Numerische Mathematik c Springer-Verlag 1994 Electronic Edition Least supported bases and local linear independence J.M. Carnicer, J.M. Pe~na? Departamento de Matematica
More informationAbstract Minimal degree interpolation spaces with respect to a nite set of
Numerische Mathematik Manuscript-Nr. (will be inserted by hand later) Polynomial interpolation of minimal degree Thomas Sauer Mathematical Institute, University Erlangen{Nuremberg, Bismarckstr. 1 1, 90537
More informationINTRODUCTION TO MULTIGRID METHODS
INTRODUCTION TO MULTIGRID METHODS LONG CHEN 1. ALGEBRAIC EQUATION OF TWO POINT BOUNDARY VALUE PROBLEM We consider the discretization of Poisson equation in one dimension: (1) u = f, x (0, 1) u(0) = u(1)
More informationSOLVING MESH EIGENPROBLEMS WITH MULTIGRID EFFICIENCY
SOLVING MESH EIGENPROBLEMS WITH MULTIGRID EFFICIENCY KLAUS NEYMEYR ABSTRACT. Multigrid techniques can successfully be applied to mesh eigenvalue problems for elliptic differential operators. They allow
More informationA mixed nite volume element method based on rectangular mesh for biharmonic equations
Journal of Computational and Applied Mathematics 7 () 7 3 www.elsevier.com/locate/cam A mixed nite volume element method based on rectangular mesh for biharmonic equations Tongke Wang College of Mathematical
More information1 A complete Fourier series solution
Math 128 Notes 13 In this last set of notes I will try to tie up some loose ends. 1 A complete Fourier series solution First here is an example of the full solution of a pde by Fourier series. Consider
More informationECON 7335 INFORMATION, LEARNING AND EXPECTATIONS IN MACRO LECTURE 1: BASICS. 1. Bayes Rule. p(b j A)p(A) p(b)
ECON 7335 INFORMATION, LEARNING AND EXPECTATIONS IN MACRO LECTURE : BASICS KRISTOFFER P. NIMARK. Bayes Rule De nition. Bayes Rule. The probability of event A occurring conditional on the event B having
More information1 Introduction We will consider traveling waves for reaction-diusion equations (R-D) u t = nx i;j=1 (a ij (x)u xi ) xj + f(u) uj t=0 = u 0 (x) (1.1) w
Reaction-Diusion Fronts in Periodically Layered Media George Papanicolaou and Xue Xin Courant Institute of Mathematical Sciences 251 Mercer Street, New York, N.Y. 10012 Abstract We compute the eective
More information2 EBERHARD BECKER ET AL. has a real root. Thus our problem can be reduced to the problem of deciding whether or not a polynomial in one more variable
Deciding positivity of real polynomials Eberhard Becker, Victoria Powers, and Thorsten Wormann Abstract. We describe an algorithm for deciding whether or not a real polynomial is positive semidenite. The
More informationSolving Symmetric Indefinite Systems with Symmetric Positive Definite Preconditioners
Solving Symmetric Indefinite Systems with Symmetric Positive Definite Preconditioners Eugene Vecharynski 1 Andrew Knyazev 2 1 Department of Computer Science and Engineering University of Minnesota 2 Department
More informationLinear Algebra, part 2 Eigenvalues, eigenvectors and least squares solutions
Linear Algebra, part 2 Eigenvalues, eigenvectors and least squares solutions Anna-Karin Tornberg Mathematical Models, Analysis and Simulation Fall semester, 2013 Main problem of linear algebra 2: Given
More informationG METHOD IN ACTION: FROM EXACT SAMPLING TO APPROXIMATE ONE
G METHOD IN ACTION: FROM EXACT SAMPLING TO APPROXIMATE ONE UDREA PÄUN Communicated by Marius Iosifescu The main contribution of this work is the unication, by G method using Markov chains, therefore, a
More information4. Higher Order Linear DEs
4. Higher Order Linear DEs Department of Mathematics & Statistics ASU Outline of Chapter 4 1 General Theory of nth Order Linear Equations 2 Homogeneous Equations with Constant Coecients 3 The Method of
More informationVARIETIES WITHOUT EXTRA AUTOMORPHISMS II: HYPERELLIPTIC CURVES
VARIETIES WITHOUT EXTRA AUTOMORPHISMS II: HYPERELLIPTIC CURVES BJORN POONEN Abstract. For any field k and integer g 2, we construct a hyperelliptic curve X over k of genus g such that #(Aut X) = 2. We
More informationJournal of Computational and Applied Mathematics. Multigrid method for solving convection-diffusion problems with dominant convection
Journal of Computational and Applied Mathematics 226 (2009) 77 83 Contents lists available at ScienceDirect Journal of Computational and Applied Mathematics journal homepage: www.elsevier.com/locate/cam
More informationA SHORT NOTE COMPARING MULTIGRID AND DOMAIN DECOMPOSITION FOR PROTEIN MODELING EQUATIONS
A SHORT NOTE COMPARING MULTIGRID AND DOMAIN DECOMPOSITION FOR PROTEIN MODELING EQUATIONS MICHAEL HOLST AND FAISAL SAIED Abstract. We consider multigrid and domain decomposition methods for the numerical
More informationUCLA Chemical Engineering. Process & Control Systems Engineering Laboratory
Constrained Innite-Time Nonlinear Quadratic Optimal Control V. Manousiouthakis D. Chmielewski Chemical Engineering Department UCLA 1998 AIChE Annual Meeting Outline Unconstrained Innite-Time Nonlinear
More informationLinear Regression and Its Applications
Linear Regression and Its Applications Predrag Radivojac October 13, 2014 Given a data set D = {(x i, y i )} n the objective is to learn the relationship between features and the target. We usually start
More informationSTABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin
On the stability of invariant subspaces of commuting matrices Tomaz Kosir and Bor Plestenjak September 18, 001 Abstract We study the stability of (joint) invariant subspaces of a nite set of commuting
More informationNew coarse grid operators for highly oscillatory coefficient elliptic problems
Carnegie Mellon University Research Showcase @ CMU Department of Mathematical Sciences Mellon College of Science 1996 New coarse grid operators for highly oscillatory coefficient elliptic problems Engquist
More informationMULTIGRID PRECONDITIONING IN H(div) ON NON-CONVEX POLYGONS* Dedicated to Professor Jim Douglas, Jr. on the occasion of his seventieth birthday.
MULTIGRID PRECONDITIONING IN H(div) ON NON-CONVEX POLYGONS* DOUGLAS N ARNOLD, RICHARD S FALK, and RAGNAR WINTHER Dedicated to Professor Jim Douglas, Jr on the occasion of his seventieth birthday Abstract
More informationA theorem on summable families in normed groups. Dedicated to the professors of mathematics. L. Berg, W. Engel, G. Pazderski, and H.- W. Stolle.
Rostock. Math. Kolloq. 49, 51{56 (1995) Subject Classication (AMS) 46B15, 54A20, 54E15 Harry Poppe A theorem on summable families in normed groups Dedicated to the professors of mathematics L. Berg, W.
More information31. Successive Subspace Correction method for Singular System of Equations
Fourteenth International Conference on Domain Decomposition Methods Editors: Ismael Herrera, David E. Keyes, Olof B. Widlund, Robert Yates c 2003 DDM.org 31. Successive Subspace Correction method for Singular
More information12 CHAPTER 1. PRELIMINARIES Lemma 1.3 (Cauchy-Schwarz inequality) Let (; ) be an inner product in < n. Then for all x; y 2 < n we have j(x; y)j (x; x)
1.4. INNER PRODUCTS,VECTOR NORMS, AND MATRIX NORMS 11 The estimate ^ is unbiased, but E(^ 2 ) = n?1 n 2 and is thus biased. An unbiased estimate is ^ 2 = 1 (x i? ^) 2 : n? 1 In x?? we show that the linear
More information