Engineering Papers⌕ Search

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.

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

At least 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

Adaptive Flight Control Design with Optimal Control Modification on an F-18 Aircraft Model

In the presence of large uncertainties, a control system needs to be able to adapt rapidly to regain performance. Fast adaptation is referred to as the implementation of adaptive control with a large adaptive gain to reduce the tracking error rapidly; however, a large adaptive gain can lead to high-frequency oscillations which can adversely affect the robustness of an adaptive control law. A new adaptive control modification is presented that can achieve robust adaptation with a large adaptive gain without incurring high-frequency oscillations as with the standard model-reference adaptive control. The modification is based on the minimization of the Y2 norm of the tracking error, which is formulated as an optimal control problem. The optimality condition is used to derive the modification using the gradient method. The optimal control modification results in a stable adaptation and allows a large adaptive gain to be used for better tracking while providing sufficient robustness. A damping term (v) is added in the modification to increase damping as needed. Simulations were conducted on a damaged F-18 aircraft (McDonnell Douglas, now The Boeing Company, Chicago, Illinois) with both the standard baseline dynamic inversion controller and the adaptive optimal control modification technique. The results demonstrate the effectiveness of the proposed modification in tracking a reference model.

Burken, John J.↗
DOE OSTI2020

Optimizing the hypre solver for manycore and GPU architectures

The solution of large-scale combustion problems with codes such as Uintah on modern computer architectures requires the use of multithreading and GPUs to achieve performance. Uintah uses a low-Mach number approximation that requires iteratively solving a large system of linear equations. The Hypre iterative solver has solved such systems in a scalable way for Uintah, but the use of OpenMP with Hypre leads to at least slowdown due to OpenMP overheads. The proposed solution uses the MPI Endpoints within Hypre, where each team of threads acts as a different MPI rank. This approach minimizes OpenMP synchronization overhead and performs as fast or (up to 1.44) faster than Hypre's MPI-only version, and allows the rest of Uintah to be optimized using OpenMP. The profiling of the GPU version of Hypre shows the bottleneck to be the launch overhead of thousands of micro-kernels. The GPU performance was improved by fusing these micro-kernels and was further optimized by using Cuda-aware MPI, resulting in an overall speedup of 1.16—1.44 compared to the baseline GPU implementation. The above optimization strategies were published in the International Conference on Computational Science 2020 [1]. This work extends the previously published research by carrying out the second phase of communication-centered optimizations in Hypre to improve its scalability on large-scale supercomputers. Additionally, this includes an efficient non-blocking inter-thread communication scheme, communication-reducing patch assignment, and expression of logical communication parallelism to a new version of the MPICH library that utilizes the underlying network parallelism [2]. The above optimizations avoid communication bottlenecks previously observed during strong scaling and improve performance by up to 2 on 256 nodes of Intel Knight's Landing processor.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2010

Exhaustive Versus Randomized Searchers for Nonlinear Optimization in 21st Century Computing: Solar Application

We present a simple multi-dimensional exhaustive search method to obtain, in a reasonable time, the optimal solution of a nonlinear programming problem. It is more relevant in the present day non-mainframe computing scenario where an estimated 95% computing resources remains unutilized and computing speed touches petaflops. While the processor speed is doubling every 18 months, the band width is doubling every 12 months, and the hard disk space is doubling every 9 months. A randomized search algorithm or, equivalently, an evolutionary search method is often used instead of an exhaustive search algorithm. The reason is that a randomized approach is usually polynomial-time, i.e., fast while an exhaustive search method is exponential-time i.e., slow. We discuss the increasing importance of exhaustive search in optimization with the steady increase of computing power for solving many real-world problems of reasonable size. We also discuss the computational error and complexity of the search algorithm focusing on the fact that no measuring device can usually measure a quantity with an accuracy greater than 0.005%. We stress the fact that the quality of solution of the exhaustive search - a deterministic method - is better than that of randomized search. In 21 st century computing environment, exhaustive search cannot be left aside as an untouchable and it is not always exponential. We also describe a possible application of these algorithms in improving the efficiency of solar cells - a real hot topic - in the current energy crisis. These algorithms could be excellent tools in the hands of experimentalists and could save not only large amount of time needed for experiments but also could validate the theory against experimental results fast.

Sen, Syamal K.↗
DOE OSTI2025

Design of a High-Pressure Fuel System for Use with Dimethyl Ether

