Abstract
Dual‐primal FETI methods for linear elasticity problems in three dimensions are considered. These are nonoverlapping domain decomposition methods where some primal continuity constraints across subdomain boundaries are required to hold throughout the iterations, whereas most of the constraints are enforced by Lagrange multipliers. An algorithmic framework for dual‐primal FETI methods is described together with a transformation of basis to implement the primal constraints. Numerical results obtained from a parallel implementation of these algorithms applied to a model benchmark problem with structured meshes and to problems with more complicated geometries from industrial and biological applications using unstructured meshes are provided. These results show that the presented dual‐primal FETI algorithms are numerical and parallel scalable.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
