Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithm”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Variational approaches to constructing the many-body nuclear ground state for quantum computing

Here, we explore the preparation of specific nuclear states on gate-based quantum hardware using variational algorithms. Large-scale classical diagonalizations of the nuclear shell model have reached sizes of 10 9 –10 10 basis states but are still severely limited by computational resources. Quantum computing can, in principle, solve such systems exactly with exponentially fewer resources than classical computing. Exact solutions for large systems require many qubits and large gate depth, but variational approaches can effectively limit the required gate depth. We use the unitary coupled cluster approach to construct approximations of the ground-state vectors, later to be used in dynamics calculations. The testing ground is the phenomenological shell model space, which allows us to mimic the complexity of the internucleon interactions. We find that often one needs to minimize over a large number of parameters, using a large number of entanglements that makes the application on existing hardware challenging. Prospects for rapid improvements with more capable hardware are, however, very encouraging.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

A Deep Generative Model for Non-Intrusive Identification of EV Charging Profiles

The proliferation of electric vehicles (EVs) brings environmental benefits and technical challenges to power grids. An identification algorithm which can accurately extract individual EV charging profiles out of widely available smart meter measurements has attracted great interests. This paper proposes a non-intrusive identification framework for EV charging profile extraction, which is driven by deep generative models (DGM). First, the proposed DGM is designed as a representation layer embedded into the Markov process and used to model the joint probability distribution of available time-series data. A novel contribution is to approximate posterior distributions by neural networks whose parameters are obtained by variational inference and supervised learning. Second, the EV charging status is inferred from the DGM via dynamic programming. Lastly, the desired EV charging profile can be reconstructed by the rated power of EV models and inferred status. Compared with the benchmark Hidden Markov Models, the proposed framework can better handle noise in data with less computational complexity and better overall accuracy performances with smaller recall. The proposed framework is validated by numerical experiments on the Pecan Street dataset.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2020

Solving Eco-Driving Problems Using Indirect Collocation Method and Smooth Representation

Here, we discuss the eco-driving problem, considering both electric and conventional powertrains, and presents a pathway to solving it numerically using an indirect collocation method. Despite the low-order system dynamics, the piecewise fuel/efficiency map, gear shifting, and real-world traffic/road situations bring system discontinuities/switchings and pure state constraints into the problem formulation, which make the problem highly nonlinear and nontrivial to solve. This letter introduces smooth approximations to convert the original problem to an unconstrained (and penalized) smooth boundary-value problem. This approach eliminates the discussion of the switching structure and leads to a lightweight Newton-method-based solution procedure.

42 ENGINEERING↗
DOE OSTI2021

Evaluation of cooling setpoint setback savings in commercial buildings using electricity and exterior temperature time series data

Commercial buildings account for a significant amount of total energy produced in the US, and the Heating Ventilation and Cooling (HVAC) systems are one of the most significant components of their overall consumption. In this study, we proposed a new data-driven approach to evaluate HVAC cooling systems in commercial buildings and identify savings opportunities. The focus is an investigation of the impact of thermostat setpoint setback but using only whole building, electricity data taken at 15-min intervals for the analysis. We conducted a comparative study of setpoint setback characteristics on 432 commercial buildings with 5 building usage types across the United States. To accomplish this, both piecewise and Random Forest regression algorithms were employed using electricity and exterior temperature datasets to identify operational characteristics and the effective setpoints in the building to determine the corresponding savings opportunities. Both occupied and unoccupied time periods were studied across cooling degree days (CDD), when air conditioning is typically operational. Here the results show that in commercial buildings, on average, cooling systems account for 9.5% of total consumption. When a one degree setback during the cooling season is applied, an average of approximately 1.1% of annual consumption is achieved; retail and office buildings demonstrate the highest potential for savings. Additionally, we identified that the number of cooling degree days and base to peak ratio (BPR) are the most important variables for predicting the magnitude of the consumption of cooling systems.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

A fast particle-mesh simulation of non-linear cosmological structure formation with massive neutrinos

