In this paper, a new approach for powder cold compaction simulations is presented. A density-dependent plastic model within
the framework of finite strain multiplicative hyperelastoplasticity is used to describe the highly nonlinear material behaviour;
the Coulomb dry friction model is used to capture friction effects at die-powder contact; and an Arbitrary Lagrangian–Eulerian
(ALE) formulation is used to avoid the (usual) excessive distortion of Lagrangian meshes caused by large mass fluxes. Several
representative examples, involving structured and unstructured meshes are simulated. The results obtained agree with the experimental
data and other numerical results reported in the literature. It is shown that, contrary to other Lagrangian and adaptive h-remeshing approaches recently reported for this type of problems, the present approach verifies the mass conservation principle
with very low relative errors (less than 1% in all ALE examples and exactly in the pure Lagrangian examples). Moreover, thanks
to the use of an ALE formulation and in contrast with other simulations, the presented density distributions do not present
spurious oscillations.
Received: 20 March 2002 / Accepted: 15 October 2002
The partial financial support of the Ministerio de Ciencia y Tecnología (grant number DPI 2001-2204) is gratefully acknowledged. 相似文献
This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.
A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system. 相似文献