Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 469 records · Page 26

SUNSPOT: A computer program for producing optimal solar sail planetocentric trajectories

The input, output and subroutines, including listings, for the SUNSPOT code are described. SUNSPOT can calculate time optimal planetocentric trajectories including orbit-to-orbit transfer and orbit to a subescape point. Trajectories about the the four inner planets can be calculated, and shadowing, oblateness, and solar motion may be included. A penalty function may be included to prevent trajectories which intersect the planet's surface.

Sackett, L. L.↗

SPRITE - A computer code for the optimization of space based heat pipe radiator systems

An integrated analytical tool has been developed for use in designing optimized space-based heat pipe radiator systems. This code, SPRITE-1, incorporates the thermal, structural, and reliability aspects of the radiator into a single framework from which a physically consistent design can be obtained. A parametric study of the integral heat pipe panel radiator was performed using SPRITE-1, and a preliminary minimum mass design was obtained. The radiator design is summarized, and the mass minimization method and results are presented.

Buksa, John J.↗

Optimization of KINETICS Chemical Computation Code

NASA JPL has been creating a code in FORTRAN called KINETICS to model the chemistry of planetary atmospheres. Recently there has been an effort to introduce Message Passing Interface (MPI) into the code so as to cut down the run time of the program. There has been some implementation of MPI into KINETICS; however, the code could still be more efficient than it currently is. One way to increase efficiency is to send only certain variables to all the processes when an MPI subroutine is called and to gather only certain variables when the subroutine is finished. Therefore, all the variables that are used in three of the main subroutines needed to be investigated. Because of the sheer amount of code that there is to comb through this task was given as a ten-week project. I have been able to create flowcharts outlining the subroutines, common blocks, and functions used within the three main subroutines. From these flowcharts I created tables outlining the variables used in each block and important information about each. All this information will be used to determine how to run MPI in KINETICS in the most efficient way possible.

planetary atmospheres↗

Using Computational Flow Imaging to Optimize Filtered Rayleigh Scattering Measurements of an Isolator Shock Train

Filtered Rayleigh scattering (FRS) is a laser diagnostic where the intensity of elastically scattered light is measured after it passes through a molecular absorption filter. The filter removes background interference that overwhelms the relatively weak scattering from the gas molecules. However, with a filter, the measured light intensity depends on many of the scattering gas properties, including pressure, density, temperature, and velocity. In this work, CFD simulations of an isolator shock train flow field are input into a physics-based model to predict the values of FRS intensity measurements in a proposed experiment. The goal is to evaluate if a simplistic FRS setup (that utilizes one camera, laser, and absorption filter) can be used to accurately quantify number density despite the fact that the scattered light intensity also depends on other gas properties. It is found that the experimental setup can be optimized such that a linear relationship describes the number density with an average prediction error of 2%. The vast majority of the flow exhibits prediction errors of less than 3%, but small regions of the flow reach up to 11% error. A sensitivity analysis shows that the prediction error increases with the central wavelength of the incident laser light and decreases with the angle between the camera and laser propagation directions. The optimal experimental parameters are chosen based on a compromise between the prediction error, spatial resolution, and the amount of unfiltered light. In the future, the proposed FRS setup will be implemented to acquire new and valuable information on an isolator shock train, a flow field that has been traditionally studied using wall static pressure measurements and path-integrated visualization techniques, such as schlieren and shadowgraphy.

Hunt, Robin L.↗

Simulator for multilevel optimization research

A computer program designed to simulate and improve multilevel optimization techniques is described. By using simple analytic functions to represent complex engineering analyses, the simulator can generate and test a large variety of multilevel decomposition strategies in a relatively short time. This type of research is an essential step toward routine optimization of large aerospace systems. The paper discusses the types of optimization problems handled by the simulator and gives input and output listings and plots for a sample problem. It also describes multilevel implementation techniques which have value beyond the present computer program. Thus, this document serves as a user's manual for the simulator and as a guide for building future multilevel optimization applications.

Padula, S. L.↗

Interactive graphics nonlinear constrained optimization

An interactive computer graphics environment was used for nonlinear constrained optimization analysis. It is found that by combining the power of a digital computer with the subtlety of engineering judgment during program execution, final results can be substantially better than the ones achieved by the numerical algorithm by itself.

Saouma, V. E.↗

Agentic AI vs ML-Based Autotuning: A Comparative Study for Loop Reordering Optimization

High Performance Computing (HPC) applications rely heavily on code optimizations to achieve good performance on modern CPU and GPU architectures. Traditional Machine Learning auto-tuning approaches have demonstrated success in exploring high-dimensional spaces, but they often require expensive compile-run evaluations and lack adaptability for large HPC applications. The recent advances in Large Language Models (LLMs) and Agentic AI systems raise intriguing questions about the potential of these approaches to address specific optimization methodologies. This work aims to answer an essential question for the HPC community: “How Agentic AI Systems Compare to Traditional ML Autotuning Techniques?” To address this question, we present a comparative analysis between a traditional ML-based optimization approach and an Agentic AI system, evaluating their respective capabilities and limitations for loop-level optimization. In addition, we introduced a new Agentic AI system named LoopGen-AI using three different Large Language Models: GPT-4.1, Claude 4.0, and Gemini 2.5. A key finding is that LoopGen-AI achieves competitive per-formance with only a few program runs, the reasoning logs from the agents revealed that their decisions rely heavily on the combination of semantic understanding of the target kernel with dynamic feedback from the environment, highlighting a promising new dimension in performance tuning. In contrast, ML-based autotuners focus on statistical exploration, and require orders of magnitude more runs to reach peak performance. Additionally, our analysis shows that prompt engineering, particularly using Persona + Context Manager patterns, significantly impacts the effectiveness of Agentic AI. Our results indicate that while Agentic AI systems are not yet a complete replacement for ML-based autotuners, it can effectively complement traditional methods.

