Domain decomposition methods of dual-primal FETI type for edge element approximations in three dimensions

Abstract: We consider domain decomposition algorithms of FETI type for edge element approximations in three dimensions. We first show that a strong coupling exists between tangential degrees of freedom associated to the subdomain edges and faces. We then propose a dual-primal FETI algorithm that relies on a change of basis and on a suitable choice of a coarse space. We give a logarithmic bound for the condition number of the resulting preconditioned operator. Numerical results confirm this bound and the necessity of performing a change of basis. To cite this article: A. Toselli, C. R. Acad. Sci. Paris, Ser. I 339 (2004). [Copyright &y& Elsevier]