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,333 records · Page 74
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Finding middle ground: Flow regimes designed for salmon and energy value

In regulated rivers, shaping seasonal flows to recover species at risk depends on understanding when to expect conflicts with competing water users and when their interests are aligned. Multi-objective optimization can be used to reveal such conflicts and commonalities. When species are involved, multi-objective optimization is challenged by the need to simulate complex species responses to flow regimes. Previously, we addressed that challenge by developing a simplified salmon model (Quantus) that defines cohorts of salmon by the river section and time in which they were spawned. Salmon in these space-time cohorts are tracked from the time redds (nests) are constructed until the cohort exits the tributary en route to the ocean. In this study, we modeled seasonal patterns in energy value and developed a Pareto-optimal frontier of seasonal flow patterns to maximize in-river salmon survival and hydropower value. Candidate flow regimes were characterized by two pulse flows varying in magnitude, timing, and duration and constrained by a total annual flow near the historical median. Our analysis revealed times when economic and salmon objectives were aligned and times when they differed. Pulse flows that favored higher energy value were timed to meet demand during extreme temperatures. Both salmon and hydropower objectives produced optimal flow regimes with pulse flows in early summer, but only solutions favoring hydropower value included high flows in mid-winter. Solutions favoring higher age-0 salmon survival provided an extended pulse flow in late winter/early spring, which suggests that access to productive floodplain habitat allowed faster growth and earlier out-migration and reduced the need for higher temperature-moderating flows later in spring. Minimum flows were also higher among solutions favoring salmon over energy. The tools used to produce these results can help to design simplified seasonal flow regimes by revealing compromise solutions that satisfy both fish and energy producers and highlighting when potential conflicts are likely.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

A Novel Framework for Performance Evaluation and Design Optimization of PCM Embedded Heat Exchangers for the Built Environment

