Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear 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 649 records · Page 36

The 'optimum' upwind advection on a triangular mesh

For advection schemes based on fluctuation splitting, a design criterion of optimizing the time step leads to linear schemes that coincide with those designed for least truncation error. A further stage of optimizing the time step using a nonlinear positivity criterion, leads to considerable further gains in resolution.

Roe, P. L.↗

Multivariable control of the Space Shuttle Remote Manipulator System

Linear controllers are designed to regulate the end effector of the Space Shuttle Remote Manipulator System (SRMS) operating in position hold mode. Design techniques used include H2 and H-infinity optimization. The nonlinear SRMS is linearized by modeling the effects of the significant nonlinearities as uncertain parameters. Each regulator design is evaluated for robust stability using both the small gain theorem with an H-infinity norm and the less conservative mu-analysis test. Regulator designs offer significant improvement over the current system for the nominal plant. Unfortunately, the SRMS model suffers from lightly damped poles with real parametric uncertainty. Under such conditions, the mu-analysis test, which allows for complex perturbations, cannot guarantee robust stability.

Adams, Neil J.↗

Robustified time-optimal control of uncertain structural dynamic systems

A new approach for computing open-loop time-optimal control inputs for uncertain linear dynamical systems is developed. In particular, the single-axis, rest-to-rest maneuvering problem of flexible spacecraft in the presence of uncertainty in model parameters is considered. Robustified time-optimal control inputs are obtained by solving a parameter optimization problem subject to robustness constraints. A simple dynamical system with a rigid-body mode and one flexible mode is used to illustrate the concept.

Liu, Qiang↗

Modal methods in optimal control synthesis

Efficient algorithms for solving linear smoother-follower problems with quadratic criteria are presented. For time-invariant systems, the algorithm consists of one backward integration of a linear vector equation and one forward integration of another linear vector equation. Furthermore, the backward and forward Riccati matrices can be expressed in terms of the eigenvalues and eigenvectors of the Euler-Lagrange equations. Hence, the gains of the forward and backward Kalman-Bucy filters and of the optimal state-feedback regulator can be determined without integration of matrix Riccati equations. A computer program has been developed, based on this method of determining the gains, to synthesize the optimal time-invariant compensator in the presence of random disturbance inputs and random measurement errors. The program also computes the rms state and control variables of the optimal closed-loop system.

Bryson, A. E., Jr.↗

Eigenvalue Sensitivity Computations for Linear Stability Theory

To realize the drag reduction benefit of boundary-layer transition control strategies, it is crucial to integrate transition prediction into the vehicle design through an optimization process. The integration of transition prediction based on linear stability analysis into adjoint d design optimization requires coupling an adjoint enabled computational fluid dynamics (CFD) solver with an adjoint enabled linear stability code. In particular, the boundary-layer transition location is often predicted using the N-factor method based on linear stability theory (LST). Thus, sensitivity of the linear-stability eigenvalues constitute an essential building block for optimizing the laminar flow performance. The present paper describes an implementation of LST eigenvalue sensitivity analysis that can be easily coupled with a CFD solver. Specifically, we describe a discrete adjoint formulation for the transition location prediction based on the N-factor method. The verification of this formulation is carried out by comparing the adjoint-based sensitivity of the local growth rate of a given instability mode with respect to the disturbance frequency, and the adjoint-based sensitivity of the transition location with respect to spanwise wavenumber with those sensitivities computed using a finite-difference approximation. Finally, the adjoint LST formulation is applied to flat-plate boundary-layer flows at transonic, supersonic, and hypersonic conditions, to determine the behavior and sensitivities of the transition location with respect to a range of disturbance spanwise wavenumbers.

Boundary Layer Transition↗

Estimation of optimal Kalman filter gain from non-optimal filter residuals

