Search NASA⌕ Search

SEARCH · Search NASA

Results for “Types Of Problems”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

MCNPs Easy Sources for (α,n) (MESA) 1.0: A User’s Guide

MCNPs Easy Sources for Alpha,N (MESA) facilitates the construction of MCNP source definition cards for (α,n) sources. It is a complete re-write of the homogeneous, surface source, and three layer problem types from Sources4c. Please refer to this reference for documentation on the cross-sections and neutron emission spectra. The one departure from Sources4c is the use of alpha energies and activities from the ISC ENDF VII or VIII library specified by the user.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

A large-scale benchmarking of deterministic and stochastic derivative-free optimization algorithms

This presentation summarizes our work in the PrOMMiS project on benchmarking of data-driven optimization algorithms and their applications in self-driving laboratories. This work supports the broader project goal of accelerating the identification of promising separation methods and operating conditions for critical minerals separation processes. We present a systematic benchmarking study of 42 data-driven optimization algorithms on a broad collection of 502 test problems. The results identify BAM, GLCCLUSTER, and MULTIMIN as the most effective optimization solvers, with BAM showing the highest overall performance and solving more than 80% of the benchmark problems. The study also shows that no single solver consistently outperforms the others across all problem types, indicating that our future laboratory applications may benefit from using a small set of strong solvers rather than relying on a single method. The presentation also illustrates an in-silico chemical reactor case study showing that data-driven optimization methods can guide autonomous experimentation in a self-driving laboratory and identify optimal operating conditions within a small number of experiments. Overall, the results provide a basis for selecting efficient optimization methods and demonstrate the practical use of data-driven optimization in self-driving laboratory workflows.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Algorithm-guided experimentation for autonomous AI systems in self-driving laboratories

This presentation summarizes our work in the PrOMMiS project on benchmarking of data-driven optimization algorithms and their applications in self-driving laboratories. This work supports the broader project goal of accelerating the identification of promising separation methods and operating conditions for critical minerals separation processes. We present a systematic benchmarking study of 42 data-driven optimization algorithms on a broad collection of 502 test problems. The results identify BAM, GLCCLUSTER, and MULTIMIN as the most effective optimization solvers, with BAM showing the highest overall performance and solving more than 80% of the benchmark problems. The study also shows that no single solver consistently outperforms the others across all problem types, indicating that our future laboratory applications may benefit from using a small set of strong solvers rather than relying on a single method. The presentation also illustrates an in-silico chemical reactor case study showing that data-driven optimization methods can guide autonomous experimentation in a self-driving laboratory and identify optimal operating conditions within a small number of experiments. Overall, the results provide a basis for selecting efficient optimization methods and demonstrate the practical use of data-driven optimization in self-driving laboratory workflows.

36 MATERIALS SCIENCE↗
DOE OSTI2020

H2OI95: A Stand-Alone Fortran Code for Evaluating the IAPWS-95 Equation-of-State Model for Water (Rev. 1)

H2OI95 is a stand-alone Fortran code for evaluating the IAPWS-95 equation-of-state model for the thermodynamic properties of water. It also evaluates the corresponding thermochemical properties of water consistent with the CODATA recommendations. The IAPWS-95 model is based on a model equation for the dimensionless Helmholtz energy for which the primary variables are the inverse reduced temperature (τ = T cr /T ) and reduced density (δ = ρ/ρ cr ). Here T is the absolute temperature (K), ρ is density (kg/m³), and the subscript “ cr ” refers to the critical point of water (647.096 K and 22.064 MPa pressure in this model, for which ρ cr is 322 kg/m³). The code solves four basic types of problems, distinguished by the specified inputs: 1. Temperature (K) and density (ρ kg/m³) or reduced density (δ) 2. Temperature (K) and pressure (MPa). 3. Temperature (K) on the saturation (liquid-vapor equilibrium) curve 4. Pressure (MPa) on the saturation curve. Each type of problem is run using a corresponding input (text) file. All but the first type of problem require iteration. For example, to solve for desired temperature and pressure, the reduced density must be adjusted to give the desired pressure. Iteration is accomplished using the Newton-Raphson method, though the secant method is also used in solving the fourth type of problem. For the last three types of problems, H2OI95 has been used to conduct numerical studies of convergence and the problem of multiple numerical solutions, some of which are not physically valid. Obtaining valid results depends mainly on appropriate choice of starting values for the density. The default values used in H2OI95 appear to consistently lead to generally desired results. With modification (not addressed here), H2OI95 can be used to support SUPCRT92 and similar codes that compute chemical thermodynamic properties of species and reactions over a wide range of temperature and pressure (273.16-1273K and 0-1000 MPa). Version 1.1 of this software calculates an extended set of water properties, including some derivable solely from IAPWS-95, such as the isobaric thermal expansivity and the isothermal compressibility, and still other properties based on supplementary models sanctioned by IAPWS, including the dynamic viscosity, thermal conductivity, surface tension, and static dielectric constant, and various other properties (notably Debye-Hückel parameters) derivable from the dielectric constant and its partial derivatives with respect to temperature and pressure. A coding error in Version 1.0 was identified while testing the implementation of the viscosity model. This error is described in Appendix C. It mainly affects calculation of “higher order” properties such as compressibility and heat capacity near the critical point.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)