This research sheds light on the performance evaluation and design optimization of PCM-HXs for the built environment, addressing several barriers to practical issues to PCM-HX commercialization such as modeling aspects (i.e., modeling expertise and computational / time investment, etc.), manufacturing aspects (i.e., at-scale manufacturing, cost assessments, etc.) and experimental performance assessment (i.e., reliable experimental data, assessment of multiple PCM-working fluid combinations, etc.). We present a novel, comprehensive, and experimentally-validated design optimization framework for PCM-HXs capable of simulating any PCM-HX geometry with reasonable accuracy and significant computational time savings when compared to traditional CFD-based design practices. The framework was validated for a wide range of PCM-HX configurations, including a design optimization for a domestic hot water heater application where TES partially replaces electrical heating input. The resulting PCM-HXs were found to deliver 34-68% of the total daily hot water supply with only 5-10% package volume increase from the water heater, thus within U.S. DOE targets for TES systems. To identify the most promising HXs for PCM applications, first-order geometry and cost analyses were conducted based on off-the-shelf HX products. As part of this work, 9 PCM-HX prototypes were manufactured using additive and conventional manufacturing methods. Detailed economy-of-scale assessments were conducted for the most promising PCM-HXs and were found to have a good outlook for the next 5-10 years. The PCM-HX design optimization framework was validated through comprehensive in-house experimental testing using newly-developed PCM-to-fluid test facilities. In total,10 total in-house component-level experiments were conducted using these prototypes, including 9 with water and 1 with refrigerant (R410A) as the working fluid. It was found that the framework can successfully predict experimental thermal-hydraulic performance within ±10-20% the first time without manual design changes, eliminating the need for time-consuming and expensive prototyping efforts as part of the design process. As part of this work, a publicly-available PCM web tool was released which includes a PCM property database (531 PCMs) and PCM-HX modeling tool to assist the design community on common PCM-HX use-cases, e.g., single/multiple flow path(s) fluid-to-PCM and air-to-fluid-to-PCM configurations (https://ceeeweb.umd.edu/pcmapp/). This work will accelerate the design and time to market for next generation PCM-HXs.

25 ENERGY STORAGE↗
DOE OSTI2025

Adiabatic quantum support vector machines

Adiabatic quantum computers can solve difficult optimization problems (e.g., the quadratic unconstrained binary optimization problem), and they seem well suited to train machine learning models. In this paper, we describe an adiabatic quantum approach for training support vector machines. We show that the time complexity of our quantum approach is an order of magnitude better than the classical approach. Next, we compare the test accuracy of our quantum approach against a classical approach that uses the Scikit-learn library in Python across five benchmark datasets (Iris, Wisconsin Breast Cancer (WBC), Wine, Digits, and Lambeq). We show that our quantum approach obtains accuracies on par with the classical approach. Finally, we perform a scalability study in which we compute the total training times of the quantum approach and the classical approach with an increasing number of features and an increasing number of data points in the training dataset. In conclusion, our scalability results show that the quantum approach obtains a 3.5–4.5x speedup over the classical approach on datasets with many (millions of) features.

Computational Complexity↗
DOE OSTI2022

Fixed Depth Hamiltonian Simulation via Cartan Decomposition

Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize limited quantum resources remains an open problem. In this study, we tackle this problem by presenting a constructive algorithm, based on Cartan decomposition of the Lie algebra generated by the Hamiltonian, which generates quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one-dimensional transverse field $\mathrm{XY}$ model, where $\mathscr{O}$(n 2 )-gate circuits naturally emerge. Compared to product formulas with significantly larger gate counts, our algorithm drastically improves simulation precision. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

LOGAN: High-Performance GPU-Based X-Drop Long-Read Alignment

Pairwise sequence alignment is one of the most computationally intensive kernels in genomic data analysis, accounting for more than 90% of the runtime for key bioinformatics applications. This method is particularly expensive for third-generation sequences due to the high computational cost of analyzing sequences of length between 1Kb and 1Mb. Given the quadratic overhead of exact pairwise algorithms for long alignments, the community primarily relies on approximate algorithms that search only for high-quality alignments and stop early when one is not found. In this work, we present the first GPU optimization of the popular X-drop alignment algorithm, that we named LOGAN. Results show that our high-performance multi-GPU implementation achieves up to 181.6 GCUPS and speed-ups up to 6.6× and 30.7× using 1 and 6 NVIDIA Tesla V100, respectively, over the state-of-the-art software running on two IBM Power9 processors using 168 CPU threads, with equivalent accuracy. We also demonstrate a 2.3× LOGAN speed-up versus ksw2, a state-of-art vectorized algorithm for sequence alignment implemented in minimap2, a long-read mapping software. Furthermore, to highlight the impact of our work on a real-world application, we couple LOGAN with a many-to-many long-read alignment software called BELLA, and demonstrate that our implementation improves the overall BELLA runtime by up to 10.6×. Finally, we adapt the Roofline model for LOGAN and demonstrate that our implementation is near optimal on the NVIDIA Tesla V100s.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Model-based and Model-free Designs for an Extended Continuous-time LQR with Exogenous Inputs

We present an extended linear quadratic regulator (LQR) design for continuous-time linear time-invariant (LTI) systems in the presence of exogenous inputs. We first propose a model-based solution with cost minimization guarantees for states and inputs using dynamic programming (DP). The control law consists of a combination of the optimal state feedback and an additional optimal term dependent on the exogenous inputs. The control gains for the two components are obtained by solving a set of matrix differential equations. We provide these solutions for both finite horizons and steady-state cases. In the second part of the paper, we formulate a reinforcement learning (RL) based algorithm which does not need any model information except the input matrix, and can compute an approximate steady-state LQR gain using measurements of the states, the control inputs, and the exogenous inputs. Both model-based and data-driven optimal control algorithms are tested with a numerical example under different exogenous inputs showcasing the effectiveness of the designs.

Mukherjee, Sayak↗
DOE OSTI2023

Parallel Algorithms for Computing the Tensor-Train Decomposition

The tensor-train (TT) decomposition expresses a tensor in a data-sparse format used in molecular simulations, high-order correlation functions, and optimization. In this paper, we propose four parallelizable algorithms that compute the TT format from various tensor inputs: (1) Parallel-TTSVD for traditional format, (2) PSTT and its variants for streaming data, (3) Tucker2TT for Tucker format, and (4) TT-fADI for solutions of Sylvester tensor equations. We provide theoretical guarantees of accuracy, parallelization methods, scaling analysis, and numerical results. For example, for a d-dimension tensor in $\mathbb{R}$ $n\times∙∙∙$$\times$$n$ a two-sided sketching algorithm PSTT2 is shown to have a memory complexity of $O(n^{[d/2]})$, improving upon $O(n^{d—1})$ from previous algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A Pulsar-Inspired Timing Framework for Power System: Optimization and Performance Evaluation

Due to their excellent stability, neutron pulsar stars are considered promising candidate timing sources for power system applications. However, the complexity of pulsar signals necessitates advanced processing algorithms to provide accurate timing references. This paper presents the foundational framework for pulsar signal processing, serving as the basis for further optimization. To enhance the timing accuracy and computation efficiency in pulsar period searches, three algorithms are proposed as the initial optimization step: wavelet de-noising, fast folding, and cross-correlation for profile evaluation. Wavelet de-noising improves signal-to-noise ratio (SNR) by 36%–70%. Fast folding reduces computation time from hundreds of seconds to mere milliseconds. Cross-correlation works better than traditional SNR-based methods by effectively identifying the optimal period. The performance of the proposed algorithms is evaluated using observation data from telescopes. Together, these algorithms significantly improve pulsar timing performance, reducing the error of the Pulse Per Second (PPS) signal from hundreds to tens of microseconds.

Wu, Ori [ORNL] (ORCID:0000000326723410)↗
DOE OSTI2021

Balanced k -means clustering on an adiabatic quantum computer

Adiabatic quantum computers are a promising platform for efficiently solving challenging optimization problems. Therefore, many are interested in using these computers to train computationally expensive machine learning models. We present a quantum approach to solving the balanced k-means clustering training problem on the D-Wave 2000Q adiabatic quantum computer. In order to do this, we formulate the training problem as a quadratic unconstrained binary optimization (QUBO) problem. Unlike existing classical algorithms, our QUBO formulation targets the global solution to the balanced k-means model. We test our approach on a number of small problems and observe that despite the theoretical benefits of the QUBO formulation, the clustering solution obtained by a modern quantum computer is usually inferior to the solution obtained by the best classical clustering algorithms. Nevertheless, the solutions provided by the quantum computer do exhibit some promising characteristics. We also perform a scalability study to estimate the run time of our approach on large problems using future quantum hardware. Finally, as a final proof of concept, we used the quantum approach to cluster random subsets of the Iris benchmark data set.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Interactive Exploration of High-Dimensional Phase Diagrams

High-dimensional thermodynamic phase stability databases are becoming increasingly common due to the convergence of three recent trends: (i) the widespread interest in so-called “high-entropy” alloys, (ii) the availability of high-throughput computational assessments of phase stability in broad composition spaces and (iii) the ongoing development of ever-increasingly broad, multicomponent, multiphase CALPHAD databases. Although automated computational tools can readily process such high-dimensional data, scientists are often unable to visualize the relevant phase relations, an ability that is crucial to gaining an intuitive understanding of the stability constraints governing materials design. The present work addresses this need by providing algorithms that enable the interactive exploration of phase equilibria in high-dimensional spaces. These algorithms concentrate the complex nonlinear nonsmooth optimization needed into a preprocessing step that generates a large number of high-dimensional yet elementary graphical primitives. Furthermore, these primitives can then be cross-sectioned to yield 3-dimensional views in a computationally efficient manner that enables an interactive exploration of high-dimensional spaces. All of these operations are highly parallelizable, thus facilitating scaling of this method to large data sets.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Model-Free Voltage Control of Active Distribution System with PVs Using Surrogate Model-Based Deep Reinforcement Learning

Accurate knowledge of the distribution system topology and parameters is required to achieve good voltage control performance, but this is difficult to obtain in practice. This paper proposes a physical-model-free voltage control method based on a surrogate-model-enabled deep reinforcement learning approach. Specifically, a surrogate model is trained in a supervised manner using the recorded limited number of historical data to learn the relationship between the power injections and voltage fluctuations of each node. Then, the deep reinforcement learning algorithm is applied to learn an optimal control strategy from the experiences obtained by continuous interactions with the surrogate model. The proposed method can achieve physical-model-free control of unbalanced distribution network and inform real-time decisions to deal with fast voltage fluctuations caused by the rapid variation of PV generation. Simulation results on an unbalance IEEE 123-bus system show that the proposed method can achieve similar performance as that of perfect physical-model-based approaches while being advantageous over other traditional methods.

active distribution network↗
DOE OSTI2026

Harnessing Quantum Computing for Energy Materials: Opportunities and Challenges

Developing high-performance materials is critical for diverse energy applications to increase efficiency, improve sustainability and reduce costs. Classical computational methods have enabled important breakthroughs in energy materials development, but they face scaling and time-complexity limitations, particularly for high-dimensional or strongly correlated material systems. Quantum computing (QC) promises to offer a paradigm shift by exploiting quantum bits with their superposition and entanglement to address challenging problems intractable for classical approaches. This Perspective discusses the opportunities in leveraging QC to advance energy materials research and the challenges QC faces in solving complex and high-dimensional problems. We present cases on how QC, when combined with classical computing methods, can be used for the design and simulation of practical energy materials. We also outline the outlook for error-corrected, fault-tolerant QC capable of achieving predictive accuracy and quantum advantage for complex material systems.

Algorithms↗
DOE OSTI2025

Solving k –SAT problems with generalized quantum measurement

We generalize the projection–based quantum measurement–driven k –SAT algorithm of Benjamin, Zhao, and Fitzsimons to arbitrary strength quantum measurements, including the limit of continuous monitoring. In doing so, we clarify that this algorithm is a particular case of the measurement–driven quantum control strategy elsewhere referred to as “Zeno dragging”. We argue that the algorithm is most efficient with finite time and measurement resources in the continuum limit, where measurements have an infinitesimal strength and duration. Moreover, for solvable k -SAT problems, the dynamics generated by the algorithm converge deterministically towards target dynamics in the long–time (Zeno) limit, implying that the algorithm can successfully operate autonomously via Lindblad dissipation, without detection. We subsequently study both the conditional and unconditional dynamics of the algorithm implemented via generalized measurements, quantifying the advantages of detection for heralding errors. These strategies are investigated first in a computationally–trivial 2-qubit 2-SAT problem to build intuition, and then we consider the scaling of the algorithm on 3-SAT problems encoded with 4–10 qubits. We numerically investigate the scaling of 3-SAT with respect to algorithmic runtime and find that the optimized time to solution scales with qubit number n as λ n , where λ is slightly larger than $\sqrt{2}$ for unconditional dynamics and less than $\sqrt{2}$ for conditional dynamics. We assess the implications for using this analog measurement–driven approach to quantum computing in practice.

quantum information↗
DOE OSTI2021

Absolute contrast estimation for soft X-ray photon fluctuation spectroscopy using a variational droplet model

Abstract X-ray photon fluctuation spectroscopy using a two-pulse mode at the Linac Coherent Light Source has great potential for the study of quantum fluctuations in materials as it allows for exploration of low-energy physics. However, the complexity of the data analysis and interpretation still prevent recovering real-time results during an experiment, and can even complicate post-analysis processes. This is particularly true for high-spatial resolution applications using CCDs with small pixels, which can decrease the photon mapping accuracy resulting from the large electron cloud generation at the detector. Droplet algorithms endeavor to restore accurate photon maps, but the results can be altered by their hyper-parameters. We present numerical modeling tools through extensive simulations that mimic previous x-ray photon fluctuation spectroscopy experiments. By modification of a fast droplet algorithm, our results demonstrate how to optimize the precise parameters that lift the intrinsic counting degeneracy impeding accuracy in extracting the speckle contrast. These results allow for an absolute determination of the summed contrast from multi-pulse x-ray speckle diffraction, the modus operandi by which the correlation time for spontaneous fluctuations can be measured.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Variational quantum algorithms

Applications such as simulating complicated quantum systems or solving large-scale linear algebra problems are very challenging for classical computers, owing to the extremely high computational cost. Quantum computers promise a solution, although fault-tolerant quantum computers will probably not be available in the near future. Current quantum devices have serious constraints, including limited numbers of qubits and noise processes that limit circuit depth. Variational quantum algorithms (VQAs), which use a classical optimizer to train a parameterized quantum circuit, have emerged as a leading strategy to address these constraints. VQAs have now been proposed for essentially all applications that researchers have envisaged for quantum computers, and they appear to be the best hope for obtaining quantum advantage. Nevertheless, challenges remain, including the trainability, accuracy and efficiency of VQAs. Here we overview the field of VQAs, discuss strategies to overcome their challenges and finally, we highlight the exciting prospects for using them to obtain quantum advantage.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Thermodynamic stability versus kinetic accessibility: Pareto fronts for programmable self-assembly

A challenge in designing self-assembling building blocks is to ensure the target state is both thermodynamically stable and kinetically accessible. These two objectives are known to be typically in competition, but it is not known how to simultaneously optimize them. We consider this problem through the lens of multi-objective optimization theory: we develop a genetic algorithm to compute the Pareto fronts characterizing the tradeoff between equilibrium probability and folding rate, for a model system of small polymers of colloids with tunable short-ranged interaction energies. We use a coarse-grained model for the particles' dynamics that allows us to efficiently search over parameters, for systems small enough to be enumerated. For most target states there is a tradeoff when the number of types of particles is small, with medium-weak bonds favouring fast folding, and strong bonds favouring high equilibrium probability. Additionally, the tradeoff disappears when the number of particle types reaches a value m *, that is usually much less than the total number of particles. This general approach of computing Pareto fronts allows one to identify the minimum number of design parameters to avoid a thermodynamic–kinetic tradeoff. However, we argue, by contrasting our coarse-grained model's predictions with those of Brownian dynamics simulations, that particles with short-ranged isotropic interactions should generically have a tradeoff, and avoiding it in larger systems will require orientation-dependent interactions.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Single-shot x-ray phase-contrast and dark-field imaging based on coded binary phase mask

We introduce a coded-mask-based multi-contrast imaging method for high-resolution phase-contrast and dark-field imaging. The method uses a binary phase mask designed to provide an ultra-high-contrast pattern and reference-free single-shot measurement and an algorithm based on maximum-likelihood optimization and automatic differentiation to perform simultaneous reconstruction of absorption, phase, and dark-field object images. Further, we demonstrate that the method has great potential for real-time quantitative phase imaging and wavefront sensing when combined with deep learning.

Qiao, Zhi (ORCID:0000000286285320)↗