SEARCH · Engineering Papers

Results for “fast optimization”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗

DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Gu, Shouzhen [Yale U.]↗

DOE OSTI2026

Performance-Aligned LLMs for Generating Fast HPC Code

Optimizing scientific software is a difficult task because codebases are often large and complex, and performance can depend upon several factors including the algorithm, its implementation, and hardware among others. Causes of poor performance can originate from disparate sources and be difficult to diagnose. Recent years have seen a multitude of work that use large language models (LLMs) to assist in software development tasks. However, these tools are trained to model the distribution of code as text, and are not specifically designed to understand performance aspects of code. In this work, we introduce a reinforcement learning based methodology to align the outputs of code LLMs with performance. This allows us to build upon the current code modeling capabilities of LLMs and extend them to generate better performing code. Here, we demonstrate that our fine-tuned model improves the expected speedup of generated code over base models for a set of benchmark tasks from 0.9 to 1.6 for serial code and 1.9 to 4.5 for OpenMP parallel code.

Computer science↗

DOE OSTI2021

Measuring Plant Metabolite Abundance in Spearmint ( Mentha spicata L.) with Raman Spectra to Determine Optimal Harvest Time

A fast field-deployable method utilizing Raman spectroscopy to determine the optimal harvest time of plants to extract the highest abundance of target metabolites is presented. Rosmarinic acid is a metabolite extracted from spearmint (Mentha spicata L.). Leaves from commercial “Native” and proprietary clonal line “KI110” spearmint were measured as a function of cell type and age to determine rosmarinic acid abundance. A linear regression model with leave-one-out cross-validation (R 2 CV = 0.61, RMSECV = 11.1 mg/g) was developed between selected Raman peak areas and rosmarinic acid concentrations determined by high-performance liquid chromatography (HPLC). A principal component analysis (PCA) model was also developed to determine rosmarinic acid abundance. The method may be suited to the analysis of many agriculturally relevant plant species and metabolites with distinct Raman peaks.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2024

Carbon-Binder Optimization for Lithium-Ion Battery Extreme Fast Charge

Battery performance is strongly correlated with electrode microstructure and weight loading of the electrode components. Among them are the carbon-black and binder additives that enhance effective conductivity and provide mechanical integrity. However, these both reduce effective ionic transport in the electrolyte phase and reduce energy density. Therefore, an optimal additive loading is required to maximize performance, especially for fast charging where ionic transport is essential. Such optimization analysis is however challenging due to the nanoscale imaging limitations that prevent characterizing this additive phase and thus quantifying its impact on performance. Herein, an additive-phase generation algorithm has been developed to remedy this limitation and identify percolation threshold used to define a minimal additive loading. Improved ionic transport coefficients from reducing additive loading has been then quantified through homogenization calculation, macroscale model fitting, and experimental symmetric cell measurement, with good agreement between the methods. Rate capability test demonstrates capacity improvement at fast charge at the beginning of life, from 37% to 55%, respectively for high and low additive loading during 6C CC charging, in agreement with macroscale model, and attributed to a combination of lower cathode impedance, reduced electrode tortuosity and cathode thickness.

carbon-binder additives↗

DOE OSTI2025

Economic Storage Size Optimization for Electric Vehicle Extreme-Fast Charging Stations

En-route charging infrastructure for electric vehicles is critical to support transportation needs. These charging stations are likely to have high loads and especially sharp peak loads given fast charging capabilities needed to meet transportation schedules. In order to reduce both strain on distribution grid infrastructure and charging station operational costs, many stations are likely to employ behind the meter storage. This paper demonstrates a behind the meter storage sizing optimization that employs an open-source agent-based vehicle behavior model (BEAM) to determine the best sizing across many scenarios. This optimization and analysis is novel in that it examines how storage size impacts not only charging station cost and peak load, but also vehicle queue times. The optimization is also applied across a wide analysis region with sufficient diversity and numbers to provide novel statistical analysis of optimal sizes.

Aka, Julius↗

DOE OSTI2020

Optimized System for On-Route Fast Charging of Battery-Electric Shuttle Buses

