A Balancing Algorithm for Mortar Methods
|
|
- Sandra King
- 6 years ago
- Views:
Transcription
1 A Balancing Algorithm for Mortar Methods Dan Stefanica Baruch College, City University of New York, NY, USA. Summary. The balancing methods are hybrid nonoverlapping Schwarz domain decomposition methods from the Neumann-Neumann family. They are efficient and easy to implement. We present a new balancing algorithm for mortar finite element methods. We prove a condition number estimate which depends polylogarithmically on the number of nodes on each subregion edge and does not depend on the number of subregions of the partition of the computational domain, just as in the conforming finite element case. Introduction The balancing method of Mandel [7] is a hybrid nonoverlapping Schwarz domain decomposition method from the Neumann-Neumann family. It is easy to implement and uses a natural coarse space of minimal dimension which allows for an unstructured partition of the computational domain. The condition numbers of the resulting algorithms depend polylogarithmically on the number of degrees of freedom in each subregion. There is a close connection between the balancing method and the FETI [5] and FETI DP [4] methods; cf. [6]. A new version of the balancing method, also related to FETI type algorithms, was recently proposed by Dohrmann et al. [9, ]. Mortar finite elements were first introduced by Bernardi et al. [] and are actively used in practice because of their advantages over the conforming finite elements, e.g., flexible mesh generation and straightforward local refinement. In this paper, we propose an extension of the balancing method to mortar finite elements. As in conforming cases, every local space is associated with a subregion from the partition of the computational domain. The values of the mortar function on a nonmortar side depend on, but are not equal to, its values on the mortar sides opposite the nonmortar. To account for this dependence, the local spaces are defined on extended subregions, instead of using local spaces and local solvers defined on each subregion. In this regard, our algorithm is different from classical Neumann-Neumann methods.
2 748 D. Stefanica We establish a polylogarithmic upper bound for the condition number of our algorithm. The same bound has been obtained for the balancing algorithm of Dryja [], as well as for other mortar algorithms, e.g., the iterative substructuring method of Achdou et al. [], in the geometrically nonconforming case. While the algorithm proposed here is based on a similar philosophy as the method suggested in [], since the Schwarz framework is used to study the convergence properties of both algorithms, major differences exist between the two algorithms. For example, in the algorithm of [], the local spaces are associated with pairs of opposite nonmortar and mortar sides. Abstract Schwarz Theory We use this elegant framework of the abstract Schwarz theory [] to study the convergence properties of the balancing algorithm proposed in this paper. Let V be a finite dimensional space, with a coercive inner product a : V V R,andlet f : V R be a continuous operator. We want to find the unique solution u V of a(u, v) = f(v), v V. () Assume that V can be written as V = V +V +...+V N, where the sum is not necessarily direct nor do we necessarily have V i V, i =:N.Let I i : V i V be embedding operators and let ã i : V i V i R be bilinear forms which are symmetric, continuous, and coercive. The corresponding projection-like operators T e i : V V i are defined by ã i( T e iv, v i) = a(v, I iv i), v i V i, v V. () Using the operators T i : V V, T i = I i et i, the additive and multiplicative Schwarz methods for solving () can be introduced. The balancing method is a hybrid method, combining the potential for parallelization of the additive methods and the fast convergence of the multiplicative methods. Choose the bilinear form ã to be exact, i.e., ã (, ) =a(, ). The coarse space solver T is therefore a projection, subsequently denoted by P. The balancing method consists of solving T bal u = g bal,where T bal = P +(I P )(T + + T N)(I P ). () Here, g bal is obtained by solving N local problems of the same form as () that do not require any knowledge of u. The equation T bal u = g bal is a preconditioned version of () and can be solved without further preconditioning using CG or GMRES algorithms. A Mortar Discretization of an Elliptic Problem As a model problem for two dimensional self adjoint elliptic PDEs with homogeneous coefficients, we choose the Poisson problem with mixed boundary conditions on Ω :given f L (Ω), find u H (Ω) such that u = f on Ω, with u =on Ω D and u/ n =on Ω N, (4)
3 A Balancing Algorithm for Mortar Methods 749 where Ω N and Ω D are the parts of Ω = Ω N Ω D where Neumann and Dirichlet boundary conditions are imposed, respectively, and Ω D has positive Lebesgue measure. To keep the presentation concise, we only discuss geometrically conforming mortar elements. Let {Ω i} i=:n be a geometrically conforming mortar decomposition of a polygonal domain Ω of diameter into rectangles of diameter of order H. (This notation is not coincidental: for the balancing method proposed here, each local space V i will correspond to one subregion Ω i.) The restriction of the mortar finite element space V h to any rectangle Ω i is a Q finite element function on a mesh of diameter h. Weakcontinuityisrequiredacross Γ, the interface between the subregions {Ω i} i=:n. We choose a set of edges of {Ω i} i=:n, called nonmortars, which form a disjoint partition of Γ. For each nonmortar side γ there exists exactly one side opposite to it, which is called a mortar side. The jump [w] of a mortar function w V across any nonmortar γ must be orthogonal to a space of test functions Ψ(γ), i.e., [w] ψds =, ψ Ψ(γ). (5) γ In [], Ψ(γ) consists of continuous, piecewise linear functions on γ that are constant in the first and last mesh intervals of γ. Note that the end points of the nonmortar sides are associated with genuine degrees of freedom. We discretize the Poisson problem (4) by using the mortar finite element space and obtain the discrete problem: V h find u h V h such that a Γ (u h,v h )=f(v h ), v h V h, (6) where the bilinear form a Γ (, ) is defined as the sum of contributions from the individual subregions, and f( ) is the L -inner product by the function f : a Γ (v h,w h ) = v h w h dx and f(v) = Ω i i= Ω fv dx. Let V h (Γ ) be the restriction of V h to the interface Γ,andlet V be the space of discrete piecewise harmonic functions defined as follows: if v Γ V h (Γ ), then its harmonic extension H(v Γ ) V is the only function in V h which, on every subregion Ω i, is equal to the harmonic extension of v Γ Ωi with respect to the H -seminorm. As in other substructuring methods, we eliminate the unknowns corresponding to the interior of the subregions. Problem (6) becomes a Schur complement problem on V h (Γ ): find u Γ V h (Γ ) s.t. a Γ (H(u Γ ), H(v Γ )) = f(h(v Γ )), v Γ V h (Γ ). (7) For simplicity, we denote V h (Γ ) by V and let a(, ) =a Γ (H( ), H( )) be the inner product on V. Problem (7) can be formulated on V as follows: find u V s.t. a(u, v) =f(v), v V. (8)
4 75 D. Stefanica 4 A Balancing Algorithm for Mortars In this section, we introduce a new balancing algorithm for mortar finite elements. Our results can be extended to second order self-adjoint elliptic problems with mixed boundary conditions discretized by geometrically nonconforming mortars, and to three dimensional problems. We solve (8) using the technique outlined in Section. To do so, we need to introduce a coarse space V and local spaces V i, i =:N. The major difference between the classical balancing method and our algorithm for mortars is related to the extended subregions Ωi e, which replace the individual subregions in the definition of the local bilinear forms ã i(, ). An important role in the balancing algorithm is played by the counting functions associated with the interface nodes of each extended subregion. In [], we have shown that defining ã i(, ) only on Ω i does not lead to a convergent algorithm. Extended Subregions: The extended subregion eω i is defined as the union of Ω i and all its neighbors that have a mortar side opposite Ω i.let N i be the set of corner nodes of Ω i, all the nodes on the mortar sides of Ω i, and all the nodes on the mortar sides opposite the nonmortar sides of Ω i. The counting function ν i : Γ R corresponding to Ω i is a mortar function taking the following values at the genuine degrees of freedom: 8 < number of sets N j with x N j, if x N i; ν i(x) =, if x/ N i; :, if x Ω i Ω N. In the geometrically conforming case, the value of ν i at every interior node of the mortar sides where ν i does not vanish is equal to, and Range(ν i) {,,...,4}. Let ν i be the mortar function with nodal values ν i (x) =/νi(x) if νi(x) and ν i (x) = otherwise. As in the continuous finite element case, ν i form a partition of unity, i.e., ν i =. i= Coarse Space V : The coarse space V has one basis function, H(ν i ),theharmonic extension of ν i, per subregion Ωi. The bilinear form a is exact, i.e., ã(, ) = a(, ). Therefore, a(p u, H(ν i )) = a(u, H(ν i )), and a((i P )u, H(ν i )) =, u V. (9) Local Spaces: The local space V i is associated with the subregion Ω i, is embedded in V, i.e., V i V, and consists of piecewise harmonic functions which vanish at all the genuine degrees of freedom of Γ \ N i. The bilinear form ã i(, ) :V i V i R is defined using the extended subregion Ω e i : ã i(v i,w i) = X H(I h (ν iv i)) H(I h (ν iw i)) dx, () Ω j Ω j e Ω i where I h : L (Ω) V is the nodal basis interpolation onto the mortar space V. The projection-like operator T i is given by T i = I i et i,where
5 A Balancing Algorithm for Mortar Methods 75 ei (shaded) corresponding Fig.. All possible instances of extended subregions Ω to one subregion Ωi (center in each picture). The values of the counting function νi at the corners of Ωi are recorded. Mortar sides are marked with an additional solid line. a i (Tei u, vi ) = a(u, vi ), vi Vi. () ei contains more than one subregion, then any vi Vi ei = Ωi, i.e., if Ω If Ω ei \ Ωi. The problem () is well posed since it is a Poisson problem vanishes on Ω ei \ Ωi. ei with zero Dirichlet boundary conditions on Ω on Ω ei = Ωi, then all the sides of Ωi are mortars; cf. Figure, upper left If Ω picture. This corresponds to the case of a floating subregion in the classical balancing algorithm, and requires using balanced functions. Note that H(νi νi ) is equal to on Ωi, and therefore a i (Tei u, H(νi )) = H(Ih (νi Tei u)) H(νi νi ) dx =. Ωi For the local problem () to be solvable, u must satisfy a(u, H(νi )) =, () for every floating subregion Ωi. Such functions are called balanced functions. From (9), we conclude that any function in Range(I P ) is balanced. ei = Ωi, the local problem () corresponds to a pure Neumann Moreover, if Ω problem. We make the solution unique by requiring Tei u to satisfy H(Ih (νi Tei u)) dx =. () Ωi
6 75 D. Stefanica The preconditioned operator of our balancing algorithm for mortars is T bal = P +(I P )(T + + T N)(I P ). The convergence analysis of T bal relies on that of the Neumann-Neumann operator T N N = P + T + + T N,since κ(t bal ) κ(t N N ) ; cf., e.g., [8]. However, Neumann-Neumann algorithms with the spaces and approximate solvers considered in this paper would not converge. 5 Condition number estimate The condition number estimate for our algorithm is based on abstract Schwarz theory; see, e.g., []. A technical results has to be proven first, and the techniques are somewhat different for floating and non-floating regions: Lemma. Let u V and let u i = H(I h (ν i (u αi))) Vi,where αi is the weighted averages of u over Ω i, i.e., Then, α i = µ(ω i) Ω i udx. (4) a(u i,u i) C`+log(H/h) ã i(u i,u i), u i Range(T i) (5) a(u i, u i) C`+log(H/h) u H ( Ω f. i ) (6) Also, if Ω i is a floating subregion, i.e., if e Ωi = Ω i,then, ã i(u i, u i)= u H ( f Ω i ). If Ω i is a nonfloating subregion, i.e., if Ωi e Ω i, then ã i(u i, u i) C` + log(h/h) u H ( Ω f. i ) Using the results of Lemma, we can show that ã i(, ) is bounded from below by a(, ), and prove that for any function in V there exists a stable splitting into local functions; see [] for detailed proofs. Lemma. There exists a constant C, not depending on the local spaces V i,such that a(u i,u i) C`+log(H/h) ã i(u i,u i), u i Range(T i), i =:N. Lemma. Let u V and let α i be the weighted averages (4) of u over Ω i. Define u V as u = α ih(ν i ) and let ui Vi be given by ui = H(I h(ν i (u i= α i))).then u = u + and a(u,u )+ u i i= ã i(u i, u i) C`+log(H/h) a(u, u). i=
7 A Balancing Algorithm for Mortar Methods 75 Based on the results of Lemmas and, a bound on κ(t N N ), and therefore on κ(t bal ), can be established using the abstract Schwarz theory. Theorem. The condition number of the balancing algorithm is independent of the number of subregions and grows at most polylogarithmically with the number of nodes in each subregion, i.e., κ(t bal ) C`+log(H/h) 4, where C is a constant that does not depend on the properties of the partition. 6 Numerical Results We have tested the convergence properties of our balancing algorithm for a two dimensional problem discretized by geometrically nonconforming mortar finite elements. The model problem was the Poisson equation on the unit square Ω with mixed boundary conditions. We partitioned Ω into N = 6,, 64, and 8 geometrically nonconforming rectangles, and Q elements were used in each rectangle. For each partition, the number of nodes on each edge, H/h,wastakentobe, on average, 4, 8, 6, and, respectively, for different sets of experiments. The preconditioned conjugate gradient iteration was stopped when the residual norm had decreased by a factor of 6. The experiments were carried out in MATLAB. We report iteration counts, condition number estimates, and flop counts of our algorithm in Table. Table. Convergence results, geometrically nonconforming mortars. N H/h Iter Cond Mflops N H/h Iter Cond Mflops e e e e e e e e e e e e e e+ 6.6.e e+ Our balancing algorithm has similar scalability properties as those of the classical balancing algorithm. When the number of nodes on each subregion edge, H/h, was fixed and the number of subregions, N, was increased, the iteration count showed only a slight growth. When H/h was increased, while the partition was kept unchanged, the small increase in the number of iterations was satisfactory. The condition number estimates exhibited a similar dependence, or lack thereof, on N and H/h.
8 754 D. Stefanica References. Y. Achdou, Y. Maday, and O. B. Widlund, Iterative substructuring preconditioners for mortar element methods in two dimensions, SIAMJ.Numer. Anal., 6 (999), pp C. Bernardi, Y. Maday, and A. T. Patera, A new non conforming approach to domain decomposition: The mortar element method, in Collège de France Seminar, H. Brezis and J.-L. Lions, eds., Pitman, M. Dryja, An iterative substructuring method for elliptic mortar finite element problems with a new coarse space, East-West J. Numer. Math., 5 (997), pp C. Farhat, M. Lesoinne, P. LeTallec, K. Pierson, and D. Rixen, FETI- DP: A dual-primal unified FETI method - part I: A faster alternative to the twolevel FETI method, Internat. J. Numer. Methods Engrg., 5 (), pp C. Farhat and F.-X. Roux, A method of Finite Element Tearing and Interconnecting and its parallel solution algorithm, Int.J.Numer.Meth.Engrg., (99), pp A. Klawonn and O. B. Widlund, FETI and Neumann Neumann iterative substructuring methods: Connections and new results, Comm. Pure Appl. Math., 54 (), pp J. Mandel, Balancing domain decomposition, Comm. Numer. Meth. Engrg., 9 (99), pp J. Mandel and M. Bresina, Balancing domain decomposition for problems with large jumps in coefficients, Math.Comp., 65 (996), pp J. Mandel and C. R. Dohrmann, Convergence of a balancing domain decomposition by constraints and energy minimization, Numer. Linear Algebra Appl., (), pp J. Mandel, C. R. Dohrmann, and R. Tezaur, An algebraic theory for primal and dual substructuring methods by constraints, Appl. Numer. Math., 54 (5), pp D. Stefanica, A balancing algorithm for mortar finite elements. preprint, 5.. A. Toselli and O. B. Widlund, Domain Decomposition Methods Algorithms and Theory, vol. 4 of Series in Computational Mathematics, Springer, 5.
A 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 informationA FETI-DP Method for Mortar Finite Element Discretization of a Fourth Order Problem
A FETI-DP Method for Mortar Finite Element Discretization of a Fourth Order Problem Leszek Marcinkowski 1 and Nina Dokeva 2 1 Department of Mathematics, Warsaw University, Banacha 2, 02 097 Warszawa, Poland,
More informationMultispace and Multilevel BDDC. Jan Mandel University of Colorado at Denver and Health Sciences Center
Multispace and Multilevel BDDC Jan Mandel University of Colorado at Denver and Health Sciences Center Based on joint work with Bedřich Sousedík, UCDHSC and Czech Technical University, and Clark R. Dohrmann,
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 informationDomain Decomposition Methods for Mortar Finite Elements
Domain Decomposition Methods for Mortar Finite Elements Dan Stefanica Courant Institute of Mathematical Sciences New York University September 1999 A dissertation in the Department of Mathematics Submitted
More information20. A Dual-Primal FETI Method for solving Stokes/Navier-Stokes Equations
Fourteenth International Conference on Domain Decomposition Methods Editors: Ismael Herrera, David E. Keyes, Olof B. Widlund, Robert Yates c 23 DDM.org 2. A Dual-Primal FEI Method for solving Stokes/Navier-Stokes
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 informationThe mortar element method for quasilinear elliptic boundary value problems
The mortar element method for quasilinear elliptic boundary value problems Leszek Marcinkowski 1 Abstract We consider a discretization of quasilinear elliptic boundary value problems by the mortar version
More informationShort title: Total FETI. Corresponding author: Zdenek Dostal, VŠB-Technical University of Ostrava, 17 listopadu 15, CZ Ostrava, Czech Republic
Short title: Total FETI Corresponding author: Zdenek Dostal, VŠB-Technical University of Ostrava, 17 listopadu 15, CZ-70833 Ostrava, Czech Republic mail: zdenek.dostal@vsb.cz fax +420 596 919 597 phone
More informationThe All-floating BETI Method: Numerical Results
The All-floating BETI Method: Numerical Results Günther Of Institute of Computational Mathematics, Graz University of Technology, Steyrergasse 30, A-8010 Graz, Austria, of@tugraz.at Summary. The all-floating
More informationParallel scalability of a FETI DP mortar method for problems with discontinuous coefficients
Parallel scalability of a FETI DP mortar method for problems with discontinuous coefficients Nina Dokeva and Wlodek Proskurowski University of Southern California, Department of Mathematics Los Angeles,
More informationExtending the theory for domain decomposition algorithms to less regular subdomains
Extending the theory for domain decomposition algorithms to less regular subdomains Olof Widlund Courant Institute of Mathematical Sciences New York University http://www.cs.nyu.edu/cs/faculty/widlund/
More informationCONVERGENCE ANALYSIS OF A BALANCING DOMAIN DECOMPOSITION METHOD FOR SOLVING A CLASS OF INDEFINITE LINEAR SYSTEMS
CONVERGENCE ANALYSIS OF A BALANCING DOMAIN DECOMPOSITION METHOD FOR SOLVING A CLASS OF INDEFINITE LINEAR SYSTEMS JING LI AND XUEMIN TU Abstract A variant of balancing domain decomposition method by constraints
More informationASM-BDDC Preconditioners with variable polynomial degree for CG- and DG-SEM
ASM-BDDC Preconditioners with variable polynomial degree for CG- and DG-SEM C. Canuto 1, L. F. Pavarino 2, and A. B. Pieri 3 1 Introduction Discontinuous Galerkin (DG) methods for partial differential
More informationConvergence analysis of a balancing domain decomposition method for solving a class of indefinite linear systems
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Linear Algebra Appl. 2000; 00:1 6 [Version: 2002/09/18 v1.02] Convergence analysis of a balancing domain decomposition method for solving a class of indefinite
More informationMultispace and Multilevel BDDC
Multispace and Multilevel BDDC Jan Mandel Bedřich Sousedík Clark R. Dohrmann February 11, 2018 arxiv:0712.3977v2 [math.na] 21 Jan 2008 Abstract BDDC method is the most advanced method from the Balancing
More informationParallel Scalability of a FETI DP Mortar Method for Problems with Discontinuous Coefficients
Parallel Scalability of a FETI DP Mortar Method for Problems with Discontinuous Coefficients Nina Dokeva and Wlodek Proskurowski Department of Mathematics, University of Southern California, Los Angeles,
More informationSelecting Constraints in Dual-Primal FETI Methods for Elasticity in Three Dimensions
Selecting Constraints in Dual-Primal FETI Methods for Elasticity in Three Dimensions Axel Klawonn 1 and Olof B. Widlund 2 1 Universität Duisburg-Essen, Campus Essen, Fachbereich Mathematik, (http://www.uni-essen.de/ingmath/axel.klawonn/)
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 informationOn the Use of Inexact Subdomain Solvers for BDDC Algorithms
On the Use of Inexact Subdomain Solvers for BDDC Algorithms Jing Li a, and Olof B. Widlund b,1 a Department of Mathematical Sciences, Kent State University, Kent, OH, 44242-0001 b Courant Institute of
More informationON THE CONVERGENCE OF A DUAL-PRIMAL SUBSTRUCTURING METHOD. January 2000
ON THE CONVERGENCE OF A DUAL-PRIMAL SUBSTRUCTURING METHOD JAN MANDEL AND RADEK TEZAUR January 2000 Abstract In the Dual-Primal FETI method, introduced by Farhat et al [5], the domain is decomposed into
More informationDomain Decomposition Algorithms for an Indefinite Hypersingular Integral Equation in Three Dimensions
Domain Decomposition Algorithms for an Indefinite Hypersingular Integral Equation in Three Dimensions Ernst P. Stephan 1, Matthias Maischak 2, and Thanh Tran 3 1 Institut für Angewandte Mathematik, Leibniz
More informationINSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES. A virtual overlapping Schwarz method for scalar elliptic problems in two dimensions
INSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES A virtual overlapping Schwarz method for scalar elliptic problems in two dimensions Juan Gabriel Calvo Preprint No. 25-2017 PRAHA 2017 A VIRTUAL
More informationAlgebraic Coarse Spaces for Overlapping Schwarz Preconditioners
Algebraic Coarse Spaces for Overlapping Schwarz Preconditioners 17 th International Conference on Domain Decomposition Methods St. Wolfgang/Strobl, Austria July 3-7, 2006 Clark R. Dohrmann Sandia National
More informationAdaptive Coarse Space Selection in BDDC and FETI-DP Iterative Substructuring Methods: Towards Fast and Robust Solvers
Adaptive Coarse Space Selection in BDDC and FETI-DP Iterative Substructuring Methods: Towards Fast and Robust Solvers Jan Mandel University of Colorado at Denver Bedřich Sousedík Czech Technical University
More informationGRUPO DE GEOFÍSICA MATEMÁTICA Y COMPUTACIONAL MEMORIA Nº 8
GRUPO DE GEOFÍSICA MATEMÁTICA Y COMPUTACIONAL MEMORIA Nº 8 MÉXICO 2014 MEMORIAS GGMC INSTITUTO DE GEOFÍSICA UNAM MIEMBROS DEL GGMC Dr. Ismael Herrera Revilla iherrerarevilla@gmail.com Dr. Luis Miguel de
More informationNonoverlapping Domain Decomposition Methods with Simplified Coarse Spaces for Solving Three-dimensional Elliptic Problems
Nonoverlapping Domain Decomposition Methods with Simplified Coarse Spaces for Solving Three-dimensional Elliptic Problems Qiya Hu 1, Shi Shu 2 and Junxian Wang 3 Abstract In this paper we propose a substructuring
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 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 informationSOME PRACTICAL ASPECTS OF PARALLEL ADAPTIVE BDDC METHOD
Conference Applications of Mathematics 2012 in honor of the 60th birthday of Michal Křížek. Institute of Mathematics AS CR, Prague 2012 SOME PRACTICAL ASPECTS OF PARALLEL ADAPTIVE BDDC METHOD Jakub Šístek1,2,
More informationA Neumann-Dirichlet Preconditioner for FETI-DP 2 Method for Mortar Discretization of a Fourth Order 3 Problems in 2D 4 UNCORRECTED PROOF
1 A Neumann-Dirichlet Preconditioner for FETI-DP 2 Method for Mortar Discretization of a Fourth Order 3 Problems in 2D 4 Leszek Marcinkowski * 5 Faculty of Mathematics, University of Warsaw, Banacha 2,
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 informationOVERLAPPING SCHWARZ ALGORITHMS FOR ALMOST INCOMPRESSIBLE LINEAR ELASTICITY TR
OVERLAPPING SCHWARZ ALGORITHMS FOR ALMOST INCOMPRESSIBLE LINEAR ELASTICITY MINGCHAO CAI, LUCA F. PAVARINO, AND OLOF B. WIDLUND TR2014-969 Abstract. Low order finite element discretizations of the linear
More information33 RASHO: A Restricted Additive Schwarz Preconditioner with Harmonic Overlap
Thirteenth International Conference on Domain Decomposition ethods Editors: N. Debit,.Garbey, R. Hoppe, J. Périaux, D. Keyes, Y. Kuznetsov c 001 DD.org 33 RASHO: A Restricted Additive Schwarz Preconditioner
More informationApplication of Preconditioned Coupled FETI/BETI Solvers to 2D Magnetic Field Problems
Application of Preconditioned Coupled FETI/BETI Solvers to 2D Magnetic Field Problems U. Langer A. Pohoaţǎ O. Steinbach 27th September 2004 Institute of Computational Mathematics Johannes Kepler University
More informationBETI for acoustic and electromagnetic scattering
BETI for acoustic and electromagnetic scattering O. Steinbach, M. Windisch Institut für Numerische Mathematik Technische Universität Graz Oberwolfach 18. Februar 2010 FWF-Project: Data-sparse Boundary
More informationfor three dimensional problems are often more complicated than the quite simple constructions that work well for problems in the plane; see [23] for a
DUAL-PRIMAL FETI METHODS FOR THREE-DIMENSIONAL ELLIPTIC PROBLEMS WITH HETEROGENEOUS COEFFICIENTS AEL KLAWONN Λ, OLOF B. WIDLUND y, AND MAKSYMILIAN DRYJA z Abstract. In this paper, certain iterative substructuring
More informationFETI-DP for Elasticity with Almost Incompressible 2 Material Components 3 UNCORRECTED PROOF. Sabrina Gippert, Axel Klawonn, and Oliver Rheinbach 4
1 FETI-DP for Elasticity with Almost Incompressible 2 Material Components 3 Sabrina Gippert, Axel Klawonn, and Oliver Rheinbach 4 Lehrstuhl für Numerische Mathematik, Fakultät für Mathematik, Universität
More informationAn additive average Schwarz method for the plate bending problem
J. Numer. Math., Vol. 10, No. 2, pp. 109 125 (2002) c VSP 2002 Prepared using jnm.sty [Version: 02.02.2002 v1.2] An additive average Schwarz method for the plate bending problem X. Feng and T. Rahman Abstract
More informationNon-Conforming Finite Element Methods for Nonmatching Grids in Three Dimensions
Non-Conforming Finite Element Methods for Nonmatching Grids in Three Dimensions Wayne McGee and Padmanabhan Seshaiyer Texas Tech University, Mathematics and Statistics (padhu@math.ttu.edu) Summary. In
More informationSome Domain Decomposition Methods for Discontinuous Coefficients
Some Domain Decomposition Methods for Discontinuous Coefficients Marcus Sarkis WPI RICAM-Linz, October 31, 2011 Marcus Sarkis (WPI) Domain Decomposition Methods RICAM-2011 1 / 38 Outline Discretizations
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 informationTwo new enriched multiscale coarse spaces for the Additive Average Schwarz method
346 Two new enriched multiscale coarse spaces for the Additive Average Schwarz method Leszek Marcinkowski 1 and Talal Rahman 2 1 Introduction We propose additive Schwarz methods with spectrally enriched
More informationarxiv: v1 [math.na] 28 Feb 2008
BDDC by a frontal solver and the stress computation in a hip joint replacement arxiv:0802.4295v1 [math.na] 28 Feb 2008 Jakub Šístek a, Jaroslav Novotný b, Jan Mandel c, Marta Čertíková a, Pavel Burda a
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 31, pp. 384-402, 2008. Copyright 2008,. ISSN 1068-9613. ETNA ON THE EQUIVALENCE OF PRIMAL AND DUAL SUBSTRUCTURING PRECONDITIONERS BEDŘICH SOUSEDÍK
More informationcfl Jing Li All rights reserved, 22
NYU-CS-TR83 Dual-Primal FETI Methods for Stationary Stokes and Navier-Stokes Equations by Jing Li A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy
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 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 informationNumerische Mathematik
Numer. Math. (1996) 75: 59 77 Numerische Mathematik c Springer-Verlag 1996 Electronic Edition A preconditioner for the h-p version of the finite element method in two dimensions Benqi Guo 1, and Weiming
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 informationGroupe de Travail Méthodes Numériques
Groupe de Travail Méthodes Numériques Laboratoire Jacques-Louis Lions, Paris 6 Monday, May 11th, 2009 Domain Decomposition with Lagrange Multipliers: A continuous framework for a FETI-DP+Mortar method
More informationCoupled FETI/BETI for Nonlinear Potential Problems
Coupled FETI/BETI for Nonlinear Potential Problems U. Langer 1 C. Pechstein 1 A. Pohoaţǎ 1 1 Institute of Computational Mathematics Johannes Kepler University Linz {ulanger,pechstein,pohoata}@numa.uni-linz.ac.at
More informationOverlapping Schwarz Preconditioners for Spectral. Problem in H(curl)
Overlapping Schwarz Preconditioners for Spectral Nédélec Elements for a Model Problem in H(curl) Technical Report TR2002-83 November 22, 2002 Department of Computer Science Courant Institute of Mathematical
More informationOptimal Interface Conditions for an Arbitrary Decomposition into Subdomains
Optimal Interface Conditions for an Arbitrary Decomposition into Subdomains Martin J. Gander and Felix Kwok Section de mathématiques, Université de Genève, Geneva CH-1211, Switzerland, Martin.Gander@unige.ch;
More informationSubstructuring for multiscale problems
Substructuring for multiscale problems Clemens Pechstein Johannes Kepler University Linz (A) jointly with Rob Scheichl Marcus Sarkis Clark Dohrmann DD 21, Rennes, June 2012 Outline 1 Introduction 2 Weighted
More informationTR THREE-LEVEL BDDC IN THREE DIMENSIONS
R2005-862 REE-LEVEL BDDC IN REE DIMENSIONS XUEMIN U Abstract BDDC methods are nonoverlapping iterative substructuring domain decomposition methods for the solution of large sparse linear algebraic systems
More information18. Balancing Neumann-Neumann for (In)Compressible Linear Elasticity and (Generalized) Stokes Parallel Implementation
Fourteenth nternational Conference on Domain Decomposition Methods Editors: smael Herrera, David E Keyes, Olof B Widlund, Robert Yates c 23 DDMorg 18 Balancing Neumann-Neumann for (n)compressible Linear
More informationINSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES
INSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES On the approximation of a virtual coarse space for domain decomposition methods in two dimensions Juan Gabriel Calvo Preprint No. 31-2017 PRAHA 2017
More informationDomain Decomposition solvers (FETI)
Domain Decomposition solvers (FETI) a random walk in history and some current trends Daniel J. Rixen Technische Universität München Institute of Applied Mechanics www.amm.mw.tum.de rixen@tum.de 8-10 October
More informationAdditive Average Schwarz Method for a Crouzeix-Raviart Finite Volume Element Discretization of Elliptic Problems
Additive Average Schwarz Method for a Crouzeix-Raviart Finite Volume Element Discretization of Elliptic Problems Atle Loneland 1, Leszek Marcinkowski 2, and Talal Rahman 3 1 Introduction In this paper
More informationSchwarz Preconditioner for the Stochastic Finite Element Method
Schwarz Preconditioner for the Stochastic Finite Element Method Waad Subber 1 and Sébastien Loisel 2 Preprint submitted to DD22 conference 1 Introduction The intrusive polynomial chaos approach for uncertainty
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 informationParallel Sums and Adaptive BDDC Deluxe
249 Parallel Sums and Adaptive BDDC Deluxe Olof B. Widlund 1 and Juan G. Calvo 2 1 Introduction There has recently been a considerable activity in developing adaptive methods for the selection of primal
More informationAN ANALYSIS OF A FETI DP ALGORITHM ON IRREGULAR SUBDOMAINS IN THE PLANE TR
AN ANALYSIS OF A FETI DP ALGORITHM ON IRREGULAR SUBDOMAINS IN THE PLANE TR27 889 AXEL KLAWONN, OLIVER RHEINBACH, AND OLOF B. WIDLUND Abstract. In the theory for domain decomposition algorithms of the iterative
More informationMultilevel Preconditioning of Graph-Laplacians: Polynomial Approximation of the Pivot Blocks Inverses
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, 751 05 Uppsala,
More informationParallel Scalable Iterative Substructuring: Robust Exact and Inexact FETI-DP Methods with Applications to Elasticity
Parallel Scalable Iterative Substructuring: Robust Exact and Inexact FETI-DP Methods with Applications to Elasticity Oliver Rheinbach geboren in Hilden Fachbereich Mathematik Universität Duisburg-Essen
More informationPreconditioning of Saddle Point Systems by Substructuring and a Penalty Approach
Preconditioning of Saddle Point Systems by Substructuring and a Penalty Approach Clark R. Dohrmann 1 Sandia National Laboratories, crdohrm@sandia.gov. Sandia is a multiprogram laboratory operated by Sandia
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 informationA LAGRANGE MULTIPLIER METHOD FOR ELLIPTIC INTERFACE PROBLEMS USING NON-MATCHING MESHES
A LAGRANGE MULTIPLIER METHOD FOR ELLIPTIC INTERFACE PROBLEMS USING NON-MATCHING MESHES P. HANSBO Department of Applied Mechanics, Chalmers University of Technology, S-4 96 Göteborg, Sweden E-mail: hansbo@solid.chalmers.se
More informationROBUST BDDC PRECONDITIONERS FOR REISSNER-MINDLIN PLATE BENDING PROBLEMS AND MITC ELEMENTS
ROBUST BDDC PRECONDITIONERS FOR REISSNER-MINDLIN PLATE BENDING PROBLEMS AND MITC ELEMENTS L. BEIRÃO DA VEIGA, C. CHINOSI, C. LOVADINA, AND L. F. PAVARINO Abstract. A Balancing Domain Decomposition Method
More informationAn Efficient FETI Implementation on Distributed Shared Memory Machines with Independent Numbers of Subdomains and Processors
Contemporary Mathematics Volume 218, 1998 B 0-8218-0988-1-03024-7 An Efficient FETI Implementation on Distributed Shared Memory Machines with Independent Numbers of Subdomains and Processors Michel Lesoinne
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 informationDOMAIN DECOMPOSITION FOR LESS REGULAR SUBDOMAINS: OVERLAPPING SCHWARZ IN TWO DIMENSIONS TR
DOMAIN DECOMPOSITION FOR LESS REGULAR SUBDOMAINS: OVERLAPPING SCHWARZ IN TWO DIMENSIONS TR2007-888 CLARK R. DOHRMANN, AXEL KLAWONN, AND OLOF B. WIDLUND Abstract. In the theory of domain decomposition methods,
More informationSharp condition number estimates for the symmetric 2-Lagrange multiplier method
Sharp condition number estimates for the symmetric -Lagrange multiplier method Stephen W. Drury and Sébastien Loisel Abstract Domain decomposition methods are used to find the numerical solution of large
More informationA Nonoverlapping Subdomain Algorithm with Lagrange Multipliers and its Object Oriented Implementation for Interface Problems
Contemporary Mathematics Volume 8, 998 B 0-88-0988--03030- A Nonoverlapping Subdomain Algorithm with Lagrange Multipliers and its Object Oriented Implementation for Interface Problems Daoqi Yang. Introduction
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 informationGRUPO DE GEOFÍSICA MATEMÁTICA Y COMPUTACIONAL MEMORIA Nº 6
GRUPO DE GEOFÍSICA MATEMÁTICA Y COMPUTACIONAL MEMORIA Nº 6 MÉXICO 2014 MEMORIAS GGMC INSTITUTO DE GEOFÍSICA UNAM MIEMBROS DEL GGMC Dr. Ismael Herrera Revilla iherrerarevilla@gmail.com Dr. Luis Miguel de
More informationUniversität Stuttgart
Universität Stuttgart Multilevel Additive Schwarz Preconditioner For Nonconforming Mortar Finite Element Methods Masymilian Dryja, Andreas Gantner, Olof B. Widlund, Barbara I. Wohlmuth Berichte aus dem
More informationA Multigrid Method for Two Dimensional Maxwell Interface Problems
A Multigrid Method for Two Dimensional Maxwell Interface Problems Susanne C. Brenner Department of Mathematics and Center for Computation & Technology Louisiana State University USA JSA 2013 Outline A
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 informationA very short introduction to the Finite Element Method
A very short introduction to the Finite Element Method Till Mathis Wagner Technical University of Munich JASS 2004, St Petersburg May 4, 2004 1 Introduction This is a short introduction to the finite element
More informationA BDDC ALGORITHM FOR RAVIART-THOMAS VECTOR FIELDS TR
A BDDC ALGORITHM FOR RAVIART-THOMAS VECTOR FIELDS DUK-SOON OH, OLOF B WIDLUND, AND CLARK R DOHRMANN TR013-951 Abstract A BDDC preconditioner is defined by a coarse component, expressed in terms of primal
More informationAn Iterative Domain Decomposition Method for the Solution of a Class of Indefinite Problems in Computational Structural Dynamics
An Iterative Domain Decomposition Method for the Solution of a Class of Indefinite Problems in Computational Structural Dynamics Charbel Farhat a, and Jing Li a a Department of Aerospace Engineering Sciences
More informationWeighted Regularization of Maxwell Equations Computations in Curvilinear Polygons
Weighted Regularization of Maxwell Equations Computations in Curvilinear Polygons Martin Costabel, Monique Dauge, Daniel Martin and Gregory Vial IRMAR, Université de Rennes, Campus de Beaulieu, Rennes,
More informationIN p-version AND SPECTRAL ELEMENT METHODS MARIO A. CASARIN
DIAGONAL EDGE PRECONDITIONERS IN p-version AND SPECTRAL ELEMENT METHODS MARIO A. CASARIN Abstract. Domain decomposition preconditioners for high-order Galerkin methods in two dimensions are often built
More informationOptimal Left and Right Additive Schwarz Preconditioning for Minimal Residual Methods with Euclidean and Energy Norms
Optimal Left and Right Additive Schwarz Preconditioning for Minimal Residual Methods with Euclidean and Energy Norms Marcus Sarkis Worcester Polytechnic Inst., Mass. and IMPA, Rio de Janeiro and Daniel
More informationAN ADAPTIVE CHOICE OF PRIMAL CONSTRAINTS FOR BDDC DOMAIN DECOMPOSITION ALGORITHMS
lectronic Transactions on Numerical Analysis. Volume 45, pp. 524 544, 2016. Copyright c 2016,. ISSN 1068 9613. TNA AN ADAPTIV CHOIC O PRIMAL CONSTRAINTS OR BDDC DOMAIN DCOMPOSITION ALGORITHMS JUAN G. CALVO
More informationThe Mortar Boundary Element Method
The Mortar Boundary Element Method A Thesis submitted for the degree of Doctor of Philosophy by Martin Healey School of Information Systems, Computing and Mathematics Brunel University March 2010 Abstract
More information1 Introduction In this paper, we propose and study a balancing Neumann-Neumann domain decomposition method for incompressible Stokes equations. Neuman
Balancing Neumann-Neumann methods for incompressible Stokes equations Luca F. Pavarino Λ Olof B. Widlund y February 7, 1 Abstract Balancing Neumann-Neumann methods are introduced and studied for incompressible
More informationAN INTRODUCTION TO DOMAIN DECOMPOSITION METHODS. Gérard MEURANT CEA
Marrakech Jan 2003 AN INTRODUCTION TO DOMAIN DECOMPOSITION METHODS Gérard MEURANT CEA Introduction Domain decomposition is a divide and conquer technique Natural framework to introduce parallelism in the
More informationTechnische Universität Graz
Technische Universität Graz Robust boundary element domain decomposition solvers in acoustics O. Steinbach, M. Windisch Berichte aus dem Institut für Numerische Mathematik Bericht 2009/9 Technische Universität
More informationMultipréconditionnement adaptatif pour les méthodes de décomposition de domaine. Nicole Spillane (CNRS, CMAP, École Polytechnique)
Multipréconditionnement adaptatif pour les méthodes de décomposition de domaine Nicole Spillane (CNRS, CMAP, École Polytechnique) C. Bovet (ONERA), P. Gosselet (ENS Cachan), A. Parret Fréaud (SafranTech),
More informationTwo-scale Dirichlet-Neumann preconditioners for boundary refinements
Two-scale Dirichlet-Neumann preconditioners for boundary refinements Patrice Hauret 1 and Patrick Le Tallec 2 1 Graduate Aeronautical Laboratories, MS 25-45, California Institute of Technology Pasadena,
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 informationMassively Parallel Domain Decomposition Preconditioner for the High-Order Galerkin Least Squares Finite Element Method
Massively Parallel Domain Decomposition Preconditioner for the High-Order Galerkin Least Squares Finite Element Method Masayuki Yano Massachusetts Institute of Technology Department of Aeronautics and
More informationADDITIVE SCHWARZ FOR SCHUR COMPLEMENT 305 the parallel implementation of both preconditioners on distributed memory platforms, and compare their perfo
35 Additive Schwarz for the Schur Complement Method Luiz M. Carvalho and Luc Giraud 1 Introduction Domain decomposition methods for solving elliptic boundary problems have been receiving increasing attention
More informationADAPTIVE MIXED HYBRID AND MACRO HYBRID FINITE ELEMENT METHODS. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXVII, 1(1998), pp. 159 179 159 ADAPTIVE MIXED HYBRID AND MACRO HYBRID FINITE ELEMENT METHODS R. H. W. HOPPE and B. I. WOHLMUTH Abstract. In this paper, we consider efficient
More informationA posteriori error estimation for elliptic problems
A posteriori error estimation for elliptic problems Praveen. C praveen@math.tifrbng.res.in Tata Institute of Fundamental Research Center for Applicable Mathematics Bangalore 560065 http://math.tifrbng.res.in
More informationNumerical Analysis of Higher Order Discontinuous Galerkin Finite Element Methods
Numerical Analysis of Higher Order Discontinuous Galerkin Finite Element Methods Contents Ralf Hartmann Institute of Aerodynamics and Flow Technology DLR (German Aerospace Center) Lilienthalplatz 7, 3808
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 information