Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization algorithms”

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,657 records · Page 92
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

A Massively Parallel Implementation of the CCSD(T) Method Using the Resolution-of-the-Identity Approximation and a Hybrid Distributed/Shared Memory Parallelization Model

In this work, a parallel algorithm is described for the coupled-cluster singles and doubles method augmented with a perturbative correction for triple excitations [CCSD(T)] using the resolution-of-the-identity (RI) approximation for two-electron repulsion integrals (ERIs). The algorithm bypasses the storage of four-center ERIs by adopting an integral-direct strategy. The CCSD amplitude equations are given in a compact quasi-linear form by factorizing them in terms of amplitude-dressed three-center intermediates. A hybrid MPI/OpenMP parallelization scheme is employed, which uses the OpenMP-based shared memory model for intranode parallelization and the MPI-based distributed memory model for internode parallelization. Parallel efficiency has been optimized for all terms in the CCSD amplitude equations. Two different algorithms have been implemented for the rate-limiting terms in the CCSD amplitude equations that entail and -scaling computational costs, where N O and N V denote the number of correlated occupied and virtual orbitals, respectively. One of the algorithms assembles the four-center ERIs requiring N V 4 and N O 2 N V 2 -scaling memory costs in a distributed manner on a number of MPI ranks, while the other algorithm completely bypasses the assembling of quartic memory-scaling ERIs and thus largely reduces the memory demand. It is demonstrated that the former memory-expensive algorithm is faster on a few hundred cores, while the latter memory-economic algorithm shows a better strong scaling in the limit of a few thousand cores. The program is shown to exhibit a near-linear scaling, in particular for the compute-intensive triples correction step, on up to 8000 cores. The performance of the program is demonstrated via calculations involving molecules with 24–51 atoms and up to 1624 atomic basis functions. As the first application, the complete basis set (CBS) limit for the interaction energy of the π-stacked uracil dimer from the S66 data set has been investigated. This work reports the first calculation of the interaction energy at the CCSD(T)/aug-cc-pVQZ level without local orbital approximation. The CBS limit for the CCSD correlation contribution to the interaction energy was found to be -8.01 kcal/mol, which agrees very well with the value -7.99 kcal/mol reported by Schmitz, Hättig, and Tew [ Phys. Chem. Chem. Phys. 2014 , 16 , 22167-22178]. The CBS limit for the total interaction energy was estimated to be -9.64 kcal/mol.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Assessing VQLS for Fluid Dynamics on a Hybrid Quantum-HPC Stack

Recent advances in quantum linear solvers offer a promising direction for accelerating extreme scientific computations such as fluid dynamics. However, the deep and complex circuits required by many quantum algorithms limit their practical use on current quantum hardware. The Variational Quantum Linear Solver (VQLS) presents a viable alternative for near-term quantum devices (NISQ), and initial efforts have explored its application to select fluid dynamics problems. In this work, we evaluate the use of VQLS for canonical fluid dynamics problems, aiming to identify pathways for generalizing its implementation across a broader class of systems. We analyze the impact of various circuit ansatz and classical optimizers on solution quality and convergence behavior. Furthermore, we assess the algorithm's feasibility within a hybrid quantum–high-performance computing (HPC) framework by porting it to QFw, a state-of-the-art quantum-HPC software stack. 11This manuscript has been authored by UT-Battelle, LLC, under contract DE-AC05-00OR22725 with the US Department of Energy (DOE). The US government retains and the publisher, by accepting the article for publication, acknowledges that the US government retains a nonexclusive, paid-up, irrevocable, worldwide license to publish or reproduce the published form of this manuscript, or allow others to do so, for US government purposes. DOE will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan. This research used resources of the Oak Ridge Leadership Computing Facility at the Oak Ridge National Laboratory, which is supported by the Office of Science of the US DOE under Contract No. DE-AC05-00OR22725.

Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000↗
DOE OSTI2022

Robust Scheduling of Networked Microgrids for Economics and Resilience Improvement

The benefits of networked microgrids in terms of economics and resilience are investigated and validated in this work. Considering the stochastic unintentional islanding conditions and conventional forecast errors of both renewable generation and loads, a two-stage adaptive robust optimization is proposed to minimize the total operating cost of networked microgrids in the worst scenario of the modeled uncertainties. By coordinating the dispatch of distributed energy resources (DERs) and responsive demand among networked microgrids, the total operating cost is minimized, which includes the start-up and shut-down cost of distributed generators (DGs), the operation and maintenance (O&M) cost of DGs, the cost of buying/selling power from/to the utility grid, the degradation cost of energy storage systems (ESSs), and the cost associated with load shedding. The proposed optimization is solved with the column and constraint generation (C&CG) algorithm. The results of case studies demonstrate the advantages of networked microgrids over independent microgrids in terms of reducing total operating cost and improving the resilience of power supply.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2023

