Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “multi-stage 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 19 records

Design of optimally smoothing multi-stage schemes for the Euler equations

In this paper, a method is developed for designing multi-stage schemes that give optimal damping of high-frequencies for a given spatial-differencing operator. The objective of the method is to design schemes that combine well with multi-grid acceleration. The schemes are tested on a nonlinear scalar equation, and compared to Runge-Kutta schemes with the maximum stable time-step. The optimally smoothing schemes perform better than the Runge-Kutta schemes, even on a single grid. The analysis is extended to the Euler equations in one space-dimension by use of 'characteristic time-stepping', which preconditions the equations, removing stiffness due to variations among characteristic speeds. Convergence rates independent of the number of cells in the finest grid are achieved for transonic flow with and without a shock. Characteristic time-stepping is shown to be preferable to local time-stepping, although use of the optimally damping schemes appears to enhance the performance of local time-stepping. The extension of the analysis to the two-dimensional Euler equations is hampered by the lack of a model for characteristic time-stepping in two dimensions. Some results for local time-stepping are presented.

Van Leer, Bram↗

Tetrahedron Formation Control

Spacecraft flying in tetrahedron formations are excellent instrument platforms for electromagnetic and plasma studies. A minimum of four spacecraft - to establish a volume - is required to study some of the key regions of a planetary magnetic field. The usefulness of the measurements recorded is strongly affected by the tetrahedron orbital evolution. This paper considers the preliminary development of a general optimization procedure for tetrahedron formation control. The maneuvers are assumed to be impulsive and a multi-stage optimization method is employed. The stages include targeting to a fixed tetrahedron orientation, rotating and translating the tetrahedron and/or varying the initial and final times. The number of impulsive maneuvers citn also be varied. As the impulse locations and times change, new arcs are computed using a differential corrections scheme that varies the impulse magnitudes and directions. The result is a continuous trajectory with velocity discontinuities. The velocity discontinuities are then used to formulate the cost function. Direct optimization techniques are employed. The procedure is applied to the Magnetospheric Multiscale Mission (MMS) to compute preliminary formation control fuel requirements.

Guzman, Jose J.↗

Tetrahedron Formation Control

This paper considers the preliminary development of a general optimization procedure for tetrahedron formation control. The maneuvers are assumed to be impulsive and a multi-stage optimization method is employed. The stages include (1) targeting to a fixed tetrahedron location and orientation, and (2) rotating and translating the tetrahedron. The number of impulsive maneuvers can also be varied. As the impulse locations and times change, new arcs are computed using a differential corrections scheme that varies the impulse magnitudes and directions. The result is a continuous trajectory with velocity discontinuities. The velocity discontinuities are then used to formulate the cost function. Direct optimization techniques are employed. The procedure is applied to the NASA Goddard Magnetospheric Multi-Scale (MMS) mission to compute preliminary formation control fuel requirements.

Petruzzo, Charles↗

A genetic technique for planning a control sequence to navigate the state space with a quasi-minimum-cost output trajectory for a non-linear multi-dimnensional system

There are many multi-stage optimization problems that are not easily solved through any known direct method when the stages are coupled. For instance, we have investigated the problem of planning a vehicle's control sequence to negotiate obstacles and reach a goal in minimum time. The vehicle has a known mass, and the controlling forces have finite limits. We have developed a technique that finds admissible control trajectories which tend to minimize the vehicle's transit time through the obstacle field. The immediate applications is that of a space robot which must rapidly traverse around 2-or-3 dimensional structures via application of a rotating thruster or non-rotating on-off for such vehicles is located at the Marshall Space Flight Center in Huntsville Alabama. However, it appears that the development method is applicable to a general set of optimization problems in which the cost function and the multi-dimensional multi-state system can be any nonlinear functions, which are continuous in the operating regions. Other applications included the planning of optimal navigation pathways through a transversability graph; the planning of control input for under-water maneuvering vehicles which have complex control state-space relationships; the planning of control sequences for milling and manufacturing robots; the planning of control and trajectories for automated delivery vehicles; and the optimization and athletic training in slalom sports.

