Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sequential optimal design”

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 109 records · Page 6

Integrated design and experimental validation of the CSI evolutionary structure

An experimental validation of the optimization-based integrated design methodology performed under the Controls-Structures Interaction (CSI) program for a class of flexible spacecraft is reviewed. The studies have been performed using an integrated design software tool which is under development at the NASA-Langley Research Center. It is analytically and experimentally demonstrated that integrated controls-structures design can yield designs which are substantially superior to those obtained through the traditional sequential approach.

Maghami, P. G.↗

Coordinated design of coding and modulation systems

The joint optimization of the coding and modulation systems employed in telemetry systems was investigated. Emphasis was placed on formulating inner and outer coding standards used by the Goddard Spaceflight Center. Convolutional codes were found that are nearly optimum for use with Viterbi decoding in the inner coding of concatenated coding systems. A convolutional code, the unit-memory code, was discovered and is ideal for inner system usage because of its byte-oriented structure. Simulations of sequential decoding on the deep-space channel were carried out to compare directly various convolutional codes that are proposed for use in deep-space systems.

Massey, J. L.↗

Stacking optimization of compressor blades of gas turbine engines

A procedure is presented to obtain optimal designs of axial compressor blades with structural design constraints. Coefficients of the polynomials defining the circumferential tilting angles and the axial leaning distances of the airfoil cross sections from the initial design geometry are used as design variables. The compressor blades are modeled by 20-node solid elements. An efficient finite element method is developed for modal analysis and sensitivity analysis with respect to the design variables. Based on this information, a sequential linear programming method is applied to calculate the required change of geometry for the desired structural design constraints.

Cheu, Tsu-Chien↗

Optimizing for minimum weight when two different finite element models and analyses are required

The Finite Element Structural Optimization Program's (FESOP) ability to perform minimum weight optimization using two different finite element analyses and models is discussed. FESOP uses the ADS optimizer developed by Dr. Garret Vanderplaats to solve the nonlinear constrained optimization problem. The design optimization problem requires a response spectrum analysis and model to evaluate the stress and displacement constraints. However, the problem needs a frequency analysis and model to calculate the natural frequencies used to evaluate the frequency range constraints. The results of both the successful and unsuccessful approaches used to solve this difficult weight minimization problem are summarized. The results show that no one ADS optimization algorithm worked in all cases. However, the Sequential Convex Programming and Modified Method of Feasible Directions algorithms were the most successful.

Hall, Jeffrey C.↗

Design for temperature and thermal buckling constraints employing a noneigenvalue formulation

A numerical procedure for simultaneous consideration of structural/thermal interactions during aircraft design is presented, with an emphasis on reentry vehicles such as the Orbiter. It has been shown that sequential design is inappropriate for reentry vehicles, due to the degradation of the material properties at elevated reentry temperatures. Attention is focused on thermal buckling, using an analytical technique that involves requiring that the stability matrix be positive definite, with the diagonal terms on the Gauss-Doolittle factor of the matrix also constrained to be positive. A finite element method is employed to calculate the derivative of the diagonal matrix, with optimization achieved by minimization of the mass of the structure and thermal protection system. Sample calculations are presented in terms of the aluminum structure and insulation for a section of the Orbiter wing bay.

Haftka, R. T.↗

The potential application of the blackboard model of problem solving to multidisciplinary design

Problems associated with the sequential approach to multidisciplinary design are discussed. A blackboard model is suggested as a potential tool for implementing the multilevel decomposition approach to overcome these problems. The blackboard model serves as a global database for the solution with each discipline acting as a knowledge source for updating the solution. With this approach, it is possible for engineers to improve the coordination, communication, and cooperation in the conceptual design process, allowing them to achieve a more optimal design from an interdisciplinary standpoint.

Rogers, J. L.↗

Efficient Parallel Kernel Solvers for Computational Fluid Dynamics Applications