Electrifying cars, buses, and trucks is an attractive means of reducing energy use and emissions because it involves more efficient drivetrain components and minimal restructuring of the transportation network. Transit buses, driving fixed routes, help minimize driver range anxiety by properly sizing energy storage systems. A major challenge to fully electrifying transit buses is providing the amount of energy they consume in a day of driving. To enable a full day of operation without charging, batteries need to be large, which could be expensive and heavy. This work utilizes real-world transit bus data used in a battery-electric drivetrain model to co-optimize charger locations, charger power levels, and vehicle battery sizes.

ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2021

Fast multiscale contrast independent preconditioners for linear elastic topology optimization problems

The goal of this work is to present a fast and viable approach for the numerical solution of the high-contrast state problems arising in topology optimization. The optimization process is iterative, and the gradients are obtained by an adjoint analysis, which requires the numerical solution of large high-contrast linear elastic problems with features spanning several length scales. The size of the discretized problems forces the utilization of iterative linear solvers with solution time dependent on the quality of the preconditioner. The lack of clear separation between the scales, as well as the high-contrast, imposes severe challenges on the standard preconditioning techniques. Thus, here we propose new methods for the high-contrast elasticity equation with performance independent of the high-contrast and the multi-scale structure of the elasticity problem. The solvers are based on two-levels domain decomposition techniques with a carefully constructed coarse level to deal with the high-contrast and multi-scale nature of the problem. The construction utilizes spectral equivalence between scalar diffusion and each displacement block of the elasticity problems and, in contrast to previous solutions proposed in the literature, is able to select the appropriate dimension of the coarse space automatically. The new methods inherit the advantages of domain decomposition techniques, such as easy parallelization and scalability. Finally, the presented numerical experiments demonstrate the excellent performance of the proposed methods.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Genetic algorithm-based optimisation of the few-group structure for lead fast reactors analysis

The optimal choice of the few-group structure for full-core transient analyses is still an open issue in reactor physics, especially for fast system like the lead fast reactor. One possible approach to select the group boundaries is represented by heuristic search algorithms, such as evolutionary ones. In this paper, a genetic algorithm coupled with the SIMMER code is employed to determine optimized six-group boundaries for the analysis of the ALFRED reactor. The Serpent Monte Carlo code is adopted to produce both the fine-group cross section library and the fine-group flux, used as a figure of merit to drive the genetic optimisation. The results show that the algorithm is indeed able to find satisfactory solutions that comply with the set objectives and can be reasonably interpreted in light of the underlying physics of the considered core. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2020

A direct transcription-based multiple shooting formulation for dynamic optimization

The growing need for fast and efficient solution techniques for solving dynamic optimization problems is driven by a broad spectrum of applications in scheduling and control. We suggest a novel framework for dynamic optimization that utilizes a multiple shooting “backbone” with discrete rather than continuous subproblems, thereby eliminating need for repeated time-integration. A Lagrangian relaxation (LR)-based decomposition scheme is proposed, which dualizes the state continuity requirements between subproblems and enables parallel solution of the problem. We demonstrate the applicability of our method on two case studies: the Van der Pol oscillator and a batch reactor.

42 ENGINEERING↗

DOE OSTI2020

Online Optimization for Networked Distributed Energy Resources With Time-Coupling Constraints

This paper proposes a Lyapunov optimization-based online distributed (LOOD) algorithmic framework for active distribution networks (ADNs) with numerous photovoltaic inverters and inverter air conditionings (IACs). In the proposed scheme, ADNs can track an active power setpoint reference at the substation in response to transmission-level requests while concurrently minimizing the social utility loss and ensuring the security of voltages. Conventional distributed optimization methods are rarely feasible to track the optimal solutions in fast variable environments using a fine-grained sampling interval where the underlying optimization problem evolves with the iterations of the algorithms. In contrast, based on the framework of online convex optimization (OCO), the developed approach uses a distributed algebraic update to compute the next round decisions relying on the current feedback of measurements. Notably, the time-coupling constraints of IACs are decoupled for online implementation with Lyapunov optimization technique. An incentive scheme is tailored to coordinate the customer-owned assets in lieu of the direct control from network operators. Optimality and convergency are characterized analytically. Finally, we corroborate the proposed method on a modified version of 33-node test feeder. Benchmark tests show that the proposed method is computationally and economically efficient, and outperforming existing algorithms.

active distribution networks↗

DOE OSTI2024

Metric Learning to Accelerate Convergence of Operator Splitting Methods