This paper presents a novel method of estimating the optimal steady state Kalman filter gain of a linear discrete time-invariant system from a non-optimal Kalman filter residual sequence. The relation between the optimal residual sequence and a signal derived from the non-optimal residual sequence is described by a Moving Average (MA) model whose coefficients are expressed in terms of the state space parameters and the optimal steady state Kalman filter gain. In order to identify the MA model, a whitening filter of the derived signal, which corresponds to an AutoRegressive (AR) model of the signal, is first identified using the least-squares method. Then the inverse filter of the whitening filter, which corresponds to the MA model, is calculated. From the coefficients of the identified MA model, the optimal steady state Kalman filter gain can be obtained. Numerical example is provided to illustrate the feasibility of this approach.

Chen, Chung-Wen↗

Optimization by decomposition in structural and multidisciplinary applications

An algorithm for a general, multilevel structural optimization by substructuring is derived, based on the linear decomposition concept that is rooted in the Bellman's Optimality Criterion enhanced with the optimum sensitivity derivatives used as a means to account for coupling among the subproblems, each of which is limited to optimization of a substructure. The algorithm applies also to those multidisciplinary problems whose subproblems form a hierarchy similar to that of substructures. In systems where the subproblems communicate with each other at the same level, the decomposition becomes non-hierarchic and the system may be optimized as a whole based on the derivatives of the system behavior with respect to the design variables computed by a method that bypasses finite differencing on the system analysis. When a multidisciplinary system includes a structure as its part, a hybrid, hierarchic/non-hierarchic decomposition applies. Numerical examples and references to computational experience accumulated to date illustrate the discussion.

Sobieszczanski-Sobieski, Jaroslaw↗

A rotor optimization using regression analysis

The design and development of helicopter rotors is subject to the many design variables and their interactions that effect rotor operation. Until recently, selection of rotor design variables to achieve specified rotor operational qualities has been a costly, time consuming, repetitive task. For the past several years, Kaman Aerospace Corporation has successfully applied multiple linear regression analysis, coupled with optimization and sensitivity procedures, in the analytical design of rotor systems. It is concluded that approximating equations can be developed rapidly for a multiplicity of objective and constraint functions and optimizations can be performed in a rapid and cost effective manner; the number and/or range of design variables can be increased by expanding the data base and developing approximating functions to reflect the expanded design space; the order of the approximating equations can be expanded easily to improve correlation between analyzer results and the approximating equations; gradients of the approximating equations can be calculated easily and these gradients are smooth functions reducing the risk of numerical problems in the optimization; the use of approximating functions allows the problem to be started easily and rapidly from various initial designs to enhance the probability of finding a global optimum; and the approximating equations are independent of the analysis or optimization codes used.

Giansante, N.↗

On the design of classifiers for crop inventories

Crop proportion estimators that use classifications of satellite data to correct, in an additive way, a given estimate acquired from ground observations are discussed. A linear version of these estimators is optimal, in terms of minimum variance, when the regression of the ground observations onto the satellite observations in linear. When this regression is not linear, but the reverse regression (satellite observations onto ground observations) is linear, the estimator is suboptimal but still has certain appealing variance properties. In this paper expressions are derived for those regressions which relate the intercepts and slopes to conditional classification probabilities. These expressions are then used to discuss the question of classifier designs that can lead to low-variance crop proportion estimates. Variance expressions for these estimates in terms of classifier omission and commission errors are also derived.

Heydorn, R. P.↗

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 reliable algorithm for optimal control synthesis

In recent years, powerful design tools for linear time-invariant multivariable control systems have been developed based on direct parameter optimization. In this report, an algorithm for reliable optimal control synthesis using parameter optimization is presented. Specifically, a robust numerical algorithm is developed for the evaluation of the H(sup 2)-like cost functional and its gradients with respect to the controller design parameters. The method is specifically designed to handle defective degenerate systems and is based on the well-known Pade series approximation of the matrix exponential. Numerical test problems in control synthesis for simple mechanical systems and for a flexible structure with densely packed modes illustrate positively the reliability of this method when compared to a method based on diagonalization. Several types of cost functions have been considered: a cost function for robust control consisting of a linear combination of quadratic objectives for deterministic and random disturbances, and one representing an upper bound on the quadratic objective for worst case initial conditions. Finally, a framework for multivariable control synthesis has been developed combining the concept of closed-loop transfer recovery with numerical parameter optimization. The procedure enables designers to synthesize not only observer-based controllers but also controllers of arbitrary order and structure. Numerical design solutions rely heavily on the robust algorithm due to the high order of the synthesis model and the presence of near-overlapping modes. The design approach is successfully applied to the design of a high-bandwidth control system for a rotorcraft.