Quasi-N-body simulations, such as FastPM, provide a fast way to simulate cosmological structure formation, but have yet to adequately include the effects of massive neutrinos. In this work, we present a method to include neutrino particles in FastPM, enabling computation of the CDM and total matter power spectra to percent-level accuracy in the non-linear regime. The CDM-neutrino cross-power can also be computed at a sufficient accuracy to constrain cosmological observables. To avoid the shot noise that typically plagues neutrino particle simulations, we employ a quasi-random algorithm to sample the relevant Fermi-Dirac distribution when setting the initial neutrino thermal velocities. We additionally develop an effective distribution function to describe a set of non-degenerate neutrinos as a single particle to speed up non-degenerate simulations. The simulation is accurate for the full range of physical interest, M ν ≲ 0.6eV, and applicable to redshifts z ≲ 2. Such accuracy can be achieved by initializing particles with the two-fluid approximation transfer functions (using the REPS package). Convergence can be reached in ~ 25 steps, with a starting redshift of z=99. Probing progressively smaller scales only requires an increase in the number of CDM particles being simulated, while the number of neutrino particles can remain fixed at a value less than or similar to the number of CDM particles. In turn, the percentage increase in runtime-per-step due to neutrino particles is between ~ 5-20% for runs with 1024 3 CDM particles, and decreases as the number of CDM particles is increased. The code has been made publicly available, providing an invaluable resource to produce fast predictions for cosmological surveys and studying reconstruction.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

The evolution of HCO + in molecular clouds using a novel chemical post-processing algorithm

Modelling the chemistry of molecular clouds is critical to accurately simulating their evolution. To reduce computational cost, 3D simulations generally restrict their chemistry to species with strong heating and cooling effects. Time-dependent information about the evolution of other species is therefore often neglected. We address this gap by post-processing tracer particles in the SILCC-Zoom molecular cloud simulations. Using a chemical network of 39 species and 301 reactions (including freeze-out of CO and H 2 O) and a novel algorithm to reconstruct a density grid from sparse tracer particle data, we produce time-dependent density distributions for various species. We focus upon the evolution of HCO + , which is a critical formation reactant of CO but is not typically modelled on the fly. We find that ∼ 90 per cent of the HCO + content of the cold molecular gas forms in situ around n HCO + ∼ 10 3 –10 4 cm −3 , over a time-scale of approximately 1 Myr. The remaining ∼ 10 per cent forms at high extinction sites, with minimal turbulent mixing out into the less dense gas. We further show that the dominant HCO + formation pathway is dependent on the visual extinction, with the reaction H 3 + + CO contributing 90 per cent of the total HCO + production above A V, 3D = 3. We produce the very first maps of the HCO + column density, N(HCO + ), and show that it reaches values as high as 10 15 cm −2 . We find that 50 per cent of the HCO + mass is located within AV ∼ 10–30 in a density range of 10 3.5 –10 4.5 cm −3 . Our maps of N(HCO + ) are shown to be in good agreement with recent observations of the W49A star-forming region.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Deep Hierarchical Super Resolution for Scientific Data

We present a novel technique for hierarchical super resolution (SR) with neural networks (NNs), which upscales volumetric data represented with an octree data structure to a high-resolution uniform gridwith minimal seam artifacts on octree node boundaries. Our method uses existing state-of-the-art SR models and adds flexibility to upscale input data with varying levels of detail across the domain, instead of only uniform grid data that are supported in previous approaches.The key is to use a hierarchy of SR NNs, each trained to perform 2x SR between two levels of detail, with a hierarchical SR algorithm that minimizes seam artifacts by starting from the coarsest level of detail and working up.We show that our hierarchical approach outperforms baseline interpolation and hierarchical upscaling methods, and demonstrate the usefulness of our proposed approach across three use cases including data reduction using hierarchical downsampling+SR instead of uniform downsampling+SR, computation savings for hierarchical finite-time Lyapunov exponent field calculation, and super-resolving low-resolution simulation results for a high-resolution approximation visualization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Fast and Invertible Simplicial Approximation of Magnetic‐Following Interpolation for Visualizing Fusion Plasma Simulation Data

