Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematical 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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
NASA NTRS1979

Spectral characteristics of convolutionally coded digital signals

The power spectral density of the output symbol sequence of a convolutional encoder is computed for two different input symbol stream source models, namely, an NRZ signaling format and a first order Markov source. In the former, the two signaling states of the binary waveform are not necessarily assumed to occur with equal probability. The effects of alternate symbol inversion on this spectrum are also considered. The mathematical results are illustrated with many examples corresponding to optimal performance codes.

Divsalar, D.↗
NASA NTRS1980

Spectral characteristics of convolutionally coded digital signals

The power spectral density of the output symbol sequence of a convolutional encoder is computed for two different input symbol stream source models, namely, an NRZ signaling format and a first-order Markov source. The effects of alternate symbol inversion on this spectrum are also considered. The mathematical results are illustrated with many examples corresponding to optimal performance codes. It is demonstrated that only for the case of a purely random input source (e.g., NRZ data with equiprobable symbols) and a particular class of codes is the output spectrum identical to the input spectrum except for a frequency scaling (expansion) by the reciprocal of the code rate.

Divsalar, D.↗
NASA NTRS1981

A model for the submarine depthkeeping team

The most difficult task the depthkeeping team must face occurs during periscope-depth operations during which they may be required to maintain a submarine several hundred feet long within a foot of ordered depth and within one-half degree of ordered pitch. The difficulty is compounded by the facts that wave generated forces are extremely high, depth and pitch signals are very noisy and submarine speed is such that overall dynamics are slow. A mathematical simulation of the depthkeeping team based on the optimal control models is described. A solution of the optimal team control problem with an output control restriction (limited display to each controller) is presented.

Ware, J. R.↗
NASA NTRS1981

A new approach to the minimum weight/loss design of switching power converters

A new technique using the mathematical nonlinear programming ALAG is proposed to facilitate design optimizations of switching power converters. This computer-aided approach provides a minimum weight (or loss) design down to the details of component level and concurrently satisfies all related power-circuit performance requirements. It also provides such design insights as tradeoffs between power loss and system weight as the switching frequency is increased.

Lee, F. C.↗
DOE OSTI2026

LibraryX: A Framework for Cross-Library-Call Optimization

Scientific applications utilize performance libraries as a software engineering concept: these libraries encapsulate important and well-understood (mathematical) operations, allow for reuse, and are implemented and tuned by experts. Domain scientists then implement complex algorithms based on these domainspecific libraries. While individual library calls are optimized, larger performance gains across sequences of calls—sometimes spanning multiple libraries—are often unrealized, forcing a trade-off between performance and implementation complexity.To overcome this issue, we propose LibraryX, an approach and a system that allows for cross-library-call optimization even when library calls stem from multiple performance libraries. LibraryX annotates library calls with semantic information and optimizes entire directed acyclic graphs (DAGs) of calls dynamically using the SPIRAL code generation system. We demonstrate its effectiveness across a range of memory bound workloads, achieving significant speedups on Nvidia, AMD, and Intel accelerators compared to code using native libraries without cross-call optimization.

