Publications

A discrete element computer program, DMC (Distinct Motion Code) was developed to simulate blast-induced rock motion. To simplify the complex task of entering material and explosive design parameters as well as bench configuration, a full-featured graphical interface has been developed. DMC is currently executed on both Sun SPARCstation 2 and Sun SPARCstation 10 platforms and routinely used to model bench and crater blasting problems. This paper will document the design and development of the full-featured interface to DMC. The development of the interface will be tracked through the various stages, highlighting the adjustments made to allow the necessary parameters to be entered in terms and units that field blasters understand. The paper also discusses a novel way of entering non-integer numbers and the techniques necessary to display blasting parameters in an understandable visual manner. A video presentation will demonstrate the graphics interface and explains its use.

MELCOR is a fully integrated, engineering-level computer code being developed at Sandia National Laboratories for the USNRC, that models the entire spectrum of severe accident phenomena in a unified framework for both BWRs and PWRs. As a part of an ongoing assessment, program, MELCOR has been used to model the ACRR in-pile DF-4 Damaged Fuel experiment. DF-4 provided data for early phase melt progression in BWR fuel assemblies, particularly for phenomena associated with eutectic interactions in the BWR control blade and zircaloy oxidation in the canister and cladding. MELCOR provided good agreement with experimental data in the key areas of eutectic material behavior and canister and cladding oxidation. Several shortcomings associated with the MELCOR modeling of BWR geometries were found and corrected. Twenty-five sensitivity studies were performed on COR, HS and CVH parameters. These studies showed that the new MELCOR eutectics model played an important role in predicting control blade behavior. These studies revealed slight time step dependence and no machine dependencies. Comparisons made with the results from four best-estimate codes showed that MELCOR did as well as these codes in matching DF-4 experimental data.

MIMD massively parallel computers promise unique power and flexibility for engineering and scientific simulations. In this paper we review the development of a number of software methods and algorithms for scientific and engineering problems which are helping to realize that promise. We discuss new domain decomposition, load balancing, data layout and communications methods applicable to simulations in a broad range of technical field including signal processing, multi-dimensional structural and fluid mechanics, materials science, and chemical and biological systems.

