Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematical programming”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Performance of Julia for High Energy Physics Analyses

We argue that the Julia programming language is a compelling alternative to currently more common implementations in Python and C++ for common data analysis workflows in high energy physics. We compare the speed of implementations of different workflows in Julia with those in Python and C++. Furthermore, our studies show that the Julia implementations are competitive for tasks that are dominated by computational load rather than data access. For work that is dominated by data access, we demonstrate an application with concurrent file reading and parallel data processing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

The potential of quantum annealing for rapid solution structure identification

Abstract The recent emergence of novel computational devices, such as quantum computers, coherent Ising machines, and digital annealers presents new opportunities for hardware-accelerated hybrid optimization algorithms. Unfortunately, demonstrations of unquestionable performance gains leveraging novel hardware platforms have faced significant obstacles. One key challenge is understanding the algorithmic properties that distinguish such devices from established optimization approaches. Through the careful design of contrived optimization tasks, this work provides new insights into the computation properties of quantum annealing and suggests that this model has the potential to quickly identify the structure of high-quality solutions. A meticulous comparison to a variety of algorithms spanning both complete and local search suggests that quantum annealing’s performance on the proposed optimization tasks is distinct. This result provides new insights into the time scales and types of optimization problems where quantum annealing has the potential to provide notable performance gains over established optimization algorithms and suggests the development of hybrid algorithms that combine the best features of quantum annealing and state-of-the-art classical approaches.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A semi-agnostic ansatz with variable structure for variational quantum algorithms

Quantum machine learning—and specifically Variational Quantum Algorithms (VQAs)—offers a powerful, flexible paradigm for programming near-term quantum computers, with applications in chemistry, metrology, materials science, data science, and mathematics. Here, one trains an ansatz, in the form of a parameterized quantum circuit, to accomplish a task of interest. However, challenges have recently emerged suggesting that deep ansatzes are difficult to train, due to flat training landscapes caused by randomness or by hardware noise. This motivates our work, where we present a variable structure approach to build ansatzes for VQAs. Our approach, called VAns (Variable Ansatz), applies a set of rules to both grow and (crucially) remove quantum gates in an informed manner during the optimization. Consequently, VAns is ideally suited to mitigate trainability and noise-related issues by keeping the ansatz shallow. We employ VAns in the variational quantum eigensolver for condensed matter and quantum chemistry applications, in the quantum autoencoder for data compression and in unitary compilation problems showing successful results in all cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Providing a Flexible and Comprehensive Software Stack Via Spack, an Extreme-Scale Scientific Software Stack, and Software Development Kits

To manage the complex demands of modern high-performance computing (HPC), software applications increasingly depend on software developed by other teams, often at other institutions. An HPC software ecosystem approach is required to support dependencies on third-party scientific software. An ecosystem approach provides layers of activity above the individual software product level that promote interoperability, quality improvement, porting, testing, and deployment. The U.S. Exascale Computing Project (ECP) developed its HPC software ecosystem using a three-pronged approach. First, the ECP adopted and invested in Spack, a package manager designed to handle complex HPC package dependencies. Second, the ECP created the Extreme Scale Scientific Software Stack, an effort that supports developing, deploying, and running scientific applications on HPC platforms. Third, the ECP supported software product communities, or software development kits, to develop and promote best practices, improve software interoperability, and other collaborative efforts. This article describes ECP contributions to HPC software ecosystem challenges.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Quantum Distributed Unit Commitment: An Application in Microgrids

The dawn of quantum computing brings on a revolution in the way combinatorially complex power system problems such as Unit Commitment are solved. The Unit Commitment problem complexity is expected to increase in the future because of the trend toward the increase of penetration of intermittent renewables. Even though quantum computing has proven effective for solving a host of problems, its applications for power systems’ problems have been rather limited. Here, in this paper, a quantum unit commitment is innovatively formulated and the quantum version of the decomposition and coordination alternate direction method of multipliers (ADMM) is established. The above is achieved by devising quantum algorithms and by exploiting the superposition and entanglement of quantum bits (qubits) for solving subproblems, which are then coordinated through ADMM to obtain feasible solutions. The main contributions of this paper include: 1) the innovative development of a quantum model for Unit Commitment; 2) development of decomposition and coordination-supported framework which paves the way for the utilization of limited quantum resources to potentially solve the large-scale discrete optimization problems; 3) devising the novel quantum distributed unit commitment (QDUC) to solve the problem in a larger scale than currently available quantum computers are capable of solving. The QDUC results are compared with those from its classical counterpart, which validate the efficacy of quantum computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Machine Learning-enabled Scalable Performance Prediction of Scientific Codes