We introduce a fast and invertible approximation for fusion plasma simulation data represented as 2D planar meshes with connectivities approximating magnetic field lines along the toroidal dimension in deformed 3D toroidal spaces. Scientific variables (e.g., density and temperature) in these fusion data are interpolated following a complex magnetic-field-line-following scheme in the toroidal space represented by a cylindrical coordinate system. This deformation in the 3D space poses challenges for root-finding and interpolation. To this end, we propose a novel paradigm for visualizing and analyzing such data based on a newly developed algorithm for constructing a 3D simplicial mesh within the deformed 3D space. Our algorithm generates a tetrahedral mesh that connects the 2D meshes using tetrahedra while adhering to the constraints on node connectivities imposed by the magnetic field-line scheme. Specifically, we first divide the space into smaller partitions to reduce complexity based on the input geometries and constraints on connectivities. Then, we independently search for a feasible tetrahedralization of each partition, considering nonconvexity. We demonstrate our method with two X-Point Gyrokinetic Code (XGC) simulation datasets on the International Thermonuclear Experimental Reactor (ITER) and Wendelstein 7-X (W7-X), and use an ocean simulation dataset to substantiate broader applicability of our method. An open source implementation of our algorithm is available at https://github.com/rcrcarissa/DeformedSpaceTet.

Ren, Congrong [The Ohio State Univ., Columbus, OH ↗
DOE OSTI2022

Estimating Energy Market Schedules Using Historical Price Data: Preprint

The global climate crisis is expected to reshape the energy generation landscape in the coming decades. Increasing integration of non-dispatchable renewable energy resources into energy infrastructures and markets increases uncertainty and creates new opportunities for flexible energy systems. To conduct proper economic evaluation of flexible energy systems, such as integrated energy systems (IES), advancements in modelling of market interactions, such as bidding, is crucial. This work presents a shortcut algorithm which uses two mixed integer linear programs to compute dispatch schedules (e.g., hourly power production targets) that are constrained by the resource's bid information and characteristics (e.g., minimum up and down times) based on historical locational marginal price (LMP) data. This is orders of magnitude less data than required for a market clearing calculation with a full production cost model (PCM). We find the shortcut simulator recapitulates generator dispatch signals for the Prescient PCM with approximately 4% error for the RTS-GMLC test system.

electricity generation↗
DOE OSTI2022

Need for advanced research reactors for the next-generation reactor physics, analysis tools, and technology

Full text of publication follows. There is an urgent need for design and deployment of advanced research and test reactors in support of design, licensing and operation of advanced power reactors and education of next generation nuclear workforce. Existing research reactors mostly were designed and constructed decades ago with the main objectives of training operators, performing reactor physics experiments, and educating nuclear engineers and scientists. There are already gaps and significant concern about future capabilities for the existing research reactor facilities to address modern instrumentation and/or flexible environments for: performing reactor physics studies for advanced designs which have significantly different core materials forms and compositions, reactor shapes and size; validation of advanced high-fidelity software; development of machine learning algorithms for enhancement of human-machine collaboration in support of reactor monitoring, operation and safeguards; and, effective education of the next-generation workforce. The authors will focus on the need for advanced research reactors to improve and validate fast and accurate simulation tools for high-fidelity modeling and analysis of nuclear reactors in support of their design, optimization, licensing, operation, and monitoring. In the past, simulation tools were limited to relatively coarse models using approximate methodologies that benefited from two main factors: i) allowance for large margins and tolerances; ii) ability to construct prototype (e.g., zero power) reactors for adjustment of approximate methodologies. The next generation reactors have to be designed mainly by using novel high-fidelity computational tools that are accurate and fast, and therefore can be used for parametric studies and uncertainty quantification. To sufficiently demonstrate the accuracy of these tools, advanced research reactors are needed. The authors argue the need for new computational paradigms such as the MRT (Multistage, Response- function Transport) methodology which has resulted in the development of the novel high-fidelity RAPID (Real-time Analysis for Particle-transport and In-situ Detection) code system. Such code systems have to be robust in modeling any complex system, and should be fast and accurate, henceforth their uncertainties can be quantified at reasonable costs. Again, advanced research reactors are needed for the validation of the fidelity and accuracy of new computational tools. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2024

VAN-DAMME: GPU-accelerated and symmetry-assisted quantum optimal control of multi-qubit systems