Hein, C.↗

Multi-stage design of an optimal momentum management controller for the Space Station

This paper presents a multistage design scheme for determining an optimal control-moment-gyro momentum-management and attitude-control system for the Space Station Freedom. The Space Station equations of motion are linearized and block-decomposed into two block-decoupled subsystems using the matrix-sign algorithm. A sequential procedure is utilized for designing a linear-quadratic regulator for each subsystem, which optimally places the eigenvalues of the closed-loop subsystem in the region of an open sector, bounded by lines inclined at + or - pi/2k (for k = 2 or 3) from the negative real axis, and the left-hand side of a line parallel to the imaginary axis in the s-plane. Simulation results are presented to compare the resultant designs.

Sunkel, J. W.↗

Efficient Multi-Stage Time Marching for Viscous Flows via Local Preconditioning

A new method has been developed to accelerate the convergence of explicit time-marching, laminar, Navier-Stokes codes through the combination of local preconditioning and multi-stage time marching optimization. Local preconditioning is a technique to modify the time-dependent equations so that all information moves or decays at nearly the same rate, thus relieving the stiffness for a system of equations. Multi-stage time marching can be optimized by modifying its coefficients to account for the presence of viscous terms, allowing larger time steps. We show it is possible to optimize the time marching scheme for a wide range of cell Reynolds numbers for the scalar advection-diffusion equation, and local preconditioning allows this optimization to be applied to the Navier-Stokes equations. Convergence acceleration of the new method is demonstrated through numerical experiments with circular advection and laminar boundary-layer flow over a flat plate.

Kleb, William L.↗

Efficient Multi-Stage Time Marching for Viscous Flows via Local Preconditioning

A new method has been developed to accelerate the convergence of explicit time-marching, laminar, Navier-Stokes codes through the combination of local preconditioning and multi-stage time marching optimization. Local preconditioning is a technique to modify the time-dependent equations so that all information moves or decays at nearly the same rate, thus relieving the stiffness for a system of equations. Multi-stage time marching can be optimized by modifying its coefficients to account for the presence of viscous terms, allowing larger time steps. We show it is possible to optimize the time marching scheme for a wide range of cell Reynolds numbers for the scalar advection-diffusion equation, and local preconditioning allows this optimization to be applied to the Navier-Stokes equations. Convergence acceleration of the new method is demonstrated through numerical experiments with circular advection and laminar boundary-layer flow over a flat plate.

Kleb, William L.↗

Measurement of interstage fluid-annulus dynamical properties

The work described in this paper is part of an Electric Power Research Institute sponsored effort to improve rotor vibrational performance on power plant feed water pumps. A major objective of this effort is to reduce vibration levels by devising inter-stage sealing configurations with optimized damping capacity, realizing that the typical multi-stage centrifugal pump has several ore inter-stage fluid annuli than it has journal bearings. Also, the fluid annuli are distributed between the journal bearings where vibration levels are highest and can therefore be 'exercised' more as dampers than can the bearings. Described in this paper is a test apparatus which has been built to experimentally determine fluid-annulus dynamical coefficients for various configurations of inter-stage sealing geometry.

Adams, M. L.↗

Refocusing of the spent axisymmetric beam in klystron tubes

Analytic methods were developed and employed to optimize the magnetic field transition region between the output interaction gap of a klystron and a multi-stage depressed potential electrostatic beam collector, in order to enhance the power conversion efficiency of satellite-borne broadcast transmitters. Permanent magnet structures were designed to provide the magnetic field distributions required to expand and recollimate the spent electron beam of the power amplifier klystron for proper entry into the beam collector. These design criteria for magnetic field distributions for expanding and recollimating spent-beam electrons for optimal entry into a multi-stage depressed potential collector are generally applicable to traveling-wave tubes as well as klystrons.

Branch, G. M.↗

A Simulated Annealing Algorithm for the Optimization of Multistage Depressed Collector Efficiency