Hardware architectures become increasingly complex as the compute capabilities grow to exascale. Here, we present the Analytical Memory Model with Pipelines (AMMP) of the Performance Prediction Toolkit (PPT). PPT-AMMP takes high-level source code and hardware architecture parameters as input and predicts runtime of that code on the target hardware platform, which is defined in the input parameters. PPT-AMMP transforms the code to an (architecture-independent) intermediate representation, then (i) analyzes the basic block structure of the code, (ii) processes architecture-independent virtual memory access patterns that it uses to build memory reuse distance distribution models for each basic block, and (iii) runs detailed basic-block level simulations to determine hardware pipeline usage. PPT-AMMP uses machine learning and regression techniques to build the prediction models based on small instances of the input code, then integrates into a higher-order discrete-event simulation model of PPT running on Simian PDES engine. We validate PPT-AMMP on four standard computational physics benchmarks and present a use case of hardware parameter sensitivity analysis to identify bottleneck hardware resources on different code inputs. We further extend PPT-AMMP to predict the performance of a scientific application code, namely, the radiation transport mini-app SNAP. To this end, we analyze multi-variate regression models that accurately predict the reuse profiles and the basic block counts. We validate predicted SNAP runtimes against actual measured times.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Smoothing Lexis diagrams using kernel functions: A contemporary approach

Lexis diagrams are rectangular arrays of event rates indexed by age and period. Analysis of Lexis diagrams is a cornerstone of cancer surveillance research. Typically, population-based descriptive studies analyze multiple Lexis diagrams defined by sex, tumor characteristics, race/ethnicity, geographic region, etc. Inevitably the amount of information per Lexis diminishes with increasing stratification. Several methods have been proposed to smooth observed Lexis diagrams up front to clarify salient patterns and improve summary estimates of averages, gradients, and trends. In this article, we develop a novel bivariate kernel-based smoother that incorporates two key innovations. First, for any given kernel, we calculate its singular values decomposition, and select an optimal truncation point—the number of leading singular vectors to retain—based on the bias-corrected Akaike information criterion. Second, we model-average over a panel of candidate kernels with diverse shapes and bandwidths. The truncated model averaging approach is fast, automatic, has excellent performance, and provides a variance-covariance matrix that takes model selection into account. We present an in-depth case study (invasive estrogen receptor-negative breast cancer incidence among non-Hispanic white women in the United States) and simulate operating characteristics for 20 representative cancers. The truncated model averaging approach consistently outperforms any fixed kernel. Our results support the routine use of the truncated model averaging approach in descriptive studies of cancer.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2020

A Review of TSUNAMI Applications

The TSUNAMI-1D and TSUNAMI-3D sequences for generating k eff sensitivity coefficients were first released in SCALE 5 in 2004. Several other tools were introduced in the same release, including primarily the TSUNAMI-IP code for uncertainty analysis and similarity assessments. The TSUNAMI sequences added capabilities for identifying important reactions and data for systems using sensitivity coefficients and also introduced new quantitative tools for rigorously assessing the similarity of systems. Over time, the capabilities of these tools have grown, and their use has expanded into other areas such as nuclear data assessment and nuclear covariance data testing. This paper discusses applications of the TSUNAMI tools for sensitivity calculations, sensitivity/uncertainty (S/U)-based validation, and nuclear data testing. This paper is one of a series of papers at this conference on the development and use of TSUNAMI tools. The other papers address the development of the TSUNAMI methods and the use of TSUNAMI for critical experiment design and optimization.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Machine learning applied to classifying neutron resonances

The performance of nuclear reactors and other nuclear systems depends on a precise understanding of the neutron interaction cross sections for materials used in these systems. These cross sections exhibit resonance structure whose shape is determined in part by the angular momentum quantum numbers of the resonances. The correct assignment of the quantum numbers of neutron resonances is therefore of paramount importance. In this project, we apply a machine learning technique, namely decision trees, to automate the quantum number assignments. The tree is trained from simulated data generated to mimic the errors found in real data. We explore the use of several physics-motivated features for training our trees, including the nearest neighbor spacing distribution, cumulative level distribution, and channel width distributions. Initial results using random matrix theory motivated fits which demonstrated that we can determine resonance spin groups somewhat reliably. If we use these fits as features in our trees, we can train them to spot outliers corresponding to misassigned resonances. We found that with the large number of features used in this project that the decision tree tended to over t training data resulting in poor performance with respect to the test data. By reducing the number of features, we can achieve nearly perfect assignment of quantum numbers with our training data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

