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 757 records · Page 42

Coannihilation scenarios and particle spectroscopy in SU(4){sub c}xSU(2){sub L}xSU(2){sub R}

We identify a variety of coannihilation scenarios in a supersymmetric SU(4){sub c}xSU(2){sub L}xSU(2){sub R} model with discrete left-right symmetry. Nonuniversal gaugino masses, compatible with the gauge symmetry, play an essential role in realizing gluino and bino-wino coannihilation regions that are consistent with the WMAP dark matter constraints. We also explore regions of the parameter space in which the little hierarchy problem is partially resolved. We present several phenomenologically interesting benchmark points and the associated sparticle and Higgs mass spectra.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Conservative High-Order Time Integration for Lagrangian Hydrodynamics

In tis study, we develop novel time integration methods for the compressible Euler equations in the Lagrangian frame that are of arbitrary high order and exactly preserve the mass, momentum, and total energy of the system. The equations are considered in nonconservative form, that is, common for staggered grid hydrodynamics (SGH) methods; namely, the evolved quantities are mass, momentum, and internal energy. A general family of time integration schemes is formulated, and practical pairs for orders three and four are derived. Numerical results on standard hydrodynamics benchmarks confirm the high-order convergence on smooth problems and the exact numerical preservation of all physically conserved quantities.

97 MATHEMATICS AND COMPUTING↗

Enhancing Gaussian Process Surrogates for Optimization and Posterior Approximation via Random Exploration

This paper proposes novel noise-free Bayesian optimization strategies that rely on a random exploration step to enhance the accuracy of Gaussian process surrogate models. The new algorithms retain the ease of implementation of the classical GP-UCB algorithm, but the additional random exploration step accelerates their convergence, nearly achieving the optimal convergence rate. Furthermore, to facilitate Bayesian inference with intractable likelihoods, we propose to utilize optimization iterates for maximum a posteriori estimation to build a Gaussian process surrogate model for the unnormalized log-posterior density. We provide bounds for the Hellinger distance between the true and the approximate posterior distributions in terms of the number of design points. We demonstrate the effectiveness of our Bayesian optimization algorithms in nonconvex benchmark objective functions, in a machine learning hyperparameter tuning problem, and in a black-box engineering design problem. The effectiveness of our posterior approximation approach is demonstrated in two Bayesian inference problems for parameters of dynamical systems.

Bayesian inference↗

CLOMP_TM

The CLOMP_TM benchmark was developed to measure the overheads of various mechanisms used to guarantee the generation of correct results in threaded code even when multiple threads might be accessing and/or updating the same memory location at the same time. This includes widely supported mechanisms like OpenMP Atomic and Open MP Critical as well as new mechanisms like Transactional Memory (TM) and Speculative Execution (SE) of threads. The CLOMP_TM benchmark is highly configurable to allow a variety of problem sizes, atomic update region sizes, and potential race condition opportunities to be studied. A wide variety of checks are done on the results to verify the expected answer was actually generated. Thus CLOMP_TM can be used both to measure the overhead for various mechanisms and to check the correctness of their implementation.

Gyllenhaal, J.↗

Fracture Capabilities in Grizzly with the extended Finite Element Method (X-FEM)

