Engineering PapersSearch

SEARCH · Engineering Papers

Results for “automatic differentiation”

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 181 records · Page 10

Color film preservation system: Breadboard development

The development of an economically feasible system to prevent and/or substantially reduce the degradation of the color dyes of the retinal reflex images recorded on color slide films is discussed. Three different types of film storage systems were designed, fabricated, and tested. An extruded plastic cylindrical container was pressurized and no observable leakage occurred, indicating that long term storage is possible. An operational breadboard was fabricated. The system offers the capability to determine purging requirements to achieve various levels of oxygen concentration and precise leakage of various container configurations. The system has digitial display of oxygen content of the container, automatic control of the oxygen content as well as of the container to atmosphere pressure differential, and flow rate readout during purging.

Source record

Decoupled direct method for sensitivity analysis in combustion kinetics

An efficient, decoupled direct method for calculating the first order sensitivity coefficients of homogeneous, batch combustion kinetic rate equations is presented. In this method the ordinary differential equations for the sensitivity coefficients are solved separately from , but sequentially with, those describing the combustion chemistry. The ordinary differential equations for the thermochemical variables are solved using an efficient, implicit method (LSODE) that automatically selects the steplength and order for each solution step. The solution procedure for the sensitivity coefficients maintains accuracy and stability by using exactly the same steplengths and numerical approximations. The method computes sensitivity coefficients with respect to any combination of the initial values of the thermochemical variables and the three rate constant parameters for the chemical reactions. The method is illustrated by application to several simple problems and, where possible, comparisons are made with exact solutions and those obtained by other techniques.

Radhakrishnan, Krishnan

Enhanced Elliptic Grid Generation

An enhanced method of elliptic grid generation has been invented. Whereas prior methods require user input of certain grid parameters, this method provides for these parameters to be determined automatically. "Elliptic grid generation" signifies generation of generalized curvilinear coordinate grids through solution of elliptic partial differential equations (PDEs). Usually, such grids are fitted to bounding bodies and used in numerical solution of other PDEs like those of fluid flow, heat flow, and electromagnetics. Such a grid is smooth and has continuous first and second derivatives (and possibly also continuous higher-order derivatives), grid lines are appropriately stretched or clustered, and grid lines are orthogonal or nearly so over most of the grid domain. The source terms in the grid-generating PDEs (hereafter called "defining" PDEs) make it possible for the grid to satisfy requirements for clustering and orthogonality properties in the vicinity of specific surfaces in three dimensions or in the vicinity of specific lines in two dimensions. The grid parameters in question are decay parameters that appear in the source terms of the inhomogeneous defining PDEs. The decay parameters are characteristic lengths in exponential- decay factors that express how the influences of the boundaries decrease with distance from the boundaries. These terms govern the rates at which distance between adjacent grid lines change with distance from nearby boundaries. Heretofore, users have arbitrarily specified decay parameters. However, the characteristic lengths are coupled with the strengths of the source terms, such that arbitrary specification could lead to conflicts among parameter values. Moreover, the manual insertion of decay parameters is cumbersome for static grids and infeasible for dynamically changing grids. In the present method, manual insertion and user specification of decay parameters are neither required nor allowed. Instead, the decay parameters are determined automatically as part of the solution of the defining PDEs. Depending on the shape of the boundary segments and the physical nature of the problem to be solved on the grid, the solution of the defining PDEs may provide for rates of decay to vary along and among the boundary segments and may lend itself to interpretation in terms of one or more physical quantities associated with the problem.

Kaul, Upender K.

Domain-specific functional software testing: A progress report

Software Engineering is a knowledge intensive activity that involves defining, designing, developing, and maintaining software systems. In order to build effective systems to support Software Engineering activities, Artificial Intelligence techniques are needed. The application of Artificial Intelligence technology to Software Engineering is called Knowledge-based Software Engineering (KBSE). The goal of KBSE is to change the software life cycle such that software maintenance and evolution occur by modifying the specifications and then rederiving the implementation rather than by directly modifying the implementation. The use of domain knowledge in developing KBSE systems is crucial. Our work is mainly related to one area of KBSE that is called automatic specification acquisition. One example is the WATSON prototype on which our current work is based. WATSON is an automatic programming system for formalizing specifications for telephone switching software mainly restricted to POTS, i.e., plain old telephone service. Our current approach differentiates itself from other approaches in two antagonistic ways. On the one hand, we address a large and complex real-world problem instead of a 'toy domain' as in many research prototypes. On the other hand, to allow such scaling, we had to relax the ambitious goal of complete automatic programming, to the easier task of automatic testing.

Nonnenmann, Uwe

Automatic charge control system for satellites

