Abstract :
We propose a new version of the FETI algorithm for mortar discretizations based on generalized coupling conditions across the interface. The new algorithm preserves the parallelization properties of, and has the same scalability properties as, the FETI method for continuous finite elements. We compare the numerical performance of the new algorithm with that of other FETI methods for mortars. When mortar conditions are required only on a small part of the interface, while continuity is required elsewhere, we show that the extra storage and extra computational effort required by the parallel algorithm is minimal.