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 865 records · Page 48

Combining active learning suggestions

We study the problem of combining active learning suggestions to identify informative training examples by empirically comparing methods on benchmark datasets. Many active learning heuristics for classification problems have been proposed to help us pick which instance to annotate next. But what is the optimal heuristic for a particular source of data? Motivated by the success of methods that combine predictors, we combine active learners with bandit algorithms and rank aggregation methods. We demonstrate that a combination of active learners outperforms passive learning in large benchmark datasets and removes the need to pick a particular active learner a priori. We discuss challenges to finding good rewards for bandit approaches and show that rank aggregation performs well.

97 MATHEMATICS AND COMPUTING↗

Implementation of on-the-fly doppler broadening in MCNP

A new method to obtain Doppler broadened cross sections has been implemented into MCNP, removing the need to generate cross sections for isotopes at problem temperatures. When a neutron of energy E enters a material region that is at some temperature T, the cross sections for that material at temperature T are immediately obtained 'on-the-fly' (OTF) by interpolation using a high order functional expansion for the temperature dependence of the Doppler-broadened cross section for that isotope at the neutron energy E. The OTF cross sections agree with the NJOY-based cross sections for all neutron energies and all temperatures in the range specified by the user, e.g., 250 K - 3200 K. The OTF methodology has been successfully implemented into the MCNP Monte Carlo code and has been tested on several test problems by comparing MCNP with conventional ACE cross sections versus MCNP with OTF cross sections. The test problems include the Doppler defect reactivity benchmark suite and two full-core VHTR configurations, including one with multiphysics coupling using RELAP5-3D/ATHENA for the thermal-hydraulic analysis. The comparison has been excellent, verifying that the OTF libraries can be used in place of the conventional ACE libraries generated at problem temperatures. In addition, it has been found that the OTF methodology greatly reduces the complexity of the input for MCNP, resulting in an order of magnitude decrease in the number of input lines for full-core configurations. Finally, for full-core problems with multiphysics feedback, the memory required to store the cross section data is considerably reduced with OTF cross sections and the additional computational effort with OTF is modest, on the order of 10-15%. (authors)

97 MATHEMATICS AND COMPUTING↗

Assessment of shock capturing schemes for resonant flows in nonlinear instability analysis

The paper presents computational assessment of advanced numerical schemes for nonlinear acoustic problems related to combustion instabilities in liquid rocket engines. Several time-accurate, shock capturing schemes have been evaluated on a benchmark, closed-end resonant pipe flow problem. It involves the numerical solution of inviscid, compressible gas dynamics equations to predict acoustic wave propagation, wave steepening, formation of shocks, acoustic energy dissipation and wave-wall reflection for several hundred wave cycles. It was demonstrated that high accuracy TVD type schemes can be used for direct, exact nonlinear analysis of combustion instability problems, preserving high harmonic energy content for long periods of time. The selected scheme was then applied to analyze the acoustic responses of resonant pipe-resonator, radial acoustic modes and hub-baffle configurations. Interesting observations of wave shape and damping characteristics have been drawn from presented computational studies.

Przekwas, A. J.↗

Comparison of Results between the Legacy and Refined RELAP5-3D Models of the High Temperature Test Facility in Exercises 1 and 2 of the HTTF Benchmark

Work conducted in FY23 identified that RELAP5-3D was capable of reproducing trends in HTTF data during experiment PG-27 but was incapable of reproducing measured values. The primary cause of this discrepancy between RELAP5-3D results and experimental data was hypothesized to be a distortion in power density that was introduced by the radial nodalization of the model. We further hypothesized that a new model would provide better results when compared to the experiments PG-27 and PG-29. Work this FY developed a new model that is better capable of capturing local heat generation rates and contains a representation of each 1/6 azimuthal sector of the core. We used this model to develop a new set of solutions to Exercises 1 and 2 of Problems 2 and 3 in the benchmark. In this report, we present the first comprehensive comparison of the results between the two models. We see that in Exercise 1A, which is common between problems 2 and 3, the results are similar, though the results from the new model show greater detail than those from the legacy model. In Problem 2 Exercise 1B and Problem 3 Exercise 1B, we see that heat removal is slower in the new model than the legacy model. Problem 3 Exercise 1C shows temperatures that are lower in most places in the new model than the legacy model, but the area with active heat generation has higher block temperatures in the new model than the legacy model. Problem 3 Exercise 1D further shows that long-term heat removal is lower in the new model. Problem 2 Exercise 1C demonstrated that the new model observes higher temperatures in the core regions than the legacy model, justifying the need to preserve the power density in HTTF. The validation of PG-27 and PG-29 also demonstrated the improved temperature agreement in the core regions, particularly with a calibrated model that implements an effective thermal conductivity for the core material. Overall, PG-27 models show reasonable to excellent agreement for steady-state temperatures and minimal to reasonable agreement for transients. PG-29 models showed minimal to insufficient agreement with the data.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

