M. Cross

Accurate solutions of moving boundary problems using the enthalpy method

Abstract After highlighting the problems associated with the conventional numerical implementations of Stefan problems using the enthalpy formulation, a simple development is described which leads to very accurate solutions. The extension of this technique to two dimensional problems is then demonstrated using a straightforward explicit method. An implicit scheme for one dimensional problems, based upon the above development, is then described which can cope with any size phase change temperature range and the influence of internal heating, simultaneously. Finally, the utility of this scheme is demonstrated by its application to a welding problem.

Does an incremental filling technique reduce polymerization shrinkage stresses

It is widely accepted that volumetric contraction and solidification during the polymerization process of restorative composites in combination with bonding to the hard tissue result in stress transfer and inward deformation of the cavity walls of the restored tooth. Deformation of the walls decreases the size of the cavity during the filling process. This fact has a profound influence on the assumption-raised and discussed in this paper-that an incremental filling technique reduces the stress effect of composite shrinkage on the tooth. Developing stress fields for different incremental filling techniques are simulated in a numerical analysis. The analysis shows that, in a restoration with a well-established bond to the tooth-as is generally desired-incremental filling techniques increase the deformation of the restored tooth. The increase is caused by the incremental deformation of the preparation, which effectively decreases the total amount of composite needed to fill the cavity. This leads to a higher-stressed tooth-composite structure. The study also shows that the assessment of intercuspal distance measurements as well as simplifications based on generalization of the shrinkage stress state cannot be sufficient to characterize the effect of polymerization shrinkage in a tooth-restoration complex. Incremental filling methods may need to be retained for reasons such as densification, adaptation, thoroughness of cure, and bond formation. However, it is very difficult to prove that incrementalization needs to be retained because of the abatement of shrinkage effects.

Parallel Dynamic Graph Partitioning for Adaptive Unstructured Meshes

A parallel method for the dynamic partitioning of unstructured meshes is described. The method introduces a new iterative optimization technique known as relative gain optimization which both 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 rapidly. Perhaps more importantly, the algorithm results in only a small fraction of the amount of data migration compared to the static partitioners.

Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm

Multilevel algorithms are a successful class of optimization techniques which addresses the mesh partitioning problem. They usually combine a graph contraction algorithm together with a local optimization method which refines the partition at each graph level. In this paper we present an enhancement of the technique which uses imbalance to achieve higher quality partitions. We also present a formulation of the Kernighan--Lin partition optimization algorithm which incorporates load-balancing. The resulting algorithm is tested against a different but related state-of-the-art partitioner and shown to provide improved results.

A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning

The graph-partitioning problem is to divide a graph into several pieces so that the number of vertices in each piece is the same within some defined tolerance and the number of cut edges is minimised. Important applications of the problem arise, for example, in parallel processing where data sets need to be distributed across the memory of a parallel machine. Very effective heuristic algorithms have been developed for this problem which run in real-time, but it is not known how good the partitions are since the problem is, in general, NP-complete. This paper reports an evolutionary search algorithm for finding benchmark partitions. A distinctive feature is the use of a multilevel heuristic algorithm to provide an effective crossover. The technique is tested on several example graphs and it is demonstrated that our method can achieve extremely high quality partitions significantly better than those found by the state-of-the-art graph-partitioning packages.

Parallel optimisation algorithms for multilevel mesh partitioning

Three parallel optimisation algorithms, for use in the context of multilevel graph partitioning of unstructured meshes, are described. The first, interface optimisation, reduces the computation to a set of independent optimisation problems in interface regions. The next, alternating optimisation, is a restriction of this technique in which mesh entities are only allowed to migrate between subdomains in one direction. The third treats the gain as a potential field and uses the concept of relative gain for selecting appropriate vertices to migrate. The results are compared and seen to produce very high global quality partitions, very rapidly. The results are also compared with another partitioning tool and shown to be of higher quality although taking longer to compute.

