Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “compatible discretizations”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Compatibility conditions of structural mechanics for finite element analysis

The equilibrium equations and the compatibility conditions are fundamental to the analyses of structures. However, anyone who undertakes even a cursory generic study of the compatibility conditions can discover, with little effort, that historically this facet of structural mechanics had not been adequately researched by the profession. Now the compatibility conditions (CC's) have been researched and are understood to a great extent. For finite element discretizations, the CC's are banded and can be divided into three distinct categories: (1) the interface CC's; (2) the cluster or field CC's; and (3) the external CC's. The generation of CC's requires the separating of a local region, then writing the deformation displacement relation (ddr) for the region, and finally, the eliminating of the displacements from the ddr. The procedure to generate all three types of CC's is presented and illustrated through examples of finite element models. The uniqueness of the CC's thus generated is shown.

Patnaik, Surya N.↗
NASA NTRS1991

Compatibility conditions of structural mechanics for finite element analysis

The equilibrium equations and the compatibility conditions are fundamental to the analyses of structures. However, anyone who undertakes even a cursory generic study of the compatibility conditions can discover, with little effort, that historically this facet of structural mechanics had not been adequately researched by the profession. Now the compatibility conditions (CC's) have been researched and are understood to a great extent. For finite element discretizations, the CC's are banded and can be divided into three distinct categories: (1) the interface CC's; (2) the cluster or field CC's; and (3) the external CC's. The generation of CC's requires the separating of a local region, then writing the deformation displacement relation (ddr) for the region, and finally, the eliminating of the displacements from the ddr. The procedure to generate all three types of CC's is presented and illustrated through examples of finite element models. The uniqueness of the CC's thus generated is shown.

Patnaik, S. N.↗
NASA NTRS1991

Integrated force method - Compatibility conditions of structural mechanics for finite element analysis

The equilibrium equations and the compatibility conditions are fundamental to the analyses of structures. However, anyone who undertakes even a cursory generic study of the compatibility conditions can discover, with little effort, that historically this facet of structural mechanics had not been adequately researched by the profession. Now the compatibility conditions (CC's) have been researched and are understood to a great extent. For finite element discretizations, the CC's are banded and can be divided into three distinct categories: (1) the interface CC's, (2) the cluster or field CC's, and (3) the external CC's. The generation of CC's requires the separating of a local region, then writing the deformation displacement relation (ddr) for the region, and finally, the eliminating of the displacements from the ddr. The procedure to generate all three types of CC's is presented and illustrated through examples of finite element models. The uniqueness of the CC's thus generated is shown. The utilization of CC's has resulted in the novel integrated force method (IFM). The solution that is obtained by the IFM converges with a significantly fewer number of elements, compared to the stiffness and the hybrid methods.

Patnaik, Surya N.↗
NASA NTRS2012

Unsteady Adjoint Approach for Design Optimization of Flapping Airfoils

This paper describes the work for optimizing the propulsive efficiency of flapping airfoils, i.e., improving the thrust under constraining aerodynamic work during the flapping flights by changing their shape and trajectory of motion with the unsteady discrete adjoint approach. For unsteady problems, it is essential to properly resolving time scales of motion under consideration and it must be compatible with the objective sought after. We include both the instantaneous and time-averaged (periodic) formulations in this study. For the design optimization with shape parameters or motion parameters, the time-averaged objective function is found to be more useful, while the instantaneous one is more suitable for flow control. The instantaneous objective function is operationally straightforward. On the other hand, the time-averaged objective function requires additional steps in the adjoint approach; the unsteady discrete adjoint equations for a periodic flow must be reformulated and the corresponding system of equations solved iteratively. We compare the design results from shape and trajectory optimizations and investigate the physical relevance of design variables to the flapping motion at on- and off-design conditions.

Lee, Byung Joon↗
NASA NTRS2001

Designing Adaptive Low-Dissipative High Order Schemes for Long-Time Integrations

A general framework for the design of adaptive low-dissipative high order schemes is presented. It encompasses a rather complete treatment of the numerical approach based on four integrated design criteria: (1) For stability considerations, condition the governing equations before the application of the appropriate numerical scheme whenever it is possible; (2) For consistency, compatible schemes that possess stability properties, including physical and numerical boundary condition treatments, similar to those of the discrete analogue of the continuum are preferred; (3) For the minimization of numerical dissipation contamination, efficient and adaptive numerical dissipation control to further improve nonlinear stability and accuracy should be used; and (4) For practical considerations, the numerical approach should be efficient and applicable to general geometries, and an efficient and reliable dynamic grid adaptation should be used if necessary. These design criteria are, in general, very useful to a wide spectrum of flow simulations. However, the demand on the overall numerical approach for nonlinear stability and accuracy is much more stringent for long-time integration of complex multiscale viscous shock/shear/turbulence/acoustics interactions and numerical combustion. Robust classical numerical methods for less complex flow physics are not suitable or practical for such applications. The present approach is designed expressly to address such flow problems, especially unsteady flows. The minimization of employing very fine grids to overcome the production of spurious numerical solutions and/or instability due to under-resolved grids is also sought. The incremental studies to illustrate the performance of the approach are summarized. Extensive testing and full implementation of the approach is forthcoming. The results shown so far are very encouraging.

Yee, Helen C.↗
NASA NTRS2005

Designing Adaptive Low-Dissipative High Order Schemes for Long-Time Integrations

A general framework for the design of adaptive low-dissipative high order schemes is presented. It encompasses a rather complete treatment of the numerical approach based on four integrated design criteria: (1) For stability considerations, condition the governing equations before the application of the appropriate numerical scheme whenever it is possible. (2) For consistency, compatible schemes that possess stability properties, including physical and numerical boundary condition treatments, similar to those of the discrete analogue of the continuum are preferred. (3) For the minimization of numerical dissipation contamination, efficient and adaptive numerical dissipation control to further improve nonlinear stability and accuracy should be used. (4) For practical considerations, the numerical approach should be efficient and applicable to general geometries, and an efficient and reliable dynamic grid adaptation should be used if necessary. These design criteria are, in general, very useful to a wide spectrum of flow simulations. However, the demand on the overall numerical approach for non-linear stability and accuracy is much more stringent for long-time integration of complex multiscale viscous shock/shear/turbulence/acoustics interactions and numerical combustion. Robust classical numerical methods for less complex flow physics are not suitable or practical for such applications. The present approach is designed expressly to address such flow problems, especially unsteady flows.

Yee, H. C.↗
NASA NTRS1989

On discrete control of nonlinear systems with applications to robotics

Much progress has been reported in the areas of modeling and control of nonlinear dynamic systems in a continuous-time framework. From implementation point of view, however, it is essential to study these nonlinear systems directly in a discrete setting that is amenable for interfacing with digital computers. But to develop discrete models and discrete controllers for a nonlinear system such as robot is a nontrivial task. Robot is also inherently a variable-inertia dynamic system involving additional complications. Not only the computer-oriented models of these systems must satisfy the usual requirements for such models, but these must also be compatible with the inherent capabilities of computers and must preserve the fundamental physical characteristics of continuous-time systems such as the conservation of energy and/or momentum. Preliminary issues regarding discrete systems in general and discrete models of a typical industrial robot that is developed with full consideration of the principle of conservation of energy are presented. Some research on the pertinent tactile information processing is reviewed. Finally, system control methods and how to integrate these issues in order to complete the task of discrete control of a robot manipulator are also reviewed.

Eslami, Mansour↗
NASA NTRS1986

Algorithm for Fuel-Conservative Airplane Descents

Federal Aviation Administration implementing automated, time-based metering form of air-traffic control (ATC) with profile-descent procedures for arrivals into terminal area. Measures provide fuel savings by matching arrival of airplanes to airport acceptance rate through time-control computations and allowing pilot to descend at his discretion from cruise altitude to designated metering-fix altitude in idle-thrust clean configuration. Airborne descent algorithm developed compatible with time-based metering and profile-descent procedures and designed to improve accuracy of delivering airplane during fuel-efficient descent to metering fix at time designated by the ATC system.

Knox, C. E.↗
NASA NTRS1996

Decision-Aiding and Optimization for Vertical Navigation of Long-Haul Aircraft

Most decisions made in the cockpit are related to safety, and have therefore been proceduralized in order to reduce risk. There are very few which are made on the basis of a value metric such as economic cost. One which can be shown to be value based, however, is the selection of a flight profile. Fuel consumption and flight time both have a substantial effect on aircraft operating cost, but they cannot be minimized simultaneously. In addition, winds, turbulence, and performance x,ary widely with altitude and time. These factors make it important and difficult for pilots to (a) evaluate the outcomes associated with a particular trajectory before it is flown and (b) decide among possible trajectories. The two elements of this problem considered here are (1) determining, what constitutes optimality, and (2) finding optimal trajectories. Pilots and dispatchers from major U.S. airlines were surveyed to determine which attributes of the outcome of a flight they considered the most important. Avoiding turbulence-for passenger comfort topped the list of items which were not safety related. Pilots' decision making about the selection of flight profile on the basis of flight time, fuel burn, and exposure to turbulence was then observed. Of the several behavioral and prescriptive decision models invoked to explain the pilots' choices, utility maximization is shown to best reproduce the pilots' decisions. After considering more traditional methods for optimizing trajectories, a novel method is developed using a genetic algorithm (GA) operating on a discrete representation of the trajectory search space. The representation is a sequence of command altitudes, and was chosen to be compatible with the constraints imposed by Air Traffic Control, and with the training given to pilots. Since trajectory evaluation for the GA is performed holistically, a wide class of objective functions can be optimized easily. Also, using the GA it is possible to compare the costs associated with different airspace design and air traffic management policies. A decision aid is proposed which would combine the pilot's notion of optimility with the GA-based optimization, provide the pilot with a number of alternative pareto-optimal trajectories, and allow him to consider un-modelled attributes and constraints in choosing among them. A solution to the problem of displaying alternatives in a multi-attribute decision space is also presented.

Patrick, Nicholas J. M.↗
NASA NTRS1996

Decision-Aiding and Optimization for Vertical Navigation of Long-Haul Aircraft

Most decisions made in the cockpit are related to safety, and have therefore been proceduralized in order to reduce risk. There are very few which are made on the basis of a value metric such as economic cost. One which can be shown to be value based, however, is the selection of a flight profile. Fuel consumption and flight time both have a substantial effect on aircraft operating cost, but they cannot be minimized simultaneously. In addition, winds, turbulence, and performance vary widely with altitude and time. These factors make it important and difficult for pilots to (a) evaluate the outcomes associated with a particular trajectory before it is flown and (b) decide among possible trajectories. The two elements of this problem considered here are: (1) determining what constitutes optimality, and (2) finding optimal trajectories. Pilots and dispatchers from major u.s. airlines were surveyed to determine which attributes of the outcome of a flight they considered the most important. Avoiding turbulence-for passenger comfort-topped the list of items which were not safety related. Pilots' decision making about the selection of flight profile on the basis of flight time, fuel burn, and exposure to turbulence was then observed. Of the several behavioral and prescriptive decision models invoked to explain the pilots' choices, utility maximization is shown to best reproduce the pilots' decisions. After considering more traditional methods for optimizing trajectories, a novel method is developed using a genetic algorithm (GA) operating on a discrete representation of the trajectory search space. The representation is a sequence of command altitudes, and was chosen to be compatible with the constraints imposed by Air Traffic Control, and with the training given to pilots. Since trajectory evaluation for the GA is performed holistically, a wide class of objective functions can be optimized easily. Also, using the GA it is possible to compare the costs associated with different airspace design and air traffic management policies. A decision aid is proposed which would combine the pilot's notion of optimality with the GA-based optimization, provide the pilot with a number of alternative pareto-optimal trajectories, and allow him to consider unmodelled attributes and constraints in choosing among them. A solution to the problem of displaying alternatives in a multi-attribute decision space is also presented.

Patrick, Nicholas J. M.↗
NASA NTRS1990

Quadrature imposition of compatibility conditions in Chebyshev methods

Often, in solving an elliptic equation with Neumann boundary conditions, a compatibility condition has to be imposed for well-posedness. This condition involves integrals of the forcing function. When pseudospectral Chebyshev methods are used to discretize the partial differential equation, these integrals have to be approximated by an appropriate quadrature formula. The Gauss-Chebyshev (or any variant of it, like the Gauss-Lobatto) formula can not be used here since the integrals under consideration do not include the weight function. A natural candidate to be used in approximating the integrals is the Clenshaw-Curtis formula, however it is shown that this is the wrong choice and it may lead to divergence if time dependent methods are used to march the solution to steady state. The correct quadrature formula is developed for these problems. This formula takes into account the degree of the polynomials involved. It is shown that this formula leads to a well conditioned Chebyshev approximation to the differential equations and that the compatibility condition is automatically satisfied.

Gottlieb, D.↗
NASA NTRS1971

Comparison of a discrete steepest ascent method with the continuous steepest ascent method for optimal programing

A discrete steepest ascent method which allows controls which are not piecewise constant (for example, it allows all continuous piecewise linear controls) was derived for the solution of optimal programming problems. This method is based on the continuous steepest ascent method of Bryson and Denham and new concepts introduced by Kelley and Denham in their development of compatible adjoints for taking into account the effects of numerical integration. The method is a generalization of the algorithm suggested by Canon, Cullum, and Polak with the details of the gradient computation given. The discrete method was compared with the continuous method for an aerodynamics problem for which an analytic solution is given by Pontryagin's maximum principle, and numerical results are presented. The discrete method converges more rapidly than the continuous method at first, but then for some undetermined reason, loses its exponential convergence rate. A comparsion was also made for the algorithm of Canon, Cullum, and Polak using piecewise constant controls. This algorithm is very competitive with the continuous algorithm.

Childs, A. G.↗
NASA NTRS1995

Investigation of computational and spectral analysis methods for aeroacoustic wave propagation

Most computational fluid dynamics (CFD) schemes are not adequately accurate for solving aeroacoustics problems, which have wave amplitudes several orders of magnitude smaller yet with frequencies larger than the flow field variations generating the sound. Hence, a computational aeroacoustics (CAA) algorithm should have minimal dispersion and dissipation features. A dispersion relation preserving (DRP) scheme is, therefore, applied to solve the linearized Euler equations in order to simulate the propagation of three types of waves, namely: acoustic, vorticity, and entropy waves. The scheme is derived using an optimization procedure to ensure that the numerical derivatives preserve the wave number and angular frequency of the partial differential equations being discretized. Consequently, simulated waves propagate with the correct wave speeds and exhibit their appropriate properties. A set of radiation and outflow boundary conditions, compatible with the DRP scheme and derived from the asymptotic solutions of the governing equations, are also implemented. Numerical simulations are performed to test the effectiveness of the DRP scheme and its boundary conditions. The computed solutions are shown to agree favorably with the exact solutions. The major restriction appears to be that the dispersion relations can be preserved only for waves with wave lengths longer than four or five spacings. The boundary conditions are found to be transparent to the outgoing disturbances. However, when the disturbance source is placed closer to a boundary, small acoustic reflections start appearing. CAA generates enormous amounts of temporal data which needs to be reduced to understand the physical problem being simulated. Spectral analysis is one approach that helps us in extracting information which often can not be easily interpreted in the time domain. Thus, three different methods for the spectral analysis of numerically generated aeroacoustic data are studied. First, the capabilities of two traditional methods for spectral analysis, namely, the Blackman-Tukey method and periodogram method, are compared in estimating the spectra of a simple-periodic process. The periodogram is then applied to analyze transitory-deterministic processes. Finally, these two methods are compared with a more recent method, referred as the Weighted-Overlapped-Segment-Averaging (WOSA) method, in estimating the spectra of a chaotic (random-like) process. From the demonstrative case for the spectral analyses of data generated by simple-periodic process, the periodogram method is found to give a better estimate of the steep-sloped spectra than the Blackman-Tukey method. Also, for this problem, the Hanning window is found to perform better with the periodogram method than with the Blackman-Tukey method. Finally, for the spectral analysis of data generated by the chaotic process, the periodogram method does not perform well, whereas, the WOSA and Blackman-Tukey methods give equivalently good results.

Vanel, Florence O.↗
NASA NTRS1998

A New Time-Space Accurate Scheme for Hyperbolic Problems: Quasi-Explicit Case - 1

This paper presents a new discretization scheme for hyperbolic systems of conservations laws. It satisfies the TVD property and relies on the new high-resolution mechanism which is compatible with the genuinely multidimensional approach proposed recently. This work can be regarded as a first step towards extending the genuinely multidimensional approach to unsteady problems. Discontinuity capturing capabilities and accuracy of the scheme are verified by a set of numerical tests.

Sidilkover, David↗
NASA NTRS1986

Optical Scanner for Linear Arrays

Optical scanner instantaneously reads contiguous lines forming scene or target in object plane. Reading active or passive and scans, continuous or discrete. Scans essentially linear with scan angle and symmetric about axial ray. Nominal focal error, resulting from curvature of scan, well within Rayleigh limit. Scanner specifically designed to be fully compatible with general requirements of linear arrays.

Finkel, M. W.↗
NASA NTRS1991

Program For Parallel Discrete-Event Simulation

User does not have to add any special logic to aid in synchronization. Time Warp Operating System (TWOS) computer program is special-purpose operating system designed to support parallel discrete-event simulation. Complete implementation of Time Warp mechanism. Supports only simulations and other computations designed for virtual time. Time Warp Simulator (TWSIM) subdirectory contains sequential simulation engine interface-compatible with TWOS. TWOS and TWSIM written in, and support simulations in, C programming language.

Beckman, Brian C.↗
NASA NTRS1972

Slush hydrogen liquid level system

A discrete capacitance liquid level system developed is specifically for slush hydrogen, but applicable to LOX, LN2, LH2, and RP1 without modification is described. The signal processing portion of the system is compatible with conventional liquid level sensors. Compatibility with slush hydrogen was achieved by designing the sensor with adequate spacing, while retaining the electrical characteristics of conventional sensors. Tests indicate excellent stability of the system over a temperature range of -20 C to 70 C for the circuit and to cryogenic temperatures of the sensor. The sensor was tested up to 40 g's rms random vibration with no damage to the sensor. Operation with 305 m of cable between the sensor and signal processor was demonstrated. It is concluded that this design is more than adequate for most flight and ground applications.

Hamlet, J. F.↗
NASA NTRS1991

Discrete shape sensitivity equations for aerodynamic problems

Intensive research and development in Computational Fluid Dynamics (CFD) has recently produced many powerful CFD codes to simulate complex aerodynamic phenomena. However, in order to enhance the usefulness of these CFD codes for design practice, development of design sensitivity equations compatible to these codes becomes very important. This paper represents a part of such an effort to develop a sensitivity analysis methodology that enables the sensitivity equations to be implemented into existing CFD codes with minimal code modification. The methodology is based upon a preelimination procedure which accounts for consistently linearized boundary conditions. Formulations of both the direct differentiation and the adjoint variable methods will be presented in the paper.

Hou, Gene J.-W.↗