2 resultados para Remeshing
em Greenwich Academic Literature Archive - UK
Resumo:
The computational modelling of extrusion and forging processes is now well established. There are two main approaches: Lagrangian and Eulerian. The first has considerable complexities associated with remeshing, especially when the code is parallelised. The second approach means that the mould has to be assumed to be entirely rigid and this may not be the case. In this paper, a novel approach is described which utilises finite volume methods on unstructured meshes. This approach involves the solution of free surface non-Newtonian fluid flow equations in an Eulerian context to track the behaviour of the workpiece and its extrusion/forging, and the solution of the solid mechanics equations in the Lagrangian context to predict the deformation/stress behaviour of the die. Test cases for modelling extrusion and forging problems using this approach will be presented.
Resumo:
This chapter describes a parallel optimization technique that incorporates a distributed load-balancing algorithm and provides an extremely fast solution to the problem of load-balancing adaptive unstructured meshes. Moreover, a parallel graph contraction technique can be employed to enhance the partition quality and the resulting strategy outperforms or matches results from existing state-of-the-art static mesh partitioning algorithms. The strategy can also be applied to static partitioning problems. Dynamic procedures have been found to be much faster than static techniques, to provide partitions of similar or higher quality and, in comparison, involve the migration of a fraction of the data. The method employs a new iterative optimization technique that balances the workload and attempts to minimize the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equivalent or higher quality to static partitioners (which do not reuse the existing partition) and much more quickly. The dynamic evolution of load has three major influences on possible partitioning techniques; cost, reuse, and parallelism. The unstructured mesh may be modified every few time-steps and so the load-balancing must have a low cost relative to that of the solution algorithm in between remeshing.