Preconditioning the Mortar Method by Substructuring: The High Order Case.
暂无分享,去创建一个
We analyze a class of preconditioners for the mortar method, based on substructuring. After splitting in a suitable way the degrees of freedom in interior, edge and vertex, we study the performance of a block Jacobi type preconditioner for which the condition number of the preconditioned matrix only grows polylogarithmically. Unlike the previous work by Achdou, Maday and Widlund [1], which is restricted to the case of first order finite element, this paper relies on abstract assumptions and therefore applies to finite element of any order. Moreover, the use of a suitable coarse preconditioner (whose effect we analyze) makes this technique more efficient. (© 2004 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)
[1] J. Lions,et al. Non-homogeneous boundary value problems and applications , 1972 .
[2] Barbara I. Wohlmuth,et al. Discretization Methods and Iterative Solvers Based on Domain Decomposition , 2001, Lecture Notes in Computational Science and Engineering.
[3] Silvia Bertoluzza,et al. Substructuring preconditioners for the three fields domain decomposition method , 2003, Math. Comput..
[4] Olof B. Widlund,et al. Iterative Substructuring Preconditioners For Mortar Element Methods In Two Dimensions , 1997 .