Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization applications”

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,153 records · Page 64

Low profile antennas for MSAT applications

For MSAT applications, a number of different antennas have been designed and investigated. They include low gain omnidirectional antennas and medium gain to high gain directional antennas. The latter include both portable and vehicular antennas. While portable units are desirable to be low profile and low cost, the vehicular antennas have proved to be the most challenging antenna types for the mobile satellite application. The results of our efforts in design of such antennas are described briefly. Low profile designs are emphasized in most cases, and microstrip type radiators are therefore selected. The single radiator provides low gain omnidirectional patterns and is optimized for low cost applications. It provides low gains around 2-6 dBic and is useful mostly for the data transmission. Medium to high gain antennas are developed as arrays of omnidirectional elements. Again, different designs are optimized to meet the needs of different applications. For portable units, the array configuration can be flexible and is optimized for maximum broadside gains. For vehicular units, however the configurations are desirable to be low profile, or compact, and have means for scanning the antenna beam. For simplicity, fixed beam antennas with mechanical beam scan are selected. For these antennas, as well, different designs, having low profile or compact size, are selected and optimized to meet the MSAT gain and G/T requirements.

Shafai, L.↗

Regulation of Renewable Energy Sources to Optimal Power Flow Solutions Using ADMM

This paper considers power distribution systems featuring renewable energy sources (RESs), and develops a distributed optimization method to steer the RES output powers to solutions of AC optimal power flow (OPF) problems. The design of the proposed method leverages suitable linear approximations of the AC-power flow equations, and is based on the Alternating Direction Method of Multipliers (ADMM). Convergence of the RES-inverter output powers to solutions of the OPF problem is established under suitable conditions on the stepsize as well as mismatches between the commanded setpoints and actual RES output powers. In a broad sense, the methods and results proposed here are also applicable to other distributed optimization problem setups with ADMM and inexact dual updates.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DEVELOPMENT AND APPLICATION OF RISK ANALYSIS TOOLKIT FOR PLANT RESOURCE OPTIMIZATION

This paper presents the development of methods and tools that are being designed to optimize plant operations (e.g., maintenance/replacement schedules and optimal maintenance postures for plant components) in a manner that is more cost effective than current approaches and makes better use of available component health and cost data. These methods include both data- and model-based optimization methods. Model-based optimization methods directly include reliability and cost models to determine an optimal plant operational strategy. We consider gradient-based and evolutionary (based on genetic algorithms) optimization methods. The second class of methods target more specific use cases (e.g., project schedule optimization) and are not based on reliability models directly, but they require specific component reliability and cost data. This class of methods is based on variants of the knapsack problem with an aim to determine an optimal project schedule that maximizes the overall NPV. This paper also presents multi-objective methods designed to identify an optimal maintenance posture based on a Pareto frontier analysis. Rather than dictating the “right” tradeoff (i.e., identify the absolute best posture), we show how it is possible to perform a trade space exploration approach (i.e., identify value and costs of several postures and let the analysis account for desired value and cost metrics). This is performed by identifying maintenance postures that maximize value (e.g., system availability) and minimize operational costs, i.e., the Pareto frontier in a value-cost trade space. For all these methods we present detailed applicative examples that show their validity from a decision-making perspective.

97 - MATHEMATICS AND COMPUTING↗

Machine Learning Optimization of p-Type Transparent Conducting Films

p-Type transparent conducting materials (p-TCMs) are important components of optoelectronic devices including solar cells, photodetectors, displays, and flexible sensors. Cu–Zn–S thin films prepared by chemical bath deposition (CBD) can have both high transparency in the visible range (>80%) as well as excellent hole conductivity (>1000 S cm –1 ). However, the interplay between the deposition parameters in the CBD process (metal and sulfur precursor concentrations, temperature, pH, complexing agents, etc.) creates a multidimensional parameter space such that optimization for a specific application is challenging and time-consuming. Here we show that strategic design of experiment combined with machine learning (ML) allows for the efficient optimization of p-TCM performance. The approach is guided by a figure of merit (FOM) calculated from the film conductivity and optical transmission in the desired spectral range. A specific example is shown using two steps of optimization using a selected subset of four experimental CBD factors. The ML model is based on support vector regression employing a radial basis function as the kernel function. 10-fold cross-validation was performed to mitigate overfitting. After the first round of optimization, predicted areas in the parameter space with maximal FOMs were selected for a second round of optimization. Films with optimal FOMs were incorporated into heterojunction solar cells and transparent photodiodes. Here, the optimization approach shown here will be generally applicable to any materials synthesis process with multiple parameters.

14 SOLAR ENERGY↗

Unsteady Adjoint of Pressure Loss for a Fundamental Transonic Turbine Vane

