Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical 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 523 records · Page 29

Optimization of Layer Densities for Spacecraft Multilayered Insulation Systems

Numerous tests of various multilayer insulation systems have indicated that there are optimal densities for these systems. However, the only method of calculating this optimal density was by a complex physics based algorithm developed by McIntosh. In the 1970's much data were collected on the performance of these insulation systems with many different variables analyzed. All formulas generated included number of layers and layer density as geometric variables in solving for the heat flux, none of them was in a differentiable form for a single geometric variable. It was recently discovered that by converting the equations from heat flux to thermal conductivity using Fourier's Law, the equations became functions of layer density, temperatures, and material properties only. The thickness and number of layers of the blanket were merged into a layer density. These equations were then differentiated with respect to layer density. By setting the first derivative equal to zero, and solving for the layer density, the critical layer density was determined. Taking a second derivative showed that the critical layer density is a minimum in the function and thus the optimum density for minimal heat leak, this is confirmed by plotting the original function. This method was checked and validated using test data from the Multipurpose Hydrogen Testbed which was designed using McIntosh's algorithm.

Johnson, W. L.↗

Theory and computation of optimal low- and medium-thrust transfers

This report presents two numerical methods considered for the computation of fuel-optimal, low-thrust orbit transfers in large numbers of burns. The origins of these methods are observations made with the extremal solutions of transfers in small numbers of burns; there seems to exist a trend such that the longer the time allowed to perform an optimal transfer the less fuel that is used. These longer transfers are obviously of interest since they require a motor of low thrust; however, we also find a trend that the longer the time allowed to perform the optimal transfer the more burns are required to satisfy optimality. Unfortunately, this usually increases the difficulty of computation. Both of the methods described use small-numbered burn solutions to determine solutions in large numbers of burns. One method is a homotopy method that corrects for problems that arise when a solution requires a new burn or coast arc for optimality. The other method is to simply patch together long transfers from smaller ones. An orbit correction problem is solved to develop this method. This method may also lead to a good guidance law for transfer orbits with long transfer times.

Chuang, C.-H.↗

Optimal Design of Calibration Signals in Space Borne Gravitational Wave Detectors

Future space borne gravitational wave detectors will require a precise definition of calibration signals to ensure the achievement of their design sensitivity. The careful design of the test signals plays a key role in the correct understanding and characterization of these instruments. In that sense, methods achieving optimal experiment designs must be considered as complementary to the parameter estimation methods being used to determine the parameters describing the system. The relevance of experiment design is particularly significant for the LISA Pathfinder mission, which will spend most of its operation time performing experiments to characterize key technologies for future space borne gravitational wave observatories. Here we propose a framework to derive the optimal signals in terms of minimum parameter uncertainty to be injected to these instruments during its calibration phase. We compare our results with an alternative numerical algorithm which achieves an optimal input signal by iteratively improving an initial guess. We show agreement of both approaches when applied to the LISA Pathfinder case.

LISA Path_nder mission↗

Optimal trajectories between Earth and Mars in their true planetary orbits.

The optimal transfers from Earth to Mars and from Mars to Earth, considering the actual planetary orbits, are presented as functions of the corresponding idealized Hohmann transfers. The numerically exact two-impulse optimal trajectories are given in graphical form for all possible Hohmann windows. The two-impulse transfers which are absolute optimals and those for which a third impulse provides the absolute optimal are delineated. These data are designed to provide all the information necessary for quick orbit calculations for preliminary Martian mission analysis. In this form, they are as easy to use as the standard Hohmann transfer approximations and provide much greater accuracy.

Gravier, J. P.↗

Theory of the optimally coupled Q-switched laser

The general equations describing Q-switched laser operation are transcendental in nature and require numerical solutions, which greatly complicates the optimization of real devices. Here, it is shown that, using the mathematical technique of Lagrange multipliers, one can derive simple analytic expressions for all of the key parameters of the optimally coupled laser, i.e., one which uses an optimum reflector to obtain maximum laser efficiency for a given pump level. These parameters can all be expressed as functions of a single dimensionless variable z, defined as the ratio of the unsaturated small-signal gain to the dissipative (nonuseful) optical loss, multiplied by a few simple constants. Laser design tradeoff studies and performance projections can be accomplished quickly with the help of several graphs and a simple hand calculator. Sample calculations for a high-gain Nd:YAG and a low-gain alexandrite laser are presented as illustrations of the technique.

Degnan, John J.↗

Data Structure and Parallel Decomposition Considerations on a Fibonacci Grid