Given a planar straight-line graph, we find a covering triangulation whose maximum angle is as small as possible. A covering triangulation is a triangulation whose vertex set contains the input vertex set and whose edge set contains the input edge set. Such a triangulation differs from the usual Steiner triangulation in that we may not add a Steiner vertex on any input edge. Covering triangulations provide a convenient method for triangulating multiple regions sharing a common boundary, as each region can be triangulated independently. As it is possible that no finite covering triangulation is optimal in terms of its maximum angle, we propose an approximation algorithm. Our algorithm produces a covering triangulation whose maximum angle {gamma} is probably close to {gamma}{sub opt}, a lower bound on the maximum angle in any covering triangulation of the input graph. Note that we must have {gamma} {le} 3{gamma}{sub opt}, since we always have {gamma}{sub opt} {ge} {pi}/3 and no triangulation can contain an angle of size greater than {pi}. We prove something significantly stronger. We show that {pi} {minus} {gamma} {ge} ({pi} {minus} {gamma}{sub opt})/6, i.e., our {gamma} is not much closer to {pi} than is {gamma}{sub opt}. This result represents the first nontrivial bound on a covering triangulation`s maximum angle. We require a subroutine for the following problem: Given a polygon with holes, find a Steiner triangulation whose maximum angle is bounded away from {pi}. No angle larger than 8{pi}/9 is sufficient for the bound on {gamma} claimed above. The number of Steiner vertices added by our algorithm and its running time are highly dependent on the corresponding bounds for the subroutine. Given an n-vertex planar straight-line graph, we require O(n + S(n)) Steiner vertices and O(n log n + T(n)) time, where S(n) is the number of Steiner vertices added by the subroutine and T(n) is its running time for an O(n)-vertex polygon with holes.

The multiplication of a vector by a matrix is the kernel computation of many algorithms in scientific computation. A fast parallel algorithm for this calculation is therefore necessary if one is to make full use of the new generation of parallel supercomputers. This paper presents a high performance, parallel matrix-vector multiplication algorithm that is particularly well suited to hypercube multiprocessors. For an n x n matrix on p processors, the communication cost of this algorithm is O(n/{radical}p + log(p)), independent of the matrix sparsity pattern. The performance of the algorithm is demonstrated by employing it as the kernel in the well-known NAS conjugate gradient benchmark, where a run time of 6.09 seconds was observed. This is the best published performance on this benchmark achieved to date using a massively parallel supercomputer.

The numerical stability and truncation error of a family of differencing schemes for viscoplastic constitutive relations in wavecodes is investigated. A von Neumann stability analysis is performed for a one-dimensional model problem. This analysis identifies two differencing methods that have no restriction on the time step size beyond the usual Courant-Friedrichs-Lewy condition. One of these methods is first-order accurate, and the other is second-order accurate. Implementation of one of these methods in the three-dimensional wavecode CTH is discussed. © 1993 Academic Press. All rights reserved.

A method of solving the two-phase fluid flow equations using a genetic algorithm on a NCUBE multiprocessor computer is presented. The topics discussed are the two-phase flow equations, the genetic representation of the unknowns, the fitness function, the genetic operators, and the implementation of the algorithm on the NCUBE computer. The efficiency of the implementation is investigated using a pipe blowdown problem. Effects of varying the genetic parameters and the number of processors are presented.

A method is described for parallelizing molecular dynamics (MD) simulations by block-decomposing the matrix of bonded and non-bonded force computations. It is particularly useful for organic simulations (polymers, proteins) because unlike spatial-decomposition methods, it requires no geometric information about the simulation domain. Because its communication cost scales as N/{radical}P. rather than N as in the all-to-all broadcast or ring-exchange techniques commonly used in this type of MD simulation, larger numbers of processors can be used effectively, yielding greater parallel speed-ups.

Performance and functionality increases in network environments have in the need for readily accessible mass storage. UNIX{reg_sign}-based networks and mass storage systems are providing the required connectivity and interoperability, however, how UNIX-based mass storage systems are being used is not well documented. This paper describes a study of the usage of the UNIX-based Network Storage Service at Sandia National Laboratories.

A discrete element computer program, DMC (Distinct-Motion Code), has been used for several years to simulate blasting-induced rock motion. Recent enhancements of DMC`s capabilities have included addition of an algorithm that couples together rock motion and gas flow. This allows the user to specify a particular explosive which also specifies equation-of-state and other parameters necessary to model explosive gas flow from the blastwell. Rock loading by the flowing gas is calculated automatically. The mechanism for calculating the rock loading is the subject of this paper. The rock motion effects the gas flow calculation by changing the porosity. DMC is currently being used on a SLTN SPARCstation 2 computer workstation.

Multiple sources of variation will often affect the stability of a manufacturing process. Items from different batches may vary because of variation both within a batch and among different batches. Potential sources of variation include within run, run-to-run and week-to-week differences in a manufacturing process. If multiple sources of variation are present, traditional control chart methods may not be appropriate. In this report we develop control charts for monitoring these sources of variation as well as the process average. An example of how to use the control charts is given, using Field 89 data from functional testing of the MC3854 neutron tube.

Efficient use of a distributed memory parallel computer requires that the computational load be balanced across processors in a way that minimizes interprocessor communication. We present a new domain mapping algorithm that extends recent work in which ideas from spectral graph theory have been applied to this problem. Our generalization of spectral graph bisection involves a novel use of multiple eigenvectors to allow for division of a computation into four or eight parts at each stage of a recursive decomposition. The resulting method is suitable for scientific computations like irregular finite elements or differences performed on hypercube or mesh architecture machines. Experimental results confirm that the new method provides better decompositions arrived at more economically and robustly than with previous spectral methods. We have also improved upon the known spectral lower bound for graph bisection.

