Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational 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.

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

At least 1,405 records · Page 78

Achieving stress-constrained topological design via length scale control

A new suite of computational procedures for stress-constrained continuum topology optimization is presented. In contrast to common approaches for imposing stress constraints, herein it is proposed to limit the maximum stress by controlling the length scale of the optimized design. Several procedures are formulated based on the treatment of the filter radius as a design variable. This enables to automatically manipulate the minimum length scale such that stresses are constrained to the allowable value, while the optimization is driven to minimizing compliance under a volume constraint – without any direct constraints on stresses. Numerical experiments are presented that incorporate the following : 1) Global control over the filter radius that leads to a uniform minimum length scale throughout the design; 2) Spatial variation of the filter radius that leads to local manipulation of the minimum length according to stress concentrations; and 3) Combinations of the two above. The optimized designs provide high-quality trade-offs between compliance, stress and volume. From a computational perspective, the proposed procedures are efficient and simple to implement: essentially, stress-constrained topology optimization is posed as a minimum compliance problem with additional treatment of the length scale.

42 ENGINEERING↗

Performance of particle in cell methods on highly concurrent computational architectures

Particle in cell (PIC) methods are effective in computing Vlasov-Poisson system of equations used in simulations of magnetic fusion plasmas. PIC methods use grid based computations, for solving Poisson’s equation or more generally Maxwell’s equations, as well as Monte-Carlo type methods to sample the Vlasov equation. The presence of two types of discretizations, deterministic field solves and Monte-Carlo methods for the Vlasov equation, pose challenges in understanding and optimizing performance on today large scale computers which require high levels of concurrency. These challenges arises from the need to optimize two very different types of processes and the interactions between them. Modern cache based high-end computers have very deep memory hierarchies and high degrees of concurrency which must be utilized effectively to achieve good performance. The effective use of these machines requires maximizing concurrency by eliminating serial or redundant work and minimizing global communication. A related issue is minimizing the memory traffic between levels of the memory hierarchy because performance is often limited by the bandwidths and latencies of the memory system. This paper discusses some of the performance issues, particularly in regard to parallelism, of PIC methods. The gyrokinetic toroidal code (GTC) is used for these studies and a new radial grid decomposition is presented and evaluated. Scaling of the code is demonstrated on ITER sized plasmas with up to 16K Cray XT3/4 cores.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Performance of particle in cell methods on highly concurrent computational architectures

Particle in cell (PIC) methods are effective in computing Vlasov-Poisson system of equations used in simulations of magnetic fusion plasmas. PIC methods use grid based computations, for solving Poisson’s equation or more generally Maxwell’s equations, as well as Monte-Carlo type methods to sample the Vlasov equation. The presence of two types of discretizations, deterministic field solves and Monte-Carlo methods for the Vlasov equation, pose challenges in understanding and optimizing performance on today large scale computers which require high levels of concurrency. These challenges arises from the need to optimize two very different types of processes and the interactions between them. Modern cache based high-end computers have very deep memory hierarchies and high degrees of concurrency which must be utilized effectively to achieve good performance. The effective use of these machines requires maximizing concurrency by eliminating serial or redundant work and minimizing global communication. A related issue is minimizing the memory traffic between levels of the memory hierarchy because performance is often limited by the bandwidths and latencies of the memory system. This paper discusses some of the performance issues, particularly in regard to parallelism, of PIC methods. The gyrokinetic toroidal code (GTC) is used for these studies and a new radial grid decomposition is presented and evaluated. Scaling of the code is demonstrated on ITER sized plasmas with up to 16K Cray XT3/4 cores.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Improving Parallel I/O Performance with Data Layout Awareness