The Fibonacci grid, proposed by Swinbank and Purser (see companion abstract), provides attractive properties for global numerical atmospheric prediction by offering an optimally homogeneous, geometrically regular, and approximately isotropic discretization, with only the polar regions requiring special numerical treatment. It is a mathematical idealization, applied to the sphere, of the multi-spiral patterns often found in botanical structures, such as in pine cones and sunflower heads. Computationally, it is natural to organize the domain, into zones, in each of which the same pair, or triple, of "Fibonacci spirals" dominate. But the further subdivision of such zones into "tiles" of a shape and size suitable for distribution to the processors of a massively parallel computer requires very careful consideration if the subsequent spatial computations along the respective spirals, especially those computations (such as compact differencing schemes) that involve recursion, can be implemented in an efficient "load-balanced "manner without requiring excessive amounts of inter-processor communications. In this paper we show how certain "number theoretic" properties of the Fibonacci sequence (whose numbers prescribe the multiplicity of successive spirals) may be exploited in the decomposition of grid zones into tidy arrangements of triangular grid tiles, each tile possessing one side approximately parallel to the constant-latitude zone boundary. We also describe how the spatially recursive processes may be decomposed across such a tiling, and the directionality of the recursions reversed on alternate grid lines, to ensure a very high degree of load balancing throughout the execution of the computations required for one time step of a global model.

Michalakes, John↗

Performance Analysis of Magnetohydrodynamic Drag Modulation for Actively Controlled Aerocapture at Neptune

Missions to the Ice Giants are a top priority for flagship missions this coming decade. However, a fully propulsive orbital insertion into these planets requires an immense amount of fuel, taking a significant portion of the spacecraft mass and restricting the scientific payload. To mitigate this, aerocapture has been heavily investigated. Although simulations have shown that aerodynamically controlled aerocapture can successfully insert into an orbit around both Ice Giants, the deep atmospheric pass required necessitates a complex, mass expensive, and sometimes prohibitive thermal protection system. Magnetohydrodynamic drag modulation serves as a potential alternative control method for aerocapture which could not only save propellant mass compared to fully propulsive orbital insertion, but also save thermal protection system mass compared to conventional aerocapture methods. Both aerodynamically controlled and magnetohydrodynamically controlled aerocapture methodologies were simulated in NASA Langley’s high-fidelity six degree-of-freedom flight dynamics code, the Program to Optimize Simulated Trajectories II. Each method was simulated to identical missions to Neptune using a numerical predictor-corrector algorithm to optimize the control towards the target orbit. The results concluded that magnetohydrodynamic drag modulation can successfully capture and performs on par with aerodynamic drag modulation while significantly reducing the heatflux and aeroshell complexity.

Danny N Nguyen↗

Application of optimal input synthesis to aircraft parameter identification

The Frequency Domain Input Synthesis procedure is used in identifying the stability and control derivatives of an aircraft. By using a frequency-domain approach, one can handle criteria that are not easily handled by the time-domain approaches. Numerical results are presented for optimal elevator deflections to estimate the longitudinal stability and control derivatives subject to root-mean square constraints on the input. The applicability of the steady state optimal inputs to finite duration flight testing is investigated. The steady state approximation of frequency-domain synthesis is good for data lengths greater than two time cycles for the short period mode of the aircraft longitudinal motions. Phase relationships between different frequency components become important for shorter data lengths. The frequency domain inputs are shown to be much better than the conventional doublet inputs.

Gupta, N. K.↗

The expanded LaGrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrainted optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗

The expanded Lagrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrained optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗

Thermal Property Estimation of Fibrous Insulation: Heat Transfer Modeling and the Continuous Genetic Algorithm

Thermal properties of high-temperature fibrous insulation materials were estimated from transient thermal tests using an inverse heat transfer technique. Transient temperature data from an experimental set up was collected and a simple, one-dimensional numerical model was constructed to replicate the temperatures within the test assembly. The Continuous Genetic Algorithm optimization technique in conjunction with a numerical thermal model and transient test data was used to estimate coefficients of a functional representation of the thermal property. The thermal properties, i.e., thermal conductivity and specific heat, of an alumina insulation felt were estimated over the temperature range of 300 K to 1700 K at various constant static pressures in nitrogen gas and compared with published data. The resulting thermal property estimates were within 10% of published values over the entire temperature range at various pressures. The methodology, application, and results are presented.

Frye, Elora↗

DeepONet-Assisted Optimization of Surface Topography for Transition Delay in A Mach 4.5 Boundary Layer

We use deep learning, an ensemble variationaltechnique (EnVar), and direct numerical simulations(DNS) to design an optimal topography for a two-dimensional roughness element that delays the on-set of laminar-turbulent transition in a Mach 4.5 flat-plate boundary layer. Deep operator networks (Deep-ONets), which have the known ability to learn com-plex nonlinear operators within dynamical systems,are used for machine learning. For the baseline config-uration of a smooth flat plate, the second-mode wavesat the DNS inflow cause a quick nonlinear breakdownof the high-speed boundary layer within the computa-tional domain. Results reported in the present studyvalidate the ability of DeepONets to model the tran-sition delay via a given topography of the roughnesselement. The computing cost to optimize the rough-ness element for minimal skin-friction drag is substan-tially lowered by the DeepONets-based reduced-ordermodel. In comparison to the baseline method of EnVaroptimization based on DNS alone, the DeepONets-based EnVar optimizer is able to delay transition pastthe outflow boundary of the computational domainwhile utilizing almost 5–6 times fewer DNS.