Distributed-memory parallel computers dominate today's parallel computing arena. These machines, such as Intel Paragon, IBM SP2, and Cray Origin2OO, have successfully delivered high performance computing power for solving some of the so-called "grand-challenge" problems. Despite initial success, parallel machines have not been widely accepted in production engineering environments due to the complexity of parallel programming. On a parallel computing system, a task has to be partitioned and distributed appropriately among processors to reduce communication cost and to attain load balance. More importantly, even with careful partitioning and mapping, the performance of an algorithm may still be unsatisfactory, since conventional sequential algorithms may be serial in nature and may not be implemented efficiently on parallel machines. In many cases, new algorithms have to be introduced to increase parallel performance. In order to achieve optimal performance, in addition to partitioning and mapping, a careful performance study should be conducted for a given application to find a good algorithm-machine combination. This process, however, is usually painful and elusive. The goal of this project is to design and develop efficient parallel algorithms for highly accurate Computational Fluid Dynamics (CFD) simulations and other engineering applications. The work plan is 1) developing highly accurate parallel numerical algorithms, 2) conduct preliminary testing to verify the effectiveness and potential of these algorithms, 3) incorporate newly developed algorithms into actual simulation packages. The work plan has well achieved. Two highly accurate, efficient Poisson solvers have been developed and tested based on two different approaches: (1) Adopting a mathematical geometry which has a better capacity to describe the fluid, (2) Using compact scheme to gain high order accuracy in numerical discretization. The previously developed Parallel Diagonal Dominant (PDD) algorithm and Reduced Parallel Diagonal Dominant (RPDD) algorithm have been carefully studied on different parallel platforms for different applications, and a NASA simulation code developed by Man M. Rai and his colleagues has been parallelized and implemented based on data dependency analysis. These achievements are addressed in detail in the paper.

Sun, Xian-He↗

Progress Toward a Compact 0.05 K Magnet Refrigerator Operating from 10 K

Much of the most interesting information regarding our universe is hidden in the sub-millimeter, infrared, and x-rays bands of the spectrum, to which our atmosphere is largely opaque. Thus, missions exploring these bands are a very important part of NASA s Space Science program. Coincidentally, the most sensitive detectors in these spectral regions operate at extremely low temperatures, typically 0.05 - 0.10 K. Generally these temperatures will be achieved using magnetic refrigerators, also know as Adiabatic Demagnetization Refrigerators, or ADRs. Current ADRs, such as the one used in the XRS-II instrument on the Astro-E2 satellite, use a single-stage to cool detectors from 1.3 K to 0.06 K. The ADR is designed so that it can absorb the heat on the detector stage for at least 24 hours before it must stop, warm up to the helium bath temperature (1.3 K), and dump the accumulated heat. Future detector arrays will be much larger and will have higher heat dissipation. Furthermore, future missions will use mechanical cryocoolers to provide upper stage cooling, but they can only reach 4 - 10 K. Trying to scale heavy (-15 kg) single stage ADRs up to the higher heat loads and higher heat rejection temperatures required leads to unacceptably large systems. The GSFC Cryogenics Branch has developed the Continuous ADR (CADR) to solve this problem. The CADR consists of a series of ADR stages that sequentially pass heat from the load up to the high temperature heat sink. The stage connected to the load remains at a constant temperature. The continuous stage effectively decouples detector operation from ADR operation, allowing the ADR stages to be cycled much more rapidly. Rapid cycling leads to higher cooling power density. The cascading, multistage arrangement allows the magnetic refrigerant of each stage to be optimized for its own temperature swing. In the past year, we have made good progress toward a 0.05 to 10K system. A four-stage system that operates from 4.2 K was demonstrated. Magnetic shielding was added to eliminate inter-stage coupling. Improvements were made to superconducting and passive gas-gap heat switches. A second type of passive gas gap switch, one meant for use at higher temperature, was demonstrated. The presentation will focus primarily on these recent design improvements, and on the challenges that remain on the progress toward a system that will operate from 10 K or higher.

Canavan, Edgar↗

Stacking sequence optimization of simply supported laminates with stability and strain constraints

