Selection strategy for fixing nodes in FETI-DP method

Brož, Jaroslav and Kruis, Jaroslav (2010) Selection strategy for fixing nodes in FETI-DP method. Pollack Periodica, 5 (2). pp. 57-68. ISSN 1788-1994

Text pollack.5.2010.2.6.pdf Restricted to Repository staff only until 31 August 2030. Download (1MB)

Abstract

This paper deals with selection strategy of fixing nodes in the FETI-DP method. The FETI-DP method is one of non-overlapping domain decomposition methods. The method was published by Farhat and co-workers in 2001. Selection of the fixing unknowns in the FETI-DP, TFETI or BDDC domain decomposition method has strong influence on the method behavior. The selection itself is not straightforward in the case of irregular domains and subdomains. Three-step algorithm for the selection of the fixing unknowns is presented and some numerical examples are shown. The algorithm is based on nodal multiplicity, which is the number of subdomains sharing the node. If the three-step algorithm selects unsatisfactory number of fixing nodes, additional geometrical conditions are applied. These conditions lead to selection of additional fixing nodes. Moreover, higher number of the fixing nodes usually results in better convergence of the coarse problems.

Actions (login required)

Edit Item