The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.

127 Qubits↗
DOE OSTI2024

MCNPs Easy Sources for (α,n) (MESA):Verification with Sources4c

MESA is intended to be a direct re-implementation of the algorithms documented in the Sources manual in C++. However, some fundamental changes to the computational structure and logic were made to avoid the use of goto, require consistency in input definition, and reduce computational approximations in later steps of three-layer problems. In addition, MESA uses α-decay information from ISC libraries (based on ENDF). In most cases, differences between Sources4c and MESA are dominated by differences in decay energy spectra and intensities. To verify this we have reproduced 6 problems that are documented examples or samples in Sources4c. These problems cover the three types of problems MESA currently supports: homogeneous, interface, and three-layer.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

A Fast and Scalable Genetic Algorithm-Based Approach for Planning of Microgrids in Distribution Networks

As a result of climate change, extreme weather events are occurring more frequently and with increasing impact. This trend poses a significant challenge for distribution utilities and system operators to ensure that there is uninterrupted power supply to critical loads in their networks; thus, the level of proactive preparation of the distribution system to be able to handle severe impacts of extreme weather events represents the system's resilience. One method that distribution system planners can use to prepare for future extreme events is to plan multiple microgrids which can use local generation as much as possible to supply critical loads. But partitioning an existing distribution system such that multiple feasible islands are planned and which are capable of supporting critical loads is still challenging for distribution systems - first, because of the size of the network graph partitioning problem and, second, because of the difficulty in properly formulating the desired attributes of such islands or microgrids. Therefore, this paper presents a genetic algorithm based approach that facilitates incorporating multiple objectives for grid partitioning by formulating two types of problems - node allocation and edge elimination - and it considers multiple topological and resilience-enhancing objectives. The performance of the proposed genetic algorithm-based approach is numerically evaluated on multiple test systems as well as on a real distribution feeder in Colorado, United States.

genetic algorithm↗
DOE OSTI2021

Solving Inverse Stochastic Problems from Discrete Particle Observations Using the Fokker--Planck Equation and Physics-Informed Neural Networks

The Fokker--Planck (FP) equation governing the evolution of the probability density function (PDF) is applicable to many disciplines, but it requires specification of the coefficients for each case, which can be functions of space-time and not just constants and hence require the development of a data-driven modeling approach. When the data available is directly on the PDF, there exist methods for inverse problems that can be employed to infer the coefficients and thus determine the FP equation and subsequently obtain its solution. Herein, we address a more realistic scenario, where only sparse data are given on the particles' positions at a few time instants, which are not sufficient to accurately construct directly the PDF even at those times from existing methods, e.g., kernel estimation algorithms. To this end, we develop a general framework based on physics-informed neural networks (PINNs) that introduces a new loss function using the Kullback--Leibler divergence to connect the stochastic samples with the FP equation to simultaneously learn the equation and infer the multidimensional PDF at all times. In particular, we consider two types of inverse problems, type I, where the FP equation is known but the initial PDF is unknown, and type II, in which, in addition to the unknown initial PDF, the drift and diffusion terms are also unknown. In both cases, we investigate problems with either Brownian or Lévy noise or a combination of both. Here, we demonstrate the new PINN framework in detail in the one-dimensional (1D) case, but we also provide results for up to five dimensions demonstrating that we can infer both the FP equation and dynamics simultaneously at all times with high accuracy using only very few discrete observations of the particles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Overview of RFID Applications Utilizing Neural Networks

