A FETI-DP Method for Mortar Finite Element Discretization of a Fourth Order Problem
|
|
- Kathryn Shelton
- 5 years ago
- Views:
Transcription
1 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, Warszawa, Poland, lmarcin@mimuw.edu.pl 2 Department of Mathematics and Computer Science, Clarkson University, PO Box 5815, Potsdam, NY , USA, ndokeva@clarkson.edu Summary. In this paper we present a FETI-DP type algorithm for solving the system of algebraic equations arising from the mortar finite element discretization of a fourth order problem on a nonconforming mesh. A conforming reduced Hsieh- Clough-Tocher macro element is used locally in the subdomains. We present new FETI-DP discrete problems and later introduce new parallel preconditioners for two cases: where there are no crosspoints in the coarse division of subdomains and in the general case. 1 Introduction The mortar methods are effective methods for constructing approximations of PDE problems on nonconforming meshes. They impose weak integral coupling conditions across the interfaces on the discrete solutions, cf. [1]. In this paper we present a FETI-DP method (dual primal Finite Element Tearing and Interconnecting, see [6, 9, 8] for solving discrete problems arising from a mortar discretization of a fourth order model problem. The original domain is divided into subdomains and a local conforming reduced HCT (Hsieh-Clough-Tocher macro element discretization is introduced in each subdomain. The discrete space is constructed using mortar discretization, see [10]. Then the degrees of freedom corresponding to the interior nodal points are eliminated as usually in all substructuring methods. The remaining system of unknowns is solved by a FETI-DP method. Many variants of FETI-DP methods for solving systems arising from the discretizations on a single conforming mesh of second and fourth order problems are fully analyzed, cf. [9, 8]. Recently there have been a few FETI-DP type algorithms for mortar discretization of second order problems, cf. [11, 5, 4, 3], and [7]. To our knowledge there are no FETI type algorithms for solving systems of equations arising from a mortar discretization of a fourth order problem in the literature. This work was partially supported by Polish Scientific Grant 2/P03A/005/24.
2 584 L. Marcinkowski, N. Dokeva The remainder of the paper is organized as follows. In Section 2 we introduce our differential and discrete problems. When there are no crosspoints in the coarse division of the domain, the FETI operator takes a much simpler form and therefore this case is presented separately together with a parallel preconditioner in Section 3, while Section 4 is dedicated to a short description of the FETI-DP operator and a respective preconditioner in the general case. 2 Differential and Discrete Problems Let Ω be a polygonal domain in R 2. Then our model problem is to find u H 2 0(Ω such that a(u, v = f(v v H 2 0(Ω, (1 where u is the displacement, f L 2 (Ω is the body force, a(u, v = [ u v + (1 ν (2u x1 x 2 v x1 x 2 u x1 x 1 v x2 x 2 u x2 x 2 v x1 x 1 ] dx. Here Ω H 2 0(Ω = {v H 2 (Ω : v = nv = 0 on Ω}, n is the normal unit derivative outward to Ω, and u xi x j := 2 u x i x j for i, j = 1, 2. We assume that the Poisson ratio ν satisfies 0 < ν < 1/2. From the Lax-Milgram theorem and the continuity and ellipticity of the bilinear form a(, it follows that there exists a unique solution of this problem. Next we assume that Ω is a union of disjoint polygonal substructures Ω i which form a coarse triangulation of Ω, i.e. the intersection of the boundaries of two different subdomains Ω k Ω l, k l, is either the empty set, a vertex or a common edge. We also assume that this triangulation is shape regular in the sense of Section 2, p. 5 in [2]. An important role is played by the interface Γ, defined as the union of all open edges of substructures, which are not on the boundary of Ω. In each subdomain Ω k we introduce a quasiuniform triangulation T h (Ω k made of triangles. Let h k = max τ Th (Ω k diam τ be the parameter of this triangulation. In each Ω k we introduce a local conforming reduced Hsieh-Clough-Tocher (RHCT macro finite element space X h (Ω k as follows, cf. Figure 1: X h (Ω k = {v C 1 (Ω k : v τ P 3(τ i, for triangles τ i, i = 1, 2, 3, (2 formed by connecting the vertices of τ T h (Ω k to its centroid, nv is linear on each edge of τ, and v = nv = 0 on Ω k Ω}. The degrees of freedom of RHCT macro elements are given by {u(p i, u x1 (p i, u x2 (p i}, i = 1, 2, 3, (3 for the three vertices p i of an element τ T h (Ω k, cf. Figure 1. We introduce next an auxiliary global space X h (Ω = N k=1 X h(ω k, and the so called broken bilinear form:
3 FETI-DP for Mortar FE for 4th Order Problem 585 Fig. 1. Reduced HCT element a h (u, v = N a k (u, v, where a k (u, v = [ u v + (1 ν (2u x1 x 2 v x1 x 2 u x1 x 1 v x2 x 2 u x2 x 2 v x1 x 1 ] dx. Ω k k=1 Then let X(Ω be the subspace of X h (Ω consisting of all functions which have all degrees of freedom (dofs of the RHCT elements continuous at the crosspoints the vertices of the substructures. The interface Γ kl which is a common edge of two neighboring substructures Ω k and Ω l inherits two 1D independent triangulations: T h,k (Γ kl the h k one from T h (Ω k and T h,l (Γ kl the h l one from T h (Ω l. Hence we can distinguish the sides (or meshes of this interface. Let γ m,k be the side of Γ kl associated with Ω k and called master (mortar and let be the side corresponding to Ω l and called slave (nonmortar. Note that both the master and the slave occupy the same geometrical position of Γ kl. The set of vertices of T h,k (γ m,k on γ m,k is denoted by γ m,k,h and the set of nodes of T h,l ( on by,h. In order to obtain our results we need a technical assumption of a uniform bound for the ratio h γm /h δm for any interface Γ kl = γ m,k =. An important role in our algorithm is played by four trace spaces onto the edges of the substructures. For each interface Γ kl = Ω k Ω l let W t,k (Γ kl be the space of C 1 continuous functions piecewise cubic on the 1D triangulation T h,k (Γ kl and let W n,k (Γ kl be the space of continuous piecewise linear functions on T h,k (Γ kl. The spaces W t,l (Γ kl and W n,l (Γ kl are defined analogously, but on the h l triangulation T h,l (Γ kl of Γ kl. Note that these four spaces are the tangential and normal trace spaces onto the interface Γ kl Γ of functions from X h (Ω k and X h (Ω l, respectively. We also need to introduce two test function spaces for each slave = Γ kl. Let M t( be the space of all C 1 continuous piecewise cubic on T h,l ( functions which are linear on the two end elements of T h,l ( and let M n( be the space of all continuous piecewise linear on T h,l ( functions which are constant on the two end elements of T h,l (. We now define the global space M(Γ = Γ Mt( M n( and the bilinear form b(u, ψ defined over X(Ω M(Γ as follows: let u = (u 1,..., u N X(Ω and ψ = (ψ m δm = (ψ m,t, ψ m,n δm M(Γ, then let
4 586 L. Marcinkowski, N. Dokeva b(u, ψ = b m,t(u, ψ m,t + b m,n(u, ψ m,n δ m Γ with b m,t(u, ψ m,t = (u k u l ψ m,y ds (4 δ m b m,n(u, ψ m,n = ( nu k nu l ψ m,n ds. (5 δ m Then our discrete problem is to find the pair (u h, λ X(Ω M(Γ such that a h (u h, v + b(v, λ = f(v v X(Ω (6 b(u h, φ = 0 φ M(Γ. (7 Note that if we introduce the discrete space V h = {u X(Ω : b(u, φ = 0 φ M(Γ} then u h is the unique function in V h that satisfies a h (u h, v = f(v v V h, which is a standard mortar discrete problem formulation, cf. e.g. [10]. Note that we can split the matrix K (l the matrix representation of a l (u, v in the standard nodal basis of X h (Ω l as: K (l := K (l ii K (l ci K (l ic K (l K(l ir cc K (l cr K (l ri K rc (l K rr (l, (8 where in the rows the indices i, c and r refer to the unknowns u (i corresponding to the interior nodes, u (c to the crosspoints, and u (r to the remaining nodes, i.e. those related to the edges. 2.1 Matrix Form of the Mortar Conditions Note that (7 is equivalent to two mortar conditions on each slave = γ m,k = Γ kl : b m,t(u, φ = (u k u l φ ds = 0 φ M t( (9 δ m b m,n(u, ψ = ( nu k nu l ψ ds = 0 ψ M n(. (10 δ m Introducing the following splitting of two vectors representing the tangential and normal traces u δm,l and nu δm,l we get u δm,l = u (r + u (c and nu δm,l = nu (r + nu (c on a slave Ω l, cf. (8. We can now rewrite (9 and (10 in a matrix form as B (r t, u (r + B (c t, u (c = B (r t,γ m,k u (r γ m,k + B (c t,γ m,k u (c γ m,k, (11
5 FETI-DP for Mortar FE for 4th Order Problem 587 B (r n, nu (r + B (c n, nu (c = B (r n,γ m,k nu (r γ m,k + B (c n,γ m,k nu (c γ m,k, where the matrices B t,δm,l = (B (r t,, B (c t, and B n,δm,l = (B (r t,γ m,k, B (c t,γ m,k are mass matrices obtained by substituting the standard nodal basis functions of W t,l (, W n,l ( and M t(, M n( into (9 and (10, respectively i.e. B t,δm,l = {(φ x,s, ψ y,r} x,y δm,l,h φ x,s W t(, ψ y,r M t(, (12 s,r=0,1 B n,δm,l = {(φ x, ψ y} x,y δm,l,h φ x W n(, ψ y M n(, (13 where φ x,s, (ψ x,s is a nodal basis function of W t(, (M t( associated with a vertex x of T h,l ( and is either a value if s = 0 or a derivative if s = 1, and φ x W n,l ( and ψ x, M n( are nodal basis function of these respective spaces equal to one at the node x and zero at all remaining nodal points on. The matrices B t,γm,k = (B (r n,, B (c n,, and B n,γm,k = (B n,γ (r m,k, B n,γ (c m,k are defined analogously. Note that B (r t,, B (r n, are positive definite square matrices, see e.g. [10], but the other matrices in (11 are in general rectangular. We also need the block-diagonal matrices ( ( Bt,δm,l 0 Bt,γk,l 0 B δm,l = B 0 B γk,l = n,δm,l 0 B n,γk,l. (14 3 FETI-DP Problem No Crosspoints Case In this section we present a FETI-DP formulation for the case with no crosspoints, i.e. two subdomains are either disjoint or have a common edge, cf. Figure 2. In this case both the FETI-DP problem and the preconditioner are fully parallel and simple to describe and implement. Ω 1 Ω 1 Ω 2 Ω 3 Ω 4 Ω 2 Ω 3 Fig. 2. Decompositions of Ω into subdomains with no crosspoints 3.1 Definition of the FETI Method We now reformulate the system (6 (7 as follows K ii K ir 0 u (i f i K := K ri K rr Br T u (r = f r, (15 0 B r 0 λ 0
6 588 L. Marcinkowski, N. Dokeva where B r = diag{b r,δm,l } δm with B r,δm,l = and K ii are block diagonal matrices of K (l rr ( I δm,l, (B (r 1 B γ (r m,k. Here K rr and K (l ii, respectively, cf. (8, and λ = {(B (r T }λ. Next the unknowns related to interior nodes and crosspoints, i.e. u (i in (15, are eliminated, which yields a new system Su (r + B T r λ = g r, B ru (r = 0, (16 where S = K rr K ri (K ii 1 K ir and g r = f r K ri (K ii 1 f i. We now eliminate u (r and we end up with the following FETI-DP problem find λ M(Γ such that F( λ = d, (17 where d = B rs 1 g r and F = B rs 1 B T r. Note that both S and B are block diagonal matrices due to the assumption that there are no crosspoints. Next we introduce the following parallel preconditioner M 1 = B rsb T r. ( Convergence Estimates We say that the coarse triangulation is in Neumann-Dirichlet ordering if every subdomain has either all edges as slaves or all as mortars. In the case of no crosspoints it is always possible to choose the master-slave sides so as to obtain an N-D ordering of subdomains. We have the following theorem in which a condition bound is established: Theorem 1. For any λ M(Γ it holds that c (1 + log(h/h p Mλ, λ Fλ, λ C Mλ, λ, where c and C are positive constants independent of any mesh parameters, H = max k H k and h = min k h k, p = 0 in the case of Neumann-Dirichlet ordering and p = 2 in general case. 4 General Case Here we present briefly the case with crosspoints: the matrix formulation of (6 (7 is as follows: K ii K ic K ir 0 u (i f i K := K ci Kcc K cr Bc T u (c K ri K rc K rr Br T u (r = f c f r, (19 0 B c B r 0 λ 0 where the global block matrices B c = diag{b c,δm,l } and B r = diag{b r,δm,l } are split into local ones defined over the vector representation spaces of traces on the interface Γ kl = γ m,k = :
7 B c,δm,l = FETI-DP for Mortar FE for 4th Order Problem 589 ( (B (r 1 B (c, (B (r 1 B γ (c m,k, (20 and B r,δm,l is defined in (15. Here K cc is a block built of K (l cc taking into account the continuity of dofs at crosspoints, λ = {(B (r T }λ, and K rr and K ii are block diagonal matrices as in (15. Next we eliminate the unknowns related to the interior nodes and crosspoints i.e. u (i, u (c in (19 and we get Ŝu (r + ˆB T λ = ˆf r, ˆBu (r + Ŝcc λ = ˆf c, ( 1 Kir where the matrices are defined as follows: Ŝ = K rr (K ri K rc K i&c K ( ( cr Kir 0 1 ˆB = B r (0 B c K i&c K i&c = ( Kii K ic such that K ci Kcc 1, and Ŝcc = (0 Bc K i&c (21 K cr Bc T with. We now eliminate u (r and we end up with finding λ M(Γ F( λ = d, (22 where d = f c ˆBŜ 1 f r and F = Ŝcc ˆBŜ 1 ˆBT. Next we introduce the following parallel preconditioner: M 1 = B rs rrbr T where S rr = diag{s rr (l } N l=1 with S rr (l = (K rr (l K (l ri (K(l ii 1 K (l ir, i.e. S(l rr is the respective submatrix of the Schur matrix S (l over Ω l. Then in the case of Neumann-Dirichlet ordering we have that the condition number κ(m 1 F is bounded by (1 + log(h/h 2 and in the general case by (1 + log(h/h 4., References [1] C. Bernardi, Y. Maday, and A.T. Patera. A new nonconforming approach to domain decomposition: the mortar element method. In Nonlinear Partial Differential Equations and Their Applications. Collège de France Seminar, Vol. XI (Paris, , volume 299 of Pitman Res. Notes Math. Ser., pages Longman Sci. Tech., Harlow, [2] S.C. Brenner. The condition number of the Schur complement in domain decomposition. Numer. Math., 83(2: , [3] N. Dokeva, M. Dryja, and W. Proskurowski. A FETI-DP preconditioner with a special scaling for mortar discretization of elliptic problems with discontinuous coefficients. SIAM J. Numer. Anal., 44(1: , [4] M. Dryja and W. Proskurowski. On preconditioners for mortar discretization of elliptic problems. Numer. Linear Algebra Appl., 10(1-2:65 82, [5] M. Dryja and O.B. Widlund. A FETI-DP method for a mortar discretization of elliptic problems. In Recent developments in domain decomposition methods (Zürich, 2001, volume 23 of Lect. Notes Comput. Sci. Eng., pages Springer, Berlin, [6] C. Farhat, M. Lesoinne, and K. Pierson. A scalable dual-primal domain decomposition method. Numer. Linear Algebra Appl., 7(7-8: , 2000.
8 590 L. Marcinkowski, N. Dokeva [7] H.H. Kim and C.-O. Lee. A preconditioner for the FETI-DP formulation with mortar methods in two dimensions. SIAM J. Numer. Anal., 42(5: , [8] A. Klawonn, O.B. Widlund, and M. Dryja. Dual-primal FETI methods for three-dimensional elliptic problems with heterogeneous coefficients. SIAM J. Numer. Anal., 40(1: , [9] J. Mandel and R. Tezaur. On the convergence of a dual-primal substructuring method. Numer. Math., 88(3: , [10] L. Marcinkowski. A mortar element method for some discretizations of a plate problem. Numer. Math., 93(2: , [11] D. Stefanica and A. Klawonn. The FETI method for mortar finite elements. In Eleventh International Conference on Domain Decomposition Methods (London, 1998, pages DDM.org, Augsburg, 1999.
An 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationFinite Elements. Colin Cotter. February 22, Colin Cotter FEM
Finite Elements February 22, 2019 In the previous sections, we introduced the concept of finite element spaces, which contain certain functions defined on a domain. Finite element spaces are examples of
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationA Domain Decomposition Method for Quasilinear Elliptic PDEs Using Mortar Finite Elements
W I S S E N T E C H N I K L E I D E N S C H A F T A Domain Decomposition Method for Quasilinear Elliptic PDEs Using Mortar Finite Elements Matthias Gsell and Olaf Steinbach Institute of Computational Mathematics
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 informationDual-Primal Isogeometric Tearing and Interconnecting Solvers for Continuous and Discontinuous Galerkin IgA Equations
Dual-Primal Isogeometric Tearing and Interconnecting Solvers for Continuous and Discontinuous Galerkin IgA Equations Christoph Hofer and Ulrich Langer Doctoral Program Computational Mathematics Numerical
More informationIsogEometric Tearing and Interconnecting
IsogEometric Tearing and Interconnecting Christoph Hofer and Ludwig Mitter Johannes Kepler University, Linz 26.01.2017 Doctoral Program Computational Mathematics Numerical Analysis and Symbolic Computation
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 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 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 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 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 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 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 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 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 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 informationAND BARBARA I. WOHLMUTH
A QUASI-DUAL LAGRANGE MULTIPLIER SPACE FOR SERENDIPITY MORTAR FINITE ELEMENTS IN 3D BISHNU P. LAMICHHANE AND BARBARA I. WOHLMUTH Abstract. Domain decomposition techniques provide a flexible tool for the
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 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 informationCapacitance Matrix Method
Capacitance Matrix Method Marcus Sarkis New England Numerical Analysis Day at WPI, 2019 Thanks to Maksymilian Dryja, University of Warsaw 1 Outline 1 Timeline 2 Capacitance Matrix Method-CMM 3 Applications
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 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 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 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] 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 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 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-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 informationBasics and some applications of the mortar element method
GAMM-Mitt. 28, No. 2, 97 123 (2005) Basics and some applications of the mortar element method Christine Bernardi 1, Yvon Maday 1, and Francesca Rapetti 2 1 Laboratoire Jacques-Louis Lions, C.N.R.S. & université
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 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 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 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 informationON THE CONVERGENCE OF A DUAL-PRIMAL SUBSTRUCTURING METHOD. January 2000 Revised April 2000
ON THE CONVERGENCE OF A DUAL-PRIMAL SUBSTRUCTURING METHOD JAN MANDEL AND RADEK TEZAUR January 2000 Revised April 2000 Abstract In te Dual-Primal FETI metod, introduced by Farat et al [5], te domain is
More informationScalable BETI for Variational Inequalities
Scalable BETI for Variational Inequalities Jiří Bouchala, Zdeněk Dostál and Marie Sadowská Department of Applied Mathematics, Faculty of Electrical Engineering and Computer Science, VŠB-Technical University
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 informationScalable Domain Decomposition Preconditioners For Heterogeneous Elliptic Problems
Scalable Domain Decomposition Preconditioners For Heterogeneous Elliptic Problems Pierre Jolivet, F. Hecht, F. Nataf, C. Prud homme Laboratoire Jacques-Louis Lions Laboratoire Jean Kuntzmann INRIA Rocquencourt
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 informationPhD dissertation defense
Isogeometric mortar methods with applications in contact mechanics PhD dissertation defense Brivadis Ericka Supervisor: Annalisa Buffa Doctor of Philosophy in Computational Mechanics and Advanced Materials,
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 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 informationScientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1
Scientific Computing WS 2017/2018 Lecture 18 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 18 Slide 1 Lecture 18 Slide 2 Weak formulation of homogeneous Dirichlet problem Search u H0 1 (Ω) (here,
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 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 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 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 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 informationFinite Elements. Colin Cotter. January 15, Colin Cotter FEM
Finite Elements January 15, 2018 Why Can solve PDEs on complicated domains. Have flexibility to increase order of accuracy and match the numerics to the physics. has an elegant mathematical formulation
More informationAN ADAPTIVE CHOICE OF PRIMAL CONSTRAINTS FOR BDDC DOMAIN DECOMPOSITION ALGORITHMS TR
AN ADAPTIVE CHOICE OF PRIMAL CONSTRAINTS FOR BDDC DOMAIN DECOMPOSITION ALGORITHMS JUAN G. CALVO AND OLOF B. WIDLUND TR2015-979 Abstract. An adaptive choice for primal spaces, based on parallel sums, is
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 informationChapter 5 A priori error estimates for nonconforming finite element approximations 5.1 Strang s first lemma
Chapter 5 A priori error estimates for nonconforming finite element approximations 51 Strang s first lemma We consider the variational equation (51 a(u, v = l(v, v V H 1 (Ω, and assume that the conditions
More informationBasic Principles of Weak Galerkin Finite Element Methods for PDEs
Basic Principles of Weak Galerkin Finite Element Methods for PDEs Junping Wang Computational Mathematics Division of Mathematical Sciences National Science Foundation Arlington, VA 22230 Polytopal Element
More informationXIAO-CHUAN CAI AND MAKSYMILIAN DRYJA. strongly elliptic equations discretized by the nite element methods.
Contemporary Mathematics Volume 00, 0000 Domain Decomposition Methods for Monotone Nonlinear Elliptic Problems XIAO-CHUAN CAI AND MAKSYMILIAN DRYJA Abstract. In this paper, we study several overlapping
More informationA P4 BUBBLE ENRICHED P3 DIVERGENCE-FREE FINITE ELEMENT ON TRIANGULAR GRIDS
A P4 BUBBLE ENRICHED P3 DIVERGENCE-FREE FINITE ELEMENT ON TRIANGULAR GRIDS SHANGYOU ZHANG DEDICATED TO PROFESSOR PETER MONK ON THE OCCASION OF HIS 6TH BIRTHDAY Abstract. On triangular grids, the continuous
More informationScientific Computing WS 2018/2019. Lecture 15. Jürgen Fuhrmann Lecture 15 Slide 1
Scientific Computing WS 2018/2019 Lecture 15 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 15 Slide 1 Lecture 15 Slide 2 Problems with strong formulation Writing the PDE with divergence and gradient
More informationLECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES)
LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES) RAYTCHO LAZAROV 1 Notations and Basic Functional Spaces Scalar function in R d, d 1 will be denoted by u,
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 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 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 information