A finite-volume shallow layer method for the MHD instabilities in an aluminium production cell

An electrolytic cell for Aluminium production contains molten metal and molten electrolyte, which are subject to high dc-currents and magnetic fields. Lorentz forces arising from the cross product of current and magnetic field may amplify natural gravity waves at the interface between the two fluids, leading to short circuits in extreme cases. The external magnetic field and current distribution in the production cell is computed through a detailed finite element analysis at Torino Polytechnic. The results are then used to compute the magnetohydrodynamic and thermal effects in the aluminium/electrolyte bath. Each cell has lateral dimensions of 6m x 2m, whilst the bath depth is only 30cm. the electrically resistive electrolyte path, which is critical in the operation of the cell, has layer depth of only a few centimetres below each carbon anode. Because the shallow dimensions of the liquid layer a finite-volume shallow-layer technique has been used at Greenwich to compute the resulting flow-field and interface perturbations. The information obtained from this method, i.e. depth averaged velocities and aluminium/electrolyte interface position is then embedded in the three-dimensional finite volume code PHYSICA and will be used to compute the heat transfer and phase change in the cell.

[Review] Assessment: Problems, Developments and Statistical Issues; a Volume of Expert Contributions. Edited by H. Goldstein and T. Lewis. ISBN 0 471 95668 6. Wiley, Chichester, 1996. viii+274 pp., £45.

This is a book on general issues to do with assessment, not a statistics book, although it touches on statistical issues. Although it is intended for an international readership to include teachers, educationalists, policy makers and personnel managers and would be of interest to such groups it has been written mainly from the viewpoint of developed countries and is not obviously essential reading or an essential purchase for anyone. Short biographies of the 15 contributors are given at the start of the book and references from all the chapters are brought together at the end. The order of chapters appears to be arbitrary to some extent and there is little cross-referencing from one chapter to another.

Dynamic fluid-structure interactions using finite volume unstructured mesh procedures

A three-dimensional finite volume, unstructured mesh (FV-UM) method for dynamic fluid–structure interaction (DFSI) is described. Fluid structure interaction, as applied to flexible structures, has wide application in diverse areas such as flutter in aircraft, wind response of buildings, flows in elastic pipes and blood vessels. It involves the coupling of fluid flow and structural mechanics, two fields that are conventionally modelled using two dissimilar methods, thus a single comprehensive computational model of both phenomena is a considerable challenge. Until recently work in this area focused on one phenomenon and represented the behaviour of the other more simply. More recently, strategies for solving the full coupling between the fluid and solid mechanics behaviour have been developed. A key contribution has been made by Farhat et al. [Int. J. Numer. Meth. Fluids 21 (1995) 807] employing FV-UM methods for solving the Euler flow equations and a conventional finite element method for the elastic solid mechanics and the spring based mesh procedure of Batina [AIAA paper 0115, 1989] for mesh movement. In this paper, we describe an approach which broadly exploits the three field strategy described by Farhat for fluid flow, structural dynamics and mesh movement but, in the context of DFSI, contains a number of novel features: a single mesh covering the entire domain, a Navier–Stokes flow, a single FV-UM discretisation approach for both the flow and solid mechanics procedures, an implicit predictor–corrector version of the Newmark algorithm, a single code embedding the whole strategy.

Parallel partitioning of unstructured meshes

A method is outlined for optimising graph partitions which arise in mapping un- structured mesh calculations to parallel computers. The method employs a combination of iterative techniques to both evenly balance the workload and minimise the number and volume of interprocessor communications. They are designed to work efficiently in parallel as well as sequentially and when combined with a fast direct partitioning technique (such as the Greedy algorithm) to give an initial partition, the resulting two-stage process proves itself to be both a powerful and flexible solution to the static graph-partitioning problem. The algorithms can also be used for dynamic load-balancing and a clustering technique can additionally be employed to speed up the whole process. Experiments indicate that the resulting parallel code can provide high quality partitions, independent of the initial partition, within a few seconds.