Summary
The importance of using coarse components, and thus at least one additional level, in the design of domain decomposition methods has been understood for at least twenty years. For many problems of interest, such a device, which provides at least a minimal amount of global transfer of information in each step, is necessary in order to obtain convergence rates which are independent of the number of subdomains. An historical overview, colored by the scientific history of its author, is given of the development of such coarse components of the domain decomposition algorithms. These algorithms are all preconditioned conjugate gradient methods or they are accelerated by using some alternative Krylov space method. The preconditioners are built from solvers of the given problem restricted to subdomains and a coarse approximation which often can be quite exotic.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agoshkov, V.I.: Poincaré-Steklov operators and domain decomposition methods in finite dimensional spaces. In R. Glowinski, G.H. Golub, G.A. Meurant, and J. Périaux, eds., First International Symposium on Domain Decomposition Methods for Partial Differential Equations, Philadelphia, PA, 1988. SIAM.
Babuška, I.: Über Schwarzsche Algorithmen in partiellen Differentialgleichungen der mathematischen Physik. ZAMM, 37(7/8):243–245, 1957.
Bourgat, J.-F., Glowinski, R., Le Tallec, P., Vidrascu, M.: Variational formulation and algorithm for trace operator in domain decomposition calculations. In T. Chan, R. Glowinski, J. Périaux, and O. Widlund, eds., Domain Decomposition Methods. Second International Symposium on Domain Decomposition Methods, pages 3–16, Philadelphia, PA, 1989. SIAM. Los Angeles, CA, Jan. 14–16, 1988.
Bramble, J.H., Pasciak, J.E., Schatz, A.H.: The construction of preconditioners for elliptic problems by substructuring, I. Math. Comp., 47(175):103–134, 1986.
Bramble, J.H., Pasciak, J.E., Schatz, A.H.: The construction of preconditioners for elliptic problems by substructuring, IV. Math. Comp., 53(187):1–24, 1989.
Brenner, S.C.: Lower bounds of two-level additive Schwarz preconditioners with small overlap. SIAM J. Sci. Comput., 21(5):1657–1669, 2000.
Brenner, S.C., Sung, L.: Discrete Sobolev and Poincaré inequalities via Fourier series. East-West J. of Numer. Math, 8:83–92, 2000.
Cai, X.-C., Sarkis, M.: A restricted additive Schwarz preconditioner for general sparse linear systems. SIAM J. Sci. Comp., 21:239–247, 1999.
Dohrmann, C.R.: A preconditioner for substructuring based on constrained energy minimization. SIAM J. Sci Comput., 25(1):246–258, 2003.
Dohrmann, C.R., Widlund, O.B.: A hybrid domain decomposition method for compressible and almost incompressible elasticity. Technical Report TR2008-919, Courant Institute, New York University, Dec. 2008.
Dohrmann, C.R., Widlund, O.B.: An overlapping Schwarz algorithm for almost incompressible elasticity. Technical Report TR2008-912, Department of Computer Science, Courant Institute, New York University, May 2008.
Dryja, M.: An additive Schwarz algorithm for two- and three-dimensional finite element elliptic problems. In T. Chan, R. Glowinski, J. Périaux, and O. Widlund, eds., Domain Decomposition Methods. Second International Symposium on Domain Decomposition Methods, 168–172, Philadelphia, PA, 1989. SIAM. Los Angeles, CA, Jan. 14–16, 1988.
Dryja, M., Smith, B.F., Widlund, O.B.: Schwarz analysis of iterative substructuring algorithms for elliptic problems in three dimensions. SIAM J. Numer. Anal., 31(6):1662–1694, Dec. 1994.
Dryja, M., Widlund, O.B.: Domain decomposition algorithms with small overlap. SIAM J. Sci. Comput., 15(3):604–620, May 1994.
Farhat, C., Lesoinne, M., Le Tallec, P., Pierson, K., Rixen, D.: FETI-DP: A dual-primal unified FETI method- part I: A faster alternative to the two-level FETI method. Internat. J. Numer. Methods Engrg., 50(7):1523–1544, 2001.
Farhat, C., Lesoinne, M., Pierson, K.: A scalable dual-primal domain decomposition method. Numer. Linear Algebra Appl., 7(7–8):687–714, 2000.
Farhat, C., Roux, F.-X.: A Method of Finite Element Tearing and Interconnecting and its Parallel Solution Algorithm. Internat. J. Numer. Meth. Engrg., 32: 1205–1227, 1991.
Glowinski, R., Wheeler, M.F.: Domain decomposition and mixed finite element methods for elliptic problems. In R. Glowinski, G.H. Golub, G.A. Meurant, and J. Périaux, eds., First International Symposium on Domain Decomposition Methods for Partial Differential Equations, 144–172, Philadelphia, PA, 1988. SIAM. Paris, Jan. 7–9, 1987.
Klawonn, A., Rheinbach, O.: A parallel implementation of Dual-Primal FETI methods for three dimensional linear elasticity using a transformation of basis. SIAM J. Sci. Comput., 28(5):1886–1906, 2006.
Klawonn, A., Rheinbach, O.: Inexact FETI-DP methods. Internat. J. Numer. Methods Engrg., 69:284–307, 2007.
Klawonn, A., Widlund, O.B.: Dual-Primal FETI methods for linear elasticity. Comm. Pure Appl Math., 59(11):1523–1572, Nov. 2006.
Li, J., Widlund, O.B.: BDDC algorithms for incompressible Stokes equations. SIAM J. Numer. Anal., 44(6):2432–2455, 2006.
Lions, P.-L.: On the Schwarz alternating method. I. In R. Glowinski, G.H. Golub, G.A. Meurant, and J. Périaux, eds., First International Symposium on Domain Decomposition Methods for Partial Differential Equations, pages 1–42, Philadelphia, PA, 1988. SIAM. Paris, Jan. 7–9, 1987.
Mandel, J.: Iterative solvers by substructuring for the p-version finite element method. Comp. Methods Appl. Mech. Engrg., 80:117–128, 1990.
Mandel, J., Brezina, M.: Balancing domain decomposition for problems with large jumps in coefficients. Math. Comp., 65(216):1387–1401, 1996.
Mandel, J., Dohrmann, C.R., Tezaur, R.: An algebraic theory for primal and dual substructuring methods by constraints. Appl. Numer. Math., 54:167–193, 2005.
Quarteroni, A., Valli, A.: Domain Decomposition Methods for Partial Differential Equations. Oxford Science, 1999.
Schwarz, H.A.: Gesammelte Mathematische Abhandlungen, vol. 2, 133–143. Springer, Berlin, 1890. First published in Vierteljahrsschrift der Naturforschenden Gesellschaft in Zürich, vol. 15, 1870, 272–286.
Smith, B.F.: A parallel implementation of an iterative substructuring algorithm for problems in three dimensions. SIAM J. Sci. Comput., 14(2):406–423, March 1993.
Smith, B.F.: Bjørstad, P.E., Gropp, W.: Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations. Cambridge University Press, 1996.
Sobolev, S.L.: L’Algorithme de Schwarz dans la Théorie de l’Elasticité. Comptes Rendus (Doklady) de l’Académie des Sciences de l’URSS, IV( (XIII) 6):243–246, 1936.
Toselli, A., Widlund, O.: Domain Decomposition Methods - Algorithms and Theory, vol. 34 of Springer Series in Computational Mathematics. Springer, Berlin–Heidelberg–New York, 2005.
Tu, X.: Three-level BDDC in two dimensions. Internat. J. Numer. Methods Engrg., 69:33–59, 2007.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Widlund, O.B. (2009). The Development of Coarse Spaces for Domain Decomposition Algorithms. In: Bercovier, M., Gander, M.J., Kornhuber, R., Widlund, O. (eds) Domain Decomposition Methods in Science and Engineering XVIII. Lecture Notes in Computational Science and Engineering, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02677-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-02677-5_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02676-8
Online ISBN: 978-3-642-02677-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)