As Radio Frequency Identification (RFID) methods continue to evolve to higher levels of complexity, one form of machine learning is making its appearance. The use of Neural Networks (NN) in the RFID field is steadily increasing, and in the fields of localization and activity recognition, promising results are being shown from a variety of research. RFID applications fall primarily under two types of problems including regression and classification. We analyze RIFD localization techniques which fall under regression, and activity recognition which falls under classification. Many works don’t classify themselves as activity recognition methods, but because they fall under the classification category, we still consider them as activity recognition techniques. This research overviews the Neural Network models in the localization field based on whether they can perform independently of the environment in which they were tested. For activity recognition and accessory fields, the major methods involve tag-based and tag-free approaches. In conclusion, after the models are surveyed, a comparison study is given to examine what may be the cause for increased accuracy between different Neural Network models.

42 ENGINEERING↗
DOE OSTI2020

An Efficient Numerical Algorithm for Solving Data Driven Feedback Control Problems

The goal of this paper is to solve a class of stochastic optimal control problems numerically, in which the state process is governed by an Itô type stochastic differential equation with control process entering both in the drift and the diffusion, and is observed partially. The optimal control of feedback form is determined based on the available observational data. In this work, we call this type of control problems the data driven feedback control. The computational framework that we introduce to solve such type of problems aims to find the best estimate for the optimal control as a conditional expectation given the observational information. To make our method feasible in providing timely feedback to the controlled system from data, we develop an efficient stochastic optimization algorithm to implement our computational framework.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Solving a class of infinite-dimensional tensor eigenvalue problems by translational invariant tensor ring approximations

Here, we examine a method for solving an infinite-dimensional tensor eigenvalue problem Hx = λx, where the infinite-dimensional symmetric matrix H exhibits a translational invariant structure. We provide a formulation of this type of problem from a numerical linear algebra point of view and describe how a power method applied to e -Ht is used to obtain an approximation to the desired eigenvector. This infinite-dimensional eigenvector is represented in a compact way by a translational invariant infinite Tensor Ring (iTR). Low rank approximation is used to keep the cost of subsequent power iterations bounded while preserving the iTR structure of the approximate eigenvector. We show how the averaged Rayleigh quotient of an iTR eigenvector approximation can be efficiently computed and introduce a projected residual to monitor its convergence. In the numerical examples, we illustrate that the norm of this projected iTR residual can also be used to automatically modify the time step to ensure accurate and rapid convergence of the power method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

An efficient solution of low-frequency magnetic problems with voltage sources using all-frequency stable formulation

The modeling and simulation of magnetic problems at low frequencies are considered in this paper. When excited with a voltage source, conduction current is induced in the circuit of interest, which generates the magnetic field. This type of problems is modeled using the all-frequency stable formulation, which employs the potential description of fields with an inhomogeneous Coulomb gauge. With the aid of the stable formulation, the low-frequency breakdown problem is circumvented and both electric and magnetic fields can be solved in a single simulation. To solve large magnetic problems efficiently, it is necessary to employ an iterative solver with an efficient preconditioner. In this work, a preconditioner based on the incomplete LU decomposition is constructed and applied in a wide frequency range. Several numerical examples are given to demonstrate the performance of the proposed method.

Mekonnen, Minyechil↗
DOE OSTI2022

A Fast and Scalable Genetic Algorithm-Based Approach for Planning of Microgrids in Distribution Networks: Preprint

As a result of climate change, extreme weather events are occurring more frequently and with increasing impact. This trend poses a significant challenge for distribution utilities and system operators to ensure that there is uninterrupted power supply to critical loads in their networks; thus, the level of proactive preparation of the distribution system to be able to handle severe impacts of extreme weather events represents the system's resilience. One method that distribution systems use to prepare for extreme events is to form multiple microgrids and thereby isolate themselves from the grid supply by using local generation as much as possible to supply critical loads. But partitioning an existing system into multiple feasible islands capable of supporting critical loads is still challenging for distribution systems - first, because of the size of the graph partitioning problem and, second, because of the difficulty in properly formulating the desired attributes of such islands or microgrids. Therefore, this paper presents a genetic algorithmbased approach that facilitates incorporating multiple objectives for grid partitioning by formulating two types of problems - node allocation and edge elimination - and it considers multiple topological and resilience-enhancing objectives. The performance of the proposed genetic algorithm-based approach is numerically evaluated on multiple test systems as well as on a real distribution feeder in Colorado, USA.

edge elimination↗
DOE OSTI2021

Solving the $k$-Sparse Eigenvalue Problem with Reinforcement Learning