The SCATHA and the ATS-5 and 6 spacecraft provided insights to the problem of spacecraft charging at geosychronous altitudes. Reduction of the levels of both absolute and differential charging was indicated, by the emission of low energy neutral plasma. It is appropriate to complete the transition from experimental results to the development of a system that will sense the state-of-charge of a spacecraft, and, when a predetermined threshold is reached, will respond automatically to reduce it. A development program was initiated utilizing sensors comparable to the proton electrostatic analyzer, the surface potential monitor, and the transient pulse monitor that flew in SCATHA, and combine these outputs through a microprocessor controller to operate a rapid-start, low energy plasma source.

Shuman, B. M.

A Formal Verification Framework for Runtime Assurance

The simplex architecture is an instance of Runtime Assurance (RTA) where a trusted component takes control of a safety-critical system when an untrusted component violates a safety property. This paper presents a formalization of the simplex RTA framework in the language of hybrid programs. A feature of this formal verification framework is that, for a given system, a specific instantiation can be created and its safety properties are guaranteed by construction. Instantiations may be kept at varying levels of generality, allowing for black box components, such as ML/AI-based controllers, to be modeled. The framework is written in the Prototype Verification System (PVS) using Plaidypvs, an embedding of differential dynamic logic in PVS. As a proof of concept, the framework is illustrated on an automatic vehicle braking system.

Runtime assurance

A Formal Verification Framework for Runtime Assurance

The simplex architecture is an instance of Runtime Assurance (RTA) where a trusted component takes control of a safety-critical system when an untrusted component violates a safety property. This paper presents a formalization of the simplex RTA framework in the language of hybrid programs. A feature of this formal verification framework is that, for a given system, a specific instantiation can be created and its safety properties are guaranteed by construction. Instantiations may be kept at varying levels of generality, allowing for black box components, such as ML/AI-based controllers, to be modeled. The framework is written in the Prototype Verification System (PVS) using Plaidypvs, an embedding of differential dynamic logic in PVS. As a proof of concept, the framework is illustrated on an automatic vehicle braking system.

Runtime assurance

Further Development of a New, Flux-Conserving Newton Scheme for the Navier-Stokes Equations

This paper is one of a series of papers describing the development of a new numerical approach for solving the steady Navier-Stokes equations. The key features in the current development are (1) the discrete representation of the dependent variables by way of high order polynomial expansions, (2) the retention of all derivatives in the expansions as unknowns to be explicitly solved for, (3) the automatic balancing of fluxes at cell interfaces, and (4) the discrete simulation of both the integral and differential forms of the governing equations. The main purpose of this paper is, first, to provide a systematic and rigorous derivation of the conditions that are used to simulate the differential form of the Navier-Stokes equations, and second, to extend our previously-presented internal flow scheme to external flows and nonuniform grids. Numerical results are presented for high Reynolds number flow (Re = 100,000) around a finite flat plate, and detailed comparisons are made with the Blasius flat plate solution and Goldstein wake solution. It is shown that the error in the streamwise velocity decreases like r(sup alpha)(Delta)y(exp 2), where alpha approx. 0.25 and r = delta(y)/delta(x) is the grid aspect ratio.

Scott, James R.

Numerical solution of flow problems using body-fitted coordinate systems

The technique of boundary-fitted coordinate systems is based on a method of automatic numerical generation of a general curvilinear coordinate system having a coordinate line coincident with each boundary of a general multi-connected region containing any number of arbitrarily shaped bodies. Once the curvilinear coordinate system is generated, any partial differential system of interest can be solved on this coordinate system by transforming the equations and solving the resulting system in finite difference approximation on the rectangular transformed plane. This method of automatic body-fitted curvilinear coordinate generation is used to construct finite-difference solutions of the full, time dependent Navier-Stokes equations for the unsteady viscous flow about arbitrary two-dimensional airfoils, or any other two-dimensional bodies. Finally, initial results for three-dimensional applications are also presented.

Thompson, J. F.

Algorithm for Liapunov stability analysis

Development of algorithm provides automatic computation of quadratic estimate of domain of stability for stable equilibrium states of nonlinear systems of ordinary differential equations.

Geiss, G. R.

TOMCAT - A code for numerical generation of boundary-fitted curvilinear coordinate systems on fields containing any number of arbitrary two-dimensional bodies

A method for automatic generation of boundary-fitted curvilinear coordinate systems, where the transformed coordinates are solutions of an elliptic differential system in the physical plane, and where the coordinate lines are coincident with all boundaries of a general multiply-connected, two-dimensional region containing any number of arbitrarily shaped bodies, and is described along with a suitable computer code for implementing the method. Any partial differential system can be solved on the boundary-fitted coordinate system by appropriate transformations. The transformed equations are approximated by finite differences and solved numerically in the transformed plane. All computations, whether for generating coordinate system or then solving the transformed equations, can be done on a rectangular field with square mesh with no interpolation required on the boundaries. The physical boundaries may even be time-dependent.

