Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematics computing”

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,063 records · Page 59
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Sequential linear integer programming for integer optimal control with total variation regularization

We propose a trust-region method that solves a sequence of linear integer programs to tackle integer optimal control problems regularized with a total variation penalty. The total variation penalty implies that the considered integer control problems admit minimizers. We introduce a local optimality concept for the problem, which arises from the infinite-dimensional perspective. In the case of a one-dimensional domain of the control function, we prove convergence of the iterates produced by our algorithm to points that satisfy first-order stationarity conditions for local optimality. We demonstrate the theoretical findings on a computational example.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Benchmarking Information Scrambling

Information scrambling refers to the rapid spreading of initially localized information over an entire system, via the generation of global entanglement. This effect is usually detected by measuring a temporal decay of the out-of-time order correlators. However, in experiments, decays of these correlators suffer from fake positive signals from various sources, e.g., decoherence due to inevitable couplings to the environment, or errors that cause mismatches between the purported forward and backward evolutions. Here, in this Letter, we provide a simple and robust approach to single out the effect of genuine scrambling. This allows us to benchmark the scrambling process by quantifying the degree of the scrambling from the noisy backgrounds. We also demonstrate our protocol with simulations on IBM cloud-based quantum computers.

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 OSTI2023

Adaptive Time Step Control for Multirate Infinitesimal Methods

Multirate methods have been used for decades to temporally evolve initial-value problems in which different components evolve on distinct time scales, and thus use of different step sizes for these components can result in increased computational efficiency. Generally, such methods select these different step sizes based on experimentation or stability considerations. For problems that evolve on a single time scale, adaptivity approaches that strive to control local temporal error are widely used to achieve numerical results of a desired accuracy with minimal computational effort, while alleviating the need for manual experimentation with different time step sizes. However, there is a notable gap in the publication record on the development of adaptive time step controllers for multirate methods. In this paper, we extend the single-rate controller work of Gustafsson [ACM Trans. Math. Software, 20 (1994), pp. 496-517] to the multirate method setting. Specifically, we develop controllers based on polynomial approximations to the principal error functions for both the "fast" and "slow" time scales within multirate infinitesimal (MRI) methods. We additionally investigate a variety of approaches for estimating the errors arising from each time scale within MRI methods. We then numerically evaluate the proposed multirate controllers and error estimation strategies on a range of multirate test problems, comparing their performance against an estimated optimal performance. Through this work, we combine the most performant of these approaches to arrive at a set of multirate adaptive time step controllers that robustly achieve desired solution accuracy with minimal computational effort.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Multiphysics coupling in the Exascale computing project

Multiphysics coupling presents a significant challenge in terms of both computational accuracy and performance. Achieving high performance on coupled simulations can be particularly challenging in a high-performance computing context. The US Department of Energy Exascale Computing Project has the mission to prepare mission-relevant applications for the delivery of the exascale computers starting in 2023. Many of these applications require multiphysics coupling, and the implementations must be performant on exascale hardware. In this special issue we feature six articles performing advanced multiphysics coupling that span the computational science domains in the Exascale Computing Project.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Side Channel Considerations for AES Intermediate Rounds

We illustrate a theoretical side-channel analysis on the intermediate rounds of AES, using only the Hamming weights of the bytes registered after the S-box operation. Input and output state values are unknown. Simulations and a blind test were used to show the feasibility of the analysis under ideal conditions. General applicability of the idea and possible extensions are discussed, as well as limiting assumptions. Some implementation approaches are described in Appendix A, in the case of constrained computing capabilities (desktop or laptop).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Data Reduction for Science: Brochure from the Advanced Scientific Computing Research Workshop

Data reduction for science holds promise for addressing the challenges of moving, storing, and processing massive data sets produced by the scientific community. Pursuing the PRDs outlined here will enable advances in data streaming, fast feedback and/or autonomous control of experiments, and faster time to scientific insight. These advances will result in a significant improvement in the ability to transport, store, process and interpret experimental, observational, and computational data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Fast Emulation of Expensive Simulations using Approximate Gaussian Processes [Slides]

Nuclear Computational Low-Energy Initiative (NUCLEI) collaboration uses Density Functional Theory (DFT) simulations to predict the structure and binding energies of nuclei over a wide range of proton (Z) and neutron (N) numbers. The DFT simulations utilize a particular parameterization of a Skyrme energy density functional called UNEDF1 which depends on 12 free parameters that must be fit to data (M Kortelainen et al 2014). Fitting involves comparing (e.g.) predicted binding energies of nuclei to experimentally measured values. We use only binding energies as observables, but DFT with UNEDF1 will predict structure (shape) observables as well. In this work, assessing the capability of approximate GP emulators to balance emulator accuracy with computational speed to facilitate improved UNEDF1 calibration. Sparse GPs are straightforward to train and accurate. Calibration is not straightforward with MCMC (using MH or HMC/NUTS). We produced reusable software for continuing and building on this work as well as accessing and using Darwin cluster compute resources

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Space-Time Reduced-Order Modeling for Uncertainty Quantification