Parallel applications can benefit greatly from massive computational capability, but their performance suffers from large latency of I/O accesses. The poor I/O performance has been attributed as a critical cause of the low sustained performance of parallel computing systems. In this study, we propose a data layout-aware optimization strategy to promote a better integration of the parallel I/O middleware and parallel file systems, two major components of the current parallel I/O systems, and to improve the data access performance. We explore the layout-aware optimization in both independent I/O and collective I/O, two primary forms of I/O in parallel applications. We illustrate that the layout-aware I/O optimization could improve the performance of current parallel I/O strategy effectively. The experimental results verify that the proposed strategy could improve parallel I/O performance by nearly 40% on average. The proposed layout-aware parallel I/O has a promising potential in improving the I/O performance of parallel systems.

99 GENERAL AND MISCELLANEOUS↗

Final Report: Super Instruction Architecture for Scalable Parallel Computations

The most advanced methods for reliable and accurate computation of the electronic structure of molecular and nano systems are the coupled-cluster techniques. These high-accuracy methods help us to understand, for example, how biological enzymes operate and contribute to the design of new organic explosives. The ACES III software provides a modern, high-performance implementation of these methods optimized for high performance parallel computer systems, ranging from small clusters typical in individual research groups, through larger clusters available in campus and regional computer centers, all the way to high-end petascale systems at national labs, including exploiting GPUs if available. This project enhanced the ACESIII software package and used it to study interesting scientific problems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Revisiting Theoretical Tools and Approaches for the Valorization of Recalcitrant Lignocellulosic Biomass to Value-Added Chemicals

Biorefinery processes for converting lignocellulosic biomass to fuels and chemicals proceed via an integrated series of steps. Biomass is first pretreated and deconstructed using chemical catalysts and/or enzymes to liberate sugar monomers and lignin fragments. Deconstruction is followed by a conversion step in which engineered host organisms assimilate the released sugar monomers and lignin fragments, and produce value-added fuels and chemicals. Over the past couple of decades, a significant amount of work has been done to develop innovative biomass deconstruction and conversion processes that efficiently solubilize biomass, separate lignin from the biomass, maximize yields of bioavailable sugars and lignin fragments and convert the majority of these carbon sources into fuels, commodity chemicals, and materials. Herein, we advocate that advanced in silico approaches provide a theoretical framework for developing efficient processes for lignocellulosic biomass valorization and maximizing yields of sugars and lignin fragments during deconstruction and fuel and chemical titers during conversion. This manuscript surveys the latest developments in lignocellulosic biomass valorization with special attention given to highlighting computational approaches used in process optimization for lignocellulose pretreatment; enzyme engineering for enhanced saccharification and delignification; and prediction of the genome modification necessary for desired pathway fine-tuning to upgrade products from biomass deconstruction into value-added products. Physics-based modeling approaches such as density functional theory calculations and molecular dynamics simulations have been most impactful in studies aimed at exploring the molecular level details of solvent-biomass interactions, reaction mechanisms occurring in biomass-solvent systems, and the catalytic mechanisms and engineering of enzymes involved in biomass degradation. More recently, with ever increasing amounts of data from, for example, advanced mutli-omics experiments, machine learning approaches have begun to make important contributions in synthetic biology and optimization of metabolic pathways for production of biofuels and chemicals.

09 BIOMASS FUELS↗

Toward Molecular Catalysts by Computer

Rational design of molecular catalysts requires a systematic approach to designing ligands with specific functionality and precisely tailored electronic and steric properties. It then becomes possible to devise computer protocols to predict accurately the required properties and ultimately to design catalysts by computer. In this account we first review how thermodynamic properties such as oxidation-reduction potentials (E0), acidities (pKa), and hydride donor abilities (ΔGH-) form the basis for a systematic design of molecular catalysts for reactions that are critical for a secure energy future (hydrogen evolution and oxidation, oxygen and nitrogen reduction, and carbon dioxide reduction). We highlight how density functional theory allows us to determine and predict these properties within “chemical” accuracy (~ 0.06 eV for redox potentials, ~ 1 pKa unit for pKa values, and ~ 1.5 kcal/mol for hydricities). These quantities determine free energy maps and profiles associated with catalytic cycles, i.e. the relative energies of intermediates, and help us distinguish between desirable and high-energy pathways and mechanisms. Good catalysts have flat profiles that avoid high activation barriers due to low and high energy intermediates. We illustrate how the criterion of a flat energy profile lends itself to the prediction of design points by computer for optimum catalysts. This research was carried out in the Center for Molecular Electro-catalysis, an Energy Frontier Research Center funded by the U.S. Department of Energy (DOE), Office of Science, Office of Basic Energy Sciences. Pacific Northwest National Laboratory (PNNL) is operated for the DOE by Battelle.