Biophysical stress analysis of restored teeth: experimental strain measurement

Abstract The substantial amount of literature on biophysical stress analysis of restored teeth is reviewed. Principal methods of analysis include photoelastic analogs, measurement and finite element techniques. It is asserted that although much has been learned from these activities, there is no integrated methodology for analyzing the strength of restored teeth. Such a methodology is proposed, involving both experimental and modelling components which are mutually corroborating. The rest of the paper concentrates upon the experimental component of the methodology, which is based upon strain gauge measurements obtained within the context of a servohydraulics framework. Data are reported on the strain measured in a wide variety of cavity sizes, both unrestored and utilizing a range of materials and techniques in the restored complex. It is shown that intracoronal restorations which feature hard tissue bonding and cuspal coverage yield restorations with significant recovery of stiffness.

A multi-scale atomistic-continuum modelling of crack propagation in a two-dimensional macroscopic plate

A novel multi-scale seamless model of brittle-crack propagation is proposed and applied to the simulation of fracture growth in a two-dimensional Ag plate with macroscopic dimensions. The model represents the crack propagation at the macroscopic scale as the drift-diffusion motion of the crack tip alone. The diffusive motion is associated with the crack-tip coordinates in the position space, and reflects the oscillations observed in the crack velocity following its critical value. The model couples the crack dynamics at the macroscales and nanoscales via an intermediate mesoscale continuum. The finite-element method is employed to make the transition from the macroscale to the nanoscale by computing the continuum-based displacements of the atoms at the boundary of an atomic lattice embedded within the plate and surrounding the tip. Molecular dynamics (MD) simulation then drives the crack tip forward, producing the tip critical velocity and its diffusion constant. These are then used in the Ito stochastic calculus to make the reverse transition from the nanoscale back to the macroscale. The MD-level modelling is based on the use of a many-body potential. The model successfully reproduces the crack-velocity oscillations, roughening transitions of the crack surfaces, as well as the macroscopic crack trajectory. The implications for a 3-D modelling are discussed.

Multilevel mesh partitioning for heterogeneous communication networks

Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem for distributing unstructured meshes onto parallel computers. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. To date these algorithms have been used almost exclusively to minimise the cut edge weight in the graph with the aim of minimising the parallel communication overhead, but recently there has been a perceived need to take into account the communications network of the parallel machine. For example the increasing use of SMP clusters (systems of multiprocessor compute nodes with very fast intra-node communications but relatively slow inter-node networks) suggest the use of hierarchical network models. Indeed this requirement is exacerbated in the early experiments with meta-computers (multiple supercomputers combined together, in extreme cases over inter-continental networks). In this paper therefore, we modify a multilevel algorithm in order to minimise a cost function based on a model of the communications network. Several network models and variants of the algorithm are tested and we establish that it is possible to successfully guide the optimisation to reflect the chosen architecture.

Computer aided parallelisation tools (CAPTools)—conceptual overview and performance on the parallelisation of structured mesh codes

Computer Aided Parallelisation Tools (CAPTools) is a toolkit designed to automate as much as possible of the process of parallelising scalar FORTRAN 77 codes. The toolkit combines a very powerful dependence analysis together with user supplied knowledge to build an extremely comprehensive and accurate dependence graph. The initial version has been targeted at structured mesh computational mechanics codes (eg. heat transfer, Computational Fluid Dynamics (CFD)) and the associated simple mesh decomposition paradigm is utilised in the automatic code partition, execution control mask generation and communication call insertion. In this, the first of a series of papers [1–3] the authors discuss the parallelisations of a number of case study codes showing how the various component tools may be used to develop a highly efficient parallel implementation in a few hours or days. The details of the parallelisation of the TEAMKE1 CFD code are described together with the results of three other numerical codes. The resulting parallel implementations are then tested on workstation clusters using PVM and an i860-based parallel system showing efficiencies well over 80%.