Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematical analysis”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,171 records · Page 65
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Analysys of the performance a PEM-type electrolyzer in variable energy supply conditions

Here in this article, the main variables related to the performance of a proton exchange membrane-type electrolyzer are analyzed along with the risk of explosion for different operating conditions, notably when the electrolyzer works with a variable solar energy power supply and at high pressure. A novel mathematical model was developed that considers all mass transport phenomena through the membrane electrode assembly (MEA) for water, hydrogen, and oxygen, as well as the water evaporation in the anode and cathode channels. The main findings of this work are that for a solar energy supply operating at high pressure, the electrolyzer cannot function safely throughout the day, since in the hours when solar irradiation is lower, low current densities favor high hydrogen concentrations at the anode. Finally, it was found that greater thicknesses of the membrane increased the explosion risk due to the increase in the MEA temperature and therefore the hydrogen solubility.

08 HYDROGEN↗
DOE OSTI2023

Machine learning surrogate of physics-based building-stock simulator for end-use load forecasting

Building energy models are used to simulate heat and mass transfer and estimate end-use load in buildings. With the proliferation of solar photovoltaics on residential and commercial buildings, increasingly, buildings are expected to provide grid services, for which accurate and computationally efficient building energy simulations and end-use load prediction are imperative. Existing building energy simulation tools, however, have significant computational overhead that make them less practical in real-time deployment for optimization, design, uncertainty quantification and control in building energy management systems. Here this article presents a data-driven machine learning model based on light gradient boosting method (LightGBM) as a surrogate for a physics-based simulator for residential buildings to predict end-use load. The machine learning based surrogate model accounts for time-series related variables, seasonality and trend component of end-use load, and history of end-use load. The accuracy of the surrogate model is assessed on the prediction of the load profiles of 100 different houses in Cook County, Illinois, USA. The LightGBM surrogate model is shown to reduce the root-mean-squared error by 53% relative to a reference decision tree (DT) based model reported previously in the literature. Moreover, the model predicts the load spikes and high-ramp rate events throughout the year which are often the Achilles heel of other models in the literature. The machine learning based surrogate model is demonstrated to be computationally efficient, with a ten-fold reduction in the computational time compared to a physics-based building energy simulation, and suitable for uncertainty analysis and real-time control of building characteristics in response to uncertainty.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Evaluating MPI resource usage summary statistics

The Message Passing Interface (MPI) remains the dominant programming model for scientific applications running on today’s high-performance computing (HPC) systems. This dominance stems from MPI’s powerful semantics for inter-process communication that has enabled scientists to write applications for simulating important physical phenomena. MPI does not, however, specify how messages and synchronization should be carried out. Those details are typically dependent on low-level architecture details and the message characteristics of the application. Therefore, analyzing an application’s MPI resource usage is critical to tuning MPI’s performance on a particular platform. The result of this analysis is typically a discussion of the mean message sizes, queue search lengths and message arrival times for a workload or set of workloads. While a discussion of the arithmetic mean in MPI resource usage might be the most intuitive summary statistic, it is not always the most accurate in terms of representing the underlying data. In this paper, we analyze MPI resource usage for a number of key MPI workloads using an existing MPI trace collector and discrete-event simulator. Our analysis demonstrates that the average, while easy and efficient to calculate, is a useful metric for characterizing latency and bandwidth measurements, but may not be a good representation of application message sizes, match list search depths, or MPI inter-operation times. Additionally, we show that the median and mode are superior choices in many cases. We also observe that the arithmetic mean is not the best representation of central tendency for data that are drawn from distributions that are multi-modal or have heavy tails. Furthermore, the results and analysis of our work provide valuable guidance on how we, as a community, should discuss and analyze MPI resource usage data for scientific applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A unifying equation for fermentation sustainability across the titer-rate-yield landscape