High-fidelity simulations, e.g., large eddy simulation (LES), are often needed for accurately predicting pressure losses due to wake mixing and boundary layer development in turbomachinery applications. An unsteady adjoint of high-fidelity simulations is useful for design optimization in such aerodynamic applications. In this paper, we present unsteady adjoint solutions using a large eddy simulation model for an inlet guide vane from von Karman Institute (VKI) using aerothermal objectives. The unsteady adjoint method is effective in capturing the gradient for a short time interval aerothermal objective, whereas the method provides diverging gradients for long time-averaged thermal objectives. As the boundary layer on the suction side near the trailing edge of the vane is turbulent, it poses a challenge for the adjoint solver. The chaotic dynamics cause the adjoint solution to diverge exponentially from the trailing edge region when solved backward in time. This results in the corruption of the sensitivities obtained from the adjoint solutions. An energy analysis of the unsteady compressible Navier–Stokes adjoint equations indicates that adding artificial viscosity to the adjoint equations can dissipate the adjoint energy while potentially maintaining the accuracy of the adjoint sensitivities. Analyzing the growth term of the adjoint energy provides a metric for identifying the regions in the flow where the adjoint term is diverging. Results for the vane obtained from simulations performed on the Titan supercomputer are demonstrated.

Engineering↗

Design of structure/control systems with transient response constraints exhibiting relative minima

Structural optimization problems involving dynamic behavior constraints often exhibit nonconvex design spaces. The direct application of a global optimization algorithm requires a large number of function evaluations which in term require a large number of dynamic structural analyses. This work presents a strategy aimed at finding the global optimum for problems with transient dynamic behavior constraints based on approximation concepts. The method consists of generating and solving a sequence of approximate problems using a global optimizer. The approximations are explicit and capture the inherent nonconvexity of the exact functions. A simple example problem is presented.

Sepulveda, A. E.↗

Application of modern control theory to the design of optimum aircraft controllers

A procedure is described for synthesis of optimal aircraft control systems by application of the concepts of optimal control theory to time-invariant linear systems with quadratic performance criteria. Essential in this synthesis procedure is the solution of the Riccati matrix equation which results in a constant linear feedback control law for an output regulator which maintains a plant in an equilibrium in the presence of impulse disturbances. An algorithm is derived for designing maneuverable output regulators with selected state variables for feedback.

Power, L. J.↗

Insights into Constraining Rate Coefficients in Fuel Oxidation Mechanisms Using Genetic Algorithm Optimization

Accurate fuel oxidation mechanisms can enable predictive capabilities that aid in advancing combustion technologies. High-level computational kinetics can yield reasonable rate coefficients with uncertainties, in some cases, below a factor of 2. Computed rate coefficients can be constrained further by optimizing against experimental data. Here, we explore the application of genetic algorithm (GA) optimization to constrain computed rate coefficients in complex fuel oxidation mechanisms in conjunction with temperature-dependent species mole fractions from jet-stirred reactor (JSR) measurements. Cyclohexane is a model candidate for understanding the reactivity of cyclic fuels. In this work, we optimize the rate coefficients of the most recent literature cyclohexane mechanism, which incorporates theoretically computed rate coefficients for the reaction networks stemming from the first and second O 2 addition pathways, against the experimental results of two separate literature JSR studies. Optimization consistency is evaluated by carrying out three GA optimizations: fitting to the temperature-dependent species mole fractions in each JSR experiment separately and simultaneously fitting the species mole fractions in both experiments. Local sensitivity analyses are used to identify five influential low-temperature oxidation reactions for optimization. Although the three optimizations do not yield identical rate coefficients, the direction of change in all five rate coefficients is consistent among the three optimizations. Performance of the models from the three optimizations is assessed against literature ignition delay times with differences in the level of agreement observed among the different optimizations. In conclusion, comparisons are made with our recent optimization work of a cyclopentane oxidation master-equation model against time-resolved species concentrations, and insights and improvements of the strategy for constraining rate coefficients using GA optimization are discussed.

33 ADVANCED PROPULSION SYSTEMS↗

Optimal Pulse Processing, Pile-Up Decomposition, and Applications of Silicon Drift Detectors at LCLS

