Implementation of surface-to-surface contact algorithms using iterative solvers on parallel computers


Journal Article

In this work, we introduce a robust parallel surface-tosurface contact solution strategy for three dimensional frictional contact problems. A new algorithm is described which has improved overall capability with respect to numerical robustness and spatial convergence rates, showing also good parallel efficiency. In part because numerical methods for contact problems typically result in illconditioned and highly unsymmetric stiffness matrices, direct methods for equation solving have typically been preferred in such applications. However, for large-scale contact numerical modeling, the direct method appears to be limited by its requirements for memory and computation time, which scale with the number of unknowns n as (n1.5) and (n2), respectively. In this paper, we have implemented a parallel contact algorithm using iterative solution methods, and have applied it to several numerical examples using an Intel Xeon based Linux cluster and an HP-Compaq AlphaServer with up to 512 processors. Relatively good scalable performance has been observed in the applications tested.

Duke Authors

Cited Authors

  • Kim, EJ; Laursen, TA

Published Date

  • December 1, 2006

Published In

Start / End Page

  • 394 - 400

International Standard Serial Number (ISSN)

  • 1027-2658

Citation Source

  • Scopus