Dimensionality Reduction with Variational Encoders Based on Subsystem Purification

Efficient methods for encoding and compression are likely to pave the way toward the problem of efficient trainability on higher-dimensional Hilbert spaces, overcoming issues of barren plateaus. Here, we propose an alternative approach to variational autoencoders to reduce the dimensionality of states represented in higher dimensional Hilbert spaces. To this end, we build a variational algorithm-based autoencoder circuit that takes as input a dataset and optimizes the parameters of a Parameterized Quantum Circuit (PQC) ansatz to produce an output state that can be represented as a tensor product of two subsystems by minimizing $Tr(ρ^2)$. The output of this circuit is passed through a series of controlled swap gates and measurements to output a state with half the number of qubits while retaining the features of the starting state in the same spirit as any dimension-reduction technique used in classical algorithms. The output obtained is used for supervised learning to guarantee the working of the encoding procedure thus developed. We make use of the Bars and Stripes (BAS) dataset for an 8 × 8 grid to create efficient encoding states and report a classification accuracy of 95% on the same. Thus, the demonstrated example provides proof for the working of the method in reducing states represented in large Hilbert spaces while maintaining the features required for any further machine learning algorithm that follows.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Development of Steady-State and Dynamic Mass and Energy Constrained Neural Networks for Distributed Chemical Systems Using Noisy Transient Data

The paper presents the development of algorithms for mass and energy constrained neural network models that can exactly conserve the overall mass and energy of distributed chemical process systems, even though the noisy transient data used for optimal model training violate the same. In contrast to approximately satisfying mass and energy balance constraints of a system by soft penalization of objective function, algorithms have been developed for solving equality-constrained nonlinear optimization problems, thus providing the guarantee of exactly satisfying the system mass and energy conservation laws. For developing dynamic mass-energy constrained network models for distributed systems, hybrid series and parallel dynamic-static neural networks have been leveraged. The developed algorithms for solving both the training and forward problems are validated using both steady-state and dynamic data in the presence of various noise characteristics. The developed data-driven algorithms are flexible to exactly satisfy mass and energy balance constraints for dynamic chemical processes if the system holdup information is available. The proposed network structures and algorithms are applied to the development of data-driven lumped and distributed models of an adiabatic superheater/reheater system, a nonisothermal continuous stirred tank reactor, as well as an electrically heated plug-flow reactor system where one form of energy gets transformed to another. It has been observed that the mass-energy constrained neural networks yield a root mean squared error of <1% with respect to the system truth for the case studies evaluated in this work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Enhanced mechanical property evaluation using innovative data analytics capability

This report focuses on efforts to improve Multiphysics Object-Oriented Simulation Environ-ment (MOOSE) for mechanical property evaluation using data analytics. These efforts involveimprovements to the stochastic tools module (STM) for stochastic simulations of MOOSE mul-tiphysics model and the development of inverse optimization capabilities. The report gives anoverview of the STM and describes recent updates to its core capabilities and theory on itsreduced-order model (ROM) schemes. Examples are also provided showing the impact of theseupdates and exhibits the usefulness of ROMs. An overview of the gradient based inverse opti-mziation algorithms are given along with examples of their application to source identification.Inverse optimization will provide a new methodology in STM for fitting model parameters toexperimental data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Rare Events via Cross-Entropy Population Monte Carlo

Rare events are events that happen with very low frequency. Estimating rare event probabilities using Monte Carlo techniques is computationally expensive, often to the point of intractability, and special methods are required. Importance sampling (IS) is a well known technique that uses a proposal distribution in place of a target distribution to lower the variance of the estimator. Key to the success of IS methods is the choice of a proposal distribution, or the parameters governing the distribution. Adaptive importance sampling improves the parameters of a family or population of proposal distributions iteratively through trials. We present a novel cross-entropy population Monte Carlo algorithm, which adapts the parameters of proposals through the cross-entropy method. The proposed method stands apart from previous work in that we are not optimizing a mixture distribution. Instead, we leverage deterministic mixture weights and optimize the distributions individually through a reinterpretation of the typical derivation of the cross-entropy method. Demonstrations on rare event examples show that the algorithm can outperform existing resampling based population Monte Carlo methods, especially for higher-dimensional problems. Finally, we also demonstrate efficacy on a conjunction analysis problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