acidity↗

RLScheduler: An Automated HPC Batch Job Scheduler Using Reinforcement Learning

Today’s high-performance computing (HPC) platforms are still dominated by batch jobs. Accordingly, effective batch job scheduling is crucial to obtain high system efficiency. Existing HPC batch job schedulers typically leverage heuristic priority functions to prioritize and schedule jobs. But, once configured and deployed by the experts, such priority functions can hardly adapt to the changes of job loads, optimization goals, or system settings, potentially leading to degraded system efficiency when changes occur. To address this fundamental issue, we present RLScheduler, an automated HPC batch job scheduler built on reinforcement learning. RLScheduler relies on minimal manual interventions or expert knowledge, but can learn high-quality scheduling policies via its own continuous ‘trial and error’. We introduce a new kernel-based neural network structure and trajectory filtering mechanism in RLScheduler to improve and stabilize the learning process. Through extensive evaluations, we confirm that RLScheduler can learn high-quality scheduling policies towards various workloads and various optimization goals with relatively low computation cost. Moreover, we show that the learned models perform stably even when applied to unseen workloads, making them practical for production use.

Zhang, Di↗

Final Report: Main Group Element Chemistry in Service of Hydrogen Storage and Activation

Replacing combustion of carbon-based fuels with alternative energy sources that have minimal environmental impact is one of the grand scientific and technological challenges of the early 21st century. Not only is it critical to capture energy from new, renewable sources, it is also necessary to store the captured energy efficiently and effectively for use at the point of service when and where it is needed, which may not be collocated with the collection site. There are many potential storage media but we focus on the storage of energy in chemical bonds. It is more efficient to store energy on a per weight basis in chemical bonds. This is because it is hard to pack electrons into small volumes with low weight without the use of chemical bonds. The focus of the project was the development of new chemistries to enable DOE to meet its technical objectives for hydrogen storage using chemical hydrogen storage systems. We provided computational chemistry support in terms of thermodynamics, kinetics, and properties prediction in support of the experimental efforts of the DOE Center of Excellence for Chemical Hydrogen Storage. The goal of the Center is to store energy in chemical bonds involving hydrogen atoms. Once the hydrogen is stored in a set of X-H/Y-H bonds, the hydrogen has to be easily released and the depleted fuel regenerated very efficiently. This differs substantially from our current use of fossil fuel energy sources where the reactant is converted to energy plus CO2 (coal) or CO2 and H2O (gasoline, natural gas), which are released into the atmosphere. In future energy storage scenarios, the spent fuel will be captured and the energy storage medium regenerated. This places substantial additional constraints on the chemistry. The goal of the computational chemistry work was to reduce the time to design new materials and develop materials that meet the 2010 and 2015 DOE objectives in terms of weight percent, volume, release time, and regeneration ability. This goal was met in terms of reducing the number of costly experiments and helping to focus the experimental effort on the potentially optimal targets. We have used computational chemistry approaches to predict the thermodynamic properties of a wide range of compounds containing boron, nitrogen, hydrogen, and other elements as appropriate including carbon. These calculations were done in most cases with high level molecular orbital theory methods that have small error bars on the order of ± 1 to 2 kcal/mol. The results were used to benchmark more approximate methods such as density functional theory for larger systems and for database development. We predicted reliable thermodynamics for thousands of compounds for release and regeneration schemes to aid/guide materials design and process design and simulation. These are the first reliable computed values for these compounds and for many represent the only available values. Overall, the computational results have provided us with new insights into the chemistry of main group and organic-base chemical hydrogen systems from the release of hydrogen to the regeneration of spent fuel. A number of experimental accomplishments were also made in this project. The experimental work on hydrogen storage materials centered on activated polarized σ- or π-bonded frameworks that hold the potential for ready dihydrogen activation, uptake, and eventually release. To this end, a large number of non-traditional valence systems including carbenes, cyanocarbons, and C-B and and B-N systems were synthesized and examined. During the course of these studies an important lead arose from the novel valency of a class of stable organic singlet bi-radical systems. A synthetic strategy to an “endless” hydrogen storage polymer has been developed based on our cyanocarbon chemistry. A key issue with the synthetic efforts was being able to link the kinetics of release with the size of the substituents as it was difficult to develop a low molecular weight molecule with the right kinetics. A novel hydrogen activation process has been developed which showed that Lewis acid-base pairs need not be “frustrated” in their reactivity towards activating H2. Reaction can occur at temperatures as low as -80 ºC. We established that the interaction of H2 with the electrophile is a key step in the activation process.