Industrial fermentation is central to the sustainable production of fuels and chemicals, yet commercial viability of emerging technologies hinges on improving fermentation titer, rate, and yield (TRY). How these metrics shape system cost remains difficult to generalize due to complex interactions among feedstocks, fermentation, separations, catalytic upgrading, waste management, and facility design. Here, we systematically map theoretical fermentation performance spaces (formed by all potential TRY combinations) for 32 representative biomanufacturing facilities—spanning distinct choices for feedstocks, fermentation regimes and products, separations, and catalytic upgrading—by simulating and evaluating them (via techno-economic analysis, TEA) under uncertainty (600,000 Monte Carlo simulations) and across TRY combinations (7500 TRY combinations for each of 32 configurations). Across this wide design and thermodynamic simulation space, we find the relationship between fermentation TRY and system cost is captured by a simple, generalizable mathematical equation (R 2 of 0.992 − 1.000 across our simulations; 0.954 − 1.000 when validated against prior studies that used different tools). We use this equation to elucidate key drivers that shape cost sensitivity to fermentation performance, generating widely applicable insights. By demonstrating a unifying relationship governs the impact of fermentation on biomanufacturing economics, this work establishes a foundation for agile, holistically predictive, resource-efficient strategies to prioritize fermentation research and development needs and accelerate commercialization of emerging biomanufacturing technologies.

applied mathematics↗
DOE OSTI2022

Long-time simulations for fixed input states on quantum hardware

Publicly accessible quantum computers open the exciting possibility of experimental dynamical quantum simulations. While rapidly improving, current devices have short coherence times, restricting the viable circuit depth. Despite these limitations, we demonstrate long-time, high fidelity simulations on current hardware. Specifically, we simulate an XY-model spin chain on Rigetti and IBM quantum computers, maintaining a fidelity over 0.9 for 150 times longer than is possible using the iterated Trotter method. Our simulations use an algorithm we call fixed state Variational Fast Forwarding (fsVFF). Recent work has shown an approximate diagonalization of a short time evolution unitary allows a fixed-depth simulation. fsVFF substantially reduces the required resources by only diagonalizing the energy subspace spanned by the initial state, rather than over the total Hilbert space. We further demonstrate the viability of fsVFF through large numerical simulations, and provide an analysis of the noise resilience and scaling of simulation errors.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

An updated LLVM-based quantum research compiler with further OpenQASM support

