We propose a new version of the FETI algorithm which preserves the parallelization properties of the classical FETI algorithms when applied to mortar discretizations. This new version is based on generalized coupling conditions across the interface replacing the mortar conditions.

We present numerical results showing that the new FETI algorithm has the same scalability properties as the classical FETI method. We compare the numerical performance of the algorithm proposed here with that of the FETI and FETI--DP methods for mortars. We also discuss implementation details and storage requirements for the new algorithm, both for general geometrically nonconforming situations and for the case when mortar conditions are required only on a small part of the interface, while continuity is required elsewhere.

We conclude by discussing extensions of our algorithm to problems containing Linear Multipoint Constraints.