Efforts are underway to develop fracture mechanics capabilities in the Grizzly code to enable it to be used to perform deterministic fracture assessments of degraded reactor pressure vessels (RPVs). A capability was previously developed to calculate three-dimensional interaction- integrals to extract mixed-mode stress-intensity factors. This capability requires the use of a finite element mesh that conforms to the crack geometry. The eXtended Finite Element Method (X-FEM) provides a means to represent a crack geometry without explicitly fitting the finite element mesh to it. This is effected by enhancing the element kinematics to represent jump discontinuities at arbitrary locations inside of the element, as well as the incorporation of asymptotic near-tip fields to better capture crack singularities. In this work, use of only the discontinuous enrichment functions was examined to see how accurate stress intensity factors could still be calculated. This report documents the following work to enhance Grizzly’s engineering fracture capabilities by introducing arbitrary jump discontinuities for prescribed crack geometries; X-FEM Mesh Cutting in 3D: to enhance the kinematics of elements that are intersected by arbitrary crack geometries, a mesh cutting algorithm was implemented in Grizzly. The algorithm introduces new virtual nodes and creates partial elements, and then creates a new mesh connectivity; Interaction Integral Modifications: the existing code for evaluating the interaction integral in Grizzly was based on the assumption of a mesh that was fitted to the crack geometry. Modifications were made to allow for the possibility of a crack front that passes arbitrarily through the mesh; and Benchmarking for 3D Fracture: the new capabilities were benchmarked against mixed-mode three-dimensional fracture problems with known analytical solutions.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Recent Advances in PyROS: The Pyomo Solver for Two-Stage Nonconvex Robust Optimization

The slides present recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. Overall, the results highlight the effectiveness of PyROS for obtaining robust solutions to optimization problems with uncertain equality constraints.

Sherman, Jason↗

Recent Advances in PyROS: The Pyomo Solver for Two-Stage Nonconvex Robust Optimization

The slides present recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. Overall, the results highlight the effectiveness of PyROS for obtaining robust solutions to optimization problems with uncertain equality constraints.

Sherman, Jason↗

Domain Decomposition for Integer Optimal Control with Total Variation Regularization

Total variation integer optimal control problems admit solutions and necessary optimality conditions via geometric variational analysis. In spite of the existence of said solutions, algorithms which solve the discretized objective suffer from high numerical cost associated with the combinatorial nature of integer programming. Hence, such methods are often limited to small and medium-sized problems. We propose a globally convergent, coordinate descent–inspired algorithm that allows tractable subproblem solutions restricted to a partition of the domain. Our decomposition method solves relatively small trust-region subproblems that modify the control variable on a subdomain only. Given nontrivial subdomain overlap, we prove that a global first-order necessary optimality condition is equivalent to a first-order necessary optimality condition per subdomain. We additionally show that a sufficient decrease is achieved on a single subdomain by way of a trust-region subproblem solver using geometric measure–theoretic arguments, which we integrate with a greedy patch selection to prove convergence of our algorithm. In conclusion, we demonstrate the practicality of our algorithm on a benchmark large-scale, PDE-constrained integer optimal control problem and find that our method is faster than the state of the art.

domain decomposition↗

The Paucity Problem: Where Have All the Space Reactor Experiments Gone?

The Handbooks of the International Criticality Safety Benchmark Evaluation Project (ICSBEP) and the International Reactor Physics Experiment Evaluation Project (IRPhEP) together contain a plethora of documented and evaluated experiments essential in the validation of nuclear data, neutronics codes, and modeling of various nuclear systems. Unfortunately, only a minute selection of handbook data (twelve evaluations) are of actual experimental facilities and mockups designed specifically for space nuclear research. There is a paucity problem, such that the multitude of space nuclear experimental activities performed in the past several decades have yet to be recovered and made available in such detail that the international community could benefit from these valuable historical research efforts. Those experiments represent extensive investments in infrastructure, expertise, and cost, as well as constitute significantly valuable resources of data supporting past, present, and future research activities. The ICSBEP and IRPhEP were established to identify and verify comprehensive sets of benchmark data; evaluate the data, including quantification of biases and uncertainties; compile the data and calculations in a standardized format; and formally document the effort into a single source of verified benchmark data. See full abstract in attached document.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

On the Computational Viability of Quantum Optimization for PMU Placement

Using optimal phasor measurement unit placement as a prototypical problem, we assess the computational viability of the current generation D-Wave Systems 2000Q quantum annealer for power systems design problems. We reformulate minimum dominating set for the annealer hardware, solve the reformulation for a standard set of IEEE test systems, and benchmark solution quality and time to solution against the CPLEX optimizer and simulated annealing. For some problem instances the 2000Q outpaces CPLEX. For instances where the 2000Q underperforms with respect to CPLEX and simulated annealing, we suggest hardware improvements for the next generation of quantum annealers.