Rosas, Miguel Romero↗

Parallelizing autotuning for HPC applications: Unveiling the potential of the speculation strategy in Bayesian optimization

In the exascale computing era, tuning High-Performance Computing (HPC) applications has become a significant computational challenge. Although Bayesian optimization (BO) has emerged as a promising tool for HPC performance tuning, the BO workflow is inherently sequential (i.e., one function evaluation at a time) and cannot leverage the huge amount of parallel resources present in modern supercomputers, resulting in a considerable underutilization of their computational capabilities. This paper explores the trade-off between search quality and parallelism in BO, investigating a diverse set of methods. Building upon both previous approaches from the literature and novel methodologies introduced in this work, our study provides a deep analysis to accelerate BO performance tuning. By examining a set of synthetic functions and practical HPC applications, our exploration analyzes the interaction among various BO methods for parallelization, the quantity of parallel resources, the runtime distribution of target HPC applications, and the costs associated with different search orchestration mechanisms that have been overlooked in previous studies. Compared to sequential BO, our novel methodology achieves comparable quality while demonstrating robust scalability in search time as the amount of parallel resources increases; it also outperforms a state-of-the-art tuner, which supports parallelization, achieving up to 3.67x faster search time. We provide high-value insights for practitioners seeking to leverage the power of parallel computing for efficient HPC application tuning. Additionally, to further assist researchers in accelerating the performance tuning of their HPC applications, we provide an extension of an existing open-source tuning framework that incorporates our methods.

Bayesian optimization↗

A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems

We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.

97 MATHEMATICS AND COMPUTING↗

A comparison of digitally simulated holographic images with actual holographic images

In making digitally generated holograms the digital computer and its associated plotting equipment degrade the quality of the hologram. It is necessary then to study the computer generated hologram in terms of these degradations. A computer simulated optical processor allows the results to be observed via computer simulated images. This research reports a method for optimizing the computer image reconstruction and compares these images with optically produced holographic images. The versatility of the simulated optical processor is illustrated by several spatial filtering and hologram reconstructions.

Calhoun, M. D.↗

Optimization of aerospace structures

Research carried out is grouped under two topics: (1) Design Optimization, and (2) Integrated Force Method of Analysis. Design Optimization Research Topics are singularity alleviation enhances structural optimization methods, computer based design capability extended through substructure synthesis, and optimality criteria provides optimum design for a select class of structural problems. Integrated Force Method of Analysis Research Topics are boundary compatibility formulation improves stress analysis of shell structures. Brief descriptions of the four topics are appended.

Keith, Theo G., Jr.↗

Optimization of a Solver for Computational Materials and Structures Problems on NVIDIA Volta and AMD Instinct GPUs

The Scalable Implementation of Finite Elements by NASA (ScIFEN) is a software package developed to solve complex computational materials and structures problems using the finite element method (FEM). In this paper, we describe optimization techniques to speed up the linear solver computation that occurs within the ScIFEN application. We consider GPUs from two different vendors, NVIDIA and AMD as our target platforms for optimization and highlight differences in performance and optimization techniques. The NVIDIA GPU Volta V100 is used in the Summit system deployed at Oak Ridge National Laboratory, and the new exascale system, Frontier, will be using AMD Radeon Instinct GPU. We evaluated the performance of various optimization techniques on test matrices, ranging in size from100K to 4M, that are representative of ScIFEN applications. The linear solver computation is memory-bound on both GPUs. Our experiments show that on the NVIDIA GPU we obtained up to79%of the theoretical peak bandwidth, while the AMD GPU achieved 59%. Overall, the NVIDIA V100 GPU outperforms the AMD MI 25 GPU1. We observed an overall speedup of up to37X on an NVIDIA V100 compared to an Intel Skylake 12-coremachine. The solver for a 4M degree of freedom system took under 2.5 seconds.

Mohammad Zubair↗

A singular perturbation analysis of minimum time long range intercept

The application of singular perturbation theory for deriving algorithms suitable for on board real time computation of optimal aircraft trajectory control was investigated. Minimum time intercept in three dimensions was selected as a pilot problem formulation, and data for an early version F-4 aircraft was used to represent aircraft aerodynamic and propulsion characteristics. Results include the derivation of nonlinear, near optimal feedback control laws that are readily implementable in an aircraft flight computer, performance results for a variety of initial conditions (including optimal intercept at short ranges), and a point mass three dimensional simulation suitable for representing fighter aircraft under closed loop optimal control.

Calise, A.↗