WARP3D: Dynamic Nonlinear Analysis of Solids Using a Preconditioned Conjugate Gradient Software Architecture

Koppenhoefer, K.C.; Gullerud, A.S.; Ruggieri, C.; Dodds, Robert H., Jr.; Healey, B.E.

Permalink

https://hdl.handle.net/2142/14220 Copy

Description

Title

WARP3D: Dynamic Nonlinear Analysis of Solids Using a Preconditioned Conjugate Gradient Software Architecture

Author(s)

• Koppenhoefer, K.C.
• Gullerud, A.S.
• Ruggieri, C.
• Dodds, Robert H., Jr.
• Healey, B.E.

Issue Date

1994-11

Keyword(s)

• Finite element analysis
• Conjugate gradient
• Plasticity
• Supercomputers

Abstract

This report describes theoretical background material and commands necessary to use the W ARP3D finite element code. WARP3D is under continuing development as a research code for the solution of very large-scale, 3-D solid models subjected to static and dynamic loads. Specific features in the code oriented toward the investigation of ductile fracture in metals include a robust finite strain formulation, a general J-integral computation facility (with inertia, face loading), an element extinction facility to model crack growth, nonlinear material models including viscoplastic effects, and the Gurson-Tvergaard dilatant plasticity model for void growth. The nonlinear, dynamic equilibrium equations are solved using an incremental-iterative, implicit formulation with full Newton iterations to eliminate residual nodal forces. Time history integration of the nonlinear equations of motion is accomplished with Newmark's f3 method. A central feature of WARP 3D involves the use of a linear-preconditioned conjugate gradient (LPCG) solver implemented in an element-by-element format to replace a conventional direct linear equation solver. This software architecture dramatically reduces both the memory requirements and CPU time for very large, nonlinear solid models since formation of the assembled (dynamic) stiffness matrix is avoided. Analyses thus exhibit the numerical stability for large time (load) steps provided by the implicit formulation coupled with the low memory requirements characteristic of an explicit code. In addition to the much lower memory requirements of the LPCG solver, the CPU time required for solution of the linear equations during each Newton iteration is generally one-half or less of the CPU time required for a traditional direct solver. All other computational aspects of the code (element stiffnesses, element strains, stress updating, element internal forces) are implemented in the element-by-element, blocked architecture. This greatly improves vectorization of the code on uni-processor hardware and enables straightforward parallel-vector processing of element blocks on multi-processor hardware.

Publisher

University of Illinois Engineering Experiment Station. College of Engineering. University of Illinois at Urbana-Champaign.

Series/Report Name or Number

Civil Engineering Studies SRS-596

Type of Resource

text

Language

en

Permalink

http://hdl.handle.net/2142/14220

Sponsor(s)/Grant Number(s)

• U.S. Nuclear Regulatory Commission. Office of Nuclear Regulatory Research. Division of Engineering. Contract No. N61533-92-K-0030
• NASA-AMES Research Center Contract No. NASA NCC2-5022

Owning Collections