作者: Charbel Farhat , Kendall Pierson , Michel Lesoinne
DOI: 10.1016/S0045-7825(99)00234-0
关键词:
摘要: The FETI algorithms are a family of numerically scalable domain decomposition methods. They have been designed in the early 1990s for solving iteratively and on parallel machines, large-scale systems equations arising from finite element discretization solid mechanics, structural engineering, dynamics, acoustic scattering problems, analyzing complex structures obtained assembly substructures with incompatible discrete interfaces. In this paper, we present second generation these methods that operate more efficiently large numbers subdomains, offer greater robustness, better performance, flexibility implementation wider variety computational platforms. We also report application performance solution geometrically non-linear analysis problems. discuss key aspects their shared distributed memory processors, benchmark them against optimized direct sparse solvers, highlight potential mechanics problems several million degrees freedom.