Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm complexity analysis”

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 541 records · Page 30

Differential methods for assessing sensitivity in biological models

Differential sensitivity analysis is indispensable in fitting parameters, understanding uncertainty, and forecasting the results of both thought and lab experiments. Although there are many methods currently available for performing differential sensitivity analysis of biological models, it can be difficult to determine which method is best suited for a particular model. In this paper, we explain a variety of differential sensitivity methods and assess their value in some typical biological models. First, we explain the mathematical basis for three numerical methods: adjoint sensitivity analysis, complex perturbation sensitivity analysis, and forward mode sensitivity analysis. We then carry out four instructive case studies. (a) The CARRGO model for tumor-immune interaction highlights the additional information that differential sensitivity analysis provides beyond traditional naive sensitivity methods, (b) the deterministic SIR model demonstrates the value of using second-order sensitivity in refining model predictions, (c) the stochastic SIR model shows how differential sensitivity can be attacked in stochastic modeling, and (d) a discrete birth-death-migration model illustrates how the complex perturbation method of differential sensitivity can be generalized to a broader range of biological models. Finally, we compare the speed, accuracy, and ease of use of these methods. We find that forward mode automatic differentiation has the quickest computational time, while the complex perturbation method is the simplest to implement and the most generalizable.

59 BASIC BIOLOGICAL SCIENCES↗

A Butterfly-Accelerated Volume Integral Equation Solver for Broad Permittivity and Large-Scale Electromagnetic Analysis

In this work, a butterfly-accelerated volume integral equation (VIE) solver is proposed for fast and accurate electromagnetic (EM) analysis of scattering from heterogeneous objects. The proposed solver leverages the hierarchical off-diagonal butterfly (HOD-BF) scheme to construct the system matrix and obtain its approximate inverse, used as a preconditioner. Complexity analysis and numerical experiments validate the O(N log 2 N) construction cost of the HOD-BF-compressed system matrix and O(N log 1.5 N) inversion cost for the preconditioner, where N is the number of unknowns in the high-frequency EM scattering problem. For many practical scenarios, the proposed VIE solver requires less memory and computational time to construct the system matrix and obtain its approximate inverse compared to a H matrix-accelerated VIE solver. The accuracy and efficiency of the proposed solver have been demonstrated via its application to the EM analysis of large-scale canonical and real-world structures comprising of broad permittivity values and involving millions of unknowns.

42 ENGINEERING↗

Locally purified maximally mixed states at scale: Entanglement pruning and symmetries

Locally Purified Density Operators (LPDOs) are state-of-the-art tensor network ansatze candidates that efficiently represent mixed quantum states at scale. However, given their non-uniqueness, their representational complexity is generally sub-optimal in practical computations. Here, in this work we perform a comprehensive numerical and analytical analysis and resolve this issue in the experimentally relevant limit where noise depolarizes the density operator into a maximally mixed state. To resolve the sub-optimality issue, we analyze two numerical tools, one analytic method, and detail the relations between them. The numerical tools used are fidelity-preserving truncations and isometric gauge transformations leveraging Riemannian optimizations over entropic objective functions. In addition, by invoking the injectivity and symmetry constraints of the maximally mixed LPDO, we also present analytical closed-form expressions for the disentangler and discuss their relation to numerical optimizers. Further, away from the maximally mixed state, our simulations highlight how the truncation threshold smoothly interpolate, as a function of depolarization, between established matrix product results and our new results. Our work shows how, by minimizing the resources required to represent key states of practical interest in experiment, the efficiency of tensor network algorithms can be substantially increased. This paves the path for uncovering tensor network’s fundamental scalability limits and latent potential in representing the wide locus of mixed quantum states that are accessible on near-term quantum devices.