The development and testing of the HELIOS-2 lattice code for use in online cross section generation

This work presents the implementation and testing of the fixed k{sub eff} calculation, with a fixed incoming current boundary condition (fixed k{sub eff} calculation) in the HELIOS-2 lattice physics code. The fixed k{sub eff} numerical algorithm and its implementation in HELIOS-2 are described. The newly implemented feature in the code was tested on a range of test problems that were based on the 2D C5G7 benchmark. Good results were obtained and showed that the implementation performed consistently across the series of test problems. (authors)

97 MATHEMATICS AND COMPUTING↗

A new approach to three-dimensional neutron transport solution based on the method of characteristics and linear axial approximation

A new approach based on the method of characteristics (MOC) is proposed to solve the neutron transport equation. A new three-dimensional (3D) spatial discretization is applied to avoid the instability issue of the transverse leakage iteration of the traditional 2D/1D approach. In this new approach, the axial and radial variables are discretized in two different ways: the linear expansion is performed in the axial direction, then, the 3D solution of the angular flux is transformed to be the planar solution of 2D angular expansion moments, which are solved by the planar MOC sweeping. Based on the boundary and interface continuity conditions, the 2D expansion moment solution is equivalently transformed to be the solution of the axially averaged angular flux. Using the piecewise averaged angular flux at the top and bottom surfaces of 3D meshes, the planes are coupled to give the 3D angular flux distribution. The 3D CMFD linear system is established from the surface net current of every 3D pin-mesh to accelerate the convergence of power iteration. The STREAM code is extended to be capable of handling 3D problems based on the new approach. Several benchmarks are tested to verify its feasibility and accuracy, including the 3D homogeneous benchmarks and heterogeneous benchmarks. The computational sensitivity is discussed. The results show good accuracy in all tests. With the CMFD acceleration, the convergence is stable. In addition, a pin-cell problem with void gap is calculated. This shows the advantage compared to the traditional 2D/1D MOC methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algebraic Multigrid Benchmark

AMG2013 is a parallel algebraic multigrid solver for linear systems arising from problems on unstructured grids. It has been derived directly from the Boomer AMG solver in the hypre library, a large linear solvers library that is being developed in the Center for Applied Scientific Computing (CASC) at LLNL. The driver provided in the benchmark can build various test problems. The default problem is a Laplace type problem on an unstructured domain with various jumps and an anisotropy in one part.

Source record↗

Machine learning moment closure models for the radiative transfer equation I: Directly learning a gradient based closure

In this paper, we take a data-driven approach and apply machine learning to the moment closure problem for the radiative transfer equation in slab geometry. Instead of learning the unclosed high order moment, we propose to directly learn the gradient of the high order moment using neural networks. This new approach is consistent with the exact closure we derive for the free streaming limit and also provides a natural output normalization. Finally, a variety of benchmark tests, including the variable scattering problem, the Gaussian source problem with both periodic and reflecting boundaries, and the two-material problem, show both good accuracy and generalizability of our machine learning closure model.

Computer science↗

Algebraic Multigrid Benchmark

AMG is a parallel algebraic multigrid solver for linear systems arising from problems on unstructured grids. It has been derived directly from the BoomerAMG solver in the hypre library, a large linear solvers library that is being developed in the Center for Applied Scientific Computing (CASC) at LLNL and is very similar to the AMG2013 benchmark with additional optimizations. The driver provided in the benchmark can build various test problems. The default problem is a Laplace type problem with a 27-point stencil, which can be scaled up and is designed to solve a very large problem. A second problem simulates a time dependent problem, in which successively various smnllcr systems are solved.

Yang, Ulrike↗

Algebraic Multigrid Benchmark

AMG is a parallel algebraic multigrid solver for linear systems arising from problems on unstructured grids. It has been derived directly from the BoomerAMG solver in the hypre library, a large linear solvers library that is being developed in the Center for Applied Scientific Computing (CASC) at LLNL and is very similar to the AMG2013 benchmark with additional optimizations. The driver provided in the benchmark can build various test problems. The default problem is a Laplace type problem with a 27-point stencil, which can be scaled up and is designed to solve a very large problem. A second problem simulates a time dependent problem, in which successively various smnllcr systems are solved.