Rao, Sanil [Carnegie Mellon University,Department ↗
NASA NTRS1975

Computerized optimization of elastic booster autopilots. Volume 1: Technical manual

The philosophy and the mathematical basis of the nonlinear programming algorithm underlying the development of the COEBRA program were given. A User's Manual was given in a separate document. The purpose of this work was to convert the COEBRA program from the CDC 6400/6500 digital computer system to the UNIVAC 1108 at the George C. Marshall Space Flight Center and to provide an instruction manual on the use of the program.

Kelley, T.↗
NASA NTRS1987

Optimization of orbital assignment and specification of service areas in satellite communications

The mathematical nature of the orbital and frequency assignment problem for communications satellites is explored, and it is shown that choosing the correct permutations of the orbit locations and frequency assignments is an important step in arriving at values which satisfy the signal-quality requirements. Two methods are proposed to achieve better spectrum/orbit utilization. The first, called the delta S concept, leads to orbital assignment solutions via either mixed-integer or restricted basis entry linear programming techniques; the method guarantees good single-entry carrier-to-interference ratio results. In the second, a basis for specifying service areas is proposed for the Fixed Satellite Service. It is suggested that service areas should be specified according to the communications-demand density in conjunction with the delta S concept in order to enable the system planner to specify more satellites and provide more communications supply.

Wang, Cou-Way↗
NASA NTRS1981

Supersonic cruise research aircraft structural studies: Methods and results

NASA Langley Research Center SCAR in-house structural studies are reviewed. In methods development, advances include a new system of integrated computer programs called ISSYS, progress in determining aerodynamic loads and aerodynamically induced structural loads (including those due to gusts), flutter optimization for composite and metal airframe configurations using refined and simplified mathematical models, and synthesis of active controls. Results given address several aspects of various SCR configurations. These results include flutter penalties on composite wing, flutter suppression using active controls, roll control effectiveness, wing tip ground clearance, tail size effect on flutter, engine weight and mass distribution influence on flutter, and strength and flutter optimization of new configurations. The ISSYS system of integrated programs performed well in all the applications illustrated by the results, the diversity of which attests to ISSYS' versatility.

Sobieszczanski-Sobieski, J.↗
NASA NTRS1990

Shape design sensitivities using fully automatic 3-D mesh generation

Previous work in three dimensional shape optimization involved specifying design variables by associating parameters directly with mesh points. More recent work has shown the use of fully-automatic mesh generation based upon a parameterized geometric representation. Design variables have been associated with a mathematical model of the part rather than the discretized representation. The mesh generation procedure uses a nonuniform grid intersection technique to place nodal points directly on the surface geometry. Although there exists an associativity between the mesh and the geometrical/topological entities, there is no mathematical functional relationship. This poses a problem during certain steps in the optimization process in which geometry modification is required. For the large geometrical changes which occur at the beginning of each optimization step, a completely new mesh is created. However, for gradient calculations many small changes must be made and it would be too costly to regenerate the mesh for each design variable perturbation. For that reason, a local remeshing procedure has been implemented which operates only on the specific edges and faces associated with the design variable being perturbed. Two realistic design problems are presented which show the efficiency of this process and test the accuracy of the gradient computations.

Botkin, M. E.↗
NASA NTRS2006

Grayscale Optical Correlator Workbench

Grayscale Optical Correlator Workbench (GOCWB) is a computer program for use in automatic target recognition (ATR). GOCWB performs ATR with an accurate simulation of a hardware grayscale optical correlator (GOC). This simulation is performed to test filters that are created in GOCWB. Thus, GOCWB can be used as a stand-alone ATR software tool or in combination with GOC hardware for building (target training), testing, and optimization of filters. The software is divided into three main parts, denoted filter, testing, and training. The training part is used for assembling training images as input to a filter. The filter part is used for combining training images into a filter and optimizing that filter. The testing part is used for testing new filters and for general simulation of GOC output. The current version of GOCWB relies on the mathematical software tools from MATLAB binaries for performing matrix operations and fast Fourier transforms. Optimization of filters is based on an algorithm, known as OT-MACH, in which variables specified by the user are parameterized and the best filter is selected on the basis of an average result for correct identification of targets in multiple test images.

Hanan, Jay↗
DOE OSTI2025

Scalable Unit Commitment with Security Constrained AC Power Flow via ADMM and Hybrid Modeling Strategies

This research introduces a more efficient way to optimize power grid operations, breaking the problem into manageable steps and using advanced mathematical techniques to speed up calculations. By incorporating smart heuristics, improved preprocessing, and contingency analysis, the approach allows operators to make better decisions faster. These innovations enhance our understanding of how to optimize energy generation, making it possible to anticipate failures before they happen, reduce system costs, and improve overall grid performance. Ultimately, this research helps bridge the gap between theoretical models and real-world applications, paving the way for a smarter, more resilient power grid. This research directly benefits the public by making electricity more affordable, reliable, and sustainable. By improving how power grids schedule and distribute electricity, the project helps energy providers reduce operational costs, which can lead to lower electricity prices for consumers. Additionally, the ability to predict and prevent power system failures enhances grid reliability, reducing the likelihood of blackouts that can disrupt homes, businesses, and critical infrastructure such as hospitals. From an environmental perspective, optimizing power generation reduces energy waste and lowers carbon emissions, contributing to cleaner air and a more sustainable energy system. Furthermore, with extreme weather events becoming more frequent, these advancements make the power grid more resilient, ensuring communities are better prepared for emergencies and natural disasters. By strengthening the nation's energy infrastructure, this research plays a crucial role in improving economic stability, public safety, and environmental sustainability.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Improving ADAM through an implicit-explicit (IMEX) time-stepping approach

The ADAM optimizer, often used in machine learning for neural network training, corresponds to an underlying ordinary differential equation (ODE) in the limit of very small learning rates. Here, this work shows that the classical ADAM algorithm is a first-order implicit-explicit (IMEX) Euler discretization of the underlying ODE. Employing the time discretization point of view, we propose new extensions of the ADAM scheme obtained by using higher-order IMEX methods to solve the ODE. Based on this approach, we derive a new optimization algorithm for neural network training that performs better than classical ADAM on several regression and classification problems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

Force-reflective teleoperated system with shared and compliant control capabilities

The force-reflecting teleoperator breadboard is described. It is the first system among available Research and Development systems with the following combined capabilities: (1) The master input device is not a replica of the slave arm. It is a general purpose device which can be applied to the control of different robot arms through proper mathematical transformations. (2) Force reflection generated in the master hand controller is referenced to forces and moments measured by a six DOF force-moment sensor at the base of the robot hand. (3) The system permits a smooth spectrum of operations between full manual, shared manual and automatic, and full automatic (called traded) control. (4) The system can be operated with variable compliance or stiffness in force-reflecting control. Some of the key points of the system are the data handling and computing architecture, the communication method, and the handling of mathematical transformations. The architecture is a fully synchronized pipeline. The communication method achieves optimal use of a parallel communication channel between the local and remote computing nodes. A time delay box is also implemented in this communication channel permitting experiments with up to 8 sec time delay. The mathematical transformations are computed faster than 1 msec so that control at each node can be operated at 1 kHz servo rate without interpolation. This results in an overall force-reflecting loop rate of 200 Hz.

Szakaly, Z.↗
DOE OSTI2024

Alternating Direction Decomposition with Strong Bounding and Convexification (ADDSBC) for Solving Security Constrained AC Unit Commitment Problems

This project aims to develop efficient and robust computational methods for solving the security-constrained unit commitment and alternating current optimal power flow problem (SC-UC-ACOPF). The SC-UC-ACOPF problem is at the center of the short-term operation of the U.S. Power Grid. It is solved every week, every day, and every 10 minutes to plan for the optimal action of electricity generation and consumption by minimizing the generation cost and maintaining power system reliability against potential disruptions of equipment failures. In mathematical terms, SC-UC-ACOPF is a challenging large-scale mixed-integer nonlinear optimization model. This means that the decisions involve both discrete variables, e.g. the turning on and off of generators and switching of transmission lines and transformers, and continuous decisions, e.g. the amount of energy generated by each generator and the power flows in the power grid. The physics of the power flow is described by nonlinear equations involving real and reactive power and bus voltages. Another key feature is the large number of contingencies, i.e. the system needs to stay reliable in face of failure of any one equipment, such as transmission lines and generators. The U.S. power grids are extremely complicated and large scale with more than 5,000 generators, 50,000 buses, and 100,000 high-voltage transmission lines, making the SC-UC-ACOPF a very large-scale computation challenge. The research developed in this project aims to solve the SC-UC-ACOPF problems in the three timescales, i.e. weekly, daily, and every 10-min. The proposed computational methods are built on a principled algorithmic approach of decomposition and penalization. More specifically, the algorithm develops spatial and temporal decomposition by exploiting the strong temporal coupling and weak spatial coupling of the UC problem and the complementary feature, i.e. weak temporal coupling and strong spatial coupling of the ACOPF problem. The algorithm also leverages recent progresses in strong convex relaxation of ACOPF. A unique feature of the proposed approach is that it generates a valid, global upper bound on the optimal maximum profit. In this way, a global optimality gap is available to measure the quality of the solution. To further speed up computation, the research team has developed a plethora of effective heuristics to strengthen the iterative penalty-based decomposition framework. For instance, a heuristic is developed to construct inner approximations of the time coupling constraints within the time decoupled problems. Contingencies are pre-screened and low-rank matrix computation is exploited to find the almost unique solution to each contingency. A novel heuristic for line switching is proposed and tested with positive impacts on instances where line switching is beneficial. Taking a systematic approach and carefully handling every detail of the problem pays off. The TIM-GO’s performance throughout the trials and the final event was stellar. TIM-GO garnered the second highest total prize money and is ranked in the top three positions across all categories of comparison.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2006

A Mathematical Model to Predict and Maintain the Neutral Buoyancy of Suited Astronauts

A previous study reported that inadequate weigh outs of suited subjects contribute to fatigue and the risk of injury during training in the Neutral Buoyancy Laboratory (NBL). Another study suggested that shoulder injuries observed in suited subjects who train in the NBL may be attributed to excessive righting moments caused by a non-optimal weigh out. The purpose of this study was to develop a mathematical model to predict and maintain the neutral buoyancy of suited subjects during training operations at the NBL. Due to time constraints, one certified NBL support diver served as a subject (height: 66.54 in; weight: 182 lbs) for this study and only one complete test was conducted. The study was divided into two runs for which the first run required the NBL divers to perform a weigh out similar to a suited astronaut on a scuba diver wearing a mock Portable Life Support System and a Displays and Control Module. For the second run, the same subject and equipment were weighed out according to the mathematical model. The objective of each run was to achieve a neutrally buoyant subject floating 450 to the pool floor. Motion data was collected using two underwater cameras and analyzed using Dartfish video analysis software while force and moment data were recorded using an AMTI force plate. The results from the NBL divers visual run indicate that the subject was floating at an angle of 29.50 while the resultant force and moment data were 1.139 lb and 1.125 ft-lb respectively. The mathematical model s weigh out resulted in the subject floating at an angle of 37.40 and a resultant force of 0.765 lb and resultant moment of 1.248 ft-lb. The mathematical model was better able to orient the subject and reduce resultant moment and force as compared to the NBL divers.

Clowers, Kurt↗
DOE OSTI2026

Selection of a Pair of Experiments to Optimally Reduce Uncertainty in Targeted Nuclear Data

We propose a novel process to select a pair of differential and integral experiments that best reduce uncertainties in targeted 239 ⁢Pu nuclear data while compressing the current nuclear data pipeline from 20 to 3 years. 239⁢ Pu nuclear data are poorly understood for neutrons in the intermediate energy range due to sparsity and uncertainty in historical experiments. New experiments targeting this range will enable better understanding of these nuclear data, but choosing the ideal experiments to conduct is challenging. Beginning with a prior distribution represented by samples of nuclear data generated from theory, generalized least squares adjustments are made to incorporate data from historical experiments. To quantify potential uncertainty reduction obtainable from a pair of candidate experiments, we compute the D-optimality criterion of the posterior covariance of intermediate energy range nuclear data compared to the equivalent covariance after additional adjustment to the pair of candidate experiments. Repeating the process for each of many candidate pairs facilitates the final selection. Results support 63⁢ Cu total cross section measurements for differential experiments and alumina and alumina/graphite configurations for integral experiments. This analysis enables choosing differential and integral experiments to be executed concurrently while shortening decision times relative to the current nuclear data pipeline.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1996

Balanced Placement Of Vibration Sensors And Actuators

Mathematical approach that involves Hankel singular values leads to method for estimation of optimal placement of relatively few vibration sensors and actuators in multivariable flexible structure. Approach extends and complements previous developments regarding approximate decomposition, to Hankel singular values, of singular values of controllability and observability grammian matrices of multivariable flexible structure. Mathematical constructs also described in "Designing An Approximately Balanced LQG Compensator" (NPO-19000).

Gawronski, Wodek↗