Abstract Quantum computing is a rapidly growing field with the potential to change how we solve previously intractable problems. Emerging hardware is approaching a complexity that requires increasingly sophisticated programming and control. Scaffold is an older quantum programming language that was originally designed for resource estimation for far-future, large quantum machines, and ScaffCC is the corresponding LLVM-based compiler. For the first time, we provide a full and complete overview of the language itself, the compiler as well as its pass structure. While previous works Abhari et al (2015 Parallel Comput. 45 2–17), Abhari et al (2012 Scaffold: quantum programming language https://cs.princeton.edu/research/techreps/TR-934-12 ), have piecemeal descriptions of different portions of this toolchain, we provide a more full and complete description in this paper. We also introduce updates to ScaffCC including conditional measurement and multidimensional qubit arrays designed to keep in step with modern quantum assembly languages, as well as an alternate toolchain targeted at maintaining correctness and low resource count for noisy-intermediate scale quantum (NISQ) machines, and compatibility with current versions of LLVM and Clang. Our goal is to provide the research community with a functional LLVM framework for quantum program analysis, optimization, and generation of executable code.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Exploring the nexus of many-body theories through neural network techniques: the tangent model

Abstract In this paper, we present a physically informed neural network (NN) representation of the effective interactions associated with coupled-cluster downfolding models to describe chemical systems and processes. The NN representation not only allows us to evaluate the effective interactions efficiently for various geometrical configurations of chemical systems corresponding to various levels of complexity of the underlying wave functions, but also reveals that the bare and effective interactions are related by a tangent function of some latent variables. We refer to this characterization of the effective interaction as a tangent model. We discuss the connection between this tangent model for the effective interaction with the previously developed theoretical analysis that examines the difference between the bare and effective Hamiltonians in the corresponding active spaces.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

CMOS-Based Single-Cycle in-Memory XOR/XNOR

Big data applications are on the rise, and so is the number of data centers. The ever-increasing massive data pool needs to be periodically backed up in a secure environment. Moreover, a massive amount of securely backed-up data is required for training binary convolutional neural networks for image classification. XOR and XNOR operations are essential for large-scale data copy verification, encryption, and classification algorithms. The disproportionate speed of existing compute and memory units makes the von Neumann architecture inefficient to perform these Boolean operations. Compute-in-memory (CiM) has proved to be an optimum approach for such bulk computations. The existing CiM-based XOR/XNOR techniques either require multiple cycles for computing or add to the complexity of the fabrication process. Here, we propose a CMOS-based hardware topology for single-cycle in-memory XOR/XNOR operations. Our design provides at least 2× improvement in the latency compared with other existing CMOS-compatible solutions. We verify the proposed system through circuit/system-level simulations and evaluate its robustness using a 5000-point Monte Carlo variation analysis. This all-CMOS design paves the way for practical implementation of CiM XOR/XNOR at scaled technology nodes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A new upper bound for the growth factor in Gaussian elimination with complete pivoting

Abstract The growth factor in Gaussian elimination measures how large the entries of an LU factorization can be relative to the entries of the original matrix. It is a key parameter in error estimates, and one of the most fundamental topics in numerical analysis. We produce an upper bound of for the growth factor in Gaussian elimination with complete pivoting — the first improvement upon Wilkinson's original 1961 bound of .

Bisain, Ankit [Department of Mathematics Massachus↗
DOE OSTI2021

Error Bounds for Dynamical Spectral Estimation

Dynamical spectral estimation is a well-established numerical approach for estimating eigenvalues and eigenfunctions of the Markov transition operator from trajectory data. Although the approach has been widely applied in biomolecular simulations, its error properties remain poorly understood. Here we analyze the error of a dynamical spectral estimation method called “the variational approach to conformational dynamics" (VAC). We bound the approximation error and estimation error for VAC estimates. Our analysis establishes VAC's convergence properties and suggests new strategies for tuning VAC to improve accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

SeeQ: A Programming Model for Portable Data-Driven Building Applications

This paper introduces SeeQ, a programming model and an abstraction framework that facilitates the development of portable data- driven building applications. Data-driven approaches can provide insights into building operations and guide decision-making to achieve operational objectives. Yet the configuration of such applications per building requires extensive effort and tacit knowledge. In SeeQ, we propose a portable programming model and build a software system that enables self-configuration and execution across diverse buildings. The configuration of each building is captured in a unified data model - in this paper, we work with the Brick ontology without loss of generality. SeeQ focuses on the distinction between the application logic and the configuration of an application against building-specific data inputs and systems. We test the proposed approach by configuring and deploying a diverse range of applications across five heterogeneous real-world buildings. The analysis shows the potential of SeeQ to significantly reduce the efforts associated with the delivery of building analytics.

analytics↗
DOE OSTI2020

ASCENDS: Advanced data SCiENce toolkit for Non-Data Scientists

Recently, advances in machine learning and artificial intelligence have been playing more and more critical roles in a wide range of areas. For the last several years, industries have shown that how learning from data, identifying patterns and making decisions with minimal human intervention can be extremely useful to their business (e.g., image classification, recommending a product to a customer, finding friends in a social network, predicting customers actions, etc.). These success stories have been motivating scientists who study physics, chemistry, materials, medicine, and many other subjects, to explore a new pathway of utilizing machine learning techniques like regression and classification for their scientific activities. However, most existing machine learning tools, systems, and methodologies have been developed for programming experts but not for scientists (or any users) who have no or little knowledge of programming. ASCENDS is a toolkit that is developed to assist scientists (or any persons) who want to use their data for machine learning tasks, more specifically, correlation analysis, regression, and classification. ASCENDS does not require programming skills. Instead, it provides a set of simple but powerful CLI (Command Line Interface) and GUI (Graphic User Interface) tools for non-data scientists to be able to intuitively perform advanced data analysis and machine learning techniques. ASCENDS has been implemented by wrapping around opensource software including Keras, TensorFlow, and scikit-learn.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

ambrosia: An R package for calculating and analyzing food demand that is responsive to changing incomes and prices

The ambrosia R package was developed to calculate food demand for staples and non-staple commodities that is responsive to changing levels of incomes and prices. ambrosia implements the framework to quantify food demand as established by Edmonds et al. (Edmonds et al. 2017) and allows the user to explore and estimate different variables related to the food demand system. Currently ambrosia provides 3 main functions: (1) calculation of food demand for any given set of parameters including income levels and prices (2) estimation of parameters within a given a dataset. Note: ambrosia is used to calculate parameters for the food demand model implemented in the Global Change Analysis Model(GCAM) (3) exploration and preparation of raw data before starting a parameter estimation

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

TBAA20: Task-Based Algorithms and Applications

The new challenges posed by Exascale system architectures have resulted in difficulty achieving a desired scalability using traditional distributed ­memory runtimes. Task­-based programming models show promise in addressing these challenges, providing application developers with a productive and performant approach to programming on next generation systems. Empirical studies show that task-based models can overcome load ­balancing issues that are inherent to traditional distributed ­memory runtimes, and that task-­based runtimes perform comparably to those systems when balanced. This panel is designed to explore the advantages of task-­based programming models on modern and future HPC systems from an industry, university, and national lab perspective. It aims at gathering application experts and proponents of these models to present concrete and practical examples of using task­-based runtimes to overcome the challenges posed by Exascale system architectures. This report describes the objectives, activities, and outcomes of the panel TBAA: Task­-Based Algorithms and Applications which was held at the International Conference for High Performance Computing, Networking, Storage, and Analysis (SC 20) on November 18, 2020.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

SAM Code Enhancement, Validation, and Reference Model Development for Fluoride-salt-cooled High-temperature Reactors

The System Analysis Module (SAM) is under development at Argonne National Laboratory as a modern system-level modeling and simulation tool for advanced non-light water reactor safety analyses. It utilizes the object-oriented application framework MOOSE to leverage the modern software environment and advanced numerical methods. The capabilities of SAM are being extended to enable the transient modeling, analysis, and design of various advanced nuclear reactor systems. This report summarizes recent progress under DOE-NE’s Nuclear Energy Advanced Modeling and Simulation program in SAM code development, demonstration, and validation to support transient safety analysis of Fluoride-salt-cooled High-temperature Reactors.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

DECOVALEX-2023 Task F Specification (Rev. 9)

This report is the revised (Revision 9) Task F specification for DECOVALEX-2023. Task F is a comparison of the models and methods used in deep geologic repository performance assessment. The task proposes to develop a reference case for a mined repository in a fractured crystalline host rock (Task F1) and a reference case for a mined repository in a salt formation (Task F2). Teams may choose to participate in the comparison for either or both reference cases. For each reference case, a common set of conceptual models and parameters describing features, events, and processes that impact performance will be given, and teams will be responsible for determining how best to implement and couple the models. The comparison will be conducted in stages, beginning with a comparison of key outputs of individual process models, followed by a comparison of a single deterministic simulation of the full reference case, and moving on to uncertainty propagation and uncertainty and sensitivity analysis. This report provides background information, a summary of the proposed reference cases, and a staged plan for the analysis.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2024

Attack Surface of Wind Energy Technologies in the United States

Low cost, reliable electrical energy production from wind relies upon automation and control systems, arguably more so than traditional thermal generation. These same systems, however, can serve as the target of adversaries’ cyber-attacks. Idaho National Laboratory (INL), at the request of the Department of Energy’s (DOE’s) Office of Cybersecurity, Energy Security, and Emergency Response (CESER) and Energy Efficiency and Renewable Energy’s (EERE’s) Wind Energy Technologies Office (WETO), evaluated a generalized wind plant architecture to understand the classes of potential threat actors and the vectors that could enable a cyber-attack. This evaluation explores the attack surface of a representative wind plant, identifying potential methods and vectors that an adversary could leverage to conduct a cyber-attack. Included in this assessment are some recommended mitigations and approaches. Each recommendation requires a full security evaluation, cost/benefit analysis, and risk analysis by each owner and operator.

17 WIND ENERGY↗