The paper documents the modeling and experimental work on a common rail fuel injection system for Dimethyl Ether, a potential diesel substitute with a low carbon intensity signature. The DME fuel system is deployed on a light duty 2.2L compression ignition engine. The paper describes the injector optimization to shift to higher flows to account for the lower heating value and density of the DME when compared to diesel. The type of the injection system used for the DME application is an advanced rendering of the Common rail noted for a one-piece piston-needle injector construction and a solenoid driven spill valve featuring a pressure balanced poppet. A dedicated high-pressure fuel pump designed to pressurize DME is used. The design results in a fast acting open and close injection event, reduced leakage, with reduced cavitation in the fuel injector volume. Design parameters for system optimization included fill and spill orifices, needle lift, bias spring, and injector hole size. The design model provides good correlation of the instantaneous rates of injection with experiments across a wide range of pressure and injection timings. Proposed performance milestones for the design included similar DME injection duration to the diesel counterpart for same fuel energy injected into the cylinder to retain high engine cycle efficiency. Here, the dedicated DME design provided reduced hydraulic delays of 50%. Tests demonstrated sustained operation at pressures of 1000 bar, with capability to reach 1500bar. Durability tests showed no cavitation-deterioration over a 200-hour test cycle by means of spray imaging and hardware inspection.