We examine the possibility of using a reinforcement learning (RL) algorithm to solve large-scale eigenvalue problems in which the desired the eigenvector can be approximated by a sparse vector with at most k nonzero elements, where k is relatively small compare to the dimension of the matrix to be partially diagonalized. Here, this type of problem arises in applications in which the desired eigenvector exhibits localization properties and in large-scale eigenvalue computations in which the amount of computational resource is limited. When the positions of these nonzero elements can be determined, we can obtain the k-sparse approximation to the original problem by computing eigenvalues of a k × k submatrix extracted from k rows and columns of the original matrix. We review a previously developed greedy algorithm for incrementally probing the positions of the nonzero elements in a k-sparse approximate eigenvector and show that the greedy algorithm can be improved by using an RL method to refine the selection of k rows and columns of the original matrix. We describe how to represent states, actions, rewards and policies in an RL algorithm designed to solve the k-sparse eigenvalue problem and demonstrate the effectiveness of the RL algorithm on two examples originating from quantum many-body physics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

An asymptotically compatible approach for Neumann-type boundary condition on nonlocal problems

In this paper we consider 2D nonlocal diffusion models with a finite nonlocal horizon parameter δ characterizing the range of nonlocal interactions, and consider the treatment of Neumann-like boundary conditions that have proven challenging for discretizations of nonlocal models. We propose a new generalization of classical local Neumann conditions by converting the local flux to a correction term in the nonlocal model, which provides an estimate for the nonlocal interactions of each point with points outside the domain. While existing 2D nonlocal flux boundary conditions have been shown to exhibit at most first order convergence to the local counter part as δ → 0, the proposed Neumann-type boundary formulation recovers the local case as O(δ 2 ) in the L∞(Ω) norm, which is optimal considering the O(δ 2 ) convergence of the nonlocal equation to its local limit away from the boundary. We analyze the application of this new boundary treatment to the nonlocal diffusion problem, and present conditions under which the solution of the nonlocal boundary value problem converges to the solution of the corresponding local Neumann problem as the horizon is reduced. To demonstrate the applicability of this nonlocal flux boundary condition to more complicated scenarios, we extend the approach to less regular domains, numerically verifying that we preserve second-order convergence for non-convex domains with corners. Finally, based on the new formulation for nonlocal boundary condition, we develop an asymptotically compatible meshfree discretization, obtaining a solution to the nonlocal diffusion equation with mixed boundary conditions that converges with O(δ 2 ) convergence.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Radiometric Testing of Germicidal UV Products, Round 1: UV-C Towers and Whole-Room Luminaires (CALiPER Summary Report)

This summary report analyzes the independently tested performance of 13 germicidal ultraviolet (GUV) products purchased between February and July 2022. A companion full report (DOE 2023) provides additional information and discussion of the tested products, test methods, and results. The products were of three different types: • Seven portable, consumer-oriented GUV towers designed to be placed on the floor or a desk of an unoccupied room to disinfect air and surfaces. Five of these products used LED sources and two products had low-pressure mercury (LPM) sources. • One GUV whole-room luminaire designed to be installed on a ceiling to disinfect air when a room is occupied. This product had LED sources. • Five GUV troffer or high-bay style whole-room luminaires designed to be installed in or suspended from a ceiling to disinfect air and surfaces when a room is unoccupied. All five had LPM sources. Product testing covered radiometric and electrical performance for all 13 products as well as photobiological safety evaluation if product documentation included testable claims. Measurement results enable comparison between products and against manufacturer or vendor claims. Testing identified numerous issues related to the accuracy of claimed GUV product performance. Claims were often untestable, contradictory, ambiguous, or used incorrect units and/or terminology. When claims were testable, they often did not match test results. For example, three LED products that claimed to emit UV-C emitted only UV-A. Product claim issues were more common among consumer-oriented tower products, but all product types exhibited problems with accurate performance claims. The UV-C radiant efficiency (calculated as UV-C output power divided by electrical input power) of the products varied widely, even among similar products using the same source technologies. For example, the UV-C radiant efficiency of LPM products varied by greater than a factor of three for the same product type, indicating a large potential energy savings opportunity for products that are better designed for efficiency. LED products had orders-of-magnitude lower UV-C radiant efficiency than LPM products. This study also identified several testing challenges and limitations. Most significant among these is the capability to accurately test and report the performance of larger GUV products. Whereas integrating spheres are used to quickly measure total radiant flux (i.e., output power) and spectral distribution, goniometers are used to measure radiant intensity distribution (from which radiant flux can be calculated). Integrating spheres require a specialized and costly coating to test UV, and the testing laboratory for this round of products had only a 20-inch diameter hemisphere with this capability. The integrating sphere accommodated just 2 of the 10 UV-C emitting products. Goniometer testing had a different size limitation in that mirrors typically used to increase goniometer test distance to the far field reflect little to no UV. As a result, the study evaluated only 6 of 13 products in the far field. Electronic files of UV-C intensity data for the other 7 products, which would typically be imported into design software for designing GUV applications, may not be reliable for predicting irradiance at arbitrary far-field distances (IES 2022a; CIE 2020). Specifiers and buyers of GUV products need accurate performance claims and data to deploy GUV technology safely and effectively. This CALiPER GUV Round 1 report demonstrates the significant education and training manufacturers and vendors still require to accurately test and report the performance of their GUV products. Further industry standards and guidelines may address testing limitations and improve test methods, product performance, and the accuracy of performance claims.

