Theoretical comparison of the FETI and algebraically partitioned FETI methods, and performance comparisons with a direct sparse solver

✍ Scribed by Daniel J. Rixen; Charbel Farhat; Radek Tezaur; Jan Mandel

• Publisher: John Wiley and Sons
• Year: 1999
• Tongue: English
• Weight: 673 KB
• Volume: 46
• Category: Article
• ISSN: 0029-5981
• DOI: 10.1002/(sici)1097-0207(19991010)46:4<501::aid-nme685>3.0.co;2-7

✦ Synopsis

In this paper, we prove that the Algebraic A-FETI method corresponds to one particular instance of the original one-level FETI method. We also report on performance comparisons on an Origin 2000 between the one-and two-level FETI methods and an optimized sparse solver, for two industrial applications: the stress analysis of a thin shell structure, and that of a three-dimensional structure modelled by solid elements. These comparisons suggest that for topologically two-dimensional problems, sparse solvers are e ective when the number of processors is relatively small. They also suggest that for three-dimensional applications, scalable domain decomposition methods such as FETI deliver a superior performance on both sequential and parallel hardware conÿgurations.