Recent developments in machine learning have led to promising advances in accelerating the solution of constrained optimization problems. Increasing demand for real-time decision-making capabilities in applications such as artificial intelligence and optimal control has led to a variety of proposed strategies for learning to produce fast solutions to optimization problems. For example, recent works have shown that it is possible to accelerate the convergence of optimization algorithms by learning to select their parameters, such as gradient descent stepsizes. This work proposes a new approach, in which the underlying metric spaces of proximal operator splitting algorithms are learned to maximize convergence rate. While prior works in optimization theory have derived optimal metrics in simple cases, no such result exists for many practical problem forms including general Quadratic Programming (QP). This paper shows how differentiable optimization can enable the end-to-end learning of proximal metrics, enhancing the convergence of proximal algorithms for QP problems beyond what is possible based on known theory. Additionally, the results illustrate a strong connection between the learned proximal metrics and active constraints at the optima, leading to an interpretation in which the predicted proximal metrics can be viewed as a form of active set prediction.

King, Ethan [BATTELLE (PACIFIC NW LAB)]↗

DOE OSTI2020

Optimal charging scheduling and management for a fast-charging battery electric bus system

Herein we discuss how battery electric buses (BEBs) are rapidly being embraced by public transit agencies because of their environmental and economic benefits. To address the problems of limited driving range and time-consuming charging for BEBs, manufacturers have developed rapid on-route charging technology that utilizes typical layovers at terminals to charge buses in operation using high power. With on-route fast-charging, BEBs are as capable as their diesel counterparts in terms of range and operating time. However, on-route fast-charging makes it more challenging to schedule and manage charging events for a BEB system. First, on-route fast-charging may lead to high electricity power demand charges. Second, it may increase electricity energy charges because of charging that occurs during on-peak hours. Without careful charging scheduling and management, on-route fast-charging may significantly increase fuel costs and reduce the economic attractiveness of BEBs. The present study proposes a network modeling framework to optimize the charging scheduling and management for a fast-charging BEB system, effectively minimizing total charging costs. The charging schedule determines when to charge a BEB, while the charging management strategically controls the actual charging power. Charging costs include both electricity demand charges and energy charges. The charging scheduling and management problem is first formulated as a nonlinear nonconvex program with time-continuous variables. A discretizing method and a linear reformulation technique are then adopted to reformulate the model as a linear program, which can be easily solved using off-the-shelf solvers, even for large-scale problems. Finally, the model is demonstrated with extensive numerical studies based on two real-world bus networks. The results demonstrate that the proposed model can effectively determine the optimal charging scheduling and management for a fast-charging BEB system, which carries the potential for use in large-scale real-world bus networks.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2021

Towards an Agent-Based Blackboard System for Reactor Design Optimization

The field of reactor design is rich with opportunities for applications of computational optimization algorithms; these applications can range from preliminary core design to reactor shuffling patterns. Many of these schemes rely on sets of previously generated solutions (sometimes referred to as “generations”) to inform future decisions. While it is important to build upon prior knowledge, this process requires a full generation of solutions to be formed before future solutions can be examined. Rather than relying on a generational scheme to perform an optimization, we propose using an agent-based approach in conjunction with a blackboard framework for performing reactor design optimizations. Utilizing an agent-based approach allows agents to perform tasks independently, while retaining the ability to build off of previous solutions. We develop an agent-based blackboard system (ABBS) for determining the Pareto front (PF) in sodium fast reactor design optimization problems and compared this with the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). Our goal is to evaluate the viability of the ABBS in producing a PF that is comparable with the NSGA-II algorithm. The design space consists of the fuel height, fuel smear, and plutonium fraction in the core, and we seek to minimize the reactivity swing and plutonium mass, while maximizing the burnup. The diversity, coverage, and spread of the PFs generated by the two methods are examined, and the ABBS is able to converge to the same PF as the NSGA-II algorithm. These results show that the ABBS is able to find optimal designs that are similar to those found by the NSGA-II algorithm. We conclude our study by applying the ABBS to the design of a sodium-cooled fast reactor to dispose of weapons-grade plutonium. The ABBS finds a core design that can burn upwards of 17.5 kg of weapons-grade plutonium per year and degrade an additional 195 kg of weapons-grade plutonium per year into non-weapons-grade material.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2023

FAST Low-Energy Beamline Studies: Toward High-Peak 5D Brightness Beams for FAST-GREENS