DeepGrid: Robust Deep Reinforcement Learning-based Contingency Management

Increasing uncertainty raised by the integration of renewable energy resources requires an enormous number of simulations to be carried out for the security assessment of the power grid. However, it is challenging to assess the steady-state and dynamic security indices for different system contingency events by doing an exhaustive analysis in real-time due to the computational and communication constraints. One promising solution is using data-driven techniques along with the system models to train an intelligent contingency management framework to better handle the contingencies in real-time. Nevertheless, implementing a data-driven technique to obtain the best remedial actions necessitates to account for the effect of the measurement noise on the performance of the contingency management. To tackle these challenges, we leverage a robust deep reinforcement learning (DRL) algorithm called Double Deep Q-Network (DDQN) to design a recommender system capable of prescribing optimal control actions with the help of the real-time digital simulator (RTDS). The use of RTDS system in combination with the advanced DRL algorithm allows to explore a wide variety of system contingencies in order to derive better remedial actions. The performance of the proposed algorithm is evaluated in IEEE 9-bus system under different loading conditions, and different network configurations in presence of noisy measurements.

Ghasemkhani, Amir↗
DOE OSTI2020

Approaching scalable VQE of interacting bosons with NISQ devices [Slides]

Scaling up variational quantum eigensolver (VQE) algorithms to practical applications utilizing quantum advantage with noisy intermediate-scale quantum (NISQ) devices is challenging. The expansive cost-function evaluation and demanding optimization quickly exhaust the precious quantum resource available on NISQ devices. In this work, we discuss the appropriate VQE strategy suitable for multi-site interacting boson systems, for example, the Holstein model and the Rabi lattice model. We investigate the cost-function setup and the optimization tactics to utilize the limited quantum resource efficiently. Our strategy illustrates that the scalable VQE algorithms of interacting bosons have a promising future.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Tensor decompositions for count data that leverage stochastic and deterministic optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the maximum likelihood estimator (MLE) of the Poisson CPD model. Here, this work presents two new algorithms that extend state-of-the-art local methods for Poisson CPD. Hybrid GCP-CPAPR combines Generalized Canonical Decomposition (GCP) with stochastic optimization and CP Alternating Poisson Regression (CPAPR), a deterministic algorithm, to increase the probability of converging to the MLE over either method used alone. Restarted CPAPR with SVDrop uses a heuristic based on the singular values of the CPD model unfoldings to identify convergence toward optimizers that are not the MLE and restarts within the feasible domain of the optimization problem, thus reducing overall computational cost when using a multi-start strategy. We provide empirical evidence that indicates our approaches outperform existing methods with respect to converging to the Poisson CPD MLE.

CPAPR↗
DOE OSTI2022

Optimized Quantum Phase Estimation for Simulating Electronic States in Various Energy Regimes

While quantum algorithms for simulation exhibit better asymptotic scaling than their classical counterparts, they currently cannot be implemented on real-world devices. Instead, chemists and computer scientists rely on costly classical simulations of these quantum algorithms. In particular, the quantum phase estimation (QPE) algorithm is among several approaches that have attracted much attention in recent years for its genuine quantum character. However, it is memory-intensive to simulate and intractable for moderate system sizes. Herein, this paper discusses the performance and applicability of QPESIM, a new simulation of the QPE algorithm designed to take advantage of modest computational resources. In particular, we demonstrate the versatility of QPESIM in simulating various electronic states by examining the ground and core-level states of H 2 O. For these states, we also discuss the effect of the active-space size on the quality of the calculated energies. For the high-energy core-level states, we demonstrate that new QPE simulations for active spaces defined by 15 active orbitals significantly reduce the errors in core-level excitation energies compared to earlier QPE simulations using smaller active spaces.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Neural Networks-Based Inverter Control: Modeling and Adaptive Optimization for Smart Distribution Networks

The optimal voltage control of inverter-based resources, especially under the high penetration of solar photovoltaics, is critical to the stability of the distribution power system. However, the computational complexity as well as the coordinated operation performance of the voltage control optimization in the distribution power system limits the real-time applications. To mitigate this issue, a model-free based adaptive optimal control scheme for the smart inverter is proposed to maximize the active power generation, minimize the power loss, and maintain the bus voltages in smart distribution networks. An inverter-based optimization model for coordinated operation is first established, considering the uncertainties of renewable power generation. Subsequently, by collecting the data and control strategies, the neural networks (NNs) based algorithm is proposed to efficiently predict the best possible control strategy. The main objective of this scheme is to accurately predict candidate optimal solutions with near-negligible feasibility and optimization gaps, with the advantage of avoiding complicated iteration-based numerical algorithms. Thereafter, the co-simulation among OpenDSS, MATLAB, and Python is set up to fully take advantage of the three individual software. Experiments are conducted based on different control parameter characteristics and structures of NNs. Finally, the results reveal that an average mean squared error of 0.013 and 1 ms response time are achieved, which is lower than some state-of-the-art methods.