In 1991, Sandia National Laboratories acquired a Network Storage Service (NSS) as a result of a fully competitive procurement. The Network Storage Service, which provides access to over a terabyte of data storage in a two-tiered hierarchy, had minimal software security features. Before the NSS could be placed into production, it had to be accredited by the Department of Energy, Sandia`s accrediting authority. Sandia was faced with implementing security features to allow the NSS to be operated in its secure computing network, which is a single security clearance, multiple data security level environment. This paper describes the software security design alternatives that were considered and what was ultimately implemented.

Archimedes is a prototype mechanical assembly system which generates and executes robot assembly programs from a CAD model input. The system seeks to increase flexibility in robotic mechanical assembly applications by automating the programming task. Input is a solid model of the finished assembly, augmented by additional design information such as weld specifications. Parts relationships and geometric constraints are deduced from the solid model. A rule-based planner generates a ``generic`` assembly plan that satisfies the geometric constraints, as well as other constraints embodied in the rules. A plan compiler then converts the generic plan into code specific to an application environment. Other outputs include fixture designs, workcell layout information, object-recognition (vision) routines, grasp plans, and executable code for controlling the robot and workcell accessories. Lessons from operating and demonstrating the system are presented, with a particular emphasis on the implications for future systems. 12 refs.

This paper presents a method to solve partial differential equations governing two-phase fluid flow by using a genetic algorithm on the NCUBE/2 multiprocessor computer. Genetic algorithms represent a significant departure from traditional approaches of solving fluid flow problems. The inherent parallelism of genetic algorithms offers the prospect of obtaining solutions faster than ever possible. The paper discusses the two-phase flow equations, the genetic representation of the unknowns, the fitness function, the genetic operators, and the implementation of the genetic algorithm on the NCUBE/2 computer. The paper investigates the implementation efficiency using a pipe blowdown test and presents the effects of varying both the genetic parameters and the number of processors. The results show that genetic algorithms provide a major advancement in methods for solving two-phase flow problems. A desired goal of solving these equations for a specific simulation problem in real time or faster requires computers with an order of magnitude more processors or faster than the NCUBE/2`s 1024.

A new algorithm for the treatment of sliding interfaces between solids with or without friction in an Eulerian wavecode is described. The algorithm has been implemented in the two-dimensional version of the CTH code. The code was used to simulate penetration and perforation of aluminum plates by rigid, conical-nosed tungsten projectiles. Comparison with experimental data is provided.

Many complex physical processes are modeled by coupled systems of partial differential equations (PDEs). Often, the numerical approximation of these PDEs requires the solution of large sparse nonsymmetric systems of equations. In this paper we compare the parallel performance of a number of preconditioned Krylov subspace methods on a large-scale MIMD machine. These methods are among the most robust and efficient iterative algorithms for the solution of large sparse linear systems. They are easy to implement on various architectures and work well on a wide variety of important problems. In this comparison we focus on the parallel issues associated with both local preconditioners (those that combine information from the entire domain). The various preconditioners are applied to a variety of PDE problems within the GMRES, CCGS, BiCGSTAB, and QMRCGS methods. Conclusions are drawn on the effectiveness of the different schemes based on results obtained from a 1024 processor a nCUBE 2 hypercube.

A series of experiments has been performed on the Sandia Hypervelocity Launcher to determine the performance limits of conventional Whipple shields against representative 0.8 g aluminum orbital debris plate-like fragments with velocities of 7 and 10 km/s. Supporting diagnostics include flash X-rays, high speed photography and transient digitizers for timing correlation. Two Whipple shield designs were tested with either a 0.030 cm or a 0.127 cm thick front sheet and a 0.407 cm thick backsheet separated by 30.5 cm. These two designs bracket the ballistic penetration limit curve for protection against these debris simulants for 7 km/s impacts.

Acoustic telemetry has been a dream of the drilling industry for the past 50 years. It offers the promise of data rates which are one-hundred times greater than existing technology. Such a system would open the door to true logging-while-drilling technology and bring enormous profits to its developers. The basic idea is to produce an encoded sound wave at the bottom of the well, let it propagate up the steel drillpipe, and extract the data from the signal at the surface. Unfortunately, substantial difficulties arise. The first difficult problem is to produce the sound wave. Since the most promising transmission wavelengths are about 20 feet, normal transducer efficiencies are quire low. Compounding this problem is the structural complexity of the bottomhole assembly and drillstring. For example, the acoustic impedance of the drillstring changes every 30 feet and produces an unusual scattering pattern in the acoustic transmission. This scattering pattern causes distortion of the signal and is often confused with signal attenuation. These problems are not intractable. Recent work has demonstrated that broad frequency bands exist which are capable of transmitting data at rates up to 100 bits per second. Our work has also identified the mechanism which is responsible for the observed anomalies in the patterns of signal attenuation. Furthermore in the past few years a body of experience has been developed in designing more efficient transducers for application to metal waveguides. The direction of future work is clear. New transducer designs which are more efficient and compatible with existing downhole power supplies need to be built and tested; existing field test data need to be analyzed for transmission bandwidth and attenuation; and the new and less expensive methods of collecting data on transmission path quality need to be incorporated into this effort. 11 refs.