Vansteenwyk, Brett↗

Use of High Fidelity Methods in Multidisciplinary Optimization-A Preliminary Survey

Multidisciplinary optimization is a key element of design process. To date multidiscipline optimization methods that use low fidelity methods are well advanced. Optimization methods based on simple linear aerodynamic equations and plate structural equations have been applied to complex aerospace configurations. However, use of high fidelity methods such as the Euler/ Navier-Stokes for fluids and 3-D (three dimensional) finite elements for structures has begun recently. As an activity of Multidiscipline Design Optimization Technical Committee (MDO TC) of AIAA (American Institute of Aeronautics and Astronautics), an effort was initiated to assess the status of the use of high fidelity methods in multidisciplinary optimization. Contributions were solicited through the members MDO TC committee. This paper provides a summary of that survey.

Guruswamy, Guru P.↗

Accumulated approximation: A new method for structural optimization by iterative improvement

A new method for the solution of non-linear mathematical programming problems in the field of structural optimization is presented. It is an iterative scheme which for each iteration refines the approximation of objective and constraint functions by accumulating the function values of previously visited design points. The method has proven to be competitive for a number of well-known examples of which one is presented here. Furthermore because of the accumulation strategy, the method produces convergence even when the sensitivity analysis is inaccurate.

Rasmussen, John↗

A rapid method for optimization of the rocket propulsion system for single-stage-to-orbit vehicles

A rapid analytical method for the optimization of rocket propulsion systems is presented for a vertical take-off, horizontal landing, single-stage-to-orbit launch vehicle. This method utilizes trade-offs between propulsion characteristics affecting flight performance and engine system mass. The performance results from a point-mass trajectory optimization program are combined with a linearized sizing program to establish vehicle sizing trends caused by propulsion system variations. The linearized sizing technique was developed for the class of vehicle systems studied herein. The specific examples treated are the optimization of nozzle expansion ratio and lift-off thrust-to-weight ratio to achieve either minimum gross mass or minimum dry mass. Assumed propulsion system characteristics are high chamber pressure, liquid oxygen and liquid hydrogen propellants, conventional bell nozzles, and the same fixed nozzle expansion ratio for all engines on a vehicle.

Eldred, C. H.↗

Computationally efficient control allocation

A computationally efficient method for calculating near-optimal solutions to the three-objective, linear control allocation problem is disclosed. The control allocation problem is that of distributing the effort of redundant control effectors to achieve some desired set of objectives. The problem is deemed linear if control effectiveness is affine with respect to the individual control effectors. The optimal solution is that which exploits the collective maximum capability of the effectors within their individual physical limits. Computational efficiency is measured by the number of floating-point operations required for solution. The method presented returned optimal solutions in more than 90% of the cases examined; non-optimal solutions returned by the method were typically much less than 1% different from optimal and the errors tended to become smaller than 0.01% as the number of controls was increased. The magnitude of the errors returned by the present method was much smaller than those that resulted from either pseudo inverse or cascaded generalized inverse solutions. The computational complexity of the method presented varied linearly with increasing numbers of controls; the number of required floating point operations increased from 5.5 i, to seven times faster than did the minimum-norm solution (the pseudoinverse), and at about the same rate as did the cascaded generalized inverse solution. The computational requirements of the method presented were much better than that of previously described facet-searching methods which increase in proportion to the square of the number of controls.

Durham, Wayne↗