SEARCH · Engineering Papers

Results for “time minimization”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 541 records · Page 30

All sources NASA NTRS DOE OSTI

NASA NTRS1983

Active flutter control using discrete optimal constrained dynamic compensators

A method for synthesizing digital active flutter suppression controllers using the concept of optimal output feedback is presented. A recently developd convergent algorithm is employed to determine constrained control law parameters that minimize an infinite-time discrete quadratic performance index. Low-order compensator dynamics are included in the control law and the compensator parameters are computed along with the output feedback gain as part of the optimization process. An input noise adjustment procedure is used to improve the stability margins of the digital active flutter controller. Results from investigations into sample rate variation, prefilter pole variation, and effects of varying flight condtions are discussed. The study indicates that a digital control law which accommodates computation delay can stabilize the wing with reasonable rms performance and adequate stability margins.

Broussard, J. R.↗

NASA NTRS1984

Food Acquisition: Food Ingredients, Raw Materials and Supply

The kind of food supply system that will serve the space station in coming years is considered. The direction and rate of evolution of space food service systems is also considered and what is needed to supply appropriate food to space station crews. Innovations in food sourcing, recipe development, pre-preparation, packaging, preservation, presentation, consumption and waste disposal are discussed. The development and validation of preparation systems and ingredients which minimize demands on crew time and provide maximum eating enjoyment is outlined.

Wheat, D. W.↗

NASA NTRS1986

DSA's subcarrier demodulation losses

The degradation in bit error rate performance due to imperfect subcarrier tracking by the Demodulation Synchronization Assembly (DSA) is investigated. Results apply to any type of digital loop and received signal dynamics. A type four loop causes the least amount of loss, because it tracks phase jerk with zero steady-state error. However, when frequency rate and frequency acceleration are as large as in the extended Magellan mission, it will be necessary to decrease the loop update time in order to minimize the losses.

Simon, M.↗

NASA NTRS1985

A minimum time control algorithm for linear and nonlinear systems

The minimum time control problem with bounded control has long been of interest to control engineers. Much of the theoretical study of this problem has been limited to linear systems and the results are usually problem-specific. This paper presents a new computational method for solving the minimum-time control problem when the control action is assumed to be bang-bang. A gradient-based algorithm is developed where the switching times are updated to minimize the final state missed distance. The algorithm is applicable to linear and nonlinear problems, including multi-input systems.

Wen, J.↗

NASA NTRS1986

Fixed order dynamic compensation for multivariable linear systems

This paper considers the design of fixed order dynamic compensators for multivariable time invariant linear systems, minimizing a linear quadratic performance cost functional. Attention is given to robustness issues in terms of multivariable frequency domain specifications. An output feedback formulation is adopted by suitably augmenting the system description to include the compensator states. Either a controller or observer canonical form is imposed on the compensator description to reduce the number of free parameters to its minimal number. The internal structure of the compensator is prespecified by assigning a set of ascending feedback invariant indices, thus forming a Brunovsky structure for the nominal compensator.

Kramer, F. S.↗

NASA NTRS1986

Dynamic remapping decisions in multi-phase parallel computations

The effectiveness of any given mapping of workload to processors in a parallel system is dependent on the stochastic behavior of the workload. Program behavior is often characterized by a sequence of phases, with phase changes occurring unpredictably. During a phase, the behavior is fairly stable, but may become quite different during the next phase. Thus a workload assignment generated for one phase may hinder performance during the next phase. We consider the problem of deciding whether to remap a paralled computation in the face of uncertainty in remapping's utility. Fundamentally, it is necessary to balance the expected remapping performance gain against the delay cost of remapping. This paper treats this problem formally by constructing a probabilistic model of a computation with at most two phases. We use stochastic dynamic programming to show that the remapping decision policy which minimizes the expected running time of the computation has an extremely simple structure: the optimal decision at any step is followed by comparing the probability of remapping gain against a threshold. This theoretical result stresses the importance of detecting a phase change, and assessing the possibility of gain from remapping. We also empirically study the sensitivity of optimal performance to imprecise decision threshold. Under a wide range of model parameter values, we find nearly optimal performance if remapping is chosen simply when the gain probability is high. These results strongly suggest that except in extreme cases, the remapping decision problem is essentially that of dynamically determining whether gain can be achieved by remapping after a phase change; precise quantification of the decision model parameters is not necessary.

Nicol, D. M.↗

NASA NTRS1987

Optimal dynamic remapping of parallel computations