Yang, Ulrike↗

A computationally efficient P 1 radiation model for modern combustion systems utilizing pre-conditioned conjugate gradient methods

The iterative convergence of the P 1 radiation model can be slow in optically thin scenarios when employing classical iterative methods. In order to remedy this shortcoming, an in-house P 1 radiation model was interfaced with high performance, scalable, linear solver libraries. Next, the accuracies of P 1 radiation model calculations was assessed by comparing its predictions against discrete ordinates (DO) model calculations for prototypical problems representative of modern combustion systems. Corresponding benchmark results were also included for comparison. Utilizing Pre-Conditioners (PC) to the Conjugate Gradients (CG) method, the convergence time of the P 1 radiation model reduced by a factor of 30 for modest problem sizes and a factor of 70 for larger sized problems when compared against classical Gauss Seidel sweeps. Additionally, PC provided 50% computational savings compared to employing CG in a standalone mode. The P 1 model calculation times were about 25–30% of the DO model calculation time. The time to solution also scaled linearly with an increase in problem size. The weighted sum of gray gases model employed in this study in conjunction with the P 1 model provided good agreement against benchmark data with L 2 error norms (defined relative to corresponding DO calculations) improving when isotropic intensities were prevalent.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A comparison between the one- and two-step spin-orbit coupling approaches based on the ab initio Density Matrix Renormalization Group

The efficient and reliable treatment of both spin-orbit coupling (SOC) and electron correlation is essential for understanding f-element chemistry. Here, we analyze two approaches to the problem, the one-step approach where both effects are treated simultaneously, and the two-step state interaction approach. We report an implementation of the ab initio density matrix renormalization group(DMRG) with a one-step treatment of the SOC effect which can be compared to prior two-step treatments on an equal footing. Using a dysprosium octahedral complex and bridged dimer as benchmark systems, we identify characteristics of problems where the one-step approach is beneficial for obtaining the low-energy spectrum.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Godiva IV Thermal Neutron Dosimetry Modeling and Variance Reduction

The transfer of the Godiva IV experiment from the Los Alamos Critical Experiments Facility (LACEF) to the National Critical Experiments Research Center (NCERC) introduced a vastly different experiment room return to the neutron flux. The contribution of the background to the burst neutron energy spectrum is significant in the thermal and epithermal neutron energies. Target materials may be placed in various locations in the Godiva room, or outside of the room, for thermal neutron activation. Modeling of this dosimetry problem in Monte Carlo N-Particle (MCNP) presented a novel challenge compared to previous Godiva IV glory hole irradiation simulations. An advanced dosimetry modeling framework for high efficiency calculations in locations far from the Godiva IV fission source was desired. The mesh-based weight windows and point detector advanced variance reduction techniques in MCNP were implemented and tested using adaptations of the critical experiment benchmark model of the Godiva IV problem. The models were validated against measured activations of Nickel, Indium, Scandium, and Cobalt foils at locations 2 meters from the Godiva IV core. Dosimetry measurements were performed in collaboration with Sandia National Laboratory. The weight windows and point detector variance reduction coupled method resulted in the highest problem efficiency.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Solution Irregularity Remediation for Spatial Discretization Error Estimation for S N Transport Solutions

The discrete ordinates linear Boltzmann transport equation is typically solved in its spatially discretized form, incurring spatial discretization error. Quantification of this error for purposes such as adaptive mesh refinement or error analysis requires an a posteriori estimator, which utilizes the numerical solution to the spatially discretized equation to compute an estimate. Because the quality of the numerical solution informs the error estimate, irregularities, present in the true solution for any realistic problem configuration, tend to cause the largest deviation in the error estimate vis-a-vis the true error. In this paper, an analytical partial singular characteristic tracking (pSCT) procedure for reducing the estimator’s error is implemented within our novel residual source estimator for a zeroth-order discontinuous Galerkin scheme, at the additional cost of a single inner iteration. Here, a metric-based evaluation of the pSCT scheme versus the standard residual source estimator is performed over the parameter range of a Method of Manufactured Solutions test suite. The pSCT scheme generates near-ideal accuracy in the estimate in problems where the dominant source of the estimator’s error is the solution irregularity, namely, problems where the true solution is discontinuous and problems where the true solution’s first derivative is discontinuous and the scattering ratio is low. In problems where the scattering ratio is high and the true solution is discontinuous in the first derivative, the error in the scattering source, which is not converged by the pSCT scheme, is greater than the error incurred due to the irregularity. Ultimately, a pSCT scheme is judged to be useful for error estimation in problems where the computational cost of the scheme is justified. In the presence of many irregularities, such a scheme may be intractable for general use, but in benchmarks, as an analytical tool, or in problems that have nondissipative discontinuities, the scheme may prove invaluable.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Automated benchmark generation based upon a specification language

