Multilevel Preconditioning of Graph-Laplacians: Polynomial Approximation of the Pivot Blocks Inverses
|
|
- Amos Stokes
- 5 years ago
- Views:
Transcription
1 Multilevel Preconditioning of Graph-Laplacians: Polynomial Approximation of the Pivot Blocks Inverses P. Boyanova 1, I. Georgiev 34, S. Margenov, L. Zikatanov 5 1 Uppsala University, Box 337, Uppsala, Sweden IICT BAS, Acad. G. Bonchev Str., bl. 5A, 1113 Sofia, Bulgaria 3 IMI BAS, Acad. G. Bonchev Str., bl Sofia, Bulgaria 4 RICAM AAS, Altenbergerstraße 69, A-4040 Linz, Austria 5 Department of Mathematics, Penn State, University Park, PA 1680, USA Abstract We consider the discrete system resulting from mixed finite element approximation of a second-order elliptic boundary value problem with Crouzeix-Raviart nonconforming elements for the vector valued unknown function and piece-wise constants for the scalar valued unknown function. Since the mass matrix corresponding to the vector valued variables is diagonal, these unknowns can be eliminated exactly. Thus, the problem of designing an efficient algorithm for the solution of the resulting algebraic system is reduced to one of constructing an efficient algorithm for a system whose matrix is a graph-laplacian (or weighted graph-laplacian). We propose a preconditioner based on an algebraic multilevel iterations (AMLI) algorithm. The hierarchical two-level transformations and the corresponding block splittings of the graph-laplacian needed in an AMLI algorithm are introduced locally on macroelements. Each macroelement is associated with an edge of a coarser triangulation. To define the action of the preconditioner we employ polynomial approximations of the inverses of the pivot blocks in the splittings. Such approximations are obtained via the best polynomial approximation of Ü 1 in Ľ norm on a finite interval. Our construction provides sufficient accuracy and moreover, guarantees that each pivot block is approximated by a positive definite matrix polynomial. One possible application of the constructed efficient preconditioner is in the numerical solution of unsteady Navier-Stokes equations by a projection method. It can also be used to design efficient solvers for problems corresponding to other mixed finite element discretizations. Keywords: preconditioning AMLI polynomial matrix approximation 1
2 1 Introduction Let us consider the elliptic problem in mixed form: Ù + ÖÔ = in Ω Ö Ù = 0 in Ω Ù Ò = 0 on Ω (1) where Ω is a convex polygonal domain in IR, is a given smooth vector valued function, Ò is the outward unit normal vector to the boundary. We refer to the vector valued unknown function Ù as a velocity and to the scalar valued unknown Ô as a pressure. The preconditioner that we construct is for the finite element (FE) discretization with Crouzeix- Raviart elements for Ù and piece-wise constants for Ô. It is known that such choice of spaces is stable (see [4]), and such spaces are used as a discretization in a projection method for Navier-Stokes equations (see e.g. []). The Crouzeix-Raviart mass matrix is diagonal and the velocity unknowns can be eliminated exactly (see e.g. [8]). The matrix of the reduced system for the pressure is a weighted graph-laplacian. We consider -D uniform mesh of right-angled triangles. Then A corresponds to the T-shaped four point stencil shown in Fig Figure 1: Schur complement four point stencil for the pressure We propose a preconditioner for the weighted graph-laplacian system based on algebraic multilevel iterations (AMLI) method. The framework for this method was originally introduced in [1] (see also [10], [6]). AMLI is a recursive generalization of two-level preconditioners that has optimal computational complexity due to a proper Schur complement stabilization using Chebyshev polynomials. We consider a sequence of nested triangulations Ì 0 Ì 1 Ì Ð of the domain Ω, constructed by recursive uniform refinement of a given initial mesh. We denote by (0) (1) (Ð) the corresponding system matrices. Regarding a hierarchical x block partitioning of the system matrix () at a refinement level, () = Â () () Â ()Ì = () () 11 1 () () 1 degrees of freedom added by refinement coarse mesh degrees of freedom the AMLI preconditioner is defined as follows: (0) = (0) at the coarsest mesh level with index 0,
3 () = Â () 1 () 11 0 () 1 () Á ( 1) Á () 1 Â () Ì at successively refined levels, where () 11 are symmetric positive definite approximations of () 11 that satisfy Ú Ì () 11 Ú ÚÌ () 11 Ú (1 + )ÚÌ () 11 Ú for all Ú () É 1 ( 1) 1 ( 1) ( 1) 1, where É 1 is a properly chosen polyno- ( 1) 1 and = mial of degree 1. It is known that under conditions, detailed in [1], the relative condition number satisfies ( (Ð) 1 (Ð) ) (1 + )(1 ), where is the Cauchy-Bunyakowski-Schwarz (CBS) constant, that characterizes the two-level hierarchical partitionings. For the case = the coefficients Õ 0 and Õ 1 of the optimal stabilization polynomial É 1 (Ý) = Õ 0 + Õ 1 Ý, which has to be evaluated in the AMLI W-cycle, are given by (see [1, 5]): Õ 0 = Õ 1 = (1 ) with = Ô (3) In this article we propose and justify the use of polynomial approximation of the pivot blocks inverses ( () 11 ) 1 in the AMLI setting for weighted graph-laplacians, that yields good optimal order preconditioned conjugate gradient (PCG) convergence rates. The rest of the paper is organized as follows. In Section we present the general idea of constructing approximation of a matrix inverse, using the best polynomial approximation of Ü 1 in Ä ½ norm on a finite interval. In Section 3 we show how this idea is applied for the pivot block inverses in AMLI method for weighted graph-laplacians. Section 4 is devoted to analysis of the numerical results of applying PCG method with the constructed preconditioner, as well as a comparison with the case when conjugate gradient (CG) iterations are used for solving the pivot block systems in the AMLI algorithm. Concluding remarks and brief summary of the results are found in Section 5. Polynomial approximation of a matrix inverse Let À be Ò Ò symmetric positive definite (SPD) matrix with a set of eigenvalue-eigenvector pairs Ú Ò =1 0 1 Ò. We construct a polynomial approximation (preconditioner) 1 of À 1 (i.e. preconditioner of À) such that 1 = È (À) È ¾ È, and ( 1 À) is close to 1. Theorem.1. Let È (Ü) ¾ È, and 0 Ñ È (Ü)Ü Å for all Ü in an interval Ë [ 1 Ò ] Ë. Then ÑÚ Ì Ú Ú Ì È (À)ÀÚ Å Ú Ì Ú Ú ¾ Ê Ò. 3
4 Proof. For all Ú ¾ Ê Ò, Ú = Ò =1 «Ú, we have: (È (À)ÀÚ Ú) = (È (À)À Å Ò =1 «Ò «Ú Ò =1 =1 = Å(Ú Ú) «Ú ) = Ò =1 È ( ) «The left inequality follows in the same way. We would like to have È (À)À Á, i.e. È (Ü)Ü 1 Ü ¾ Ë. Let us assume that È (Ü) 1Ü Ü ¾ Ë (0 +½). Then 1 Ü È (Ü)Ü 1 + Ü Ü ¾ Ë If we know some estimate of the spectrum of H, i.e., min max = 1 Ò, we can take Ë = [ min max ] and get 1 max È (Ü)Ü 1 + max. In general, if is small enough, or equivalently, the degree of the polynomial is large enough, we have È (Ü)Ü 0 for all Ü ¾ Ë, È (À)À is SPD, and (È (À)À) 1 + max 1 max We define È (Ü) to be the best polynomial approximation of Ü 1 in Ä ½ norm on the finite interval [ ÑÒ ÑÜ ], i.e. 1 Ü 1 È = min È ¾È ½[max min ] Ü È = () ½[max min ] It is known (see e.g. [9, 7]), that for 1 È (Ü) = 1 ( ) 1 + Ü ( 1 ) Ê +1(Ü ) where = 1 max min = max + min max min = + Ô 1 Ê +1 (Ü) = Ì +1 (Ü) + Ì (Ü) + 1 Ì 1 (Ü) and Ì (Ü) ¾ È is the Chebyshev polynomial of degree. The error of best polynomial approximation () is () = 8 ( 1 ) 4
5 A three term recurrence for È (Ü) then exists (see [7]), that let us use the following algorithm for computing È (À): (1 + Æ) È 0 (À) = (1 Æ) Á È 1(À) = + 1 Æ (1 Æ) Á È +1 (À) = [(1 + Æ)Á ]È (À) ÆÈ 1 (À) + Á where = Ô min Ô 4 ( Ô max + Ô min ) Æ = max Ô max + Ô min 3 AMLI with polynomial approximation of the pivot blocks inverses for weighted graph-laplacians We examine the case of two space dimensions and uniform mesh of right-angled triangles for the discretization of (1). Each refined mesh is obtained by dividing the current triangles in four congruent ones by connecting the midpoints of the sides. We define the hierarchical two-level transformation and corresponding splitting of the related graph-laplacian for the reduced pressure system locally for macroelements associated with the edges of the coarse triangulation. We define () using a weight parameter Ø ¾ (0 1) so that the contribution of the links between the interior nodes among the (macroelement) edge matrices of the current coarse triangle are distributed correctly. Following the numbering from Fig., we introduce the local (macroelement) matrix (), corresponding to a hypotenuse, in the form: () = () ;À = ¾ Ø+1 Ø Ø Ø The local (macroelement) matrix () 5 Ø 5 Ø Ø+1 Ø Ø Ø 5 Ø 5 Ø = () ;, corresponding to a cathetus, is introduced 5
6 Figure : Macroelement of two adjacent coarse triangles with a common hypotenuse in a similar way. Then we define the (macroelement) local transformation matrix  ()  () = ¾ Ö Ö Ö Ö Ö Ö Ö Ö where, are parameters. As shown in [3] this two-level hierarchical partitioning complies with the conditions of the main theorem in AMLI theory (see [1]) when Ö = Ô and the AMLI stabilization polynomial degree equals or 3. An estimate for the CBS constant 058 for = 1, = 01 is derived there too. We now examine È ( () 11 ), where È (Ü) is the best polynomial approximation of Ü 1. The hierarchical construction insures that the minimal and maximal eigenvalues of the pivot block do not depend on the problem size (see e.g. [3]). Therefore it is enough to calculate them for a rather coarse mesh and use the obtained values for all. All results presented in this paper on the interval Ë = [ min max ] that contains all eigenvalues of () 11 are for Ë = [ ]. In Fig. 3 the behavior of the error È (Ü) 1Ü for polynomial degrees ¾ 3 4 can be seen. In all cases, there are + alternations that comply with approximation theory. Using Theorem.1, one can verify that Ú Ì () 11 Ú (1 + () max )Ú Ì (È ( () 11 )) 1 Ú (1 + () max ) (1 () max ) ÚÌ () 11 Ú We define () 11 = (1 + () max )(È ( () 11 )) 1, and then = (1 + () max )(1 () max ) 1 (4) 6 as:
7 Figure 3: The error È (Ü) 1Ü for polynomial degrees ¾ Numerical results The presented numerical tests show the convergence behavior of the PCG method to solve the weighted graph-laplacian system for the case of Dirichlet boundary conditions in the unit square Ω = (0 1) (0 1), on a uniform grid with characteristic mesh size. The tests concern the AMLI W-cycle with polynomial approximation for the pivot blocks inverses, as well as a comparison of such preconditioner with an AMLI W-cycle, which uses some CG iterations for the pivot block systems instead. In the presentation of the numerical results we have used the following notation: is the PCG stopping criteria; Ò, = 1 5, denotes the total number of degrees of freedom on the finest grid Ò = Thus, the largest number of fine grid degrees of freedom that we have used in the numerical experiments is Ò 5 = For all the numerical tests the coarsest grid size is = 116, which corresponds to Ò 0 = 51 degrees of freedom. In Tables 1 4 the number of PCG iterations needed to reduce the energy norm of the error by a factor are given. The proposed construction for the system under consideration guarantees that the matrices () 11 are SPD for degree. For the experiments summarized in Table 1 we use the value of as in (4) to calculate the coefficients (3). The convergence behavior for = 3 and = 4 is much better than for = and in these cases the method stabilizes earlier. This is an expected result, since the estimate and the related value of is considerably bigger for =. It is important to note that is a measurement of how well () 11 approximates () 11 and it also affects to a large extend the stabilization properties of the polynomial É 1. The proposed AMLI preconditioner uses the same polynomials for the pivot block systems at each PCG iteration, thus ensuring the linearity of the process and preserving the orthogonality of the search directions. We compare it with the case of an AMLI PCG method that uses some CG iterations for approximate solution of the pivot block systems. There are several specific aspects of such experiments. CG automatically adapts to find the best approximation for a given right-hand side but this means that the matrix polynomial action that corresponds to the specified number of inner CG iterations varies at each PCG iteration. This destroys the linearity of the AMLI method process - an effect that could be taken care of by using generalized conjugate gradient (GCG) method instead of PCG 7
8 Number of PCG iterations = 1 = = 3 = 4 = Table 1: W-cycle preconditioner with polynomial approximation of degree for [ () 11 ] 1. Number of PCG iterations = 1 = = 3 = 4 = Table : W-cycle preconditioner. The approximate action of [ () 11 ] 1 is computed by applying CG iterations. The symbol means that more than 300 PCG iterations were needed to achieve the prescribed error reduction. at the price of more memory and CPU usage. For the results, presented in Table, we assume that we can use for the case of CG pivot block iterations the same estimate for as in the case of polynomial of degree pivot blocks inverses. The symbol used in the tables means that the PCG method did not converge within a limit of 300 iterations. As can be seen, the settings presented in Table do not obtain good results, no stabilization effect is visible and in some cases the process does not converge at all. The experiments presented in Tables 3 and 4 are motivated by observations that we have made from many different numerical tests (see also [5, 6]). As it turns out, a value of = 0 for the proposed AMLI method does not slow down the convergence, but on the contrary, even leads to better stabilization numbers when polynomial pivot approximations are used. The results in Table 4 show a better behavior of the preconditioner than the results in Table. Nevertheless, the polynomial approximation of [ () 11 ] 1 results in much better (more stable) algorithm. 8
9 Number of PCG iterations = 1 = = 3 = 4 = Table 3: W-cycle preconditioner ( = 0) with polynomial approximation of degree for [ () 11 ] 1. Number of PCG iterations = 1 = = 3 = 4 = Table 4: W-cycle preconditioner ( = 0). The approximate action of [ () 11 ] 1 is computed by applying CG iterations. The symbol means that more than 300 PCG iterations were needed to achieve the prescribed error reduction. 5 Concluding remarks The proposed construction for a polynomial matrix approximation leads to a considerable improvement of the conditioning of the system, while providing sufficient accuracy and positive definiteness. Applying such approximation to the pivot blocks inverses in the AMLI preconditioner for weighted graph-laplacians yields a theoretically justified linear PCG algorithm of optimal computational complexity with experimentally confirmed good convergence rates. The studied approach is applicable in a rather general setting of hierarchical multilevel methods where the spectrum of pivot blocks is uniformly bounded with respect to the number of the refinement levels. 9
10 6 Acknowledgments Research has been partially supported by the Bulgarian NSF Grants DO 0-338/08 and DO 0-147/08, and by the Austrian Science Fund, Grant P989-N18. The work of the fourth author has been supported in part by the US National Science Foundation, Grants DMS , and OCI References [1] Axelsson, O., Vassilevski, P. S., Algebraic multilevel preconditioning methods. II. SIAM J. Numer. Anal. 7 (6), [] Bejanov, B., Guermond, J.-L., Minev, P. D., 005. A locally DIV-free projection scheme for incompressible flows based on non-conforming finite elements. Internat. J. Numer. Methods Fluids 49 (5), [3] Boyanova, P., Margenov, S., 009. Multilevel splitting of weighted graph-laplacian arising in non-conforming mixed FEM elliptic problems. In: Margenov, S., Vulkov, L., Wasniewski, J. (Eds.), Numerical Analysis and Its Applications. Vol of Lecture Notes in Computer Science. Springer, pp [4] Brezzi, F., Fortin, M., Mixed and hybrid finite element methods. Vol. 15 of Springer Series in Computational Mathematics. Springer-Verlag, New York. [5] Georgiev, I., Kraus, J., Margenov, S., 008. Multilevel preconditioning of rotated bilinear non-conforming FEM problems. Comput. Math. Appl. 55 (10), [6] Kraus J., Margenov S., 009. Robust Algebraic Multilevel Methods and Algorithms. Radon Series Comp. Appl. Math., vol. 5. [7] Kraus J., Pillwein V., Zikatanov L., 009. Algebraic multilevel iteration methods and the best approximation to 1/x in the uniform norm. RICAM Technical report no [8] Margenov, S., Minev, P., 007. On a MIC(0) preconditioning of non-conforming mixed FEM elliptic problems. Math. Comput. Simulation 76 (1-3), [9] Rivlin, T. J., An introduction to the approximation of functions. Dover Publications Inc., New York, corrected reprint of the 1969 original, Dover Books on Advanced Mathematics. [10] Vassilevski, P. S., 008. Multilevel block factorization preconditioners. Springer, New York, matrix-based analysis and algorithms for solving finite element equations. 10
Optimal multilevel preconditioning of strongly anisotropic problems.part II: non-conforming FEM. p. 1/36
Optimal multilevel preconditioning of strongly anisotropic problems. Part II: non-conforming FEM. Svetozar Margenov margenov@parallel.bas.bg Institute for Parallel Processing, Bulgarian Academy of Sciences,
More informationComparative Analysis of Mesh Generators and MIC(0) Preconditioning of FEM Elasticity Systems
Comparative Analysis of Mesh Generators and MIC(0) Preconditioning of FEM Elasticity Systems Nikola Kosturski and Svetozar Margenov Institute for Parallel Processing, Bulgarian Academy of Sciences Abstract.
More informationAuxiliary space multigrid method for elliptic problems with highly varying coefficients
Auxiliary space multigrid method for elliptic problems with highly varying coefficients Johannes Kraus 1 and Maria Lymbery 2 1 Introduction The robust preconditioning of linear systems of algebraic equations
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 informationSolution methods for the Cahn-Hilliard equation discretized by conforming and non-conforming finite elements
Solution methods for the Cahn-Hilliard equation discretized by conforming and non-conforming finite elements Petia Boyanova 2, Minh Do-Quang 3, Maya Neytcheva Uppsala University, Box 337, 75 5 Uppsala,
More informationPARTITION OF UNITY FOR THE STOKES PROBLEM ON NONMATCHING GRIDS
PARTITION OF UNITY FOR THE STOES PROBLEM ON NONMATCHING GRIDS CONSTANTIN BACUTA AND JINCHAO XU Abstract. We consider the Stokes Problem on a plane polygonal domain Ω R 2. We propose a finite element method
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 informationLecture Note III: Least-Squares Method
Lecture Note III: Least-Squares Method Zhiqiang Cai October 4, 004 In this chapter, we shall present least-squares methods for second-order scalar partial differential equations, elastic equations of solids,
More informationAdaptive methods for control problems with finite-dimensional control space
Adaptive methods for control problems with finite-dimensional control space Saheed Akindeinde and Daniel Wachsmuth Johann Radon Institute for Computational and Applied Mathematics (RICAM) Austrian Academy
More informationMultigrid and Iterative Strategies for Optimal Control Problems
Multigrid and Iterative Strategies for Optimal Control Problems John Pearson 1, Stefan Takacs 1 1 Mathematical Institute, 24 29 St. Giles, Oxford, OX1 3LB e-mail: john.pearson@worc.ox.ac.uk, takacs@maths.ox.ac.uk
More informationAn Algebraic Multigrid Method Based on Matching 2 in Graphs 3 UNCORRECTED PROOF
1 An Algebraic Multigrid Method Based on Matching 2 in Graphs 3 James Brannic 1, Yao Chen 1, Johannes Kraus 2, and Ludmil Ziatanov 1 4 1 Department of Mathematics, The Pennsylvania State University, PA
More informationUniform estimate of the constant in the strengthened CBS inequality for anisotropic non-conforming FEM systems
Uniform estimate of te constant in te strengtened CBS inequality for anisotropic non-conforming FEM systems R. Blaeta S. Margenov M. Neytceva Version of November 0, 00 Abstract Preconditioners based on
More informationIncomplete Cholesky preconditioners that exploit the low-rank property
anapov@ulb.ac.be ; http://homepages.ulb.ac.be/ anapov/ 1 / 35 Incomplete Cholesky preconditioners that exploit the low-rank property (theory and practice) Artem Napov Service de Métrologie Nucléaire, Université
More informationFast Fourier Transform Solvers and Preconditioners for Quadratic Spline Collocation
Fast Fourier Transform Solvers and Preconditioners for Quadratic Spline Collocation Christina C. Christara and Kit Sun Ng Department of Computer Science University of Toronto Toronto, Ontario M5S 3G4,
More informationFrom the Boundary Element DDM to local Trefftz Finite Element Methods on Polyhedral Meshes
www.oeaw.ac.at From the Boundary Element DDM to local Trefftz Finite Element Methods on Polyhedral Meshes D. Copeland, U. Langer, D. Pusch RICAM-Report 2008-10 www.ricam.oeaw.ac.at From the Boundary Element
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 informationA Subspace Correction Method for Discontinuous Galerkin Discretizations of Linear Elasticity Equations
www.oeaw.ac.at A Subspace Correction Method for Discontinuous Galerkin Discretizations of Linear lasticity quations B. Ayuso de Dios, I. Georgiev, J. Kraus, L. Zikatanov RICAM-Report 2011-29 www.ricam.oeaw.ac.at
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 informationOverlapping Schwarz preconditioners for Fekete spectral elements
Overlapping Schwarz preconditioners for Fekete spectral elements R. Pasquetti 1, L. F. Pavarino 2, F. Rapetti 1, and E. Zampieri 2 1 Laboratoire J.-A. Dieudonné, CNRS & Université de Nice et Sophia-Antipolis,
More informationAn Iterative Substructuring Method for Mortar Nonconforming Discretization of a Fourth-Order Elliptic Problem in two dimensions
An Iterative Substructuring Method for Mortar Nonconforming Discretization of a Fourth-Order Elliptic Problem in two dimensions Leszek Marcinkowski Department of Mathematics, Warsaw University, Banacha
More information7.4 The Saddle Point Stokes Problem
346 CHAPTER 7. APPLIED FOURIER ANALYSIS 7.4 The Saddle Point Stokes Problem So far the matrix C has been diagonal no trouble to invert. This section jumps to a fluid flow problem that is still linear (simpler
More informationFrom the Boundary Element Domain Decomposition Methods to Local Trefftz Finite Element Methods on Polyhedral Meshes
From the Boundary Element Domain Decomposition Methods to Local Trefftz Finite Element Methods on Polyhedral Meshes Dylan Copeland 1, Ulrich Langer 2, and David Pusch 3 1 Institute of Computational Mathematics,
More informationBlock-tridiagonal matrices
Block-tridiagonal matrices. p.1/31 Block-tridiagonal matrices - where do these arise? - as a result of a particular mesh-point ordering - as a part of a factorization procedure, for example when we compute
More informationA Mixed Nonconforming Finite Element for Linear Elasticity
A Mixed Nonconforming Finite Element for Linear Elasticity Zhiqiang Cai, 1 Xiu Ye 2 1 Department of Mathematics, Purdue University, West Lafayette, Indiana 47907-1395 2 Department of Mathematics and Statistics,
More informationAMG for a Peta-scale Navier Stokes Code
AMG for a Peta-scale Navier Stokes Code James Lottes Argonne National Laboratory October 18, 2007 The Challenge Develop an AMG iterative method to solve Poisson 2 u = f discretized on highly irregular
More informationThe Conjugate Gradient Method
The Conjugate Gradient Method Classical Iterations We have a problem, We assume that the matrix comes from a discretization of a PDE. The best and most popular model problem is, The matrix will be as large
More informationJ.I. Aliaga 1 M. Bollhöfer 2 A.F. Martín 1 E.S. Quintana-Ortí 1. March, 2009
Parallel Preconditioning of Linear Systems based on ILUPACK for Multithreaded Architectures J.I. Aliaga M. Bollhöfer 2 A.F. Martín E.S. Quintana-Ortí Deparment of Computer Science and Engineering, Univ.
More informationAlgebraic Multigrid as Solvers and as Preconditioner
Ò Algebraic Multigrid as Solvers and as Preconditioner Domenico Lahaye domenico.lahaye@cs.kuleuven.ac.be http://www.cs.kuleuven.ac.be/ domenico/ Department of Computer Science Katholieke Universiteit Leuven
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 informationAMS subject classifications. Primary, 65N15, 65N30, 76D07; Secondary, 35B45, 35J50
A SIMPLE FINITE ELEMENT METHOD FOR THE STOKES EQUATIONS LIN MU AND XIU YE Abstract. The goal of this paper is to introduce a simple finite element method to solve the Stokes equations. This method is in
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 informationA 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 informationA note on accurate and efficient higher order Galerkin time stepping schemes for the nonstationary Stokes equations
A note on accurate and efficient higher order Galerkin time stepping schemes for the nonstationary Stokes equations S. Hussain, F. Schieweck, S. Turek Abstract In this note, we extend our recent work for
More informationA Robust Preconditioned Iterative Method for the Navier-Stokes Equations with High Reynolds Numbers
Applied and Computational Mathematics 2017; 6(4): 202-207 http://www.sciencepublishinggroup.com/j/acm doi: 10.11648/j.acm.20170604.18 ISSN: 2328-5605 (Print); ISSN: 2328-5613 (Online) A Robust Preconditioned
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 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 informationA NOTE ON THE LADYŽENSKAJA-BABUŠKA-BREZZI CONDITION
A NOTE ON THE LADYŽENSKAJA-BABUŠKA-BREZZI CONDITION JOHNNY GUZMÁN, ABNER J. SALGADO, AND FRANCISCO-JAVIER SAYAS Abstract. The analysis of finite-element-like Galerkin discretization techniques for the
More informationContents. Preface... xi. Introduction...
Contents Preface... xi Introduction... xv Chapter 1. Computer Architectures... 1 1.1. Different types of parallelism... 1 1.1.1. Overlap, concurrency and parallelism... 1 1.1.2. Temporal and spatial parallelism
More informationA posteriori error estimates for non conforming approximation of eigenvalue problems
A posteriori error estimates for non conforming approximation of eigenvalue problems E. Dari a, R. G. Durán b and C. Padra c, a Centro Atómico Bariloche, Comisión Nacional de Energía Atómica and CONICE,
More informationIterative solution methods and their rate of convergence
Uppsala University Graduate School in Mathematics and Computing Institute for Information Technology Numerical Linear Algebra FMB and MN Fall 2007 Mandatory Assignment 3a: Iterative solution methods and
More informationA Least-Squares Finite Element Approximation for the Compressible Stokes Equations
A Least-Squares Finite Element Approximation for the Compressible Stokes Equations Zhiqiang Cai, 1 Xiu Ye 1 Department of Mathematics, Purdue University, 1395 Mathematical Science Building, West Lafayette,
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 informationSUPERCONVERGENCE PROPERTIES FOR OPTIMAL CONTROL PROBLEMS DISCRETIZED BY PIECEWISE LINEAR AND DISCONTINUOUS FUNCTIONS
SUPERCONVERGENCE PROPERTIES FOR OPTIMAL CONTROL PROBLEMS DISCRETIZED BY PIECEWISE LINEAR AND DISCONTINUOUS FUNCTIONS A. RÖSCH AND R. SIMON Abstract. An optimal control problem for an elliptic equation
More informationSolving Large Nonlinear Sparse Systems
Solving Large Nonlinear Sparse Systems Fred W. Wubs and Jonas Thies Computational Mechanics & Numerical Mathematics University of Groningen, the Netherlands f.w.wubs@rug.nl Centre for Interdisciplinary
More information1. Introduction. The Stokes problem seeks unknown functions u and p satisfying
A DISCRETE DIVERGENCE FREE WEAK GALERKIN FINITE ELEMENT METHOD FOR THE STOKES EQUATIONS LIN MU, JUNPING WANG, AND XIU YE Abstract. A discrete divergence free weak Galerkin finite element method is developed
More informationLocal flux mimetic finite difference methods
Local flux mimetic finite difference methods Konstantin Lipnikov Mikhail Shashkov Ivan Yotov November 4, 2005 Abstract We develop a local flux mimetic finite difference method for second order elliptic
More informationA Balancing Algorithm for Mortar Methods
A Balancing Algorithm for Mortar Methods Dan Stefanica Baruch College, City University of New York, NY 11, USA Dan Stefanica@baruch.cuny.edu Summary. The balancing methods are hybrid nonoverlapping Schwarz
More informationAMS Mathematics Subject Classification : 65F10,65F50. Key words and phrases: ILUS factorization, preconditioning, Schur complement, 1.
J. Appl. Math. & Computing Vol. 15(2004), No. 1, pp. 299-312 BILUS: A BLOCK VERSION OF ILUS FACTORIZATION DAVOD KHOJASTEH SALKUYEH AND FAEZEH TOUTOUNIAN Abstract. ILUS factorization has many desirable
More informationAlgebraic Multigrid Methods for the Oseen Problem
Algebraic Multigrid Methods for the Oseen Problem Markus Wabro Joint work with: Walter Zulehner, Linz www.numa.uni-linz.ac.at This work has been supported by the Austrian Science Foundation Fonds zur Förderung
More informationMPI parallel implementation of CBF preconditioning for 3D elasticity problems 1
Mathematics and Computers in Simulation 50 (1999) 247±254 MPI parallel implementation of CBF preconditioning for 3D elasticity problems 1 Ivan Lirkov *, Svetozar Margenov Central Laboratory for Parallel
More informationPreface to the Second Edition. Preface to the First Edition
n page v Preface to the Second Edition Preface to the First Edition xiii xvii 1 Background in Linear Algebra 1 1.1 Matrices................................. 1 1.2 Square Matrices and Eigenvalues....................
More informationDISCRETE MAXIMUM PRINCIPLES in THE FINITE ELEMENT SIMULATIONS
DISCRETE MAXIMUM PRINCIPLES in THE FINITE ELEMENT SIMULATIONS Sergey Korotov BCAM Basque Center for Applied Mathematics http://www.bcamath.org 1 The presentation is based on my collaboration with several
More informationON THE MULTIPOINT MIXED FINITE VOLUME METHODS ON QUADRILATERAL GRIDS
ON THE MULTIPOINT MIXED FINITE VOLUME METHODS ON QUADRILATERAL GRIDS VINCENT FONTAINE 1,2 AND ANIS YOUNES 2 1 Laboratoire de Physique des Bâtiments et des Systèmes, Université de La Réunion, 15 avenue
More informationAn a posteriori error estimate and a Comparison Theorem for the nonconforming P 1 element
Calcolo manuscript No. (will be inserted by the editor) An a posteriori error estimate and a Comparison Theorem for the nonconforming P 1 element Dietrich Braess Faculty of Mathematics, Ruhr-University
More informationNewton-Multigrid Least-Squares FEM for S-V-P Formulation of the Navier-Stokes Equations
Newton-Multigrid Least-Squares FEM for S-V-P Formulation of the Navier-Stokes Equations A. Ouazzi, M. Nickaeen, S. Turek, and M. Waseem Institut für Angewandte Mathematik, LSIII, TU Dortmund, Vogelpothsweg
More informationLocal discontinuous Galerkin methods for elliptic problems
COMMUNICATIONS IN NUMERICAL METHODS IN ENGINEERING Commun. Numer. Meth. Engng 2002; 18:69 75 [Version: 2000/03/22 v1.0] Local discontinuous Galerkin methods for elliptic problems P. Castillo 1 B. Cockburn
More informationA Robust Preconditioner for the Hessian System in Elliptic Optimal Control Problems
A Robust Preconditioner for the Hessian System in Elliptic Optimal Control Problems Etereldes Gonçalves 1, Tarek P. Mathew 1, Markus Sarkis 1,2, and Christian E. Schaerer 1 1 Instituto de Matemática Pura
More informationFast solvers for steady incompressible flow
ICFD 25 p.1/21 Fast solvers for steady incompressible flow Andy Wathen Oxford University wathen@comlab.ox.ac.uk http://web.comlab.ox.ac.uk/~wathen/ Joint work with: Howard Elman (University of Maryland,
More informationDomain Decomposition Preconditioners for Spectral Nédélec Elements in Two and Three Dimensions
Domain Decomposition Preconditioners for Spectral Nédélec Elements in Two and Three Dimensions Bernhard Hientzsch Courant Institute of Mathematical Sciences, New York University, 51 Mercer Street, New
More informationInstitut für Mathematik
U n i v e r s i t ä t A u g s b u r g Institut für Mathematik Xuejun Xu, Huangxin Chen, Ronald H.W. Hoppe Local Multilevel Methods for Adaptive Nonconforming Finite Element Methods Preprint Nr. 21/2009
More informationarxiv: v1 [math.na] 29 Feb 2016
EFFECTIVE IMPLEMENTATION OF THE WEAK GALERKIN FINITE ELEMENT METHODS FOR THE BIHARMONIC EQUATION LIN MU, JUNPING WANG, AND XIU YE Abstract. arxiv:1602.08817v1 [math.na] 29 Feb 2016 The weak Galerkin (WG)
More informationSchur Complement Matrix And Its (Elementwise) Approximation: A Spectral Analysis Based On GLT Sequences
Schur Complement Matrix And Its (Elementwise) Approximation: A Spectral Analysis Based On GLT Sequences Ali Dorostkar, Maya Neytcheva, and Stefano Serra-Capizzano 2 Department of Information Technology,
More information1. Fast Iterative Solvers of SLE
1. Fast Iterative Solvers of crucial drawback of solvers discussed so far: they become slower if we discretize more accurate! now: look for possible remedies relaxation: explicit application of the multigrid
More informationAn Algebraic Multigrid Method for Eigenvalue Problems
An Algebraic Multigrid Method for Eigenvalue Problems arxiv:1503.08462v1 [math.na] 29 Mar 2015 Xiaole Han, Yunhui He, Hehu Xie and Chunguang You Abstract An algebraic multigrid method is proposed to solve
More informationLOCAL MULTILEVEL METHODS FOR ADAPTIVE NONCONFORMING FINITE ELEMENT METHODS
LOCAL MULTILEVEL METHODS FOR ADAPTIVE NONCONFORMING FINITE ELEMENT METHODS XUEUN XU, HUANGXIN CHEN, AND RONALD H.W. HOPPE Abstract. In this paper, we propose a local multilevel product algorithm and its
More informationAn interpolation operator for H 1 functions on general quadrilateral and hexahedral meshes with hanging nodes
An interpolation operator for H 1 functions on general quadrilateral and hexahedral meshes with hanging nodes Vincent Heuveline Friedhelm Schieweck Abstract We propose a Scott-Zhang type interpolation
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 informationA Balancing Algorithm for Mortar Methods
A Balancing Algorithm for Mortar Methods Dan Stefanica Baruch College, City University of New York, NY, USA. Dan_Stefanica@baruch.cuny.edu Summary. The balancing methods are hybrid nonoverlapping Schwarz
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 11, pp. 1-24, 2000. Copyright 2000,. ISSN 1068-9613. ETNA NEUMANN NEUMANN METHODS FOR VECTOR FIELD PROBLEMS ANDREA TOSELLI Abstract. In this paper,
More informationSECOND-ORDER FULLY DISCRETIZED PROJECTION METHOD FOR INCOMPRESSIBLE NAVIER-STOKES EQUATIONS
Tenth MSU Conference on Differential Equations and Computational Simulations. Electronic Journal of Differential Equations, Conference 3 (06), pp. 9 0. ISSN: 07-669. URL: http://ejde.math.txstate.edu or
More information10.6 ITERATIVE METHODS FOR DISCRETIZED LINEAR EQUATIONS
10.6 ITERATIVE METHODS FOR DISCRETIZED LINEAR EQUATIONS 769 EXERCISES 10.5.1 Use Taylor expansion (Theorem 10.1.2) to give a proof of Theorem 10.5.3. 10.5.2 Give an alternative to Theorem 10.5.3 when F
More informationOn an Approximation Result for Piecewise Polynomial Functions. O. Karakashian
BULLETIN OF THE GREE MATHEMATICAL SOCIETY Volume 57, 010 (1 7) On an Approximation Result for Piecewise Polynomial Functions O. arakashian Abstract We provide a new approach for proving approximation results
More informationENERGY NORM A POSTERIORI ERROR ESTIMATES FOR MIXED FINITE ELEMENT METHODS
ENERGY NORM A POSTERIORI ERROR ESTIMATES FOR MIXED FINITE ELEMENT METHODS CARLO LOVADINA AND ROLF STENBERG Abstract The paper deals with the a-posteriori error analysis of mixed finite element methods
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 informationEXACT DE RHAM SEQUENCES OF SPACES DEFINED ON MACRO-ELEMENTS IN TWO AND THREE SPATIAL DIMENSIONS
EXACT DE RHAM SEQUENCES OF SPACES DEFINED ON MACRO-ELEMENTS IN TWO AND THREE SPATIAL DIMENSIONS JOSEPH E. PASCIAK AND PANAYOT S. VASSILEVSKI Abstract. This paper proposes new finite element spaces that
More informationYongdeok Kim and Seki Kim
J. Korean Math. Soc. 39 (00), No. 3, pp. 363 376 STABLE LOW ORDER NONCONFORMING QUADRILATERAL FINITE ELEMENTS FOR THE STOKES PROBLEM Yongdeok Kim and Seki Kim Abstract. Stability result is obtained for
More informationRobust Domain Decomposition Preconditioners for Abstract Symmetric Positive Definite Bilinear Forms
www.oeaw.ac.at Robust Domain Decomposition Preconditioners for Abstract Symmetric Positive Definite Bilinear Forms Y. Efendiev, J. Galvis, R. Lazarov, J. Willems RICAM-Report 2011-05 www.ricam.oeaw.ac.at
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 24: Preconditioning and Multigrid Solver Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 5 Preconditioning Motivation:
More informationTermination criteria for inexact fixed point methods
Termination criteria for inexact fixed point methods Philipp Birken 1 October 1, 2013 1 Institute of Mathematics, University of Kassel, Heinrich-Plett-Str. 40, D-34132 Kassel, Germany Department of Mathematics/Computer
More informationHigh order, finite volume method, flux conservation, finite element method
FLUX-CONSERVING FINITE ELEMENT METHODS SHANGYOU ZHANG, ZHIMIN ZHANG, AND QINGSONG ZOU Abstract. We analyze the flux conservation property of the finite element method. It is shown that the finite element
More informationMultilevel and Adaptive Iterative Substructuring Methods. Jan Mandel University of Colorado Denver
Multilevel and Adaptive Iterative Substructuring Methods Jan Mandel University of Colorado Denver The multilevel BDDC method is joint work with Bedřich Sousedík, Czech Technical University, and Clark Dohrmann,
More informationJae Heon Yun and Yu Du Han
Bull. Korean Math. Soc. 39 (2002), No. 3, pp. 495 509 MODIFIED INCOMPLETE CHOLESKY FACTORIZATION PRECONDITIONERS FOR A SYMMETRIC POSITIVE DEFINITE MATRIX Jae Heon Yun and Yu Du Han Abstract. We propose
More informationFind (u,p;λ), with u 0 and λ R, such that u + p = λu in Ω, (2.1) div u = 0 in Ω, u = 0 on Γ.
A POSTERIORI ESTIMATES FOR THE STOKES EIGENVALUE PROBLEM CARLO LOVADINA, MIKKO LYLY, AND ROLF STENBERG Abstract. We consider the Stokes eigenvalue problem. For the eigenvalues we derive both upper and
More information1. Introduction. We consider the model problem that seeks an unknown function u = u(x) satisfying
A SIMPLE FINITE ELEMENT METHOD FOR LINEAR HYPERBOLIC PROBLEMS LIN MU AND XIU YE Abstract. In this paper, we introduce a simple finite element method for solving first order hyperbolic equations with easy
More information1. Fast Solvers and Schwarz Preconditioners for Spectral Nédélec Elements for a Model Problem in H(curl)
DDM Preprint Editors: editor1, editor2, editor3, editor4 c DDM.org 1. Fast Solvers and Schwarz Preconditioners for Spectral Nédélec Elements for a Model Problem in H(curl) Bernhard Hientzsch 1 1. Introduction.
More informationSpectral element agglomerate AMGe
Spectral element agglomerate AMGe T. Chartier 1, R. Falgout 2, V. E. Henson 2, J. E. Jones 4, T. A. Manteuffel 3, S. F. McCormick 3, J. W. Ruge 3, and P. S. Vassilevski 2 1 Department of Mathematics, Davidson
More informationfor Finite Element Simulation of Incompressible Flow Arnd Meyer Department of Mathematics, Technical University of Chemnitz,
Preconditioning the Pseudo{Laplacian for Finite Element Simulation of Incompressible Flow Arnd Meyer Department of Mathematics, Technical University of Chemnitz, 09107 Chemnitz, Germany Preprint{Reihe
More informationLeast-Squares Spectral Collocation with the Overlapping Schwarz Method for the Incompressible Navier Stokes Equations
Least-Squares Spectral Collocation with the Overlapping Schwarz Method for the Incompressible Navier Stokes Equations by Wilhelm Heinrichs Universität Duisburg Essen, Ingenieurmathematik Universitätsstr.
More informationA greedy strategy for coarse-grid selection
A greedy strategy for coarse-grid selection S. MacLachlan Yousef Saad August 3, 2006 Abstract Efficient solution of the very large linear systems that arise in numerical modelling of real-world applications
More informationA Finite Element Method for the Surface Stokes Problem
J A N U A R Y 2 0 1 8 P R E P R I N T 4 7 5 A Finite Element Method for the Surface Stokes Problem Maxim A. Olshanskii *, Annalisa Quaini, Arnold Reusken and Vladimir Yushutin Institut für Geometrie und
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 informationAMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 18 Outline
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 informationConstruction of a New Domain Decomposition Method for the Stokes Equations
Construction of a New Domain Decomposition Method for the Stokes Equations Frédéric Nataf 1 and Gerd Rapin 2 1 CMAP, CNRS; UMR7641, Ecole Polytechnique, 91128 Palaiseau Cedex, France 2 Math. Dep., NAM,
More informationOn angle conditions in the finite element method. Institute of Mathematics, Academy of Sciences Prague, Czech Republic
On angle conditions in the finite element method Michal Křížek Institute of Mathematics, Academy of Sciences Prague, Czech Republic Joint work with Jan Brandts (University of Amsterdam), Antti Hannukainen
More informationDiscontinuous Galerkin Methods
Discontinuous Galerkin Methods Joachim Schöberl May 20, 206 Discontinuous Galerkin (DG) methods approximate the solution with piecewise functions (polynomials), which are discontinuous across element interfaces.
More informationEffective Minimization of Functional Majorant in A Posteriori Error Analysis
Effective Minimization of Functional Majorant in A Posteriori Error Analysis Jan Valdman June 3, 28 Abstract We consider a Poisson problem and its functional a posteriori estimate derived in [2]. The estimate
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 informationEfficient Augmented Lagrangian-type Preconditioning for the Oseen Problem using Grad-Div Stabilization
Efficient Augmented Lagrangian-type Preconditioning for the Oseen Problem using Grad-Div Stabilization Timo Heister, Texas A&M University 2013-02-28 SIAM CSE 2 Setting Stationary, incompressible flow problems
More informationRobust Preconditioned Conjugate Gradient for the GPU and Parallel Implementations
Robust Preconditioned Conjugate Gradient for the GPU and Parallel Implementations Rohit Gupta, Martin van Gijzen, Kees Vuik GPU Technology Conference 2012, San Jose CA. GPU Technology Conference 2012,
More information