Search NASA⌕ Search

SEARCH · Search NASA

Results for “benchmark problem”

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 145 records · Page 8

Specification for the VERA Depletion Benchmark Suite

CASL-X-2015-1014-000 iii Consortium for Advanced Simulation of LWRs EXECUTIVE SUMMARY The CASL neutronics simulator MPACT is under development for the neutronics and T-H coupled simulation for the pressurized water reactor. MPACT includes the ORIGEN-API and internal depletion module to perform depletion calculations based upon neutron-material reaction and radioactive decay. It is a challenge to validate the depletion capability because of the insufficient measured data. One of the detoured methods to validate it is to perform a code-to-code comparison for benchmark problems. In this study a depletion benchmark suite has been developed and a detailed guideline has been provided to obtain meaningful computational outcomes which can be used in the validation of the MPACT depletion capability.

97 MATHEMATICS AND COMPUTING↗

An Expanded Criticality Validation Suite for MCNP [Slides]

The Expanded Validation Suite provides a significant advance in the quality assurance and verification/ validation of MCNP for criticality problems. The careful selection of Handbook benchmark problems that span the expected application space provides the required broad coverage of code applicability. For validation purposes, it is expected that the suite will be used with different cross section libraries, e.g., ENDF/B-VII.1, to broadly assess the impact of library improvements. For practitioners, the suite may also serve as a starting point for validating MCNP and its data libraries for their specific applications.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Code Comparison Study Fosters Confidence in the Numerical Simulation of Enhanced Geothermal Systems

Numerical simulation has become a standard analytical tool for scientists and engineers to evaluate the potential and performance of enhanced geothermal systems. A variety of numerical simulators developed by industry, universities, and national laboratories are currently available and being applied to better understand enhanced geothermal systems at the field scale. To yield credible predictions and be of value to site operators, numerical simulators must be able to accurately represent the complex coupled processes induced by producing geothermal systems, such as fracture aperture changes due to thermal stimulation, fracture shear displacement with fluid injection, rate of thermal depletion of reservoir rocks, and permeability alteration with mineral precipitation or dissolution. A suite of numerical simulators was exercised on a series of test problems that considered coupled thermal, hydraulic, geomechanical, and geochemical (THMC) processes. Problems were selected and designed to isolate selected coupled processes, to be executed on workstation class computers, and have simple but illustrative metrics for result comparisons. This paper summarizes the initial suite of seven benchmark problems, describes the code comparison activities, provides example results for problems and documents the capabilities of currently available numerical simulation codes to represent coupled processes that occur during the production of geothermal resources. Code comparisons described in this paper use the ISO (International Organization for Standardization) standard ISO-13538 for proficiency testing of numerical simulators. This approach was adopted for a recent code comparison study within the radiation transfer-modeling field of atmospheric sciences, which was focused on canopy reflectance models. This standard specifies statistical methods for analyzing laboratory data from proficiency testing schemes to demonstrate that the measurement results do not exhibit evidence of an unacceptable level of bias.

benchmark problems↗

An Extension of Implicit Monte Carlo Diffusion: Multigroup and The Difference Formulation

Implicit Monte Carlo (IMC) and Implicit Monte Carlo Diffusion (IMD) are approaches to the numerical solution of the equations of radiative transfer. IMD was previously derived and numerically tested on grey, or frequency-integrated problems. In this research, we extend Implicit Monte Carlo Diffusion (IMD) to account for frequency dependence, and we implement the difference formulation as a source manipulation variance reduction technique. We derive the relevant probability distributions and present the frequency dependent IMD algorithm, with and without the difference formulation. The IMD code with and without the difference formulation was tested using both grey and frequency dependent benchmark problems. The Su and Olson semi-analytic Marshak wave benchmark was used to demonstrate the validity of the code for grey problems. The Su and Olson semi-analytic picket fence benchmark was used for the frequency dependent problems. The frequency dependent IMD algorithm reproduces the results of both Su and Olson benchmark problems. Frequency group refinement studies indicate that the computational cost of refining the group structure is likely less than that of group refinement in deterministic solutions of the radiation diffusion methods. Our results show that applying the difference formulation to the IMD algorithm can result in an overall increase in the figure of merit for frequency dependent problems. However, the creation of negatively weighted particles from the difference formulation can cause significant numerical instabilities in regions of the problem with sharp spatial gradients in the solution. An adaptive implementation of the difference formulation may be necessary to focus its use in regions that are at or near thermal equilibrium.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Optimization: Potential, Challenges, and the Path Forward

Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization being one of the most pronounced domains. Across computer science and physics, there are a number of algorithmic approaches, often with little linkage. This is further complicated by the fragmented nature of the field of mathematical optimization, where major classes of optimization problems, such as combinatorial optimization, convex optimization, non-convex optimization, and stochastic extensions, have devoted communities. With these aspects in mind, this work draws on multiple approaches to study quantum optimization. Provably exact versus heuristic settings are first explained using computational complexity theory — highlighting where quantum advantage is possible in each context. Then, the core building blocks for quantum optimization algorithms are outlined to subsequently define prominent problem classes and identify key open questions that, if answered, will advance the field. The effects of scaling relevant problems on noisy quantum devices are also outlined in detail, alongside meaningful benchmarking problems. We underscore the importance of benchmarking by proposing clear metrics to conduct appropriate comparisons with classical optimization techniques. Lastly, we highlight two domains – finance and sustainability – as rich sources of optimization problems that could be used to benchmark, and eventually validate, the potential real-world impact of quantum optimization.