An integer programming formulation for the design of symmetric and balanced rectangular composite laminates with simply supported boundary conditions subject to buckling and strain constraints is presented. The design variables that define the stacking sequence of the laminate are ply-identity zero-one integers. The buckling constraint is linear in terms of the ply-identity design variables, but strains are nonlinear functions of these variables. A linear approximation is developed for the strain constraints so that the problem can be solved by sequential linearization using the branch and bound algorithm. Examples of graphite-epoxy plates under biaxial compression are presented. Optimum stacking sequences obtained using the linear approximation are compared with global optimum designs obtained using a genetic search procedure.

Nagendra, S.↗

Design and implementation of a parallel unstructured Euler solver using software primitives

This paper is concerned with the implementation of a three-dimensional unstructured-grid Euler solver on massively parallel distributed-memory computer architectures. The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm. An unstructured multigrid algorithm with an edge-based data structure has been adopted, and a number of optimizations have been devised and implemented to accelerate the parallel computational rates. The implementation is carried out by creating a set of software tools, which provide an interface between the parallelization issues and the sequential code, while providing a basis for future automatic run-time compilation support. Large practical unstructured grid problems are solved on the Intel iPSC/860 hypercube and Intel Touchstone Delta machine. The quantitative effects of the various optimizations are demonstrated, and we show that the combined effect of these optimizations leads to roughly a factor of 3 performance improvement. The overall solution efficiency is compared with that obtained on the Cray Y-MP vector supercomputer.

Das, R.↗

The design and implementation of a parallel unstructured Euler solver using software primitives

This paper is concerned with the implementation of a three-dimensional unstructured grid Euler-solver on massively parallel distributed-memory computer architectures. The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm. An unstructured multigrid algorithm with an edge-based data structure has been adopted, and a number of optimizations have been devised and implemented in order to accelerate the parallel communication rates. The implementation is carried out by creating a set of software tools, which provide an interface between the parallelization issues and the sequential code, while providing a basis for future automatic run-time compilation support. Large practical unstructured grid problems are solved on the Intel iPSC/860 hypercube and Intel Touchstone Delta machine. The quantitative effect of the various optimizations are demonstrated, and we show that the combined effect of these optimizations leads to roughly a factor of three performance improvement. The overall solution efficiency is compared with that obtained on the CRAY-YMP vector supercomputer.

Das, R.↗

The GPM Combined Algorithm

In this paper, the operational Global Precipitation Measurement (GPM) mission combined radar-radiometer algorithm is thoroughly described. The operational combined algorithm is designed to reduce uncertainties in GPM Core Observatory precipitation estimates by effectively integrating complementary information from the GPM Dual-Frequency Precipitation Radar (DPR) and the GPM Microwave Imager (GMI) into an optimal, physically consistent precipitation product. Although similar in many respects to previously developed combined algorithms, the GPM combined algorithm has several unique features that are specifically designed to meet the GPM objectives of deriving, based on GPM Core Observatory information, accurate and physically consistent precipitation estimates from multiple spaceborne instruments, and ancillary environmental data from reanalyses. The algorithm features an optimal estimation framework based on a statistical formulation of the Gauss-Newton method, a parameterization for the nonuniform distribution of precipitation within the radar fields of view, a methodology to detect and account for multiple scattering in Ka-band DPR observations, and a statistical deconvolution technique that allows for an efficient sequential incorporation of radiometer information into DPR precipitation retrievals.

Grecu, Mircea↗

Optimal design and use of retry in fault tolerant real-time computer systems

A new method to determin an optimal retry policy and for use in retry of fault characterization is presented. An optimal retry policy for a given fault characteristic, which determines the maximum allowable retry durations to minimize the total task completion time was derived. The combined fault characterization and retry decision, in which the characteristics of fault are estimated simultaneously with the determination of the optimal retry policy were carried out. Two solution approaches were developed, one based on the point estimation and the other on the Bayes sequential decision. The maximum likelihood estimators are used for the first approach, and the backward induction for testing hypotheses in the second approach. Numerical examples in which all the durations associated with faults have monotone hazard functions, e.g., exponential, Weibull and gamma distributions are presented. These are standard distributions commonly used for modeling analysis and faults.

Lee, Y. H.↗

Application of Monte Carlo techniques to optimization of high-energy beam transport in a stochastic environment