hardware↗

Conditional Pseudo-Reversible Normalizing Flow for Surrogate Modeling in Quantifying Uncertainty Propagation

We introduce a conditional pseudo-reversible normalizing flow (PR-NF) that directly learns conditional probability distributions from noisy physical models to efficiently quantify both forward and inverse uncertainty propagation. Traditional surrogate modeling approaches approximate only the deterministic component of physical models, requiring separate noise characterization and computationally expensive sampling methods for inverse problems. Here, in this work, we develop the conditional PR-NF model to directly learn and efficiently generate samples from the conditional probability density functions (PDFs). The training process utilizes dataset consisting of input-output pairs without requiring prior knowledge about the noise and the function. Once trained, our model efficiently generates samples from conditional PDFs for any input within the training domain. Moreover, the pseudo-reversibility feature allows for the use of fully connected neural network architectures, which simplifies the implementation and enables theoretical analysis. We provide a rigorous convergence analysis of the conditional PR-NF model, showing its ability to converge to the target conditional PDF using the Kullback−Leibler divergence. To demonstrate the effectiveness of our method, we apply it to several benchmark tests and a real-world geologic carbon storage problem.

97 MATHEMATICS AND COMPUTING↗

Recent Advances of PyROS: A Pyomo Solver for Nonconvex Two-Stage Robust Optimization in Process Systems Engineering

The document presents recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. An amine-based CO2 capture case study is presented to demonstrate the utility of PyROS for large-scale process models. Overall, the results highlight the effectiveness of PyROS for obtaining robust solutions to optimization problems with uncertain equality constraints.

Sherman, Jason↗

A comparison of global optimization algorithms with standard benchmark functions and real-world applications using Energy Plus

There is an increasing interest in the use of computer algorithms to identify combinations of parameters which optimise the energy performance of buildings. For such problems, the objective function can be multi-modal and needs to be approximated numerically using building energy simulation programs. As these programs contain iterative solution algorithms, they introduce discontinuities in the numerical approximation to the objective function. Metaheuristics often work well for such problems, but their convergence to a global optimum cannot be established formally. Moreover, different algorithms tend to be suited to particular classes of optimization problems. To shed light on this issue we compared the performance of two metaheuristics, the hybrid CMA-ES/HDE and the hybrid PSO/HJ, in minimizing standard benchmark functions and real-world building energy optimization problems of varying complexity. From this we find that the CMA-ES/HDE performs well on more complex objective functions, but that the PSO/HJ more consistently identifies the global minimum for simpler objective functions. Both identified similar values in the objective functions arising from energy simulations, but with different combinations of model parameters. This may suggest that the objective function is multi-modal. The algorithms also correctly identified some non-intuitive parameter combinations that were caused by a simplified control sequence of the building energy system that does not represent actual practice, further reinforcing their utility.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Validation of Scale 6.2 criticality calculations using KENO V.A and KENO-VI - 14603

