Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published February 20, 2002 | metadata_only
Journal Article

Three-dimensional adaptive meshing by subdivision and edge-collapse in finite-deformation dynamic-plasticity problems with application to adiabatic shear banding


This paper is concerned with the development of a general framework for adaptive mesh refinement and coarsening in three-dimensional finite-deformation dynamic–plasticity problems. Mesh adaption is driven by a posteriori global error bounds derived on the basis of a variational formulation of the incremental problem. The particular mesh-refinement strategy adopted is based on Rivara's longest-edge propagation path (LEPP) bisection algorithm. Our strategy for mesh coarsening, or unrefinement, is based on the elimination of elements by edge-collapse. The convergence characteristics of the method in the presence of strong elastic singularities are tested numerically. An application to the three-dimensional simulation of adiabatic shear bands in dynamically loaded tantalum is also presented which demonstrates the robustness and versatility of the method.

Additional Information

© 2001 John Wiley & Sons Received 22 August 2000. Revised 9 March 2001. The authors are grateful for financial support provided by the US Army Research Office under grantDAAH04-96-1-0056, and by the US Department of Energy through Caltech's Asci/ASAP Center for the Simulation of the Dynamic Behavior of Materials. We also gratefully acknowledge helpful discussions with L. Stainier and P. Mabille regarding the Ta shear-band simulations.

Additional details

August 21, 2023
August 21, 2023