Towards the ultimate iterative substructuring method: Combined numerical and parallel scalability, and multiple load cases (original) (raw)
1994, Computing Systems in Engineering
Sign up for access to the world's latest research.
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Related papers
International Journal for Numerical Methods in Engineering, 1998
The FETI algorithms are a family of numerically scalable substructuring methods with Lagrange multipliers that have been designed for solving iteratively large-scale systems of equations arising from the finite element discretization of structural engineering, solid mechanics, and structural dynamics problems. In this paper, we present a uni ed framework that simpli es the interpretation of several of the previously presented FETI concepts. This framework has enabled the improvement of the robustness and performance of the transient FETI method, and the design of a new family of coarse operators for iterative substructuring algorithms with Lagrange multipliers. We report on both of these new developments, discuss their impact on the iterative solution of large-scale finite element systems of equations by the FETI method, and illustrate them with a few static and dynamic structural analyses on an IBM SP2 parallel processor.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.