Thompson, J. F.

Advanced Gas Turbine (AGT) powertrain system initial development report

The powertrain consists of a single shaft regenerated gas turbine engine utilizing ceramic hot section components, coupled to a slit differential gearbox with an available variable stator torque converter and an available Ford intergral overdrive four-speed automatic transmission. Predicted fuel economy using gasoline fuel over the combined federal driving cycle (CFDC) is 15.3 km/1, which represents a 59% improvement over the spark-ignition-powered baseline vehicle. Using DF2 fuel, CFDC mileage estimates are 17.43 km/1. Zero to 96.6 km/hr acceleration time is 11.9 seconds with a four-second accleration distance of 21.0 m. The ceramic radial turbine rotor is discussed along with the control system for the powertrain.

Source record

The symbolic computation and automatic analysis of trajectories

Research was generally done on computation of trajectories of dynamical systems, especially control systems. Algorithms were further developed for rewriting expressions involving differential operators. The differential operators involved arise in the local analysis of nonlinear control systems. An initial design was completed of the system architecture for software to analyze nonlinear control systems using data base computing.

Grossman, Robert

Regularized Differentiation for Bioburden Density Estimation in Planetary Protection

In this paper, we propose and investigate the performance of two novel shrinkage estimators for bioburden density estimation in planetary protection. The estimators are based on the regularized differentiation of a cumulative count of colony forming units collected throughout the data collecting session or the life cycle of the entire mission. The regularized differentiation recasts the problem of bioburden density estimation as a linear least squares problem. The least squares problem is then solved through regularization techniques, such as truncated singular value decomposition and penalized least squares. The regularization is necessary to avoid noise amplification during the differentiation of noisy data. The two regularization estimators are compared with four other commonly used estimators to simultaneously evaluate the means of multivariable independent Poisson distributions: the maximum likelihood, noninformative Bayes estimator with Jeffreys prior, Empirical Bayes using conjugate gamma-Poisson model with gamma parameters selected by method of moments, and the Clevenson-Zidek estimator. It is shown through computer-simulated data that the regularized differentiation based on ridge regression has the smallest mean-squared error among all estimators. The analysis of shrinkage mechanism implemented by regularized differentiation is performed, and it is shown that the regularized differentiation amounts to performing a weighted averaging of all the samples. The weights are determined by the regularization parameter automatically selected by the L-curve technique. Since the method of least squares makes no distributional assumptions about the data, it presents an attractive technique for bioburden density estimation when there are concerns about the misspecification of the distributional model. The paper concludes with the analysis of the bioburden data collected during InSight mission and directions for future work.

97 - MATHEMATICS AND COMPUTING

Advanced AFCS developments on the XV-15 tilt rotor research aircraft

The design criteria and control and handling qualities of the Automatic Flight Control System (AFCS), developed in the framework of the XV-15 tilt-rotor research aircraft, are evaluated, differentiating between the stability and control criteria. A technically aggressive SCAS control law was implemented, demonstrating that significant benefits accrue when stability criteria are separated from design criteria; the design analyses for application of the control law are presented, and the limit bandwidth for stabilization in hovering flight is shown to be defined by rotor or control lag functions. Flight tests of the aircraft resulted in a rating of 3 on the Cooper-Harper scale; a possibility of achieving a rating of 2 is expected if the system is applied to the yaw and heave control modes.

Churchill, G. B.

Numerical simulation of low gravity draining

A boundary value problem was solved numerically for a liquid that is assumed to be inviscid and incompressible, having a motion that is irrotational and axisymmetric, and having a constant (5 degrees) solid-liquid contact angle. The avoidance of excessive mesh distortion, encountered with strictly Lagrangian or Eulerian kinematics, was achieved by introducing an auxiliary kinematic velocity field along the free surface in order to vary the trajectories used in integrating the ordinary differential equations simulating the moving boundary. The computation of the velocity potential was based upon a nonuniform triangular mesh which was automatically revised to varying depths to accommodate the motion of the free surface. These methods permitted calculation of draining induced axisymmetric slosh through the many (or fractional) finite amplitude oscillations that can occur depending upon the balance of draining, gravitational, and surface tension forces. Velocity fields, evolution of the free surface with time, and liquid residual volumes were computed for three and one half decades of Weber number and for two Bond numbers, tank fill levels, and drain radii. Comparisons with experimental data are very satisfactory.

Bizzell, G. D.