Geologic materials are often modeled with discrete spheres because the material is not continuous and discrete spherical models simplify the mathematics. Spherical element models have been created using assemblages of spheres with a specified particle size distribution or by assuming the particles are all the same size and making the assemblage a close-packed array of spheres. Both of these approaches yield a considerable amount of material dilatation upon movement. This has proven to be unsatisfactory for sedimentary rock formations that contain bedding planes where shear movement can occur with minimal dilatation of the interface. A new concept referred to as packing angle has been developed to allow the modeler to build arrays of spheres that are the same size but have the rows of spheres offset from each other. ne row offset is a function of the packing angle and allows the modeler to control the dilatation as rows of spheres experience relative horizontal motion.

Sandia National Laboratories and ICI Explosives USA have worked together since 1987 to develop computer modeling techniques for Rock Blasting. A result of this effort is the computer program DMC (Distinct Motion Code) which was developed for two-dimensional simulation of rock motion following a blast (Taylor and Preece, 1989 1992). This program has been used to study blasting-induced rock motion resulting from oil shale mining and has been coupled with a gas flow computation capability for better treatment of the explosive behavior. This past year it has been customized for simulations of bench blasting in coat mines and rock quarries (Preece and Knudsen, 1992b). The explicit descretized nature of DMC gives it an advantage over previous blast modeling programs because subtle differences, such as row delay timing, have an influence on the results. This paper will present a DMC study of the influence on percent cast of row delay timing in a typical coal mine bench blast.

Relativistic high current electron beams can be transported long distances across the geomagnetic field using the IFR (Ion focused Regime) technique. IFR is a method of providing strong electrostatic focusing and guiding of the beam. The guiding is sufficiently strong to allow the beam to transport any angle with respect to geomagnetic field. In the IFR method, first an ionizing laser (or any ionizing method) is used to create a preionized cylindrical channel.

Blade fatigue life is an important element in determining the economic viability of the Vertical-Axis Wind Turbine (VAWT). A principal source of blade fatigue is thought to be the stochastic (i.e., random) aerodynamic loads created by atmospheric turbulence. This report describes the theoretical background of the VAWT Stochastic Aerodynamic Loads (VAWT-SAL) computer code, whose purpose is to numerically simulate these random loads, given the rotor geometry, operating conditions, and assumed turbulence properties. A Double-Multiple-Stream Tube (DMST) analysis is employed to model the rotor's aerodynamic response. The analysis includes the effects of Reynolds number variations, different airfoil sections and chord lengths along the blade span, and an empirical model for dynamic stall effects. The mean ambient wind is assumed to have a shear profile which is described by either a power law or a logarithmic variation with height above ground. Superimposed on this is a full 3-D field of turbulence: i.e., in addition to random fluctuations in time, the turbulence is allowed to vary randomly in planes perpendicular to the mean wind. The influence of flow retardation on the convection of turbulence through the turbine is also modeled. Calculations are presented for the VAWT 34-m Test Bed currently in operation at Bushland, Texas. Predicted time histories of the loads, as well as their Fourier spectra, are presented and discussed. Particular emphasis is placed on the differences between so-called steady-state'' (mean wind only) predictions, and those produced with turbulence present. Somewhat surprisingly, turbulence is found to be capable of either increasing or decreasing the average output power, depending on the turbine's tip-speed ratio. A heuristic explanation for such behavior is postulated, and a simple formula is derived for predicting the magnitude of this effect without the need for a full stochastic simulation. 41 refs., 32 figs., 1 tab.

The hypervelocity impact of a particle on a surface generates a jet of shocked material which is thrown from the impact site. A simple analytic model has been developed to obtain expressions for the evolution of this jet of ejecta. The analysis is based on applying the conservation equations of mass and momentum to the problem of a normal impact of a sphere against a semi-infinite flat target. Expressions are developed for the evolution of the jet velocity, jet release point and the locus of points which describe the ejecta envelope. These analytical ejecta profiles are compared with high speed photographs of impact jet formation.

Our charged particle simulation models a relativistic electron beam for which the field solution is local and thus requires no grid. We have implemented the simulation on a CRAY and on two parallel machines, a nCUBE 2 and Connection Machine. We present implementation details and contrast the approaches necessary for the three architectures. On the parallel machines a dynamic load-balancing problem arises because the beam grows uniformly in one dimension from a few hundred to hundreds of thousands of particles as the simulation progresses. We discuss a folded Gray-code mapping of the processors to the length scale of the simulation that expands (or shrinks) as the beam changes length so as to minimize inter-processor communication. This improves the efficiency of the nCUBE version of the simulation which runs at 10x the speed of the vectorized CRAY version.