97 MATHEMATICS AND COMPUTING↗

Performance Efficiency and Effectivness of Supercomputers

Our first purpose here is to offer to a general technical and policy audience a perspective on whether the supercomputing community should focus on improving the efficiency of supercomputing systems and their use rather than on building larger and ostensibly more capable systems that are used at low efficiency. After first summarizing our content and defining some necessary terms, we give a concise answer to this question. We then set this in context by characterizing performance of current supercomputing systems on a variety of benchmark problems and actual problems drawn from workloads in the national security, industrial, and scientific context. Along the way we answer some related questions, identify some important technological trends, and offer a perspective on the significance of these trends. Our second purpose is to give a reasonably broad and transparent overview of the related issue space and thereby to better equip the reader to evaluate commentary and controversy concerning supercomputing performance. For example, questions repeatedly arise concerning the Linpack benchmark and its predictive power, so we consider this in moderate depth as an example. We also characterize benchmark and application performance for scientific and engineering use of supercomputers and offer some guidance on how to think about these. Examples here are drawn from traditional scientific computing. Other problem domains, for example, data analytics, have different performance characteristics that are better captured by different benchmark problems or applications, but the story in those domains is similar in character and leads to similar conclusions with regard to the motivating question.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A fourth-order phase-field fracture model: Formulation and numerical solution using a continuous/discontinuous Galerkin method

Modeling crack initiation and propagation in brittle materials is of great importance to be able to predict sudden loss of load-carrying capacity and prevent catastrophic failure under severe dynamic loading conditions. Second-order phase-field fracture models have gained wide adoption given their ability to capture the formation of complex fracture patterns, e.g. via crack merging and branching, and their suitability for implementation within the context of the conventional finite element method. Higher-order phase-field models have also been proposed to increase the regularity of the exact solution and thus increase the spatial convergence rate of its numerical approximation. However, they require special numerical techniques to enforce the necessary continuity of the phase field solution. In this paper, we derive a fourth-order phase-field model of fracture in two independent ways; namely, from Hamilton’s principle and from a higher-order micromechanics-based approach. The latter approach is novel, and provides a physical interpretation of the higher-order terms in the model. In addition, we propose a continuous/discontinuous Galerkin (C/DG) method for use in computing the approximate phase-field solution. This method employs Lagrange polynomial shape functions to guarantee -continuity of the solution at inter-element boundaries, and enforces the required regularity with the aid of additional variational and interior penalty terms in the weak form. Finally, the phase-field equation is coupled with the momentum balance equation to model dynamic fracture problems in hyper-elastic materials. Two benchmark problems are presented to compare the numerical behavior of the C/DG method with mixed finite element methods.

42 ENGINEERING↗

Multigrid Reduction in Time for Nonlinear Parabolic Problems: A Case Study

The need for parallelism in the time dimension is being driven by changes in computer architectures, where performance increases are now provided through greater concurrency, not faster clock speeds. This creates a bottleneck for sequential time marching schemes because they lack parallelism in the time dimension. Multigrid reduction in time (MGRIT) is an iterative procedure that allows for temporal parallelism by utilizing multigrid reduction techniques and a multilevel hierarchy of coarse time grids. MGRIT has been shown to be effective for linear problems, with speedups of up to 50 times. The goal of this work is the efficient solution of nonlinear problems with MGRIT, where efficiency is defined as achieving similar performance when compared to an equivalent linear problem. The benchmark nonlinear problem is the p-Laplacian, where p=4 corresponds to a well-known nonlinear diffusion equation and p=2 corresponds to the standard linear diffusion operator, our benchmark linear problem. The key difficulty encountered is that the nonlinear time-step solver becomes progressively more expensive on coarser time levels as the time-step size increases. To overcome such difficulties, multigrid research has historically targeted an accumulated body of experience regarding how to choose an appropriate solver for a specific problem type. To that end, this paper develops a library of MGRIT optimizations and modifications, most important an alternate initial guess for the nonlinear time-step solver and delayed spatial coarsening, that will allow many nonlinear parabolic problems to be solved with parallel scaling behavior comparable to the corresponding linear problem.