08 HYDROGEN↗

Classical Preoptimization Approach for ADAPT-VQE: Maximizing the Potential of High-Performance Computing Resources to Improve Quantum Simulation of Chemical Applications

The ADAPT-VQE algorithm is a promising method for generating a compact ansatz based on derivatives of the underlying cost function, and it yields accurate predictions of electronic energies for molecules. In this work, we report the implementation and performance of ADAPT-VQE with our recently developed sparse wave function circuit solver (SWCS) in terms of accuracy and efficiency for molecular systems with up to 52 spin orbitals. The SWCS can be tuned to balance computational cost and accuracy, which extends the application of ADAPT-VQE for molecular electronic structure calculations to larger basis sets and a larger number of qubits. Using this tunable feature of the SWCS, we propose an alternative optimization procedure for ADAPT-VQE to reduce the computational cost of the optimization. Furthermore, by preoptimizing a quantum simulation with a parametrized ansatz generated with ADAPT-VQE/SWCS, we aim to utilize the power of classical high-performance computing in order to minimize the work required on noisy intermediate-scale quantum hardware, which offers a promising path toward demonstrating quantum advantage for chemical applications.

ADAPT-VQE↗

Quantum Optimization: Potential, Challenges, and the Path Forward

Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization being one of the most pronounced domains. Across computer science and physics, there are a number of algorithmic approaches, often with little linkage. This is further complicated by the fragmented nature of the field of mathematical optimization, where major classes of optimization problems, such as combinatorial optimization, convex optimization, non-convex optimization, and stochastic extensions, have devoted communities. With these aspects in mind, this work draws on multiple approaches to study quantum optimization. Provably exact versus heuristic settings are first explained using computational complexity theory — highlighting where quantum advantage is possible in each context. Then, the core building blocks for quantum optimization algorithms are outlined to subsequently define prominent problem classes and identify key open questions that, if answered, will advance the field. The effects of scaling relevant problems on noisy quantum devices are also outlined in detail, alongside meaningful benchmarking problems. We underscore the importance of benchmarking by proposing clear metrics to conduct appropriate comparisons with classical optimization techniques. Lastly, we highlight two domains – finance and sustainability – as rich sources of optimization problems that could be used to benchmark, and eventually validate, the potential real-world impact of quantum optimization.

97 MATHEMATICS AND COMPUTING↗

Multipoint Aerostructural Optimization of Wind Turbine Rotors Using a Coupled Blade‐Resolved Aerostructural Solver