De Ojeda, William [WM International Engineering, L↗
NASA NTRS1993

Optimal resolution in maximum entropy image reconstruction from projections with multigrid acceleration

We consider the problem of image reconstruction from a finite number of projections over the space L(sup 1)(Omega), where Omega is a compact subset of the set of Real numbers (exp 2). We prove that, given a discretization of the projection space, the function that generates the correct projection data and maximizes the Boltzmann-Shannon entropy is piecewise constant on a certain discretization of Omega, which we call the 'optimal grid'. It is on this grid that one obtains the maximum resolution given the problem setup. The size of this grid grows very quickly as the number of projections and number of cells per projection grow, indicating fast computational methods are essential to make its use feasible. We use a Fenchel duality formulation of the problem to keep the number of variables small while still using the optimal discretization, and propose a multilevel scheme to improve convergence of a simple cyclic maximization scheme applied to the dual problem.

Limber, Mark A.↗
NASA NTRS2026

Deep RL for Fast Long-Horizon Operations Scheduling on NASA's Carruthers Geocorona Observatory Mission

Spacecraft operations scheduling is a highly constrained, long-horizon combinatorial optimization problem that traditionally relies on heuristics, constraint programming, or manual planning. We present a scalable deep reinforcement learning framework developed and deployed for NASA’s Carruthers Geocorona Observatory mission. Our framework introduces a macro-action abstraction known as activity blocks coupled with dynamic action-masking to navigate the intractably large search space and strictly enforce complex power, thermal, and instrument constraints. The resulting architecture generates globally feasible schedules with overwhelming probability, establishes operational trust, and executes a full training cycle in under six hours, circumventing the need for policy robustness by enabling rapid, on-demand retraining. Further, resulting schedules outperform baseline heuristics in scheduled science quality. The deep reinforcement learning framework was deployed as the default operational scheduler for the Carruthers Geocorona Observatory mission from the outset of the mission, demonstrating that deep reinforcement learning can be trusted for real spacecraft operations under complex, evolving constraints.

Geocorona↗
DOE OSTI2024

Strategies on How to Manage Battery Heat Under Fast Charge Conditions

Improvements to battery design often focus on the energy density of the active material and/or utilization of the available active material. Optimizing thermal management design at the cell-level and/or the pack level is key to accomplishing mission-relevant battery design. Measurement of heat signatures at each level helps inform manufacturing at the design, production, and characterization phases. Understanding thermal limitations allows end users to make well-informed decisions on design of durable and safe battery packs.

battery↗
DOE OSTI2022

Data reduction through optimized scalar quantization for more compact neural networks

Raw data generation for several existing and planned large physics experiments now exceeds TB/s rates, generating untenable data sets in very little time. Those data often demonstrate high dimensionality while containing limited information. Meanwhile, Machine Learning algorithms are now becoming an essential part of data processing and data analysis. Those algorithms can be used offline for post processing and post data analysis, or they can be used online for real time processing providing ultra low latency experiment monitoring. Both use cases would benefit from data throughput reduction while preserving relevant information: one by reducing the offline storage requirements by several orders of magnitude and the other by allowing ultra fast online inferencing with low complexity Machine Learning models. Moreover, reducing the data source throughput also reduces material cost, power and data management requirements. In this work we demonstrate optimized nonuniform scalar quantization for data source reduction. This data reduction allows lower dimensional representations while preserving the relevant information of the data, thus enabling high accuracy Tiny Machine Learning classifier models for online fast inferences. We demonstrate this approach with an initial proof of concept targeting the CookieBox, an array of electron spectrometers used for angular streaking, that was developed for LCLS-II as an online beam diagnostic tool. We used the Lloyd-Max algorithm with the CookieBox dataset to design an optimized nonuniform scalar quantizer. Optimized quantization lets us reduce input data volume by 69% with no significant impact on inference accuracy. When we tolerate a 2% loss on inference accuracy, we achieved 81% of input data reduction. Finally, the change from a 7-bit to a 3-bit input data quantization reduces our neural network size by 38%.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Zn 2+ -mediated catalysis for fast-charging aqueous Zn-ion batteries

Rechargeable aqueous zinc-ion batteries (AZIBs), renowned for their safety, high energy density and rapid charging, are prime choices for grid-scale energy storage. Historically, ion-shuttling models centring on ion-migration behaviour have dominated explanations for charge/discharge processes in aqueous batteries, like classical ion insertion/extraction and pseudocapacitance mechanisms. However, these models struggle to account for the exceptional performance of AZIBs compared to other aqueous metal-ion batteries. Here, in this study, we present a catalysis model elucidating the Zn 2+ anomaly in aqueous batteries, explaining it through the concept of adsorption in catalysis. Such behaviour can serve the charge/discharge role, predominantly dictated by solvated metal cations and cathode materials. First-principles calculations suggest optimal adsorption/desorption behaviour (water dissociation process) with the Zn 2+ -vanadium nitride (VN) combination. Experimentally, AZIBs implementing VN cathodes demonstrate fast-charging kinetics, showing a capacity of 577.1 mAh g -1 at a current density of 300,000 mA g -1 . The grasp of catalysis steps within AZIBs can drive solutions beyond state-of-the-art fast-charging batteries.

25 ENERGY STORAGE↗
DOE OSTI2022

Indium as a surfactant: Effects on growth morphology and background impurity in GaN films grown by ammonia-assisted molecular beam epitaxy

We report on the improvement of the surface morphology of c-plane GaN films grown at high growth rates (~1 µm/h) using ammonia molecular beam epitaxy through a series of growth optimizations as well as the introduction of indium as a surfactant. The indium surfactant was expected to help with the adatom mobility and, thus, provide smoother growth surfaces. Through a combination of varying V/III ratios, In flux, and growth temperatures, an optimal condition for surface morphology, characterized by atomic force microscopy, was achieved. At higher Ga fluxes for fast growth rates (~1 µm/h and beam equivalent pressures of ~5 × 10 –7 Torr), higher ammonia flows were necessary to preserve the surface morphology. In addition, indium was an effective surfactant—reducing the roughness and improving the overall surface morphology. However, excessive indium causes the surface morphology to degrade, potentially due to the enhancement of the Ga desorption from the surface as a result of the reaction of indium with ammonia for high indium fluxes. The indium surfactant also resulted in a reduction of background Si impurity concentrations in the film. These effects allow for the growth of thick drift layers with low background dopant concentrations for vertical GaN power devices.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Deep Reinforcement Learning for Distribution System Restoration Using Distributed Energy Resources and Tie-Switches

Distributed energy resources (DERs), such as solar PVs and energy storage, can be used to restore distribution system critical loads after the extreme weather events to increase grid resilience. However, coordinating multiple DERs together with tie-switches for multi-step restoration process under renewable uncertainty is challenging. This paper proposes a deep reinforcement learning to control discrete actions of switching on/off tie switches and DERs for critical load restoration. The restoration problem is first cast into the Markov decision process suitable for DRL. Then, the original soft actor critic (SAC) method for continuous actions has been extended to handle discrete and continuous actions. Numerical comparison results with other stochastic optimization-based approaches on the modified IEEE 33-bus system show that the proposed method can achieve fast critical load restoration in the presence of substation power outage while maintaining system voltage limit throughout the restoration process.

active distribution systems↗
NASA NTRS1975

Problem areas in the use of the firefly luciferase assay for bacterial detection

By purifying the firefly luciferase extract and adding all necessary chemicals but ATP in excess, an assay for ATP was performed by measuring the amount of light produced when a sample containing soluble ATP is added to the luciferase reaction mixture. Instrumentation, applications, and basic characteristics of the luciferase assay are presented. Effect of the growth medium and length of time grown in this medium on ATP per viable E. coli values is shown in graphic form, along with an ATP concentration curve showing relative light units versus ATP injected. Reagent functions and concentration methods are explored. Efforts to develop a fast automatable system to detect the presence of bacteria in biological fluids, especially urine, resulted in the optimization of procedures for use with different types of samples.

Picciolo, G. L.↗
NASA NTRS1976

Consideration of computer limitations in implementing on-line controls

A formal statement of the optimal control problem which includes the interval of dicretization as an optimization parameter, and extend this to include selection of a control algorithm as part of the optimization procedure, is formulated. The performance of the scalar linear system depends on the discretization interval. Discrete-time versions of the output feedback regulator and an optimal compensator, and the use of these results in presenting an example of a system for which fast partial-state-feedback control better minimizes a quadratic cost than either a full-state feedback control or a compensator, are developed.

Roberts, G. K.↗
NASA NTRS2001

[ ] or SUCCESS is Not Enough: Current Technology and Future Directions in Proof Presentation

Automated theorem provers for first order logic are now around for several decades. Over the last few years, their deductive power to solve hard problems has increased tremendously. The annual CASC system competitions [Se97] give a clear picture of this situation. However, today's automated theorem provers are restricted "more by general usability than by raw deductive power." As a result of this, there are only very few serious applications of automated theorem provers. There are numerous features which a theorem prover lacks for real-world applicability. An automated theorem prover (as it is currently seen) is nothing more than a fast and elaborate search procedure. In that sense, an ATP can compared to a formulated race car, cool and fast, but virtually unusable for shopping groceries around the corner. Many important features are missing, or are optimized for speed rather than for applicability. [Schol] identifies important features which are needed for practical usability like detection of non-theorems, handling of modal/inductive proof tasks, control of the prover, and proof output. In this paper, we will focus solely on the last point, the presentation of the ATP's result to the user. In the rest of this paper, we will first discuss the general importance of providing feedback to the user, then we will describe the system ExplainIt!, a part of the deductive synthesis system AMPHION/NAV. In the conclusions we will relate proof presentation to other ways of post-processing a proof found by an ATP and stress their role in the future of automated deduction.

Schumann, Johann↗
NASA NTRS1986

Auto Design

SPAR, a computer program developed by Lewis, is used to optimize the design of body panels by Chrysler Corporation. The program is interactive, easy to use, and fast.

Source record↗
NASA NTRS2003

A Domain Decomposition Parallelization of the Fast Marching Method

In this paper, the first domain decomposition parallelization of the Fast Marching Method for level sets has been presented. Parallel speedup has been demonstrated in both the optimal and non-optimal domain decomposition case. The parallel performance of the proposed method is strongly dependent on load balancing separately the number of nodes on each side of the interface. A load imbalance of nodes on either side of the domain leads to an increase in communication and rollback operations. Furthermore, the amount of inter-domain communication can be reduced by aligning the inter-domain boundaries with the interface normal vectors. In the case of optimal load balancing and aligned inter-domain boundaries, the proposed parallel FMM algorithm is highly efficient, reaching efficiency factors of up to 0.98. Future work will focus on the extension of the proposed parallel algorithm to higher order accuracy. Also, to further enhance parallel performance, the coupling of the domain decomposition parallelization to the G(sub 0)-based parallelization will be investigated.

Herrmann, M.↗
DOE OSTI2022

Fast simultaneous feasibility testing and applications for electrical power grids

Fast simultaneous feasibility testing (SFT) for management of an electrical power grid is achieved through various innovations. The computation problem relates to evaluation of candidate solutions for external power flows into a power grid, with respect to predetermined constraints and contingencies. Storage and computations are reduced by formulating the problem in terms of transactional nodes (e.g. third party connections for generators and loads) instead of the larger number of bus nodes. Further advantages are achieved by precomputing matrices that can be reused across multiple SFT invocations, organizing matrices and operations to reduce storage and computation, and eliminating branches that have no contingency violations. The fast SFT further enables new applications for integrating SFT with a Security-Constrained Unit Commitment (SCUC) optimizer for efficient single pass solutions; operating SFT as a service to multiple SCUC solvers; or integration with Security-Constrained Economic Dispatch (SCED) optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Retrieval of temperature and humidity profiles from ground-based high-resolution infrared observations using an adaptive fast iterative algorithm

Various retrieval algorithms have been developed for retrieving temperature and water vapor profiles from Atmospheric Emitted Radiance Interferometer (AERI) observations. The physical retrieval algorithm, named AERI Optimal Estimation (AERIoe), outperforms other retrieval algorithms in many aspects except the retrieval time, which is significantly increased due to the complex radiative transfer process. The calculation of the Jacobian matrix is the most computationally intensive step of the physical retrieval algorithm. Interestingly, an analysis of the change in AERI observations' information content with respect to Jacobians revealed that the AERIoe algorithm's performance presents negligible dependence on these metrics. Thus, the Jacobian matrix could remain unchanged when the variation in the atmospheric state is small in the retrieval process to reduce the most time-consuming computation. On the basis of the above findings, a fast physical–iterative retrieval algorithm was proposed by adaptively recalculating Jacobians in keeping with the changes in the atmospheric state. Experiments with synthetic observations demonstrate that the proposed method experiences an average reduction in retrieval time by an impressive 59 % compared to the original AERIoe algorithm while achieving maximum root-mean-square errors of less than 0.95 K and 0.22 log(ppmv) for heights below 3 km for the temperature and water vapor profile, respectively. Further analyses revealed that the fast-retrieval algorithm reached an acceptable convergence rate of 98.7 %, marginally lower than AERIoe's 99.9 % convergence rate for the 826 cases used in this study.

54 ENVIRONMENTAL SCIENCES↗