The problem of validating and verifying digital flight control system (DFCS) software is addressed in this paper. A new specification language DIVERS is proposed, and is the keystone of the approach. This language consists of keywords where each keyword represents an element in the block diagram of a DFCS. DIVERS has a dictionary which contains all the keywords a DFCS designer might need. Translator programs convert the system specifications into an executable, high-level language program. The features of translators are discussed and are elucidated by examples. This language is used to describe a typical flight software module.

Rajan, N.↗

Transparent Object Tracking Benchmark

Visual tracking has achieved considerable progress in recent years. However, current research in the field mainly focuses on tracking of opaque objects, while little attention is paid to transparent object tracking. In this paper, we make the first attempt in exploring this problem by proposing a Transparent Object Tracking Benchmark (TOTB). Specifically, TOTB consists of 225 videos (86K frames) from 15 diverse transparent object categories. Each sequence is manually labeled with axis-aligned bounding boxes. To the best of our knowledge, TOTB is the first benchmark dedicated to transparent object tracking. In order to understand how existing trackers perform and to provide comparison for future research on TOTB, we extensively evaluate 25 state-of-the-art tracking algorithms. The evaluation results exhibit that more efforts are needed to improve transparent object tracking. Besides, we observe some nontrivial findings from the evaluation that are discrepant with some common beliefs in opaque object tracking. For example, we find that deeper features are not always good for improvements. Moreover, to encourage future research, we introduce a novel tracker, named TransATOM, which leverages transparency features for tracking and surpasses all 25 evaluated approaches by a large margin. By releasing TOTB, we expect to facilitate future research and application of transparent object tracking in both the academia and industry.

97 MATHEMATICS AND COMPUTING↗

A quantum hamiltonian simulation benchmark

Hamiltonian simulation is one of the most important problems in quantum computation, and quantum singular value transformation (QSVT) is an efficient way to simulate a general class of Hamiltonians. However, the QSVT circuit typically involves multiple ancilla qubits and multi-qubit control gates. In order to simulate a certain class of n-qubit random Hamiltonians, we propose a drastically simplified quantum circuit that we refer to as the minimal QSVT circuit, which uses only one ancilla qubit and no multi-qubit controlled gates. We formulate a simple metric called the quantum unitary evolution score (QUES), which is a scalable quantum benchmark and can be verified without any need for classical computation. Under the globally depolarized noise model, we demonstrate that QUES is directly related to the circuit fidelity, and the potential classical hardness of an associated quantum circuit sampling problem. Under the same assumption, theoretical analysis suggests there exists an ‘optimal’ simulation time t opt ≈ 4.81, at which even a noisy quantum device may be sufficient to demonstrate the potential classical hardness.

97 MATHEMATICS AND COMPUTING↗

NAPAbench 2: A network synthesis algorithm for generating realistic protein-protein interaction (PPI) network families

Comparative network analysis provides effective computational means for gaining novel insights into the structural and functional compositions of biological networks. In recent years, various methods have been developed for biological network alignment, whose main goal is to identify important similarities and critical differences between networks in terms of their topology and composition. A major impediment to advancing network alignment techniques has been the lack of gold-standard benchmarks that can be used for accurate and comprehensive performance assessment of such algorithms. The original NAPAbench (network alignment performance assessment benchmark) was developed to address this problem, and it has been widely utilized by many researchers for the development, evaluation, and comparison of novel network alignment techniques. In this work, we introduce NAPAbench 2—a major update of the original NAPAbench that was introduced in 2012. NAPAbench 2 includes a completely redesigned network synthesis algorithm that can generate protein-protein interaction (PPI) network families whose characteristics closely match those of the latest real PPI networks. Furthermore, the network synthesis algorithm comes with an intuitive GUI that allows users to easily generate PPI network families with an arbitrary number of networks of any size, according to a flexible user-defined phylogeny. In addition, NAPAbench 2 provides updated benchmark datasets—created using the redesigned network synthesis algorithm—which can be used for comprehensive performance assessment of network alignment algorithms and their scalability.

42 ENGINEERING↗