𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The rs-method for material failure simulations

✍ Scribed by R. Fan; J. Fish


Publisher
John Wiley and Sons
Year
2008
Tongue
English
Weight
447 KB
Volume
73
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

A new method for propagating arbitrary failure modes is presented. Arbitrary failure modes are resolved on a refined local patch of elements and then embedded into the coarse grid using partition of unity method. Strong discontinuities are propagated by means of element erosion in the superimposed patch of elements only. The method, coined as the rs‐version of the finite element method (or reduced order s‐method), has been integrated in ABAQUS and verified on several test problems. Copyright © 2007 John Wiley & Sons, Ltd.


📜 SIMILAR VOLUMES


The material point method for simulation
✍ Allen R. York II; Deborah Sulsky; Howard L. Schreyer 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 581 KB

The material-point method (MPM) is extended to handle membranes, which are discretized by a collection of unconnected material points placed along each membrane surface. These points provide a Lagrangian description of the membrane. To solve for the membrane motion, data carried by the material poin

A Method for Estimating the Computationa
✍ Marc A Rieffel 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 403 KB

This paper presents a model for predicting the runtime and storage requirements for direct simulation Monte Carlo (DSMC) simulations of rarefied gas flow. A variety of flow configurations are considered, including internal, external, steady, and unsteady. The analysis is independent of the simulatio

Monte-Carlo Method for Simulations of Ri
✍ Thomas Vettorel; Shang Yik Reigh; Do Y. Yoon; Kurt Kremer 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 309 KB

## Abstract A detailed analysis of the efficiency of a Monte‐Carlo (MC) method employing non‐local moves for simple lattice ring polymers is presented. While the introduction of kink‐translocation moves for linear chains results in the expected speedup by a factor of the order of the number of site