A study on the lumped preconditioner and memory requirements of feti and related primal domain decompositions methods

In recent years Domain Decomposition Methods (DDM) have emerged as advanced solvers in several area of computational mechanics. In particular, during the last decade, in the area of solid and structural mechanics, they reached a considerable llevel of advancement and were shown to be more efficient than popular solvers, like advanced sparse direct solvers. The present contribution follows the lines of a series of recent publicatiolns by the authors on DDM. In these papers, the authors developed a unified theory of primal and dual methods and presented a family of DDM that were shown to be more efficient than previous methods. The present paper extends this work, presenting a new damily of related DDM, thus enriching the theory of the relations between primal and dual methods. It also explores memory requirement issues, suggesting also a particularly memory efficient formulation