Lower Bounds in Domain Decomposition
An important indicator of the efficiency of a domain decomposition preconditioner is the condition number of the preconditioned system. Upper bounds for the condition numbers of the preconditioned systems have been the focus of most analyses in domain decomposition [21, 20, 23]. However, in order to have a fair comparison of two preconditioners, the sharpness of the respective upper bounds must first be established, which means that we need to derive lower bounds for the condition numbers of the preconditioned systems.
KeywordsDomain Decomposition Piecewise Linear Function Domain Decomposition Method Courant Institute Auxiliary Space
Unable to display preview. Download preview PDF.
- 5.S. C. Brenner and Q. He, Lower bounds for three-dimensional nonoverlapping domain decomposition algorithms, Numerische Mathematik, (2003).Google Scholar
- 7.S. C. Brenner and L.-Y. Sung, Lower Bounds for Two-Level Additive Schwarz Preconditioners for Nonconforming Finite Elements, vol. 202 of Lecture Notes in Pure and Applied Mathematics, Marcel Dekker AG, New York, 1999, pp. 585–604.Google Scholar
- 10.M. Dryja and O. B. Widlund, An additive variant of the Schwarz alternating method in the case of many subregions, Tech. Rep. 339, Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, New York, 1987.Google Scholar
- 15.J. Li and O. B. Widlund, FETI-DP, BDDC, and block Cholesky methods, Tech. Rep. 857, Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, New York, 2004.Google Scholar
- 20.A. Quarteroni and A. Valli, Domain Decomposition Methods for Partial Differential Equations, Oxford University Press, 1999.Google Scholar
- 21.B. F. Smith, P. E. Bjørstad, and W. Gropp, Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations, Cambridge University Press, 1996.Google Scholar
- 23.A. Toselli and O. B. Widlund, Domain Decomposition Methods - Algorithms and Theory, vol. 34 of Series in Computational Mathematics, Springer, 2005.Google Scholar
- 24.X. Tu, Three-level BDDC in two dimensions, Tech. Rep. 856, Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, New York, 2004.Google Scholar
- 26.X. Zhang, Studies in Domain Decomposition: Multilevel Methods and the Biharmonic Dirichlet Problem, PhD thesis, Courant Institute, New York University, September 1991.Google Scholar