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,261 records · Page 70
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Mathematical methods for optimal polynomial recovery of high-dimensional systems from noisy data

The goal of our Early Career Research Project (ECRP) is to establish a modern mathematical foundation that will enable next-generation computational methods for polynomial approximation of high-dimensional systems, having a certain set of constraints, from a limited amount of noisy data. Such a foundation is critical to realizing the future potential of the DOE user facilities, and will ultimately empower scientists to address a fundamental question, namely, “how many realizations of a nonlinear manifold are required to recover the entire high-dimensional solution map, with optimal approximation guarantees and minimal computational cost?” The central theme of this effort aims to conquer this challenge by pioneering the development of extraordinarily innovative theoretical analysis and transformational non-intrusive computational methodologies. Such approaches will enable the reconstruction of the entire high-dimensional solution map, with accuracy comparable to the best approximation, while utilizing an optimal number of samples. During this reporting period we have made significant progress on four thrusts.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Polynomial Chaos Surrogate Construction for Random Fields with Parametric Uncertainty

Engineering and applied science rely on computational experiments to rigorously study physical systems. The mathematical models used to probe these systems are highly complex, and sampling-intensive studies often require prohibitively many simulations for acceptable accuracy. Surrogate models provide a means of circumventing the high computational expense of sampling such complex models. In particular, polynomial chaos expansions (PCEs) have been successfully used for uncertainty quantification studies of deterministic models where the dominant source of uncertainty is parametric. We discuss an extension to conventional PCE surrogate modeling to enable surrogate construction for stochastic computational models that have intrinsic noise in addition to parametric uncertainty. We develop a PCE surrogate on a joint space of intrinsic and parametric uncertainty, enabled by Rosenblatt transformations, which are evaluated via kernel density estimation of the associated conditional cumulative distributions. Furthermore, we extend the construction to random field data via the Karhunen–Loève expansion. We then take advantage of closed-form solutions for computing PCE Sobol indices to perform a global sensitivity analysis of the model which quantifies the intrinsic noise contribution to the overall model output variance. Additionally, the resulting joint PCE is generative in the sense that it allows generating random realizations at any input parameter setting that are statistically approximately equivalent to realizations from the underlying stochastic model. The method is demonstrated on a chemical catalysis example model and a synthetic example controlled by a parameter that enables a switch from unimodal to bimodal response distributions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A convergent genus expansion for the plateau

We conjecture a formula for the spectral form factor of a double-scaled matrix integral in the limit of large time, large density of states, and fixed temperature. The formula has a genus expansion with a nonzero radius of convergence. To understand the origin of this series, we compare to the semiclassical theory of “encounters” in periodic orbits. In Jackiw-Teitelboim (JT) gravity, encounters correspond to portions of the moduli space integral that mutually cancel (in the orientable case) but individually grow at low energies. At genus one we show how the full moduli space integral resolves the low energy region and gives a finite nonzero answer.

2D Gravity↗
DOE OSTI2021

Damage development in neutron-irradiated concrete in a test reactor: Hygro-thermal and mechanical simulations

This paper reports the development of a 3D mesoscale hygro-thermal-mechanical simulation approach to predict damage in concrete irradiated in a test reactor. This framework, developed in MOOSE, considers the effects of elevated temperature, moisture content, and high neutron fluence (energy threshold, E > 0.1 MeV) on the mortar and aggregates separately. The first-stage simulation implements hygro-thermal analysis to determine the temperature and RH inside the specimen as a function of imposed radiation energy. These are used as inputs to the second stage, which considers radiation-induced volumetric expansion (RIVE) of aggregates, and creep, shrinkage, and stress-strain response of mortar to predict the expansion, stresses, and damage in specimens made using different coarse aggregates and subjected to different irradiation times. The irradiation time-dependent damage in the mortar is expressed using an isotropic damage parameter. This multi-physics model serves as a predictive tool for damage quantification in concrete due to neutron irradiation.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Data-driven causal model discovery and personalized prediction in Alzheimer's disease