Silicon drift detectors (SDDs) revolutionized spectroscopy in fields as diverse as geology and dentistry. For a subset of experiments at ultrafast, X-ray free-electron lasers (FELs), SDDs can make substantial contributions. Often the unknown spectrum is interesting, carrying science data, or the background measurement is useful to identify unexpected signals. Many measurements involve only several discrete photon energies known a priori, allowing single-event decomposition of pile-up and spectroscopic photon counting. We designed a pulse function and demonstrated that the signal amplitude (i.e., proportional to the detected energy and obtained from fitting with the pulse function), rise time, and pulse height are interrelated, and at short peaking times, the pulse height and pulse area are not optimal estimators for detected energy; instead, the signal amplitude and rise time are obtained for each pulse by fitting, thus removing the need for pulse shaping. By avoiding pulse shaping, rise times of tens of nanoseconds resulted in reduced pulse pile-up and allowed decomposition of remaining pulse pile-up at photon separation times down to hundreds of nanoseconds while yielding time-of-arrival information with the precision of 10 ns. Waveform fitting yields simultaneously high energy resolution and high counting rates (two orders of magnitude higher than current digital pulse processors). At pulsed sources or high photon rates, photon pile-up still occurs. We showed that pile-up spectrum fitting is relatively simple and preferable to pile-up spectrum deconvolution. We then developed a photon pile-up statistical model for constant intensity sources, extended it to variable intensity sources (typical for FELs), and used it to fit a complex pileup spectrum. We subsequently developed a Bayesian pile-up decomposition method that allows decomposing pile-up of single events with up to six photons from six monochromatic lines with 99% accuracy. The usefulness of SDDs will continue into the X-ray FEL era of science. Their successors, the ePixS hybrid pixel detectors, already offer hundreds of pixels, each with a similar performance to an SDD, in a compact, robust and affordable package.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Constrained variational optimization of counting-time allocation in sequential scattering measurements: Application to Bonse–Hart USANS

Sequential scattering measurements are often performed under a fixed experimental-time budget, even though the expected count rate varies strongly across the measured coordinate. When the dwell time at each measurement position can be controlled independently, this variation creates a general resource-allocation problem: how should the available time be distributed to minimize the uncertainty of the reconstructed profile? We formulate this problem as a constrained variational optimization for measurements governed by Poisson counting statistics. When each measurement is treated independently, minimizing the averaged squared relative uncertainty yields an inverse-square-root intensity allocation. The formulation is then generalized to include correlations between neighboring measurements and an instrumental resolution operator, leading to an allocation criterion that equalizes the marginal reduction in posterior uncertainty per unit measurement time. Bonse–Hart ultra-small-angle neutron scattering (USANS), in which reciprocal space is sampled sequentially through analyzer-angle stepping, provides an experimentally grounded application. Computational benchmarking shows that the optimized allocation outperforms uniform-time and constant-relative-error strategies, while application to an experimentally measured graphite USANS profile from the Spallation Neutron Source, using Poisson resampling under alternative schedules, demonstrates how counting time should be redistributed toward weak-intensity regions under an identical total duration. The resulting framework applies to sequential scattering and related scanning measurements whenever local dwell times are adjustable and directly determine the measurement uncertainties, and when the relevant correlation and instrumental-response models are available.

Tung, Chi-Huan [ORNL] (ORCID:0000000221972074)↗

The impacts of convex piecewise linear cost formulations on AC optimal power flow

Despite strong connections through shared application areas, research efforts on power market optimization (e.g., unit commitment) and power network optimization (e.g., optimal power flow) remain largely independent. A notable illustration of this is the treatment of power generation cost functions, where nonlinear network optimization has largely used polynomial representations and market optimization has adopted piecewise linear encodings. This work combines state-of-the-art results from both lines of research to understand the best mathematical formulations of the nonlinear AC optimal power flow problem with piecewise linear generation cost functions. An extensive numerical analysis of non-convex models, linear approximations, and convex relaxations across fifty-four realistic test cases illustrates that nonlinear optimization methods are surprisingly sensitive to the mathematical formulation of piecewise linear functions. The results indicate that a poor formulation choice can slow down algorithm performance by a factor of ten, increasing the runtime from seconds to minutes. Furthermore, these results provide valuable insights into the best formulations of nonlinear optimal power flow problems with piecewise linear cost functions, an important step towards building a new generation of energy markets that incorporate the nonlinear AC power flow model.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

AI Driven Optimization of Public Transit

This project explores the application of AI-driven methods to optimize public transit operations for the Chattanooga Area Regional Transportation Authority (CARTA). By leveraging data analytics, machine learning, and predictive modeling, the initiative seeks to enhance system efficiency, improve rider experience, and support sustainability goals. This research, supported by the National Science Foundation and the U.S. Department of Energy, integrates real-time transit data with advanced computational tools to inform decision-making, optimize routes, and balance operational demands. The work exemplifies a forward-looking model for mid-sized cities aiming to modernize mobility systems through intelligent technology integration.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Optimization of Localized High Concentration Electrolytes (LHCE) for Li||LiCoO 2 and Si|| LiCoO 2 Batteries used in Consumer Electronics Applications (Final Report for I3T Project 75934)