Gangapuram, Amit Jamadagni [Oak Ridge National Lab↗

Journey to Time-Variable Moment Tensors through Inversion of Acoustic and Seismoacoustic Data

We explore the capability of acoustic and seismoacoustic datasets to directly resolve a complex, time-variable source consisting of a buried mechanism, represented as a moment tensor, and a spall mechanism, represented as a vertical force at the surface. Traditionally, each component of a resolved moment tensor assumes one underlying source time function, which likely fails to capture the full evolution of a dynamic source, such as an explosion followed by slip on near-source joints or development of spallation. Specifically, we expand previous work to resolve a time-variable moment tensor using single-modality and joint-modality inversion frameworks through analysis of infrasound and seismoacoustic data recorded as part of the Source Physics Experiment Phase II: Dry Alluvium Geology (DAG). We investigate the impact of including signals from seismic-to-air coupling that are local to each infrasound sensor in comparison to mainly atmosphere-propagating acoustic signals, which occur from coupling of the wavefield from the subsurface to the atmosphere directly above the source. Additionally, we assess the ability of our inversion algorithm to fit observed infrasound data using a variety of time-variable source mechanisms. First, we consider the buried moment tensor source alone, which assumes that the determined Green’s functions incorporate effects from spallation or that the impact from spallation is minimal. Second, we examine the estimated buried moment tensor and vertical surface spallation as terms that must both be resolved in the inversion. Third, we assess the ability for an estimated vertical surface spallation source to fit the acoustic data on its own. Finally, we compare results from the joint inversion of both seismic geophone and infrasound acoustic data for the buried-only source compared to buried and spallation sources. Our results are a preliminary investigation into the applications of the inversion technique to recorded datasets and show the technique has limited capabilities using acoustic data alone. Instead, this method shows promise for seismic and seismoacoustic datasets to resolve the time-variable mechanisms of a buried source.

47 OTHER INSTRUMENTATION↗

Computer Modeling and Simulation: Increasing Reliability by Disentangling Verification and Validation

Verification and validation (V&V) of computer codes and models used in simulations are two aspects of the scientific practice of high importance that recently have been discussed widely by philosophers of science. While verification is predominantly associated with the correctness of the way a model is represented by a computer code or algorithm, validation more often refers to the model’s relation to the real world and its intended use. Because complex simulations are generally opaque to a practitioner, the Duhem problem can arise with verification and validation due to their entanglement; such an entanglement makes it impossible to distinguish whether a coding error or the model’s general inadequacy to its target should be blamed in the case of a failure. I argue that a clear distinction between computer modeling and simulation has to be made to disentangle verification and validation. Drawing on that distinction, I suggest to associate modeling with verification and simulation, which shares common epistemic strategies with experimentation, with validation. To explain the reasons for their entanglement in practice, I propose a Weberian ideal–typical model of modeling and simulation as roles in practice. I examine an approach to mitigate the Duhem problem for verification and validation that is generally applicable in practice and is based on differences in epistemic strategies and scopes. Based on this analysis, I suggest two strategies to increase the reliability of simulation results, namely, avoiding alterations of verified models at the validation stage as well as performing simulations of the same target system using two or more different models. In response to Winsberg’s claim that verification and validation are entangled I argue that deploying the methodology proposed in this work it is possible to mitigate inseparability of V&V in many if not all domains where modeling and simulation are used.

97 MATHEMATICS AND COMPUTING↗

Development of Multiresolution Capabilities for the Holistic Energy Resource Optimization Network (HERON) tool A progress update

INL researchers work on technoeconomic analyses for integrated energy systems (IES) using the Framework for Optimization of ResourCes and Economics (FORCE). Within FORCE, researchers use the Holistic Energy Resource Optimization Network (HERON) tool to conduct optimization of grid portfolios under uncertain market conditions. These optimizations determine optimal capacities for all IES components and strategies for resource dispatch which maximize some economic metric (e.g., net present value). Resource dispatch occurs on finer timescales (typically hours) and thus are asked to respond to a given time series (e.g. hourly load demand profiles for a grid, or pre-determined electricity prices). Volatile and complex bidding dynamics as well as poorly forecasted weather events within deregulated markets add uncertainty to the time series; FORCE can address this uncertainty by training a reduced order model on historical time series and generate unique synthetic time series which represent individual scenarios or realizations of the market. The IES configuration can be simulated under these different sampled realizations and a stochastic optimization is conducted which optimizes the expected value of the desired economic metric. The training of a synthetic time series generator is limited by the chosen time resolution; dynamics can occur on different time scales. Seasonal demand trends can dominate faster dynamical events (such as power outages from certain sectors or severe weather events) which might not get captured correctly by the trained model. In this report, we investigate different ways of addressing the training and generation of time series on multiple time scales using three main algorithms: wavelet decomposition, dynamic mode decomposition, and generative adversarial networks for time series. We demonstrate a time series analysis that yields information on not just the frequency space but also temporal space: where a fast Fourier transform can provide what frequencies dominate, the new algorithms can provide when the frequencies dominate as well. These analyses can help improve IES optimization by allowing researchers to couple simulations at different timescales when it is most needed - seasonal, day-ahead, and real time optimization - with greater computational efficiency. Future work will include implementation of a subset of the proposed algorithms into the FORCE toolset and application of these analyses into multiple timescale optimization.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Identification and selection of optimal reference genes for qPCR-based gene expression analysis in Fucus distichus under various abiotic stresses

Quantitative gene expression analysis is an important tool in the scientist’s belt. The identification of evenly expressed reference genes is necessary for accurate quantitative gene expression analysis, whether by traditional RT-PCR (reverse-transcription polymerase chain reaction) or by qRT-PCR (quantitative real-time PCR; qPCR). In the Stramenopiles (the major line of eukaryotes that includes brown algae) there is a noted lack of known reference genes for such studies, largely due to the absence of available molecular tools. Here we present a set of nine reference genes (Elongation Factor 1 alpha (EF1A), Elongation Factor 2 alpha (EF2A), Elongation Factor 1 beta (EF1B), 14-3-3 Protein, Ubiquitin Conjugating Enzyme (UBCE2), Glyceraldehyde-3-phosphate Dehydrogenase (GAPDH), Actin Related Protein Complex (ARP2/3), Ribosomal Protein (40s; S23), and Actin) for the brown alga Fucus distichus . These reference genes were tested on adult sporophytes across six abiotic stress conditions (desiccation, light and temperature modification, hormone addition, pollutant exposure, nutrient addition, and wounding). Suitability of these genes as reference genes was quantitatively evaluated across conditions using standard methods and the majority of the tested genes were evaluated favorably. However, we show that normalization genes should be chosen on a condition-by-condition basis. We provide a recommendation that at least two reference genes be used per experiment, a list of recommended pairs for the conditions tested here, and a procedure for identifying a suitable set for an experimenter’s unique design. With the recent expansion of interest in brown algal biology and accompanied molecular tools development, the variety of experimental conditions tested here makes this study a valuable resource for future work in basic biology and understanding stress responses in the brown algal lineage.

59 BASIC BIOLOGICAL SCIENCES↗

Methods for Assessing Opportunities for Ring Dam Pumped Storage Hydropower

There is growing interest in new pumped storage hydropower (PSH) deployment to provide a range of grid flexibility, reliability, and resiliency services under an evolving and uncertain future power sector. The National Laboratory of the Rockies develops open PSH resource assessment and cost modeling tools to help evaluate PSH deployment opportunities, and this report describes expansions to those tools to consider an additional PSH system configuration - ring-dam reservoirs built on flat topographical features that are constructed from roller-compacted concrete material. This reservoir type is common among current PSH proposals and requires new methods to identify sites with this reservoir geometry throughout the United States and characterize the associated dam cost. Cost characterization for ring dam reservoirs required collecting historical dam cost data for earthen, rockfill, and roller-compacted concrete dams and regressing equations that relate costs between alternative materials. The ring dam site identification algorithm follows a 5-step procedure to identify circular geometry reservoirs. Once ring dam reservoirs are identified, they are then paired with potential dry-gully reservoirs, and the full set of potential paired reservoirs is cost-optimized to produce a least-cost set of potential PSH sites with no overlapping reservoirs. The resulting analysis found 1,663 ring-dam to dry-gully systems in the contiguous United States that are lower cost than any overlapping dry-gully to dry-gully systems, 29 in Alaska, and none in Hawaii or Puerto Rico. These systems constitute 1.5 TW of capacity in the contiguous United States and nearly 29 GW in Alaska, demonstrating that under suitable topography and head, ring-dam systems can provide cost-effective PSH opportunities. The greatest density of these opportunities are found in the intermountain west where there are mesas and flat land at bases of mountain ranges, but continued work could incorporate additional site characteristics or consider more complex reservoir shapes to find additional PSH deployment opportunities.

13 HYDRO ENERGY↗

CoSim: A Simulator for Co-Scheduling of Batch and On-Demand Jobs in HPC Datacenters

The increasing scale and complexity of scientific applications are rapidly transforming the ecosystem of tools, methods, and workflows adopted by the high-performance computing (HPC) community. Big data analytics and deep learning are gaining traction as essential components in this ecosystem in a variety of scenarios, such as, steering of experimental instruments , acceleration of high-fidelity simulations through surrogate computations, and guided ensemble searches. In this context, the batch job model traditionally adopted by the supercomputing in-frastructures needs to be complemented with support to schedule opportunistic on-demand analytics jobs, leading to the problem of efficient preemption of batch jobs with minimum loss of progress. In this paper, we design and implement a simulator, CoSim, that enables on-the-fly analysis of the trade-offs arising between delaying the start of opportunistic on-demand jobs, which leads to longer analytics latency, and loss of progress due to preemption of batch jobs, which is necessary to make room for on-demand jobs. To this end, we propose an algorithm based on dynamic programming with predictable performance and scalability that enables supercomputing infrastructure schedulers to analyze the aforementioned trade-off and take decisions in near real-time. Compared with other state-of-art approaches using traces of the Theta pre-Exascale machine, our approach is capable of finding the optimal solution, while achieving high performance and scalability.

batch job preemption↗

Time Series Dimension Reduction for Surrogate Models of Port Scanning Cyber Emulations

Surrogate model development is a key resource in the scientific modeling community for providing computational expedience when simulating complex systems without loss of great fidelity. The initial step to development of a surrogate model is identification of the primary governing components of the system. Principal component analysis (PCA) is a widely used data science technique that provides inspection of such driving factors, when the objective for modeling is to capture the greatest sources of variance inherent to a dataset. Although an efficient linear dimension reduction tool, PCA makes the fundamental assumption that the data is continuous and normally distributed. Thus, it provides ideal performance when these conditions are met. In the case for which cyber emulations provide realizations of a port scanning scenario, the data to be modeled follows a discrete time series function comprised of monotonically increasing piece-wise constant steps. The sources of variance are related to the timing and magnitude of these steps. Therefore, we consider using XPCA, an extension to PCA for continuous and discrete random variates. This report provides the documentation of the trade-offs between the PCA and XPCA linear dimension reduction algorithms, for the intended purpose to identify key components of greatest variance in our time series data. These components will ultimately provide the basis for future surrogate models of port scanning cyber emulations.

97 MATHEMATICS AND COMPUTING↗

Which Combinations of Environmental Conditions and Microphysical Parameter Values Produce a Given Orographic Precipitation Distribution?

This study applies an idealized modeling framework, alongside a Bayesian Markov chain Monte Carlo (MCMC) algorithm, to explore which combinations of upstream environmental conditions and cloud microphysical parameter values can produce a particular precipitation distribution over an idealized two-dimensional, bell-shaped mountain. Simulations focus on orographic precipitation produced when an atmospheric river interacts with topography. MCMC-based analysis reveals that different combinations of parameter values produce a similar precipitation distribution, with the most influential parameters being relative humidity (RH), horizontal wind speed (U), surface potential temperature (θ sfc ), and the snow fall speed coefficient (A s ). RH, U, and A s exhibit interdependence: changes in one or more of these factors can be mitigated by compensating changes in the other(s) to produce similar orographic precipitation rates. The results also indicate that the parameter sensitivities and relationships can vary for spatial subregions and given different environmental conditions. In particular, high θ sfc values are more likely to produce the target precipitation rate and spatial distribution, and thus the ensemble of simulations shows a preference for liquid precipitation at the surface. The results presented here highlight the complexity of orographic precipitation controls, and have implications for flood and water management, observational efforts, and climate change.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Topological analysis of X-ray CT data for the recognition and trending of subtle changes in microstructure under material aging

X-ray computed tomography (CT) is an established non-destructive tool for 3D imaging of multiphasic composites. Numerous applications of X-ray CT in medical diagnosis and materials characterization have been reported, many involving field-specific innovations in the imaging technology itself. Yet, quantitative summarization to link image features to properties of interest has been rare. Here we address this issue by employing state-of-the-art technics in scalar field topology for the summarization of X-ray CT images of an example biphasic system. By varying processing-parameters we create different microstructures, evolve them through accelerated thermal aging, CT-image them pre- and post-aged, and demonstrate the ability of our image summarization method to systematically track process- and age-related changes, which can often be very subtle. A novel aspect of the algorithm involves recognition over multiple resolution levels, which provides deeper insight into the pattern relationship between grain-like features and their neighbors. The method is general, adaptable to diverse image reconstruction methods and materials systems, and particularly useful in applications where practical constraints on the sample-size limits the reliable use of more complex models, e.g., convolutional neural networks.

36 MATERIALS SCIENCE↗

Innovating the next generation of commercial smart building software

Nearly 30% of commercial building energy use is wasted due to equipment faults and HVAC controls problems. The result is increased emissions, compromised comfort and productivity, and less reliable coordination of building power needs with a clean grid. The energy impact alone represents $17 billion in potential savings. Today’s smart building software provides a robust solution to address these operational deficiencies. Energy management and information systems (EMIS) are saving up to 9% on average, with two-year paybacks. They are being incorporated into energy management processes, commissioning services, and utility programs. As effective as they are, two barriers prevent even deeper benefits; limited personnel to fix problems once they are identified, and the expense and time to manually implement changes in control systems. In partnership with the research community, the EMIS industry is developing new capabilities to overcome these barriers. Moving beyond siloed products for either fault detection and diagnostics, or optimal control, these new capabilities empower users to not only automatically identify faults, but also to push corrective action, and control improvements to their buildings. In this paper, several areas for enhancements are documented: ‘one-time’ correction of faults such as setpoints, schedules, and economizer lockouts; short-term active testing for automated proportional integral derivative (PID) loop tuning and functional testing; and continuous supervisory control for demand flexibility and year-round efficiency. Results are presented from a pair of partner implementations out of a dozen providers integrating these enhancements into their products, including field tests from across the country, and insights into operator acceptance and integration into operations and maintenance practices.

Casillas, Armando↗

Exploiting the Dynamic Relationship between Peptide Separation Quality and Peptide Coisolation in a Multiple-Peptide Matches-per-Spectrum Approach Offers a Strategy To Optimize Bottom-Up Proteomics Throughput and Depth

We present that peptide cofragmentation leads to chimeric MS/MS spectra that negatively impact traditional single-peptide match-per-spectrum (sPSM) search strategies in proteomics. The collection of chimeric spectra is influenced by peptide coelution and the width of precursor isolation windows. Although peptide cofragmentation can be reduced by advanced chromatography, such as UHPLC and 2D-HPLC separation schemes, and narrower isolation windows, chimeric spectra can still be as high as 30–50% of the total MS/MS spectra collected. Alternatively, cofragmented peptides in chimeric spectra and the use of wider isolation windows benefit multiple-peptide matches-per-spectrum (mPSM) algorithms, such as CharmeRT, which facilitate the identification of several cofragmented peptides. Considering recent advancements in LC and mPSM methodologies, we present a comprehensive examination of the levels of chimeric spectra collected in the analysis of a HeLa digest measured using different LC modes of separation and isolation windows and compare the depth of identifications obtained when these data are annotated using a sPSM or a mPSM approach. Our results demonstrate that MS/MS data derived from 1D-HPLC strategies under different gradient schemes and searched with CharmeRT yielded higher average numbers of PSMs (11%–49%), peptide analytes (10%–16%), and peptide sequences (3%–10%) compared to data derived from 1D-UHPLC runs but searched with a sPSM strategy. Interestingly, data from a 2D-HPLC separation strategy benefits more from the application of CharmeRT results when compared to a 50 cm 1D-UHPLC column employing a 500 min gradient. In conclusion, these results provide new insights into how to better configure LC-MS/MS measurements for improved throughput and peptide identification in complex proteomes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Matilda v1.0: An R package for probabilistic climate projections using a reduced complexity climate model

A primary advantage to using reduced complexity climate models (RCMs) has been their ability to quickly conduct probabilistic climate projections, a key component of uncertainty quantification in many impact studies and multisector systems. Providing frameworks for such analyses has been a target of several RCMs used in studies of the future co-evolution of the human and Earth systems. In this paper, we present Matilda, an open-science R software package that facilitates probabilistic climate projection analysis, implemented here using the Hector simple climate model in a seamless and easily applied framework. The primary goal of Matilda is to provide the user with a turn-key method to build parameter sets from literature-based prior distributions, run Hector iteratively to produce perturbed parameter ensembles (PPEs), weight ensembles for realism against observed historical climate data, and compute probabilistic projections for different climate variables. This workflow gives the user the ability to explore viable parameter space and propagate uncertainty to model ensembles with just a few lines of code. The package provides significant freedom to select different scoring criteria and algorithms to weight ensemble members, as well as the flexibility to implement custom criteria. Additionally, the architecture of the package simplifies the process of building and analyzing PPEs without requiring significant programming expertise, to accommodate diverse use cases. We present a case study that provides illustrative results of a probabilistic analysis of mean global surface temperature as an example of the software application.

54 ENVIRONMENTAL SCIENCES↗

Automation of Vulnerability and Patch Management: Information Extraction, Association, and Optimization

Vulnerability and patch management is an integral part of a robust cybersecurity program, yet it grows increasingly complex due to the sheer amount of data that must be analyzed. Particularly in Operational Technology (OT) environments, analysis must be done manually because of the lack of automated solutions. Additionally, there are many steps in this process, from the initial discovery of the vulnerability to the implementation of its remediation, and each step in the process requires different data in order to be performed effectively. In this work, we provide approaches and strategies to assist operators in industrial or OT environments throughout the vulnerability management cycle. Security advisories provide key information about mitigation strategies, or actions that can be taken when a patch is unavailable or cannot be installed. Details of these strategies are not shared in public vulnerability databases and must be found manually. We approach this problem by designing a solution to automatically identify that information within vendor security advisories and retrieve it for operator use. We start with an approach that requires domain-specific knowledge of certain frequently-seen reference websites. Next, an approach that can work on an arbitrary website but relies on certain keywords. Finally, an approach that uses Natural Language Processing (NLP) methods and does not require specific knowledge or keywords. Each of these approaches is more general than its predecessor; we demonstrate high accuracy for all approaches Advisories also often contain details of affected products in non-standard or natural language formats. While this information can be easily understood when read by an operator, the non-standard format acts as a barrier to effective automation. We provide an approach for the first step in this process: identifying vendors in security advisories and mapping them to a standard framework for representing digital assets and software products. We evaluate five established string similarity algorithms, plus one of our own design that combines string similarity and information theory, on the task of mapping vendors to their corresponding entries in the Common Platform Enumeration (CPE) repository. Our results show that our proposed metric outperforms all others. Due to the constraints on time, finances, and personnel for organizations, Large Language Models (LLMs) may seem like attractive opportunities for security operators to speed up information gathering; however, it is still not clear whether LLMs can handle vulnerability management tasks well. To answer this question, we perform an empirical study of LLMs’ ability to provide consistent, accurate information about vulnerabilities in order to guide organizations in their adoption of LLMs. We observe poor performance for all models tested, suggesting that these models are not well-suited to the consistent retrieval of accurate vulnerability information. Finally, once vulnerabilities have been identified and any additional information has been obtained, operators must decide which remediation actions to implement based on their available resources. This already-complex problem becomes even more so when we consider that a vulnerability may have multiple avenues for remediation. We formulate this scenario as two knapsack problems and provide solutions, which we then compare against several existing strategies for vulnerability prioritization seen in real operational environments.

McClanahan, Kylie↗

The General Atomic and Molecular Electronic Structure System (GAMESS): Novel Methods on Novel Architectures

The primary focus of GAMESS over the last 5 years has been the development of new high-performance codes that are able to take effective and efficient advantage of the most advanced computer architectures, both CPU and accelerators. These efforts include employing density fitting and fragmentation methods to reduce the high scaling of well-correlated (e.g., coupled-cluster) methods as well as developing novel codes that can take optimal advantage of graphical processing units and other modern accelerators. Because accurate wave functions can be very complex, an important new functionality in GAMESS is the quasi-atomic orbital analysis, an unbiased approach to the understanding of covalent bonds embedded in the wave function. Finally, best practices for the maintenance and distribution of GAMESS are also discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sierra/SD – Verification Test Manual – 5.22

Verification and validation (V&V) of scientific computing programs are important at Sandia National Labs due to the expanding role of computational simulation in managing the United States nuclear stockpile. The complexities of structural response calculations used to analyze physical problems, the varieties of codes applied to the calculations, and the importance of accurate predictions when assessing field conditions demand confidence in the consistency and accuracy of computer codes. Confidence in the accuracy of the predictions arising from computer simulations must ultimately be gained through verification and validation. The Sierra salinas structural dynamics analysis code, Sierra/SD, is used at the DOE Laboratories, and in several DOD projects. The roles of Sierra/SD in the qualification of weapon systems and components for normal and hostile environments throughout the Stockpile-to-Target Sequence include to, • Redesign weapon components. • Certify weapon components and systems for target environments such as hypersonic vehicles. • Certify that components will survive the thermal mechanical shock loads associated with hostile environments. • Evaluate current stockpile issues, including issues associated with uncertainty quantification. • Address many other problems that are encountered in stockpile management. The Sierra/SD verification plan is described, and an evolving set of key verification tests are described in detail. The verification tests ensure the correctness of the mathematics and numerical algorithms associated with functionality describing engineering phenomena. Development is in accordance with a set of tailored Software Quality Engineering (SQE) practices. SQE practices guide the overall verification and validation effort.

97 MATHEMATICS AND COMPUTING↗