SCALE 6.2 provides enhancements for criticality calculations relative to SCALE 6.1, especially with updated nuclear data libraries, resonance self-shielding options for multigroup (MG) calculations, and problem-dependent temperature treatments for continuous-energy (CE) calculations. Benchmark experiments from the International Criticality Safety Benchmark Evaluation Project that are available in the Oak Ridge National Laboratory Verified, Archived, Library of Inputs and Data (VALID) were applied in this validation effort to examine the impact of the SCALE 6.2 enhancements. Over 300 cases are drawn from the VALID library for testing KENO V.a, and a more limited set of approximately 50 configurations is used for validation of KENO-VI. A total of 401 unique critical experiments are used in this validation effort. In some cases, the KENO V.a models were converted to KENO-VI models so that the performance of both codes could be assessed for the same systems. Validation results for the SCALE 6.2 ENDF/B-VII.1 nuclear data libraries are presented, including MG neutron data in 56- and 252-group structures as well as CE data. The performance of all three multipurpose neutron libraries in calculating k{sub eff} is examined with critical experiment models covering a wide range of fuels, moderators, reflectors, absorbers, and neutron spectra. The SCALE 6.2 ENDF/B-VII.1 coupled neutron-photon library, primarily developed for shielding applications with 200 neutron groups and 47 gamma groups, provides additional energy resolution for fast systems relative to the MG neutron libraries which were developed to produce low biases for thermal neutron systems. The applicability of this library to criticality calculations for fast neutron spectrum systems is not investigated here but will be addressed in the final SCALE 6.2 validation report. The results of these calculations demonstrate that SCALE 6.2 generally provides lower biases than SCALE 6.1 and that the two versions of KENO provide equivalent results on the same suite of problems. SCALE 6.2 also includes an updated neutron cross-section covariance library based on the ENDF/B-VII.1 covariance data. The effect of these updated covariances on the uncertainty in k{sub eff} due to cross section uncertainties is also presented for some cases. A more thorough investigation of the updated covariance data is presented in a companion paper. (authors)

42 ENGINEERING↗

Development of a LOCA Experimental Benchmark for BISON - Milestone L2:FMC.P15.08

Since 2013 CASL has been planning and working towards a PWR LOCA Challenge Problem. Since BISON is the CASL fuel rod simulation platform, it plays a central role in that activity. The goal of the FY-17 CASL milestone reported here was to develop an Experimental Benchmark for LOCA analysis using BISON. Activities encompassed both code development and validation. This report provides a current snapshot of BISON’s capability for LOCA behavior including: 1) a summary of code extensions to facilitate accident analysis, 2) a series of separate effects tests, and 3) initial code validation to complex integral rod LOCA behavior. Conclusions from each of these main activities are summarized below. The key material and behavior models required to address transient high-temperature phenomena occurring during LOCAs in a standard PWR have now been implemented in BISON. These apply specifically to UO2 fuel, Zircaloy cladding and water coolant. During FY-17 important new capability to address axial UO2 fuel relocation (for 1.5D geometry) and account for oxidation energy deposition in cladding, were included. Planned future development efforts include extending the axial fuel relocation model from 1.5D to 2D/3D and improving BISON’s fission gas release model to include transient gas release associated with the high burnup structure (HBS) in high burnup fuel. Additionally, investigation of potential anisotropic creep behavior in Zircaloy cladding is planned, assuming sufficient experimental data are available to support this effort. A substantial number of separate effects validation cases (42 tests from 3 experimental series) have been completed to compare BISON predictions to measured ballooning and burst behavior for Zircaloy cladding. Such experiments include a wide variety of pressures, temperatures and loading rates. In general, BISON predictions of burst temperature, pressure and burst time are very reasonable. For one experimental series, however, involving both very high temperatures and strain rates, BISON systematically over-predicts the cladding hoop strain. Investigation of this discrepancy is an important and planned activity. With another experiment an effort was made to investigate 3D cladding response due to an azimuthal temperature variation. Results indicated 3D effects are potentially important in fuel rod analysis during LOCAs and will be further investigated in the future. BISON validation to a series of integral fuel rod experiments has also been completed. These experiments involve all fuel and cladding phenomena relevant to LOCA conditions, and can include complexities associated with irradiated fuel relative to fresh fuel. Such experiments also generally include complex thermal-hydraulic boundary conditions. Four experiments (6 rods) have been considered to date including simulated fuel (ZrO2) and both fresh and high-burnup UO2. Test rods ranged from rodlets to full length commercial PWR fuel rods. As with the separate effects experiments, BISON predictions of burst temperature, pressure and burst time are generally very reasonable. Comparisons to cladding peak strain and rod outer diameter axial profiles are less satisfactory, and identify material models and possibly modeling approximations (e.g., 2D-RZ vs 3D geometries) requiring additional investigation. Validation of BISON for integral rod LOCA behavior is by no means complete, with additional cases planned.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Automatic generation of executable communication specifications from parallel applications