An algorithm employing a modified sequential random perturbation, or creeping random search, was applied to the problem of optimizing the parameters of a high-energy beam transport system. The stochastic solution of the mathematical model for first-order magnetic-field expansion allows the inclusion of state-variable constraints, and the inclusion of parameter constraints allowed by the method of algorithm application eliminates the possibility of infeasible solutions. The mathematical model and the algorithm were programmed for a real-time simulation facility; thus, two important features are provided to the beam designer: (1) a strong degree of man-machine communication (even to the extent of bypassing the algorithm and applying analog-matching techniques), and (2) extensive graphics for displaying information concerning both algorithm operation and transport-system behavior. Chromatic aberration was also included in the mathematical model and in the optimization process. Results presented show this method as yielding better solutions (in terms of resolutions) to the particular problem than those of a standard analog program as well as demonstrating flexibility, in terms of elements, constraints, and chromatic aberration, allowed by user interaction with both the algorithm and the stochastic model. Example of slit usage and a limited comparison of predicted results and actual results obtained with a 600 MeV cyclotron are given.

Parrish, R. V.↗

Integrated aerodynamic-structural design of a transport wing

The integrated aerodynamic-structural design of a subsonic transport wing for minimum weight subject to required range is formulated and solved. The problem requires large computational resources, and two methods are used to alleviate the computational burden. First, a modular sensitivity method that permits the usage of black-box disciplinary software packages, is used to reduce the cost of sensitivity derivatives. In particular, it is shown that derivatives of the aeroelastic response and divergence speed can be calculated without the costly computation of derivatives of aerodynamic influence coefficient and structural stiffness matrices. A sequential approximate optimization is used to further reduce computational cost. The optimization procedure is shown to require a relatively small number of analysis and sensitivity calculations.

Grossman, B.↗

Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

We developed framework and the mathematical formulation for optimizing communication network using mixed integer programming. The design yields a system that is much smaller, in search space size, when compared to the earlier approach. Our constrained network optimization takes into account the dynamics of link performance within the network along with mission and operation requirements. A unique penalty function is introduced to transform the mixed integer programming into the more manageable problem of searching in a continuous space. The constrained optimization problem was proposed to solve in two stages: first using the heuristic Particle Swarming Optimization algorithm to get a good initial starting point, and then feeding the result into the Sequential Quadratic Programming algorithm to achieve the final optimal schedule. We demonstrate the above planning and scheduling methodology with a scenario of 20 spacecraft and 3 ground stations of a Deep Space Network site. Our approach and framework have been simple and flexible so that problems with larger number of constraints and network can be easily adapted and solved.

Mixed Integer Programming↗

Aircraft design optimization with multidisciplinary performance criteria

The method described here for aircraft design optimization with dynamic response considerations provides an inexpensive means of integrating dynamics into aircraft preliminary design. By defining a dynamic performance index that can be added to a conventional objective function, a designer can investigate the trade-off between performance and handling (as measured by the vehicle's unforced response). The procedure is formulated to permit the use of control system gains as design variables, but does not require full-state feedback. The examples discussed here show how such an approach can lead to significant improvements in the design as compared with the more common sequential design of system and control law.

Morris, Stephen↗

Shape Optimization of Vortex Generators to Control Mack Mode Amplification

This paper demonstrates the potential to use shape optimization for the design of vortex generators in an axisymmetric boundary layer. This shape optimization increases the amplitude of stationary streaks created by streamwise vorticity, with the goal of reducing the amplification of Mack mode instabilities. The test case under consideration matches a trajectory point during the ascent phase of the HIFiRE-1 flight experiment. Wall-mounted vortex generators are added to the cone and their shape is optimized to control the amplification of Mack mode instabilities that are known to initiate laminar-turbulent transition in this flow. An empirical objective function is developed based on the previous studies of optimal streaks. A constraint on the maximum streak amplitude is added to avoid the initiation of bypass transition. The shape optimization is conducted using SU2, an open-source suite for multiphysics simulation and design. A significant improvement is observed in an integral metric of the streak amplitude, while the maximum streak amplitude is maintained close to the baseline level. The qualitative features of the optimized geometry are discussed.

Vortex generators↗