We present an open-source software package, VAN-DAMME (Versatile Approaches to Numerically Design, Accelerate, and Manipulate Magnetic Excitations), for massively-parallelized quantum optimal control (QOC) calculations of multi-qubit systems. To enable large QOC calculations, the VAN-DAMME software package utilizes symmetry-based techniques with custom GPU-enhanced algorithms. This combined approach allows for the simultaneous computation of hundreds of matrix exponential propagators that efficiently leverage the intra-GPU parallelism found in high-performance GPUs. In addition, to maximize the computational efficiency of the VAN-DAMME code, we carried out several extensive tests on data layout, computational complexity, memory requirements, and performance. These extensive analyses allowed us to develop computationally efficient approaches for evaluating complex-valued matrix exponential propagators based on Padé approximants. To assess the computational performance of our GPU-accelerated VAN-DAMME code, we carried out QOC calculations of systems containing 10 - 15 qubits, which showed that our GPU implementation is 18.4× faster than the corresponding CPU implementation. Our GPU-accelerated enhancements allow efficient calculations of multi-qubit systems, which can be used for the efficient implementation of QOC applications across multiple domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Predicting wind-driven spatial deposition through simulated color images using deep autoencoders

Abstract For centuries, scientists have observed nature to understand the laws that govern the physical world. The traditional process of turning observations into physical understanding is slow. Imperfect models are constructed and tested to explain relationships in data. Powerful new algorithms can enable computers to learn physics by observing images and videos. Inspired by this idea, instead of training machine learning models using physical quantities, we used images, that is, pixel information. For this work, and as a proof of concept, the physics of interest are wind-driven spatial patterns. These phenomena include features in Aeolian dunes and volcanic ash deposition, wildfire smoke, and air pollution plumes. We use computer model simulations of spatial deposition patterns to approximate images from a hypothetical imaging device whose outputs are red, green, and blue (RGB) color images with channel values ranging from 0 to 255. In this paper, we explore deep convolutional neural network-based autoencoders to exploit relationships in wind-driven spatial patterns, which commonly occur in geosciences, and reduce their dimensionality. Reducing the data dimension size with an encoder enables training deep, fully connected neural network models linking geographic and meteorological scalar input quantities to the encoded space. Once this is achieved, full spatial patterns are reconstructed using the decoder. We demonstrate this approach on images of spatial deposition from a pollution source, where the encoder compresses the dimensionality to 0.02% of the original size, and the full predictive model performance on test data achieves a normalized root mean squared error of 8%, a figure of merit in space of 94% and a precision-recall area under the curve of 0.93.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Fast calculation of diffraction patterns from an ensemble of aligned molecules

We report an algorithm to calculate electron diffraction patterns for molecules with anisotropic angular distribution, which is significantly faster than existing methods. The algorithm uses a transform to convert the molecular orientation distribution, which is a function of three Euler angles, to the atom-pair distribution functions which depend on the polar and azimuthal angles. The diffraction signal can then be calculated from the atom-pair distributions. We demonstrate the computation method numerically by calculating electron diffraction patterns for a symmetric top molecule (trifluoroiodomethane) and an asymmetric top molecule (formaldehyde) and show that it reduces the calculation time by approximately two orders of magnitude compared to the standard brute-force method. Here, the method can also be applied to the calculation of x-ray diffraction patterns.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2023

Novel method for the identification of the production flavor of neutral charmed mesons

We propose a new algorithm for the identification of the production flavor of neutral D mesons in the Belle II experiment. The algorithm exploits the correlation between the flavor of a reconstructed neutral D meson (signal D meson) and the electric charges of particles reconstructed in the rest of the e + e – →$c\bar{c}$ event. These include those originating from the decay of the other charm hadron produced in the event, as well as those possibly produced in association with the signal D meson. We develop the algorithm using simulation and calibrate it in data using decay modes that identify the flavor of the decaying neutral D meson. We use a data sample of e + e – collisions, corresponding to 362 fb –1 of integrated luminosity, collected by Belle II at center-of-mass energies near the Υ(4S) mass. The effective tagging efficiency in data is (47.91±0.07 (stat) ±0.51 (syst)) %, independent of the neutral-D-meson decay mode. This charm flavor tagger will approximately double the effective sample size of many CP-violation and charm-mixing measurements that so far have exclusively relied on neutral D mesons originating from D* ± decays. While developed for Belle II, the basic principles underlying the charm flavor tagger can be used in other experiments, including those at hadron colliders.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Surface Merging Technique to Design GA-Optimized Heat Sinks