parareal↗

Democratizing uncertainty quantification

Uncertainty Quantification (UQ) is vital to safety-critical model-based analyses, but the widespread adoption of sophisticated UQ methods is limited by technical complexity. In this paper, we introduce UM-Bridge (the UQ and Modeling Bridge), a high-level abstraction and software protocol that facilitates universal interoperability of UQ software with simulation codes. It breaks down the technical complexity of advanced UQ applications and enables separation of concerns between experts. UM-Bridge democratizes UQ by allowing effective interdisciplinary collaboration, accelerating the development of advanced UQ methods, and making it easy to perform UQ analyses from prototype to High Performance Computing (HPC) scale. In addition, we present a library of ready-to-run UQ benchmark problems, all easily accessible through UM-Bridge. These benchmarks support UQ methodology research, enabling reproducible performance comparisons. We demonstrate UM-Bridge with several scientific applications, harnessing HPC resources even using UQ codes not designed with HPC support.

Benchmarks↗

Verification of MCNP5-1.60 and MCNP6-Beta-2 for Criticality Safety Applications

To verify that both MCNP5-1.60 and MCNP6-Beta-2 are performing correctly for criticality safety applications, several suites of verification/validation benchmark problems were run in early 2012. Results from these benchmark suites were compared with results from previously verified versions of MCNP5. The goals of this verification testing were: (1) Verify that MCNP5-1.60 works correctly for nuclear criticality safety applications, producing the same results as for the previous verification performed in 2010; (2) Determine the sensitivity to computer roundoff using different Fortran-90 compilers for building MCNP5 and MCNP6, to support moving to current versions of the compilers; and (3) Verify that MCNP6-Beta-2 works correctly for nuclear criticality safety applications, producing the same results as for MCNP5-1.60. This provides support for eventual migration of users and applications to MCNP6. The current production version of MCNP5 included in the RSICC release package is MCNP5-1.60. This version was first distributed by RSICC in October 2010. While there were subsequent RSICC distributions of the MCNP package in July 2011 and February 2012, no changes were made to MCNP5-1.60. The RSICC release package in February 2012 included both MCNP5-1.60 and the current beta version of MCNP6, MCNP6-Beta-2. MCNP6 is the merger of MCNP5 and MCNPX capabilities. The current release of MCNP6 available from RSICC as of February 2012 is MCNP6-Beta-2. This version includes all of the features for criticality safety calculations that are available in MCNP5-1.60, and many new features largely unrelated to nuclear criticality safety calculations. This release is a 'beta' release to allow intermediate and advanced users to begin testing the merged code in their field of expertise. It should not be used for production calculations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Verification of MCNP5-1.60 and MCNP6.1 for Criticality Safety Applications

To verify that both MCNP5-1.60 and MCNP6.1 are performing correctly for criticality safety applications, several suites of verification/validation benchmark problems were run in early 2013. Results from these benchmark suites were compared with results from previously verified versions of MCNP5.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Development and evaluation of a variably saturated flow model in the global E3SM Land Model (ELM) version 1.0

Abstract. Improving global-scale model representations of near-surface soil moisture and groundwater hydrology is important for accurately simulating terrestrial processes and predicting climate change effects on water resources. Most existing land surface models, including the default E3SM Land Model (ELMv0), which we modify here, routinely employ different formulations for water transport in the vadose and phreatic zones. Clark et al. (2015) identified a variably saturated Richards equation flow model as an important capability for improving simulation of coupled soil moisture and shallow groundwater dynamics. In this work, we developed the Variably Saturated Flow Model (VSFM) in ELMv1 to unify the treatment of soil hydrologic processes in the unsaturated and saturated zones. VSFM was tested on three benchmark problems and results were evaluated against observations and an existing benchmark model (PFLOTRAN). The ELMv1-VSFM's subsurface drainage parameter, fd, was calibrated to match an observationally constrained and spatially explicit global water table depth (WTD) product. Optimal spatially explicit fd values were obtained for 79 % of global 1.9∘ × 2.5∘ grid cells, while the remaining 21 % of global grid cells had predicted WTD deeper than the observationally constrained estimate. Comparison with predictions using the default fd value demonstrated that calibration significantly improved predictions, primarily by allowing much deeper WTDs. Model evaluation using the International Land Model Benchmarking package (ILAMB) showed that improvements in WTD predictions did not degrade model skill for any other metrics. We evaluated the computational performance of the VSFM model and found that the model is about 30 % more expensive than the default ELMv0 with an optimal processor layout. The modular software design of VSFM not only provides flexibility to configure the model for a range of problem setups but also allows for building the model independently of the ELM code, thus enabling straightforward testing of the model's physics against other models.