42 ENGINEERING↗
DOE OSTI2023

Preliminary IHLW Formulation Algorithm Description

This report documents the initial algorithm that could be used by the Waste Treatment and Immobilization Plant (WTP) in batching high-level waste (HLW) and glass-forming chemicals (GFCs) in the HLW melter feed preparation vessel (MFPV) (HFP-VSL-00001 and -00005). Not all Hanford tank waste can be accommodated by the models developed for this report and significant expansion of the model boundaries could be achievable to reduce the WTP mission life and total canister production count. The immobilized HLW (IHLW) must meet a series of constraints to be acceptable for disposal in the Monitored Geologic Repository, which are contained in the Specification 1 of the Contract (DOE 2000), the Waste Acceptance Product Specifications (WAPS, DOE 1996), and the Waste Acceptance System Requirements Document (WASRD, DOE 2007). The IHLW Waste Form Compliance Plan (WCP, 24590-HLW-PL-RT-07-0001, Rev 3) specifies that the formulation algorithm will be developed and used to comply with the constraints associated with glass composition and properties. This report is not an engineering calculation, does not provide design input, and is not an engineering study. Algorithm inputs include the chemical analyses of the blended HLW in the HLW blend vessel (HBV) (HLP-VSL-00028, the volume and composition of the MFPV heel, the volume and composition of the MFPV after waste addition, the volume and composition of MFPV batch after GFC addition, the compositions of individual GFCs, and the mass of glass in each canister. In addition to these inputs, uncertainties in the HLW composition and processing parameters are included in the algorithm. Using the above inputs, the algorithm calculates the following outputs: 1) the volume of HLW to be transferred from the HBV to the MFPV, 2) the mass of each GFC for addition to the MFPV, 3) the composition of the glass that will be produced along with uncertainties, and 4) the predicted properties, with associated uncertainties, of the resulting IHLW. The algorithm uses the property-composition models to calculate properties with associated uncertainties and compares them with various constraints to ensure that a processable feed is formulated and a compliant IHLW is produced. The GFC additions are determined using an optimization approach to provide high confidence that the HLW glass will meet all product quality requirements and key processing constraints. For most HLW batches there are many possible glass compositions that meet all constraints. In these cases, the glass composition is optimized for a series of target component concentrations and target property values. The algorithm also incorporates process measurement and product quality uncertainties, based on the work of Piepel et al. (2005). Estimates of the various process and measurement uncertainties that affect glass compositions and predicted glass properties have been previously reported (Piepel et al. 2005, 2006) and the impacts of these estimated uncertainties on the IHLW composition envelope that meets product quality and processing-related properties with sufficient confidence were evaluated. The details of work performed to date to develop this initial GFC addition and batching algorithm are summarized in Sections 4 and 5. An example data set is used to illustrate the calculations of the algorithm summarized in Section 6. Finally, in Section 7, there is a statement of the required work to achieve a final operational IHLW formulation control algorithm. This report is not an engineering calculation, does not provide design input, and is not an engineering study.

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

Efficient Parallelization of Irregular Applications on GPU Architectures

With the enlarging computation capacity of general Graphics Processing Units (GPUs), leveraging GPUs to accelerate parallel applications has become a critical topic in academia and industry. However, a wide range of irregular applications with the computation-/memory-intensive nature cannot easily achieve high GPU utilization. The challenges mainly involve the following aspects: first, data dependence leads to coarse-grained kernel and inefficient parallelism; second, heavy GPU memory usage may cause frequent memory evictions and extra overhead of I/O; third, specific computation patterns produce memory redundancies; last, workload balance and data reusability conjunctly benefit the overall performance, but there may exist a dynamic trade-off between them. Targeting these challenges, this dissertation proposes multiple optimizations to accelerate two real-world applications: many-body correlation functions to simulate nuclear physics in a large-scale scientific system; the other is the eALS-based matrix factorization recommendation system. To accelerate the calculations of many-body correlation functions, this dissertation presents three frameworks in GPU memory management and multi-GPU scheduling. Firstly, an optimized systematic GPU memory management framework, MemHC, utilizes a series of new memory reduction designs in GPU memory allocation, CPU/GPU communications, and GPU memory oversubscription. Secondly, an enhanced multi-GPU scheduling framework, MICCO, particularly by taking both data dimension (e.g., data reuse and data eviction) and computation dimension into account. MICCO designs a heuristic scheduling algorithm and a machine learning-based regression model to generate the optimal settings of a proposed new concept to manage the trade-off. Thirdly, a locality-aware multi-GPU scheduling framework. This scheduler leverages pipeline batch generation with a looking-ahead strategy by building local dependency graphs for memory transfer reduction and better data reuse, achieving up to 79.92% memory cost reduction and 1.67x speedup. To parallelize the eALS-based recommendation system, this dissertation proposes an efficient CPU/GPU heterogeneous recommendation system, HEALS. HEALS employs newly designed architecture-adaptive data formats to achieve load balance and good data locality on CPU and GPU. To mitigate the data dependence, HEALS presents a CPU/GPU collaboration model for both task parallelism and data parallelism with multiple kernel computation optimizations. In summary, this dissertation efficiently accelerates two typical irregular applications on GPUs by building four frameworks, including CPU/GPU collaboration, GPU memory management, and multi-GPU scheduling.