Machine Learning↗

Fast Numerical Methods for the Design of Layered Photonic Structures with Rough Interfaces

Modified boundary conditions (MBC) and a multilayer approach (MA) are proposed as fast and efficient numerical methods for the design of 1D photonic structures with rough interfaces. These methods are applicable for the structures, composed of materials with arbitrary permittivity tensor. MBC and MA are numerically validated on different types of interface roughness and permittivities of the constituent materials. The proposed methods can be combined with the 4x4 scattering matrix method as a field solver and an evolutionary strategy as an optimizer. The resulted optimization procedure is fast, accurate, numerically stable and can be used to design structures for various applications.

Komarevskiy, Nikolay↗

DeepONet-Assisted Optimization of Surface Topography for Transition Delay in a Mach 4.5 Boundary Layer

We use deep learning, an ensemble variational technique (EnVar), and direct numerical simulations(DNS) to design an optimal topography for a two-dimensional roughness element that delays the on-set of laminar-turbulent transition in a Mach 4.5 flat-plate boundary layer. Deep operator networks (DeepONets), which have the known ability to learn complex nonlinear operators within dynamical systems, are used for machine learning. For the baseline configuration of a smooth flat plate, the second-mode waves at the DNS inflow cause a quick nonlinear breakdown of the high-speed boundary layer within the computational domain. Results reported in the present study validate the ability of DeepONets to model the transition delay via a given topography of the roughness element. The computing cost to optimize the rough-ness element for minimal skin-friction drag is substantially lowered by the DeepONets-based reduced-order model. In comparison to the baseline method of EnVar optimization based on DNS alone, the DeepONets-based EnVar optimizer is able to delay transition past the outflow boundary of the computational domain while utilizing almost 5–6 times fewer DNS.

Machine Learning↗

Structural optimization with approximate sensitivities

Computational efficiency in structural optimization can be enhanced if the intensive computations associated with the calculation of the sensitivities, that is, gradients of the behavior constraints, are reduced. Approximation to gradients of the behavior constraints that can be generated with small amount of numerical calculations is proposed. Structural optimization with these approximate sensitivities produced correct optimum solution. Approximate gradients performed well for different nonlinear programming methods, such as the sequence of unconstrained minimization technique, method of feasible directions, sequence of quadratic programming, and sequence of linear programming. Structural optimization with approximate gradients can reduce by one third the CPU time that would otherwise be required to solve the problem with explicit closed-form gradients. The proposed gradient approximation shows potential to reduce intensive computation that has been associated with traditional structural optimization.

Patnaik, S. N.↗

Optimal moving grids for time-dependent partial differential equations

Various adaptive moving grid techniques for the numerical solution of time-dependent partial differential equations were proposed. The precise criterion for grid motion varies, but most techniques will attempt to give grids on which the solution of the partial differential equation can be well represented. Moving grids are investigated on which the solutions of the linear heat conduction and viscous Burgers' equation in one space dimension are optimally approximated. Precisely, the results of numerical calculations of optimal moving grids for piecewise linear finite element approximation of partial differential equation solutions in the least squares norm.

Wathen, A. J.↗

Optimal moving grids for time-dependent partial differential equations

Various adaptive moving grid techniques for the numerical solution of time-dependent partial differential equations were proposed. The precise criterion for grid motion varies, but most techniques will attempt to give grids on which the solution of the partial differential equation can be well represented. Moving grids are investigated on which the solutions of the linear heat conduction and viscous Burgers' equation in one space dimension are optimally approximated. Precisely, the results of numerical calculations of optimal moving grids for piecewise linear finite element approximation of PDE solutions in the least-squares norm are reported.

Wathen, A. J.↗

Optimal Control Problems with Switching Points

The main idea of this report is to give an overview of the problems and difficulties that arise in solving optimal control problems with switching points. A brief discussion of existing optimality conditions is given and a numerical approach for solving the multipoint boundary value problems associated with the first-order necessary conditions of optimal control is presented. Two real-life aerospace optimization problems are treated explicitly. These are altitude maximization for a sounding rocket (Goddard Problem) in the presence of a dynamic pressure limit, and range maximization for a supersonic aircraft flying in the vertical, also in the presence of a dynamic pressure limit. In the second problem singular control appears along arcs with active dynamic pressure limit, which in the context of optimal control, represents a first-order state inequality constraint. An extension of the Generalized Legendre-Clebsch Condition to the case of singular control along state/control constrained arcs is presented and is applied to the aircraft range maximization problem stated above. A contribution to the field of Jacobi Necessary Conditions is made by giving a new proof for the non-optimality of conjugate paths in the Accessory Minimum Problem. Because of its simple and explicit character, the new proof may provide the basis for an extension of Jacobi's Necessary Condition to the case of the trajectories with interior point constraints. Finally, the result that touch points cannot occur for first-order state inequality constraints is extended to the case of vector valued control functions.

Seywald, Hans↗