58 GEOSCIENCES↗

Analytical benchmark solution for 1-D neutron transport coupled with thermal conduction and material expansion

In this work we present fully analytical solutions for a class of finite, homogeneous, 1-D slab benchmark problems with nonlinear temperature feedback effects. The proposed class of benchmarks include multiplicative 1-D neutron transport (limited to quasistatic S{sub 2} with μ = ±1) coupled with thermal conduction, convection, Doppler broadening, and expansion effects along the length of the slab. This class of benchmark models, along with the corresponding analytical solutions, are valuable for validating multiphysics analysis frameworks that support coupled neutronics/thermal/structural calculations. Analytical solutions for the benchmarks are obtained by introducing an ansatz that the equilibrium flux and temperature distributions in the slab have the same shape. Specific values for the total microscopic cross section, σ{sub t,0}, and conductive heat transfer coefficient, h, that satisfy the assumed ansatz are then determined. A discussion of the procedure for generating benchmark models and analytical solutions is provided, along with numerical results for an example set of model parameters and thoughts on practical applications of the benchmarks for multiphysics code validation. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Using Neural Architecture Search for Improving Software Flaw Detection in Multimodal Deep Learning Models

Software flaw detection using multimodal deep learning models has been demonstrated as a very competitive approach on benchmark problems. In this work, we demonstrate that even better performance can be achieved using neural architecture search (NAS) combined with multimodal learning models. We adapt a NAS framework aimed at investigating image classification to the problem of software flaw detection and demonstrate improved results on the Juliet Test Suite, a popular benchmarking data set for measuring performance of machine learning models in this problem domain.

97 MATHEMATICS AND COMPUTING↗

Using Neural Architecture Search for Improving Software Flaw Detection in Multimodal Deep Learning Models

Software flaw detection using multimodal deep learning models has been demonstrated as a very competitive approach on benchmark problems. In this work, we demonstrate that even better performance can be achieved using neural architecture search (NAS) combined with multimodal learning models. We adapt a NAS framework aimed at investigating image classification to the problem of software flaw detection and demonstrate improved results on the Juliet Test Suite, a popular benchmarking data set for measuring performance of machine learning models in this problem domain.

97 MATHEMATICS AND COMPUTING↗

The COMET method in 3-D hexagonal geometry

The hybrid stochastic-deterministic coarse mesh radiation transport (COMET) method developed at Georgia Tech now solves reactor core problems in 3-D hexagonal geometry. In this paper, the method is used to solve three preliminary test problems designed to challenge the method with steep flux gradients, high leakage, and strong asymmetry and heterogeneity in the core. The test problems are composed of blocks taken from a high temperature test reactor benchmark problem. As the method is still in development, these problems and their results are strictly preliminary. Results are compared to whole core Monte Carlo reference solutions in order to verify the method. Relative errors are on the order of 50 pcm in core eigenvalue, and mean relative error in pin fission density calculations is less than 1% in these difficult test cores. The method requires the one-time pre-computation of a response expansion coefficient library, which may be compiled in a comparable amount of time to a single whole core Monte Carlo calculation. After the library has been computed, COMET may solve any number of core configurations on the order of an hour, representing a significant gain in efficiency over other methods for whole core transport calculations. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

VERIFICATION OF THE SHIFT MONTE CARLO CODE

Shift is a new hybrid Monte Carlo/deterministic radiation transport code being developed at Oak Ridge National Laboratory. At its current stage of development, Shift includes a fully-functional parallel Monte Carlo capability for simulating eigenvalue and fixed-source multigroup transport problems. This paper focuses on recent efforts to verify Shift s Monte Carlo component using the two-dimensional and three-dimensional C5G7 NEA benchmark problems. Comparisons were made between the benchmark eigenvalues and those output by the Shift code. In addition, mesh-based scalar flux tally results generated by Shift were compared to those obtained using MCNP5 on an identical model and tally grid. The Shift-generated eigenvalues were within three standard deviations of the benchmark and MCNP5 values in all cases. The flux tallies generated by Shift were found to be in very good agreement with those from MCNP

42 ENGINEERING↗