Physics‐based design optimization workflows thread the needle between computational cost limitations and simulation complexity, often compromising between modeling detail and the range of operating design conditions. Multipoint aerostructural optimization of wind turbine rotors has so far been confined to low‐fidelity analyses or to high‐fidelity studies with simplified structural models, leaving the most complex design trade‐offs unexplored. We close this gap by performing the first tightly coupled gradient‐based multipoint aerostructural rotor optimization using 3D aerodynamic and structural solvers with discrete coupled adjoints. The optimizer simultaneously varies blade planform, airfoil shapes, and structural thickness through more than 270 design variables, minimizing a weighted combination of rotor mass and power across multiple wind speeds. Applied to a modified DTU 10‐MW benchmark under conservative structural and aerodynamic constraints, our multipoint optimization reduces rotor mass by up to 36% and increases power by 12%–15% across the main operating conditions; biasing the objective toward power yields power gains up to 18% and a 17% mass reduction. For a nominal wind distribution, 3‐point rotor designs accounting for low RPM and high thrust conditions capture dominant trade‐offs and outperform single‐point designs. Adding two off‐design points changes individual‐condition power by less than 3% but leaves the weighted average within 0.5%, and the mass‐power bias has a stronger effect on the final design than the operating‐point weighting itself. Our framework extends naturally to richer load cases and site‐specific wind distributions, providing a basis for high‐fidelity multipoint design earlier in industrial workflows.

17 WIND ENERGY↗

Impulsive Control for Continuous-Time Markov Decision Processes: A Linear Programming Approach

In this paper, we investigate an optimization problem for continuous-time Markov decision processes with both impulsive and continuous controls. We consider the so-called constrained problem where the objective of the controller is to minimize a total expected discounted optimality criterion associated with a cost rate function while keeping other performance criteria of the same form, but associated with different cost rate functions, below some given bounds. Our model allows multiple impulses at the same time moment. The main objective of this work is to study the associated linear program defined on a space of measures including the occupation measures of the controlled process and to provide sufficient conditions to ensure the existence of an optimal control.

97 MATHEMATICS AND COMPUTING↗

Computer Vision-Enabled Smart Traffic Monitoring for Sustainable Transportation Management

Transportation accounts for a significant portion of total global energy consumption. Excessive energy consumption usually occurs in urban traffic environments with congestion and travel delays. With the advancement of remote sensing and computer vision technologies, real-time traffic conditions can be monitored. Therefore, sustainable transportation management strategies can be developed to optimize the overall energy and environment performance and reduce congestion and emissions. This work presents a smart traffic monitoring system based on remote camera sensors. Real-time and historical traffic conditions at the US Department of Energy’s Oak Ridge National Laboratory (ORNL) were monitored and analyzed to develop optimal transportation management strategies for sustainability. Computer vision algorithms were developed and applied to process the real-time camera data to obtain complete traffic information across the ORNL campus. Weeks of historical data were collected and processed to analyze the traffic and identify bottlenecks. The proposed traffic monitoring and management approach can be applied and extended to benefit other campuses or urban areas.

Shao, Yunli↗

Outcomes and Insights From Simplified Analytic Trajectory Optimization for a Tethered Underwater Kite

This letter formulates and solves a periodic trajectory optimization problem for a tethered underwater kite. The goal is to maximize the average mechanical power harvested by the kite. The type of kite considered in this letter extracts electricity from ocean currents by moving cross-current as its reel away from its base station, and consumes electricity to reel back. The problem of optimizing this kite’s trajectory is challenging due to the high dimensionality and nonlinearity of its dynamics. To tackle this challenge, the literature often separates the problem into two subproblems focusing on optimizing the cross-current and the reel-in/reel-out components of the trajectory, respectively, which may be sub-optimal. In contrast, this letter solves for the combined cross-current and reel-in/reel-out trajectory by linearizing the dynamics of the kite around a zero-power reference equilibrium trajectory in spherical coordinates. This allows the trajectory optimization problem to be solved analytically for simple sinusoidal input perturbations from equilibrium. Here we use linear quadratic regulation to enable the nonlinear kite model to track the optimized trajectory. The result is a computationally efficient approach that achieves an attractive Loyd factor of 19.9%, while providing important insights into the nature of the optimal trajectory.