A large class of computations are characterized by a sequence of phases, with phase changes occurring unpredictably. The decision problem was considered regarding the remapping of workload to processors in a parallel computation when the utility of remapping and the future behavior of the workload is uncertain, and phases exhibit stable execution requirements during a given phase, but requirements may change radically between phases. For these problems a workload assignment generated for one phase may hinder performance during the next phase. This problem is treated formally for a probabilistic model of computation with at most two phases. The fundamental problem of balancing the expected remapping performance gain against the delay cost was addressed. Stochastic dynamic programming is used to show that the remapping decision policy minimizing the expected running time of the computation has an extremely simple structure. Because the gain may not be predictable, the performance of a heuristic policy that does not require estimnation of the gain is examined. The heuristic method's feasibility is demonstrated by its use on an adaptive fluid dynamics code on a multiprocessor. The results suggest that except in extreme cases, the remapping decision problem is essentially that of dynamically determining whether gain can be achieved by remapping after a phase change. The results also suggest that this heuristic is applicable to computations with more than two phases.

Nicol, David M.↗

NASA NTRS1989

Automated thermal mapping techniques using chromatic image analysis

Thermal imaging techniques are introduced using a chromatic image analysis system and temperature sensitive coatings. These techniques are used for thermal mapping and surface heat transfer measurements on aerothermodynamic test models in hypersonic wind tunnels. Measurements are made on complex vehicle configurations in a timely manner and at minimal expense. The image analysis system uses separate wavelength filtered images to analyze surface spectral intensity data. The system was initially developed for quantitative surface temperature mapping using two-color thermographic phosphors but was found useful in interpreting phase change paint and liquid crystal data as well.

Buck, Gregory M.↗

NASA NTRS1989

Efficient grid generation

Because the governing equations in fluid dynamics contain partial differentials and are too difficult in most cases to solve analytically, these differentials are generally replaced by finite difference terms. These terms contain terms in the solution at nearby states. This procedure discretizes the field into a finite number of states. These states, when plotted, form a grid, or mesh, of points. It is at these states, or field points, that the solution is found. The optimum choice of states, the x, y, z coordinate values, minimizes error and computational time. But the process of finding these states is made more difficult by complex boundaries, and by the need to control step size differences between the states, that is, the need to control the spacing of field points. One solution technique uses a different set of state variables, which define a different coordinate system, to generate the grid more easily. A new method, developed by Dr. Joseph Steger, combines elliptic and hyperbolic partial differential equations into a mapping function between the physical and computational coordinate systems. This system of equations offers more control than either equation provides alone. The Steger algorithm was modified in order to allow bodies with stronger concavities to be used, offering the possibility of generating a single grid about multiple bodies. Work was also done on identifying areas where grid breakdown occurs.

Seki, Rycichi↗

NASA NTRS1990

Simulation Of Unsteady, Viscous, Incompressible Flow

Method for numerical solution of Navier-Stokes equations of viscous, incompressible flow developed based on use of fractional-step procedure. Accurate to second order in both space and time. Attempt made to minimize Poisson-equation difficulties by choosing pressures at centers and volume fluxes across faces of computational cells as dependent variables instead of familiar Cartesian components of velocity. Choice ensures satisfaction of discrete equation of conservation of mass to within round-off errors in any coordinate system and has favorable effects on convergence properties.

Rosenfeld, Moshe↗

NASA NTRS1990

S-Chart - Scheduling-Chart Program

Schedule Chart Program (S-Chart) produces quickly, through array of simple menu choices, high-quality Gantt-type scheduling and production time-line charts with minimal data-entry requirements. Significant features include: speed and ease of use with menu-driven selections from start to finish; storage and catalogs of all sets of data for rapid access and manipulation; compact program to permit storage of dozens of sets of data on program disk; and creation of ASCII text files of graphs for rapid printing. Written in ASCII code.

Klinkner, Eric R.↗

NASA NTRS1990

Parallelization of implicit finite difference schemes in computational fluid dynamics

Implicit finite difference schemes are often the preferred numerical schemes in computational fluid dynamics, requiring less stringent stability bounds than the explicit schemes. Each iteration in an implicit scheme involves global data dependencies in the form of second and higher order recurrences. Efficient parallel implementations of such iterative methods are considerably more difficult and non-intuitive. The parallelization of the implicit schemes that are used for solving the Euler and the thin layer Navier-Stokes equations and that require inversions of large linear systems in the form of block tri-diagonal and/or block penta-diagonal matrices is discussed. Three-dimensional cases are emphasized and schemes that minimize the total execution time are presented. Partitioning and scheduling schemes for alleviating the effects of the global data dependencies are described. An analysis of the communication and the computation aspects of these methods is presented. The effect of the boundary conditions on the parallel schemes is also discussed.

Decker, Naomi H.↗

NASA NTRS1989

