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.
Kabelíková P., Dostál Z., Kozubek T., Markopoulos A. Generalized inverse matrix evaluation using graph theory, In Blaheta R., Starý J. (Editors),
Proceedings of the Modeling 2009
, Institute of Geonics AS CR, Czech Republic, 2009.
Markopoulos A., '', in Proceedings of the Modeling 2009, (2009) -.
Markopoulos A.Proceedings of the Modeling 20092009)| false
Farhat C., Lesoinne M., LeTallec P., Pierson K., Rixen D. FETI-DP: A dual-primal unified FETI method, Part I, A faster alternative to the two-level FETI method,
International Journal for Numerical Methods in Engineering
, Vol. 50, 2001, 1523–1544.
Rixen D., 'FETI-DP: A dual-primal unified FETI method, Part I, A faster alternative to the two-level FETI method' (2001) 50International Journal for Numerical Methods in Engineering: 1523-1544.
Rixen D.FETI-DP: A dual-primal unified FETI method, Part I, A faster alternative to the two-level FETI methodInternational Journal for Numerical Methods in Engineering20015015231544)| false