A consistent, Bayesian, approach to the cross section probability distribution in the unresolved resonance region

The cross sections of neutron-induced reactions can be divided into three energy ranges: the resolved resonance region (RRR), the unresolved resonance region (URR), and the fast region. In general, the cross sections in the URR show significant fluctuations that cannot be predicted and cannot be experimentally resolved, thus, it is commonly assumed that the cross section at a specific energy is given by a probability distribution function (PDF) over a range of values that can span several orders of magnitude. The current methodology used to describe such behavior is to construct the PDF by stochastically generating resonance ladders and numerically measuring the PDF. The resonance ladders are sampled using known resonance statistical properties and average resonance widths and spacings extrapolated from the RRR. Although this is a standard and widely used technique, it is computationally very expensive, therefore, an alternative, analytical, approach would be preferable due to the considerable speed up of the computational time in real life applications. Moreover, the current methodology does not take into account existing experimental data, such for total and capture cross sections, that are available for many nuclei. Finally, this approach was developed to be used in reactor-scale applications and it is not suited for use in single-event applications. In this work we will rethink the entire approach to the PDF construction using a Bayesian mindset. This will allow us to provide a different definition of the PDF that allows a much faster calculation of the higher-temperature PDFs and a proper combination of theoretical and experimental PDFs following the probability theory. We will also show that our definition is well suited for single-event applications and we will make an explicit connection between our method and the standard approach. We do this by showing that the central limit theorem applies and our method leads to the same PDF obtained with the standard methodology, for a large number of events per history.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Comparison of the Baseline USL Calculation Methods for Loosely-Coupled and Novel Neutronic Systems [Slides]

Current work includes reconstructing 187-group ENDF B/VII.1 covariance matrix for comparison study to 44-group ENDF B/VII.1 matrix to determine how covariance matrix structures affect the USL calculations and investigating the exact domination mechanism of region-wise sensitivities in a loosely-coupled system. Future work will involve seeking to understand how bias distributions change with reactivity and how to calculate propagate distribution error into USL calculations, as well as how cross section perturbation studies can be extended to other types of calculations, such as shielding calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Thermal Neutron Scattering Law (TNSL) Implementation and Testing in FUDGE

Thermal neutron scattering law processing capabilities have been recently implemented in the LLNL code FUDGE (For Updating Data and Generating Evaluations). FUDGE is now capable of producing processed TNSL data for use in Monte Carlo or deterministic transport. To test this new capability, LLNL scientists performed an extensive intercomparison between the Mercury, Ardra, COG and MCNP transport codes. This intercomparison helped probe differences between how TNSL data are handled by the transport codes and by two different processing codes (LLNL’s FUDGE and LANL’s NJOY). This report summarizes recent improvements in FUDGE TNSL capabilities as well as results from the code intercomparison.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2022

Verification of Revised and Upcoming Nuclear Data Sensitivity MCNP Features [Poster]

Nuclear data is ubiquitous across nuclear applications. Improved nuclear data means more accurate simulations. Past focus on k eff caused compensating error and areas of unvalidated nuclear data. Sensitivity can be used to optimize experiments to focus on specific areas. Sensitivity capabilities must be expanded and improved to design multivariate experiments focused on nuclear data needs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Advances in Nuclear Data Evaluation Theory for NCSP [Slides]

The generalized form of the Bayes’ Theorem improves UQ for NCSP of differential and/or integral data evaluations and of applications. It is being implemented in an API for use by SCALE, SAMMY, etc. Extended R-matrix formalism improves evaluations of RRR including direct reactions, direct capture, and the Reich-Moore approx., doorway state reactions with applications to RPI data on lead isotopes. Extended R-Matrix formalism will be implemented into SAMMY post modernization.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

How can a diverse set of integral and semi-integral measurements inform identification of discrepant nuclear data? [Slides]

Importance of nuclear data to bias changed significantly when including diverse measurement sets. LLNL pulsed sphere measurements provided information for 9 Be nuclear data above 2 MeV and subcritical benchmarks provided information for 240 Pu nuclear data between 100 keV and 10 MeV. Pulsed sphere leakage spectra and neutron noise observables are differently sensitive to nuclear data compared to critical benchmarks. Leakage spectra are sensitive to nuclear data above 5 MeV. Count rate and Feynman Y are more sensitive to nuclear data. A change in bias can help evaluators identify discrepant nuclear data. In the future, EUCLID plans to perform RAFIEKI analysis with additional benchmark and measurement sets.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