Wang, Qihan↗
DOE OSTI2023

Network-Wide Traffic Signal Control Using Bilinear System Modeling and Adaptive Optimization

This study proposes a new multi-input multi-output optimal bilinear signal control method in which a bilinear dynamic model approximation is used to capture the nonlinear dynamics of the urban traffic networks. With signal green time splits as the control input and traffic delay changes as the output for each intersections in the network, a bilinear system model was developed, which, on the basis of linear system modeling, takes interactions among traffic delays and signal timing splits into consideration. Based on the bilinear system modeling framework, we conducted two steps in each time interval to derive traffic control strategies: (1) we used the normalized least-squared algorithm to estimate system parameters; and (2) we solved an online optimization problem to obtain the updated traffic control inputs for the signal timing that minimizes future traffic delays. We evaluated the proposed method in a microscopic traffic simulation environment (VISSIM) with a 35-intersection network of Bellevue city in Washington. Two different traffic demand patterns: (1) normal traffic demands; and (2) time-varying traffic demands were simulated to compare the performance of different control strategies. Experimental results show that (1) the proposed bilinear system model can better describe traffic system dynamics than linear-model based methods, such as our previously developed linear-quadratic regulator control; and (2) the proposed method outperforms the state-of-the-art signal control strategies, namely the max-pressure and the self-organizing traffic light control methods. We have also shown that the proposed method is applicable to all other possible network layouts and signal controller phasing structures.

42 ENGINEERING↗
DOE OSTI2024

Control Co-Design Studies for a 22 MW Semisubmersible Floating Wind Turbine Platform

We present a control co-design software framework that can be used to optimize floating wind turbines and their controllers. Because this framework has many options for design variables, constraints, and merit figures, along with modeling fidelity levels, we seek to demonstrate best practices for using the tool while designing a floating platform for the new 22 MW offshore reference wind turbine developed within the International Energy Agency Wind Technology Commercialization Programme 55 on Reference Wind Turbines and Farms. During these studies, we evaluate the use of different simulation fidelity levels, the effect of using different load cases for controller tuning, and the difference between sequential and simultaneous control co-design solutions. Based on these efforts, we suggest using an algorithm that performs an initial search of the design space before optimization. We find that solving smaller optimization problems, in a sequential manner, leads to more reliable outcomes in fewer iterations than larger, simultaneous control co-design solutions. However a simultaneous CCD solution produces a platform with a 2% lower mass than the sequential CCD outcome.

17 WIND ENERGY↗
DOE OSTI2024

Asynchronous GPU-based DEM solver embedded in commercial CFD software with polyhedral mesh support

A novel graphical processing unit-based discrete element method solver is introduced to improve stability, performance, and provide seamless integration into commercial or open-source computational fluid dynamics software. A key innovation is eliminating a need for network communication between solvers, which was previously required for cross-platform coupling. This is accomplished by a direct coupling method that employs dynamic-linked libraries. Furthermore, the solver optimizes memory usage by streamlining the particle-cell search algorithm by eliminating the cells' searching grid. This ensures the solver is compatible with a wide range of mesh types, providing high geometric flexibility. The approach simplifies the simulation process by directly incorporating computational fluid dynamics mesh information into the discrete element method solver. The performance analysis indicates about sixteen times boost in computational speed compared to benchmark central processing unit-based solvers. Finally, the solver's compatibility with polyhedral meshes, a vital advantage for complex geometries, is tested against a referenced study regarding the simulation of an immersed-tube fluidized bed.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