42 ENGINEERING↗

Piston Bowl Geometry Effects on Gasoline Compression Ignition in a Heavy-Duty Diesel Engine

A design optimization campaign was conducted to search for improved combustion profiles that enhance gasoline compression ignition in a heavy-duty diesel engine with a geometric compression ratio of 17.3. A large-scale design of experiments approach was used for the optimization, employing three-dimensional computational fluid dynamics simulations. The main parameters explored include geometric features, injector specifications, and swirl motion. Both stepped-lip and re-entrant bowls were included in order to assess their respective performance implications. A total of 256 design candidates were prepared using the software package CAESES for automated and simultaneous geometry generation and combustion recipe perturbation. The design optimization was conducted for three engine loads representing light to medium load conditions. The design candidates were evaluated for fuel efficiency, emissions, fuel-air mixing, and global combustion behavior. Simulation results showed that the optimum designs were all stepped-lip bowls, due to improvements in fuel-air mixing, as well as reduced heat loss and emissions formation. Improvements in indicated specific fuel consumption of up to 3.2% were achieved while meeting engine-out NOx emission targets of 1-1.5 g/kW center dot h. Re-entrant bowls performed worse compared to the baseline design, and significant performance variations occurred across the load points. Specifically, the re-entrant bowls were on par with the stepped-lip bowls under light load conditions, but significant deteriorations occurred under higher load conditions. As a final task, selected optimized designs were then evaluated under full-load conditions.

CFD↗

Information geometry of Gaussian channels

We define a local Riemannian metric tensor in the manifold of Gaussian channels and the distance that it induces. We adopt an information-geometric approach and define a metric derived from the Bures-Fisher metric for quantum states. The resulting metric inherits several desirable properties from the Bures-Fisher metric and is operationally motivated by distinguishability considerations: It serves as an upper bound to the attainable quantum Fisher information for the channel parameters using Gaussian states, under generic constraints on the physically available resources. Our approach naturally includes the use of entangled Gaussian probe states. We prove that the metric enjoys some desirable properties like stability and covariance. As a by-product, we also obtain some general results in Gaussian channel estimation that are the continuous-variable analogs of previously known results in finite dimensions. We prove that optimal probe states are always pure and bounded in the number of ancillary modes, even in the presence of constraints on the reduced state input in the channel. This has experimental and computational implications. It limits the complexity of optimal experimental setups for channel estimation and reduces the computational requirements for the evaluation of the metric: Indeed, we construct a converging algorithm for its computation. We provide explicit formulas for computing the multiparametric quantum Fisher information for dissipative channels probed with arbitrary Gaussian states and provide the optimal observables for the estimation of the channel parameters (e.g., bath couplings, squeezing, and temperature).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Compiler generation and autotuning of communication-avoiding operators for geometric multigrid

This paper describes a compiler approach to introducing communication-avoiding optimizations in geometric multigrid (GMG), one of the most popular methods for solving partial differential equations. Communication-avoiding optimizations reduce vertical communication through the memory hierarchy and horizontal communication across processes or threads, usually at the expense of introducing redundant computation. We focus on applying these optimizations to the smooth operator, which successively reduces the error and accounts for the largest fraction of the GMG execution time. Our compiler technology applies both novel and known transformations to derive an implementation comparable to manually-tuned code. To make the approach portable, an underlying autotuning system explores the tradeoff between reduced communication and increased computation, as well as tradeoffs in threading schemes, to automatically identify the best implementation for a particular architecture and at each computation phase. Results show that we are able to quadruple the performance of the smooth operation on the finest grids while attaining performance within 94% of manually-tuned code. Overall we improve the overall multigrid solve time by 2.5× without sacrificing programer productivity.

97 MATHEMATICS AND COMPUTING↗