The 9/30/2007 ASC Level 2 Post-Processing V&V Milestone (Milestone 2360) contains functionality required by the user community for certain verification and validation tasks. These capabilities include loading of edge and face data on an Exodus mesh, run-time computation of an exact solution to a verification problem, delivery of results data from the server to the client, computation of an integral-based error metric, simultaneous loading of simulation and test data, and comparison of that data using visual and quantitative methods. The capabilities were tested extensively by performing a typical ALEGRA HEDP verification task. In addition, a number of stretch criteria were met including completion of a verification task on a 13 million element mesh.
The Z facility at Sandia National Laboratories produces high energy density environments. Computer simulations of the experiments provide key insights and help make the most efficient use of the facility. This document estimates the computer resources needed in order to support the experimental program. The resource estimate is what we would like to have in about five years and assumes that we will have a robust, scalable simulation capability as well as enough physicists to run the simulations.
Domain decomposed Monte Carlo codes, like other domain-decomposed codes, are difficult to debug. Domain decomposition is prone to error, and interactions between the domain decomposition code and the rest of the algorithm often produces subtle bugs. These bugs are particularly difficult to find in a Monte Carlo algorithm, in which the results have statistical noise. Variations in the results due to statistical noise can mask errors when comparing the results to other simulations or analytic results. If a code can get the same result on one domain as on many, debugging the whole code is easier. This reproducibility property is also desirable when comparing results done on different numbers of processors and domains. We describe how reproducibility, to machine precision, is obtained on different numbers of domains in an Implicit Monte Carlo photonics code.
The spherical harmonics (P{sub n}) approximation to the transport equation for time dependent problems has previously been treated using Riemann solvers and explicit time integration. Here we present an implicit time integration method for the P n equations using Riemann solvers. Both first-order and high-resolution spatial discretization schemes are detailed. One facet of the high-resolution scheme is that a system of nonlinear equations must be solved at each time step. This nonlinearity is the result of slope reconstruction techniques necessary to avoid the introduction of artifical extrema in the numerical solution. Results are presented that show auspicious agreement with analytical solutions using time steps well beyond the CFL limit.
ALEGRA is an arbitrary Lagrangian-Eulerian finite element code that emphasizes large distortion and shock propagation in inviscid fluids and solids. This document describes user options for modeling resistive magnetohydrodynamics, thermal conduction, and radiation transport effects, and two material temperature physics.
ALEGRA is an arbitrary Lagrangian-Eulerian multi-material finite element code used for modeling solid dynamics problems involving large distortion and shock propagation. This document describes the basic user input language and instructions for using the software.
Photon radiation transport is described by the Boltzmann equation. Because this equation is difficult to solve, many different approximate forms have been implemented in computer codes. Several of the most common approximations are reviewed, and test problems illustrate the characteristics of each of the approximations. This document is designed as a tutorial so that code users can make an educated choice about which form of approximate radiation transport to use for their particular simulation.