42 ENGINEERING↗
DOE OSTI2023

Radiometric Testing of Germicidal UV Products, Round 1: UV-C Towers and Whole-Room Luminaires (CALiPER Full Report)

This report analyzes the independently tested performance of 13 germicidal ultraviolet (GUV) products purchased between February and July 2022. The products were of three different types: • Seven portable, consumer-oriented GUV towers designed to be placed on the floor or a desk of an unoccupied room to disinfect air and surfaces. Five of these products used LED sources and two products had low-pressure mercury (LPM) sources. • One GUV whole-room luminaire designed to be installed on a ceiling to disinfect air when a room is occupied. This product had LED sources. • Five GUV troffer or high-bay style whole-room luminaires designed to be installed in or suspended from a ceiling to disinfect air and surfaces when a room is unoccupied. All five had LPM sources. Product testing covered radiometric and electrical performance for all 13 products as well as photobiological safety evaluation if product documentation included testable claims. Measurement results enable comparison between products and against manufacturer or vendor claims. Testing identified numerous issues related to the accuracy of claimed GUV product performance. Claims were often untestable, contradictory, ambiguous, or used incorrect units and/or terminology. When claims were testable, they often did not match test results. For example, three LED products that claimed to emit UV-C emitted only UV-A. Product claim issues were more common among consumer-oriented tower products, but all product types exhibited problems with accurate performance claims. The UV-C radiant efficiency (calculated as UV-C output power divided by electrical input power) of the products varied widely, even among similar products using the same source technologies. For example, the UV-C radiant efficiency of LPM products varied by greater than a factor of three for the same product type, indicating a large potential energy savings opportunity for products that are better designed for efficiency. LED products had orders-of-magnitude lower UV-C radiant efficiency than LPM products. This study also identified several testing challenges and limitations. Most significant among these is the capability to accurately test and report the performance of larger GUV products. Whereas integrating spheres are used to quickly measure total radiant flux (i.e., output power) and spectral distribution, goniometers are used to measure radiant intensity distribution (from which radiant flux can be calculated). Integrating spheres require a specialized and costly coating to test UV, and the testing laboratory for this round of products had only a 20-inch diameter hemisphere with this capability. The integrating sphere accommodated just 2 of the 10 UV-C emitting products. Goniometer testing had a different size limitation in that mirrors typically used to increase goniometer test distance to the far field reflect little to no UV. As a result, the study evaluated only 6 of 13 products in the far field. Electronic files of UV-C intensity data for the other 7 products, which would typically be imported into design software for designing GUV applications, may not be reliable for predicting irradiance at arbitrary far-field distances (IES 2022a; CIE 2020). Specifiers and buyers of GUV products need accurate performance claims and data to deploy GUV technology safely and effectively. This CALiPER GUV Round 1 report demonstrates the significant education and training manufacturers and vendors still require to accurately test and report the performance of their GUV products. Further industry standards and guidelines may address testing limitations and improve test methods, product performance, and the accuracy of performance claims.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Verification of a specialized hydrodynamic simulation code for modeling deflagration and detonation of high explosives

A specialized hydrodynamic simulation code has been developed and verified for the simulation of one-dimensional unsteady problems involving the detonation and deflagration of high explosives. To model all the relevant physical processes in these problems, a code is required to simulate compressible hydrodynamics, unsteady thermal conduction, and chemical reactions with complex rate laws. Several verification exercises are presented which test the implementation of these capabilities. The code also requires models for physics processes such as equations of state and conductivity for pure materials and mixtures as well as rate laws for chemical reactions. Additional verification tests are required to ensure that these models are implemented correctly. Though this code is limited in the types of problems it can simulate, its computationally efficient formulation allows it to be used in calibration studies for reactive burn models for high explosives. Furthermore, this study demonstrates how a series of verification tests can be used to ensure that the various physics processes needed to simulate complex phenomenon can be tested to ensure that they are correctly implemented.

97 MATHEMATICS AND COMPUTING↗