The microwave traveling wave tube amplifier (TWTA) is widely used as a high-power transmitting source for space and airborne communications. One critical factor in designing a TWTA is the overall efficiency. However, overall efficiency is highly dependent upon collector efficiency; so collector design is critical to the performance of a TWTA. Therefore, NASA Glenn Research Center has developed an optimization algorithm based on Simulated Annealing to quickly design highly efficient multi-stage depressed collectors (MDC).

Vaden, Karl R.↗

Two-dimensional computations of multi-stage compressor flows using a zonal approach

A clear understanding of the fluid dynamics associated with rotor/stator configurations can be very helpful when optimizing the performance of turbomachinery. In this study, a two-dimensional, implicit, thin-layer, Navier-Stokes zonal approach has been used to investigate the flow within a 2 1/2-stage compressor. Relative motion between the rotor and stator airfoils is made possible with the use of systems of patched and overlaid grids that move with respect to each other. The treatment of multistage turbomachines with arbitrary numbers of airfoils per row is made possible by the use of a flexible database system. Results in the form of instantaneous pressure and entropy contours and time-averaged pressures are presented for the 2 1/2-stage compressor. Time-averaged pressures and pressure amplitudes for a single-stage turbine configuration are also presented. The numerical results compare well with experimental data.

Gundy-Burlet, Karen L.↗

Tailoring explicit time-marching schemes to improve convergence characteristics

Multi-stage time-stepping schemes, tailored to chosen spatial-differencing operators, are derived and tested. The schemes are constructed to give optimal damping of the high-frequency waves. They are ideal for use with multi-grid acceleration. The concept of characteristic time-stepping, necessary for the extension of the scalar analysis to systems of equations, is presented. The schemes show a marked improvement over Runge-Kutta schemes.

Powell, Kenneth G.↗

An algorithm for the solution of dynamic linear programs

The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation scheme.

Psiaki, Mark L.↗

Numerical Methodology for Coupled Time-Accurate Simulations of Primary and Secondary Flowpaths in Gas Turbines

Detailed information of the flow-fields in the secondary flowpaths and their interaction with the primary flows in gas turbine engines is necessary for successful designs with optimized secondary flow streams. Present work is focused on the development of a simulation methodology for coupled time-accurate solutions of the two flowpaths. The secondary flowstream is treated using SCISEAL, an unstructured adaptive Cartesian grid code developed for secondary flows and seals, while the mainpath flow is solved using TURBO, a density based code with capability of resolving rotor-stator interaction in multi-stage machines. An interface is being tested that links the two codes at the rim seal to allow data exchange between the two codes for parallel, coupled execution. A description of the coupling methodology and the current status of the interface development is presented. Representative steady-state solutions of the secondary flow in the UTRC HP Rig disc cavity are also presented.

Przekwas, A. J.↗

Application of low dissipation and dispersion Runge-Kutta schemes to benchmark problems in computational aeroacoustics

We investigate accurate and efficient time advancing methods for computational aeroacoustics, where non-dissipative and non-dispersive properties are of critical importance. Our analysis pertains to the application of Runge-Kutta methods to high-order finite difference discretization. In many CFD applications, multi-stage Runge-Kutta schemes have often been favored for their low storage requirements and relatively large stability limits. For computing acoustic waves, however, the stability consideration alone is not sufficient, since the Runge-Kutta schemes entail both dissipation and dispersion errors. The time step is now limited by the tolerable dissipation and dispersion errors in the computation. In the present paper, it is shown that if the traditional Runge-Kutta schemes are used for time advancing in acoustic problems, time steps greatly smaller than that allowed by the stability limit are necessary. Low Dissipation and Dispersion Runge-Kutta (LDDRK) schemes are proposed, based on an optimization that minimizes the dissipation and dispersion errors for wave propagation. Optimizations of both single-step and two-step alternating schemes are considered. The proposed LDDRK schemes are remarkably more efficient than the classical Runge-Kutta schemes for acoustic computations. Numerical results of each Category of the Benchmark Problems are presented. Moreover, low storage implementations of the optimized schemes are discussed. Special issues of implementing numerical boundary conditions in the LDDRK schemes are also addressed.