Abstract With the explosive growth of biomarker data in Alzheimer’s disease (AD) clinical trials, numerous mathematical models have been developed to characterize disease-relevant biomarker trajectories over time. While some of these models are purely empiric, others are causal, built upon various hypotheses of AD pathophysiology, a complex and incompletely understood area of research. One of the most challenging problems in computational causal modeling is using a purely data-driven approach to derive the model’s parameters and the mathematical model itself, without any prior hypothesis bias. In this paper, we develop an innovative data-driven modeling approach to build and parameterize a causal model to characterize the trajectories of AD biomarkers. This approach integrates causal model learning, population parameterization, parameter sensitivity analysis, and personalized prediction. By applying this integrated approach to a large multicenter database of AD biomarkers, the Alzheimer’s Disease Neuroimaging Initiative, several causal models for different AD stages are revealed. In addition, personalized models for each subject are calibrated and provide accurate predictions of future cognitive status.

Zheng, Haoyang (ORCID:0000000168358242)↗
DOE OSTI2020

General approaches for shear-correcting coordinate transformations in Bragg coherent diffraction imaging. Part II

X-ray Bragg coherent diffraction imaging (BCDI) has been demonstrated as a powerful 3D microscopy approach for the investigation of sub-micrometre-scale crystalline particles. The approach is based on the measurement of a series of coherent Bragg diffraction intensity patterns that are numerically inverted to retrieve an image of the spatial distribution of the relative phase and amplitude of the Bragg structure factor of the diffracting sample. This 3D information, which is collected through an angular rotation of the sample, is necessarily obtained in a non-orthogonal frame in Fourier space that must be eventually reconciled. To deal with this, the approach currently favored by practitioners (detailed in Part I) is to perform the entire inversion in conjugate non-orthogonal real- and Fourier-space frames, and to transform the 3D sample image into an orthogonal frame as a post-processing step for result analysis. In this article, which is a direct follow-up of Part I, two different transformation strategies are demonstrated, which enable the entire inversion procedure of the measured data set to be performed in an orthogonal frame. The new approaches described here build mathematical and numerical frameworks that apply to the cases of evenly and non-evenly sampled data along the direction of sample rotation ( i.e. the rocking curve). The value of these methods is that they rely on the experimental geometry, and they incorporate significantly more information about that geometry into the design of the phase-retrieval Fourier transformation than the strategy presented in Part I. Finally, two important outcomes are (1) that the resulting sample image is correctly interpreted in a shear-free frame and (2) physically realistic constraints of BCDI phase retrieval that are difficult to implement with current methods are easily incorporated. Computing scripts are also given to aid readers in the implementation of the proposed formalisms.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Improving Time Step Convergence in an Atmosphere Model With Simplified Physics: The Impacts of Closure Assumption and Process Coupling

Convergence testing is a common practice in the development of dynamical cores of atmospheric models but is not as often exercised for the parameterization of sub-grid physics. An earlier study revealed that the stratiform cloud parameterizations in several predecessors of the Energy Exascale Earth System Model (E3SM) showed strong time-step sensitivity and slower-than-expected convergence when the model's time step was systematically refined. In this work, a simplified atmosphere model is configured that consists of the spectral-element dynamical core of the E3SM atmosphere model coupled with a large-scale condensation parameterization based on commonly used assumptions. This simplified model also resembles E3SM and its predecessors in the numerical implementation of process coupling and shows poor time-step convergence in short ensemble tests. We present a formal error analysis to reveal the expected time-step convergence rate and the conditions for obtaining such convergence. Numerical experiments are conducted to investigate the root causes of convergence problems. We show that revisions in the process coupling and closure assumption help to improve convergence in short simulations using the simplified model; the same revisions applied to a full atmosphere model lead to significant changes in the simulated long-term climate. This work demonstrates that causes of convergence issues in atmospheric simulations can be understood by combining analyses from physical and mathematical perspectives. Addressing convergence issues can help to obtain a discrete model that is more consistent with the intended representation of the physical phenomena.

54 ENVIRONMENTAL SCIENCES↗
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↗