The FAST beamline is the injector for the planned Gamma-Ray Electron ENhanced Source (GREENS) program, which aims to achieve the demonstration and first application of a high-efficiency, high-average-power free-electron laser at 515 nm. FAST-GREENS requires high 5D peak brightness; transverse normalized projected emittances of 3 mm-mrad and a peak current of 600 A are the minimum beam requirements for the FEL to reach the 10% efficiency goal. In this work, studies of the low-energy section of the FAST beamline are presented toward these ends, including preliminary measurements of beam compression and beam emittance. An effort toward developing a high-fidelity simulation model that could be later optimized for FAST-GREENS is presented.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2022

Optimization of InGaN quantum well interfaces for fast interwell carrier transport and low nonradiative recombination

Efficient high-power operation of light emitting diodes based on InGaN quantum wells (QWs) requires rapid interwell hole transport and low nonradiative recombination. The transport rate can be increased by replacing GaN barriers with that of InGaN. Introduction of InGaN barriers, however, increases the rate of the nonradiative recombination. In this work, we have attempted to reduce the negative impact of the nonradiative recombination by introducing thin GaN or AlGaN interlayers at the QW/barrier interfaces. The interlayers, indeed, reduce the nonradiative recombination rate and increase the internal quantum efficiency by about 10%. Here, the interlayers do not substantially slow down the interwell hole transport; for 0.5 nm Al 0.10 Ga 0.90 N interlayers the transport rate has even been found to increase. Another positive feature of the interlayers is narrowing of the QW PL linewidth, which is attributed to smoother QW interfaces and reduced fluctuations of the QW width.

carrier transport↗

DOE OSTI2021

Modeling a Lead-Cooled Fast Reactor with Thermal Energy Storage using Optimal Dispatch and SAM

Increased contributions from wind and solar energy have helped set the United States on an attainable pathway towards carbon-free energy production. Though renewable energy is pivotal for this goal, saturating the grid with these variable energy sources has its challenges. Resources for wind and solar vary from factors beyond human control, hence the power output from these energy generators doesn’t necessarily match power demand for a specific region at a given moment in time. Solar photovoltaic production has a drastic mismatch since the peaks for power demand and power production are often out of phase: production peaks with available irradiance while demand peaks during the morning and evening hours. This “duck curve” in energy demand, the difference between high and low demand, grows as the grid becomes more saturated with renewable energy providers.

Soto, Gabriel J.↗

DOE OSTI2023

Ultra-fast and sensitive magneto-optical hydrogen sensors using a magnetic nano-cap array

Magnetism in curved nano-geometries has opened a new path to design novel characteristics and phenomena that could greatly impact the future fundamental and applied studies of materials. Here, in this report, a hexagonally-packed array of magnetic nano-caps (or nano-patches, NP) exhibiting unique magnetic anisotropy and optimal nanostructure for fast hydrogen kinetics is explored as a sensing element for the spark-free magnetic-circular-dichroism (MCD) H 2 sensor. The MCD H 2 sensor outperforms the state-of-the-art optical sensors reported to date and satisfies the most challenging performance targets imposed by US Department of Energy. In particular, a Pd 67 Co 33 NP sensor exhibits response time of t 90 < 0.9 s, recovery time of t 10 < 9.0 s over the 1-100 mbar H 2 partial pressure range, and limit of detection (LOD) of ~1 ppm. The LOD improves to <700 ppb, when the signal-to-noise ratio is enhanced by stacking three NP arrays. Using a 30-nm TAF (Teflon AF 2400) polymer coating, the sorption kinetics of the Pd 67 Co 33 /TAF sensor are significantly accelerated, with t 90 < 0.4 s and t 10 < 2.8 s over the same pressure range. When the Pd 67 Co 33 /TAF sensor is further coated with a 100-nm poly(methyl methacrylate) (PMMA) layer, a rapid sorption time of t 90 < 0.5 s, LOD < 1 ppm and excellent sensor accuracy (<2.5% full scale) are maintained, while the sensor obtains strong selectivity against interference gases and moisture and a negligible aging effect. The MCD nano-cap sensor platform may have a great impact on the future deployment of H 2 fuel, H 2 environmental monitoring sensors, and fast proton-based magneto-ionic devices.

Fast and sensitive hydrogen sensors↗