Hu, F. Q.↗

Low-dissipation and -dispersion Runge-Kutta schemes for computational acoustics

In this paper, we investigate accurate and efficient time advancing methods for computational acoustics, where non-dissipative and non-dispersive properties are of critical importance. Our analysis pertains to the application of Runge-Kutta methods to high-order finite difference discretization. In many CFD applications multi-stage Runge-Kutta schemes have often been favored for their low storage requirements and relatively large stability limits. For computing acoustic waves, however, the stability consideration alone is not sufficient, since the Runge-Kutta schemes entail both dissipation and dispersion errors. The time step is now limited by the tolerable dissipation and dispersion errors in the computation. In the present paper, it is shown that if the traditional Runge-Kutta schemes are used for time advancing in acoustic problems, time steps greatly smaller than that allowed by the stability limit are necessary. Low-Dissipation and -Dispersion Runge-Kutta (LDDRE) schemes are proposed, based on an optimization that minimizes the dissipation and dispersion errors for wave propagation. Order optimizations of both single-step and two-step alternating schemes are considered. The proposed LDDRK schemes are remarkably more efficient than the classical Runge-Kutta schemes for acoustic computations. Moreover, low storage implementations of the optimized schemes are discussed. Special issues of implementing numerical boundary conditions in the LDDRK schemes are also addressed.

Hu, F. Q.↗

Baseband pulse shaping techniques for nonlinearly amplified pi/4-QPSK and QAM systems

A new generation of multi-stage pi/4-shifted QPSK and of superposed quadrature-amplitude-modulated (SQAM) modulators-coherent demodulators (modems) and of continuous phase modulated (CPM)-gaussian premodulation filtered minimum-shift-keying (MGMSK) systems is proposed and studied. These modems will lead to bandwidth and power efficient satellite communications systems designs. As an illustrative application, a baseband processing technique pi/4-controlled transition PSK (pi/4-CTPSK) is described. To develop a cost and power efficient design strategy, we assume that nonlinear, fully saturated high power amplifiers (HPA) are utilized in the satellite earth station transmitter and in the satellite transponder. Modem structures which could lead to application specific integrated circuit (ASIC) satellite on-board processing universal modem applications are also considered. Multistate GMSK (i.e., MGMSK) signal generation methods by means of two or more RF combined nonlinearly amplified SQAM modems and by one multistate (in-phase and quadrature-baseband premodulation filtered-superposed) SQAM architecture and one RF nonlinear amplifier are studied. During the SQAM modem development phase we investigate the potential system advantages of the pi/4-shifted logic. The bandwidth efficiency of the proposed multistate GMSK and baseband filtered PAM-FM modulator (a new class in the CPM family) will be significantly higher than that of conventional G-MSK systems. To optimize the practical P(sub e) = f((E sub b)/(N sub o)) performance we consider improved coherent demodulation MGMSK structures such as deviated-frequency locking coherent demodulators. For relative low bit rate SATCOM applications, e.g., bit rates less than 300 kb/s, phase noise tracking cancellation (for fixed site earth station) and phase noise cancellation as well as Doppler compensation (for satellite to mobile earth station) applications may be required. We study digital channel sounding methods which could cancel the phase noise-caused degradations of CPM and GMSK modems.

Feher, Kamilo↗

Improving adsorption cryocoolers by multi-stage compression and reducing void volume

It is shown that the performance of gas adsorption cryocoolers is greatly improved by using adsorbents with low void volume within and between individual adsorbent particles (reducing void volumes in plumbing lines), and by compressing the working fluid in more than one stage. Refrigerator specific power requirements and compressor volumetric efficiencies are obtained in terms of adsorbent and plumbing line void volumes and operating pressures for various charcoal adsorbents using an analytical model. Performance optimization curves for 117.5 and 80 K charcoal/nitrogen adsorption cryocoolers are given for both single stage and multistage compressor systems, and compressing the nitrogen in two stages is shown to lower the specific power requirements by 18 percent for the 117.5 K system.

Bard, S.↗