Portable parallel benchmarks are widely used and highly effective for (a) the evaluation, analysis and procurement of high-performance computing (HPC) systems and (b) quantifying the potential benefits of porting applications for new hardware platforms. Yet, past techniques to synthetically parameterized hand-coded HPC benchmarks prove insufficient for today's rapidly-evolving scientific codes particularly when subject to multi-scale science modeling or when utilizing domain-specific libraries. To address these problems, this work contributes novel methods to automatically generate highly portable and customizable communication benchmarks from HPC applications. We utilize ScalaTrace, a lossless, yet scalable, parallel application tracing framework to collect selected aspects of the run-time behavior of HPC applications, including communication operations and execution time, while abstracting away the details of the computation proper. We subsequently generate benchmarks with identical run-time behavior from the collected traces. A unique feature of our approach is that we generate benchmarks in CONCEPTUAL, a domain-specific language that enables the expression of sophisticated communication patterns using a rich and easily understandable grammar yet compiles to ordinary C + MPI. Experimental results demonstrate that the generated benchmarks are able to preserve the run-time behavior - including both the communication pattern and the execution time - of the original applications. Such automated benchmark generation is particularly valuable for proprietary, export-controlled, or classified application codes: when supplied to a third party. Our auto-generated benchmarks ensure performance fidelity but without the risks associated with releasing the original code. This ability to automatically generate performance-accurate benchmarks from parallel applications is novel and without any precedence, to our knowledge.

42 ENGINEERING↗

PRECONDITIONED BI-CONJUGATE GRADIENT METHOD FOR RADIATIVE TRANSFER IN SPHERICAL MEDIA

A robust numerical method called the Preconditioned Bi-Conjugate Gradient (Pre-BiCG) method is proposed for the solution of the radiative transfer equation in spherical geometry. A variant of this method called Stabilized Preconditioned Bi-Conjugate Gradient (Pre-BiCG-STAB) is also presented. These are iterative methods based on the construction of a set of bi-orthogonal vectors. The application of the Pre-BiCG method in some benchmark tests shows that the method is quite versatile, and can handle difficult problems that may arise in astrophysical radiative transfer theory.

79 ASTRONOMY AND ASTROPHYSICS↗

Finite temperature auxiliary field quantum Monte Carlo in the canonical ensemble

Finite temperature auxiliary field-based quantum Monte Carlo methods, including determinant quantum Monte Carlo and Auxiliary Field Quantum Monte Carlo (AFQMC), have historically assumed pivotal roles in the investigation of the finite temperature phase diagrams of a wide variety of multidimensional lattice models and materials. Despite their utility, however, these techniques are typically formulated in the grand canonical ensemble, which makes them difficult to apply to condensates such as superfluids and difficult to benchmark against alternative methods that are formulated in the canonical ensemble. Working in the grand canonical ensemble is furthermore accompanied by the increased overhead associated with having to determine the chemical potentials that produce desired fillings. Given this backdrop, in this work, we present a new recursive approach for performing AFQMC simulations in the canonical ensemble that does not require knowledge of chemical potentials. To derive this approach, we exploit the convenient fact that AFQMC solves the many-body problem by decoupling many-body propagators into integrals over one-body problems to which non-interacting theories can be applied. We benchmark the accuracy of our technique on illustrative Bose and Fermi–Hubbard models and demonstrate that it can converge more quickly to the ground state than grand canonical AFQMC simulations. We believe that our novel use of HS-transformed operators to implement algorithms originally derived for non-interacting systems will motivate the development of a variety of other methods and anticipate that our technique will enable direct performance comparisons against other many-body approaches formulated in the canonical ensemble.

Shen, Tong (ORCID:0000000206292468)↗