Lefschetz Center for Dynamical Systems Seminar
| < | < |
| < | < |
| < | < |
Scientific Computing Seminar
| < | < |
| < | < |
| < | < |
Abstract: The FETI algorithms are a family of numerically scalable domain decomposition methods. They have been designed in the early 1990's for solving iteratively and on parallel machines, large-scale systems of equations arising from the finite element discretization of solid mechanics, elastodynamics, and acoustic scattering problems, and for analyzing complex systems obtained from the assembly of subsystems with incompatible discrete interfaces.
In this talk, we present the second generation of these methods that operate more efficiently on large numbers of subdomains, offer greater robustness, better performance, and more flexibility for implementation on a wider variety of computational platforms. We also report on the application and performance of these methods for the solution of geometrically nonlinear structural mechanics problems, and exterior Helmholtz problems. We discuss key aspects of their implementation on shared and distributed memory parallel processors, benchmark them against optimized sparse solvers, and highlight their potential with the solution of a family of computational mechanics problems with several million degrees of freedom. We also report on some recent performance results obtained on the ASCI-RED teraflopper.