This project will optimize localized high concentration electrolyte (LHCE) for Li/LCO and Si/LCO batteries for consumer electronics applications, including select the best solvent and diluent, optimize the ratios of the solvents and the salt concentration. Results will be demonstrated not only in both coin cells, but also in pouch cells, which is required for large-scale commercial applications. This work can provide better understanding that would also benefit other LMB projects, including Li/NMC and Li/S batteries for electric vehicle applications. In the history of rechargeable batteries, all batteries have been first used in small scale consumer electronics, then eventually penetrate to large scale applications such as electrical vehicle or grid. We believe this development route will also be true for LMBs. By developing the best electrolyte for Li/LCO and Si/LCO chemistry, we will not only get the early market entry in consumer electronics, but we can also accumulate experience on the practical application of LMBs which can be used to further develop other types of LMBs for EV and other large-scale applications pursued by DOE.

25 ENERGY STORAGE↗

Python in the NERSC Exascale Science Applications Program for Data

We describe a new effort at the National Energy Re- search Scientific Computing Center (NERSC) in performance analysis and optimization of scientific Python applications targeting the Intel Xeon Phi (Knights Landing, KNL) many- core architecture. The Python-centered work outlined here is part of a larger effort called the NERSC Exascale Science Applications Program (NESAP) for Data. NESAP for Data focuses on applications that process and analyze high-volume, high-velocity data sets from experimental/observational science (EOS) facilities supported by the US Department of Energy Office of Science. We present three case study applications from NESAP for Data that use Python. These codes vary in terms of “Python purity” from applications developed in pure Python to ones that use Python mainly as a convenience layer for scientists without expertise in lower level programming lan- guages like C, C++ or Fortran. The science case, requirements, constraints, algorithms, and initial performance optimizations for each code are discussed. Our goal with this paper is to contribute to the larger conversation around the role of Python in high-performance computing today and tomorrow, highlighting areas for future work and emerging best practices

Ronaghi, Zahra↗

Superelastic Ball Bearings: Materials and Design to Avoid Mounting and Dismounting Brinell Damage in an Inaccessible Press-Fit Application-: Design Approach - I

Ball bearings require proper fit and installation into machinery structures (onto shafts and into bearing housings) to ensure optimal performance. For some applications, both the inner and outer race must be mounted with an interference fit and care must be taken during assembly and disassembly to avoid placing heavy static loads between the balls and races otherwise Brinell dent type damage can occur. In this paper, a highly dent resistant superelastic alloy, 60NiTi, is considered for rolling element bearing applications that encounter excessive static axial loading during assembly or disassembly. A small (R8) ball bearing is designed for an application in which access to the bearing races to apply disassembly tools is precluded. First Principles analyses show that by careful selection of materials, raceway curvature and land geometry, a bearing can be designed that allows blind assembly and disassembly without incurring raceway damage due to ball denting. Though such blind assembly applications are uncommon, the availability of bearings with unusually high static load capability may enable more such applications with additional benefits, especially for miniature bearings.

tribology↗

Using Likwid and Byfl to Benchmark Hardware Performance

This paper outlines a benchmarking study conducted during my internship at LANL, focusing on CPU (Computer Processing Unit) and program performance assessment. The primary goal was to gather memory access data using three methods across five polybench kernels The data gathered would then be used to compare and contrast to one another and calculate operational intensity for performance comparisons. Benchmarking tools like Byfl and Likwid were employed, with Byfl offering hardware-independent data through LLVM compiler communication and Likwid directly interacting with computer hardware. The study considered various benchmarking factors, including optimization levels, Big O notation ((n)), CPU diversity and specific kernel equations. Big O notation was utilized to simplify code complexity, with detailed breakdwons of operations and memory components for each polybench application. Specific O(n) equations enabled nuanced kernel compariosns, facilitating the identification of performance variations. CPU efficiency assessments were conducted using Likwid tests on two CPUs. The central focus on code optimization aimed at achieving higher speeds and reduced memory usage through streamlined code. Future work propsoes creating a roofline model, synthesizing benchmarking data into a comprehensive data graph to assist in optimizing code and improving hardware performance. The potential impact on the laboratory or national mission was underscored, emphasizing the importance of optimizing applications and hardware to conserve resources and accelerate program execution. The specific relevance to LANL’s operations in math-intensive fields such as Nuclear Fission, Space Exploration, and Nanotechnology highlights the necessity of efficient benchmarking for resource conservation and proram speed. Overall, this study contributes to the understanding of CPU and program performance, providing insights for future optimization efforts in a laboratory setting

97 MATHEMATICS AND COMPUTING↗