This work focuses on the space-time reduced-order modeling (ROM) method for solving large-scale uncertainty quantification (UQ) problems with multiple random coefficients. In contrast with the traditional space ROM approach, which performs dimension reduction in the spatial dimension, the space-time ROM approach performs dimension reduction on both the spatial and temporal domains, and thus enables accurate approximate solutions at a low cost. We incorporate the space-time ROM strategy with various classical stochastic UQ propagation methods such as stochastic Galerkin and Monte Carlo. Numerical results demonstrate that our methodology has significant computational advantages compared to state-of-the-art ROM approaches. By testing the approximation errors, we show that there is no obvious loss of simulation accuracy for space-time ROM given its high computational efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm

Consider a scalar field f : M → R, where M is a triangulated simplicial mesh in R d . A level set, or contour, at value v is a connected component of f –1 (v). As v is changed, these contours change topology, merge into each other, or split. Contour trees are concise representations of f that track this contour behavior. The vertices of these trees are the critical points of f, where the gradient is zero. The edges represent changes in the topology of contours. It is a fundamental data structure in data analysis and visualization, and there is significant previous work (both theoretical and practical) on algorithms for constructing contour trees. Suppose M has n vertices, N facets, and t critical points. A classic result of Carr, Snoeyink, and Axen (2000) gives an algorithm that takes O(n log n+Nα(N)) time (where α(·) is the inverse Ackermann function). A further improvement to O(t log t + N) time was given by Chiang et al. All these algorithms involve a global sort of the critical points, a significant computational bottleneck. Unfortunately, lower bounds of Ω(t log t) also exist. We present the first algorithm that can avoid the global sort and has a refined time complexity that depends on the contour tree structure. Intuitively, if the tree is short and fat, we get significant improvements in running time. For a partition of the contour tree into a set of descending paths, P, our algorithm runs in O($\Sigma$ pϵP |p| log |p| + tα(t) + N). This is at most O(t log D + N), where D is the diameter of the contour tree. Moreover, it is O(tα(t) + N) for balanced trees, a significant improvement over the previous complexity. Our algorithm requires numerous ideas: partitioning the contour tree into join and split trees, a local growing procedure to iteratively build contour trees, and the use of heavy path decompositions for the time complexity analysis. There is a crucial use of a family of binomial heaps to maintain priorities, ensuring that any comparison made is between comparable nodes of the contour tree. We also prove lower bounds showing that the $\Sigma$ pϵP |p| log |p| complexity is inherent to computing contour trees.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

The woman behind the curious invention of modern software: Klára Dán von Neumann’s handwritten letters confirm her legacy

The year 1945 marked not only the birth of the atomic age, but also the birth of modern computer programming. The first fully electronic computing machine, the ENIAC (Electronic Numerical Integrator And Computer), came online in December 1945. But programming the ENIAC was an excruciatingly difficult task. Klára Dán von Neumann, who joined the Laboratory at Los Alamos after WWII, helped to revolutionize the process, creating the very first modern computer programs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Kinetic Plasma Simulation in the MOOSE Framework: Verification of Electrostatic Particle In Cell Capabilities

In magnetic confinement nuclear fusion reactors, the interaction between the plasma edge and plasma facing components is extremely important. At the plasma edge, a kinetic representation such as particle-in-cell (rather than a fluid representation) is required to accurately capture the plasma behavior. General purpose particle-in-cell plasma simulation capabilities have been developed in the Multiphysics Object-Oriented Simulation Environment (MOOSE) framework. This new capability is a part of the development of a new MOOSE-based framework for modeling plasma facing components, the Fusion ENergy Integrated multiphys-X (FENIX) framework. In this work, the verification of foundational particle-in-cell capabilities in FENIX is presented. This new plasma simulation capability has three main components: moving particles in discrete steps on the finite element mesh, mapping charge density from the particle's location to the finite element mesh, and solving for the electrostatic potential based on the charge density mapped from particles to the mesh. In this paper, simple verification problems demonstrating each of these new capabilities are presented, and future work includes electromagnetic capabilities and Monte Carlo collisions with neutral gas particles.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Hybrid RANS-LES of the Atmospheric Boundary Layer for Wind Farm Simulations: Preprint