High-power density inverters require efficient and small heat dissipation systems. For liquid cooling systems, an effective heat sink design is important to enable higher heat transfer and keep the pressure drop within reasonable limits. A heat sink geometry generated from an extruded, 1D fast Fourier transform can achieve more even temperature distribution and improved heat transfer than a conventional heat sink. Building on this concept, this paper proposes a new heat sink geometry creation algorithm. Instead of one plane profile being extruded, multiple plane profiles, each created from the fast Fourier transform method, are subsequently merged by smooth surfaces along the flow direction of the heat sink. Thus, a 3D heat sink geometry is created that enables 3D coolant flow and efficient heat transfer. The volume of this design was reduced by 50% compared with pin fin heat sinks. Compared with extruded 1D fast Fourier transform heat sinks, the proposed design showed an approximately 5% device temperature reduction and a 20% pressure drop reduction.

Barua, Himel↗
DOE OSTI2024

Benchmarking Optimizers for Qumode State Preparation with Variational Quantum Algorithms

Quantum state preparation involves preparing a target state from an initial system, a process integral to applications such as quantum machine learning and solving systems of linear equations. Recently, there has been a growing interest in qumodes due to advancements in the field and their potential applications. However there is a notable gap in the literature specifically addressing this area. This paper aims to bridge this gap by providing performance benchmarks of various optimizers used in state preparation with Variational Quantum Algorithms. We conducted extensive testing across multiple scenarios, including different target states, both ideal and sampling simulations, and varying numbers of basis gate layers. Our evaluations offer insights into the complexity of learning each type of target state and demonstrate that some optimizers perform better than others in this context. Notably, the Powell optimizer was found to be exceptionally robust against sampling errors, making it a preferred choice in scenarios prone to such inaccuracies. Additionally, the Simultaneous Perturbation Stochastic Approximation optimizer was distinguished for its efficiency and ability to handle increased parameter dimensionality effectively.

Kan, Shuwen [Fordham University]↗
DOE OSTI2020

Algorithms for Efficient Reproducible Floating Point Summation

We define “reproducibility” as getting bitwise identical results from multiple runs of the same program, perhaps with different hardware resources or other changes that should not affect the answer. Many users depend on reproducibility for debugging or correctness. However, dynamic scheduling of parallel computing resources, combined with nonassociative floating point addition, makes reproducibility challenging even for summation, or operations like the BLAS. We describe a “reproducible accumulator” data structure (the “binned number”) and associated algorithms to reproducibly sum binary floating point numbers, independent of summation order. We use a subset of the IEEE Floating Point Standard 754-2008 and bitwise operations on the standard representations in memory. Our approach requires only one read-only pass over the data, and one reduction in parallel, using a 6-word reproducible accumulator (more words can be used for higher accuracy), enabling standard tiling optimization techniques. Summing n words with a 6-word reproducible accumulator requires approximately 9 n floating point operations (arithmetic, comparison, and absolute value) and approximately 3 n bitwise operations. The final error bound with a 6-word reproducible accumulator and our default settings can be up to 2 29 times smaller than the error bound for conventional (recursive) summation on ill-conditioned double-precision inputs.

Computer Science↗
DOE OSTI2020

Weighted greedy-optimal design of computer experiments for kernel-based and Gaussian process model emulation and calibration

This article is concerned with the approximation of high-dimensional functions by kernel-based methods. Motivated by uncertainty quantification, which often necessitates the construction of approximations that are accurate with respect to a probability density function of random variables, we aim at minimizing the approximation error with respect to a weighted $L^p$-norm. We present a greedy procedure for designing computer experiments based upon a weighted modification of the pivoted Cholesky factorization. The method successively generates nested samples with the goal of minimizing error in regions of high probability. Numerical experiments validate that this new importance sampling strategy is superior to other sampling approaches, especially when used with non-product probability density functions. We also show how to use the proposed algorithm to efficiently generate surrogates for inferring unknown model parameters from data.

97 MATHEMATICS AND COMPUTING↗