Linear optimization - A case study in performance analysis

The paper deals with the performance of two parallel variants of the simplex algorithm on a message-passing system. First, the simplex algorithm is reviewed, two possible parallelizations of the algorithm are discussed, and results of benchmark speedups of the alternatives are presented. Between column and row partitionings, the row partitioning method is found to be generally superior, while the column partitioning method is more efficient when the number of rows is small, and the number of columns is much greater that the number of rows. Various performance analysis tools are then applied to examine the reasons for relative performance differences, and communication idle time due to global minimization and load imbalances is noted as the main factor in execution slowdown.

Stunkel, Craig B.↗

NASA NTRS1990

Constraint treatment techniques and parallel algorithms for multibody dynamic analysis

Computational procedures for kinematic and dynamic analysis of three-dimensional multibody dynamic (MBD) systems are developed from the differential-algebraic equations (DAE's) viewpoint. Constraint violations during the time integration process are minimized and penalty constraint stabilization techniques and partitioning schemes are developed. The governing equations of motion, a two-stage staggered explicit-implicit numerical algorithm, are treated which takes advantage of a partitioned solution procedure. A robust and parallelizable integration algorithm is developed. This algorithm uses a two-stage staggered central difference algorithm to integrate the translational coordinates and the angular velocities. The angular orientations of bodies in MBD systems are then obtained by using an implicit algorithm via the kinematic relationship between Euler parameters and angular velocities. It is shown that the combination of the present solution procedures yields a computationally more accurate solution. To speed up the computational procedures, parallel implementation of the present constraint treatment techniques, the two-stage staggered explicit-implicit numerical algorithm was efficiently carried out. The DAE's and the constraint treatment techniques were transformed into arrowhead matrices to which Schur complement form was derived. By fully exploiting the sparse matrix structural analysis techniques, a parallel preconditioned conjugate gradient numerical algorithm is used to solve the systems equations written in Schur complement form. A software testbed was designed and implemented in both sequential and parallel computers. This testbed was used to demonstrate the robustness and efficiency of the constraint treatment techniques, the accuracy of the two-stage staggered explicit-implicit numerical algorithm, and the speed up of the Schur-complement-based parallel preconditioned conjugate gradient algorithm on a parallel computer.

Chiou, Jin-Chern↗

NASA NTRS1991

Reliable numerical computation in an optimal output-feedback design

A reliable algorithm is presented for the evaluation of a quadratic performance index and its gradients with respect to the controller design parameters. The algorithm is a part of a design algorithm for optimal linear dynamic output-feedback controller that minimizes a finite-time quadratic performance index. The numerical scheme is particularly robust when it is applied to the control-law synthesis for systems with densely packed modes and where there is a high likelihood of encountering degeneracies in the closed-loop eigensystem. This approach through the use of an accurate Pade series approximation does not require the closed-loop system matrix to be diagonalizable. The algorithm was included in a control design package for optimal robust low-order controllers. Usefulness of the proposed numerical algorithm was demonstrated using numerous practical design cases where degeneracies occur frequently in the closed-loop system under an arbitrary controller design initialization and during the numerical search.

Vansteenwyk, Brett↗

NASA NTRS1991

High power bipolar lead-acid batteries

The Jet Propulsion Laboratory (JPL), with interest in advanced energy storage systems, is involved in the development of a unique lead acid battery design. This battery utilizes the same combination of lead and lead dioxide active materials present in the automobile starting battery. However, it can provide 2 to 10 times the power while minimizing volume and weight. The typical starting battery is described as a monopolar type using one current collector for both the positive and negative plate of adjacent cells. Specific power as high as 2.5 kW/kg was projected for 30 second periods with as many as 2000 recharge cycles.

Halpert, Gerald↗

NASA NTRS1989

Automated thermal mapping techniques using chromatic image analysis

Buck, Gregory M.↗

NASA NTRS1991

Advanced data acquisition and display techniques for laser velocimetry

The Basic Aerodynamics Research Tunnel (BART) has been equipped with state-of-the-art instrumentation for acquiring the data needed for code validation. This paper describes the three-component LDV and the workstation-based data-acquisition system (DAS) which has been developed for the BART. The DAS allows the use of automation and the quick integration of advanced instrumentation, while minimizing the software development time required between investigations. The paper also includes a description of a graphics software library developed to support the windowing environment of the DAS. The real-time displays generated using the graphics library help the researcher ensure the test is proceeding properly. The graphics library also supports the requirements of posttest data analysis. The use of the DAS and graphics libraries is illustrated by presenting examples of the real-time and postprocessing display graphics for LDV investigations.

Kjelgaard, Scott O.↗