Wind farm simulations often do not accurately represent wake-atmospheric boundary layer (ABL) interactions, blade boundary layer (BL) dynamics, and turbine-turbine interactions. In this work, we use Active Model Split (AMS), a new hybrid Reynolds-Averaged Navier Stokes (RANS)-large eddy simulation (LES) model, which is well suited to capture these effects because the model can (i) accurately simulate the ABL with the Coriolis effect, (ii) is accurate in adverse pressure gradients such as those near wind turbine blades, and (iii) has sufficiently low computational cost to simulate multiple turbines while resolving the blade BL. For simplicity and consistency we develop AMS to be used throughout the domain rather than in a zonal method. We implement our work in the massively parallel flow solver, Nalu-Wind, so that our model can access the compute resources needed for blade-resolved simulations of multiple wind turbines. To accomplish these aims, we modify the baseline AMS by changing the RANS contribution to SST k - omega with a length scale limiter, adding the Coriolis effect, and developing an appropriate wall treatment. We show that AMS of the ABL with the Coriolis effect matches LES reference results better than those obtained with RANS. We describe our plans to add buoyancy effects and wind turbines to our AMS simulations.

atmospheric boundary layer↗
DOE OSTI2024

Infinite quantum signal processing

Quantum signal processing (QSP) represents a real scalar polynomial of degree d using a product of unitary matrices of size 2 × 2 , parameterized by ( d + 1 ) real numbers called the phase factors. This innovative representation of polynomials has a wide range of applications in quantum computation. When the polynomial of interest is obtained by truncating an infinite polynomial series, a natural question is whether the phase factors have a well defined limit as the degree d → ∞ . While the phase factors are generally not unique, we find that there exists a consistent choice of parameterization so that the limit is well defined in the ℓ 1 space. This generalization of QSP, called the infinite quantum signal processing, can be used to represent a large class of non-polynomial functions. Our analysis reveals a surprising connection between the regularity of the target function and the decay properties of the phase factors. Our analysis also inspires a very simple and efficient algorithm to approximately compute the phase factors in the ℓ 1 space. The algorithm uses only double precision arithmetic operations, and provably converges when the ℓ 1 norm of the Chebyshev coefficients of the target function is upper bounded by a constant that is independent of d . This is also the first numerically stable algorithm for finding phase factors with provable performance guarantees in the limit d → ∞ .

Dong, Yulong [Department of Mathematics, Universit↗
NASA NTRS1985

Transient Heat Transfer in Zero Gravity Environment

The objective is to provide computer codes and/or correlations for application in the design of transient heat transfer systems. The mathematical models in the computer codes are being tested by experimental data obtained in the laboratory using optical techniques. The elimination of natural convection (buoyancy) in the experimental data obtained in zero-g (KC-135) facilitates the study of thermal expansion effects which is of interest in the development and testing of the mathematical models of the transient heat transfer. Initial flight in the KC 135 (June 1983) suggested some modifications to the experimental apparatus and the data acquisition technique (high speed video will replace high speed movies for recording optical records generated during the experiments). A series of KC-135 flights with this experiment on board are scheduled for summer/fall 1984. The acquisition of the aforementioned data using interferometry and beam deflection optical techniques is anticipated. The measurements provide time dependent temperature fields above a horizontal heater surface submerged in a static fluid (Freon 13). The heater surface is electrically heated for a time interval approximately 0.100 sec. during which the data are optically recorded.

Giarratano, P. G.↗
DOE OSTI2021

Machine Learning Reduced Order Model for Cost and Emission Assessment of a Pyrolysis System

Biomass pyrolysis is a promising approach for producing economic and environmentally-friendly fuels and bioproducts. Biomass pyrolysis experiments show that feedstock properties have a significant impact on product yields and composition. Scientists are developing detailed chemical reaction mechanisms to capture the relationships between biomass composition and pyrolysis yields. These mechanisms can be computationally intensive. In this study, we investigate the use of a machine learning reduced order model (ROM) for assessing the costs and emissions of a pyrolysis biorefinery. Here, we developed a Kriging-based ROM to predict pyrolysis yields of 314 feedstock samples based on the results of a detailed chemical kinetic pyrolysis mechanism. The ROM is integrated into a chemical process model for calculating mass and energy yields in a commercial-scale (2000 tonne/day) biorefinery. The ROM estimated biofuel yields of 65 to 130 gallons per ton of dry biomass. This results in biofuel minimum fuel-selling prices of $2.62 to $5.43 per gallon and emissions of -13.62 to 145 kg of CO 2 per MJ. The ROM achieved an average mean square error of 1.8e-20 and a mean absolute error of 0.53%. These results suggest that ROMs can facilitate rapid feedstock screening for biorefinery systems.

09 BIOMASS FUELS↗
DOE OSTI2024

2D Dilaton Gravity and the Weil–Petersson Volumes with Conical Defects

We derive the Weil-Petersson measure on the moduli space of hyperbolic surfaces with defects of arbitrary opening angles and use this to compute its volume. We conjecture a matrix integral computing the corresponding volumes and confirm agreement in simple cases. Here, we combine this mathematical result with the equivariant localization approach to Jackiw-Teitelboim gravity to justify a proposed exact solution of pure 2d dilaton gravity for a large class of dilaton potentials.

97 MATHEMATICS AND COMPUTING↗