Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic 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 685 records · Page 38
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

Introduction to multigrid methods

These notes were written for an introductory course on the application of multigrid methods to elliptic and hyperbolic partial differential equations for engineers, physicists and applied mathematicians. The use of more advanced mathematical tools, such as functional analysis, is avoided. The course is intended to be accessible to a wide audience of users of computational methods. We restrict ourselves to finite volume and finite difference discretization. The basic principles are given. Smoothing methods and Fourier smoothing analysis are reviewed. The fundamental multigrid algorithm is studied. The smoothing and coarse grid approximation properties are discussed. Multigrid schedules and structured programming of multigrid algorithms are treated. Robustness and efficiency are considered.

Wesseling, P.↗
NASA NTRS2015

Evaluating a New Homogeneous Total Ozone Climate Data Record from GOME/ERS-2, SCIAMACHY/Envisat, and GOME-2/MetOp-A

The European Space Agency's Ozone Climate Change Initiative (O3-CCI) project aims at producing and validating a number of high-quality ozone data products generated from different satellite sensors. For total ozone, the O3-CCI approach consists of minimizing sources of bias and systematic uncertainties by applying a common retrieval algorithm to all level 1 data sets, in order to enhance the consistency between the level 2 data sets from individual sensors. Here we present the evaluation of the total ozone products from the European sensors Global Ozone Monitoring Experiment (GOME)/ERS-2, SCIAMACHY/Envisat, and GOME-2/MetOp-A produced with the GOME-type Direct FITting (GODFIT) algorithm v3. Measurements from the three sensors span more than 16 years, from 1996 to 2012. In this work, we present the latest O3-CCI total ozone validation results using as reference ground-based measurements from Brewer and Dobson spectrophotometers archived at the World Ozone and UV Data Centre of the World Meteorological Organization as well as from UV-visible differential optical absorption spectroscopy (DOAS)/Système D′Analyse par Observations Zénithales (SAOZ) instruments from the Network for the Detection of Atmospheric Composition Change. In particular, we investigate possible dependencies in these new GODFIT v3 total ozone data sets with respect to latitude, season, solar zenith angle, and different cloud parameters, using the most adequate type of ground-based instrument. We show that these three O3-CCI total ozone data products behave very similarly and are less sensitive to instrumental degradation, mainly as a result of the new reflectance soft-calibration scheme. The mean bias to the ground-based observations is found to be within the 1 plus or minus 1 percent level for all three sensors while the near-zero decadal stability of the total ozone columns (TOCs) provided by the three European instruments falls well within the 1-3 percent requirement of the European Space Agency's Ozone Climate Change Initiative project.

Satellite sensors↗
NASA NTRS1980

The control and estimation of large space structures

A shape control or estimation problem for a large space structure can be modeled by a partial differential equation which represents changes in shape with respect to space and time, together with spatially discrete forcing functions or observations which represent the placement of actuators or sensors at discrete points along the structure. The use of Green's functions to convert boundary value problems into integral equations provides a convenient treatment of this mixture of continuous and discrete mathematics. Control and estimation algorithms are developed for the one-dimensional static beam to illustrate this technique.

Weeks, C.↗
NASA NTRS1987

Guidance simulation and test support for differential GPS flight experiment

Three separate tasks which supported the test preparation, test operations, and post test analysis of the NASA Ames flight test evaluation of the differential Global Positioning System (GPS) are presented. Task 1 consisted of a navigation filter design, coding, and testing to optimally make use of GPS in a differential mode. The filter can be configured to accept inputs from external censors such as an accelerometer and a barometric or radar altimeter. The filter runs in real time onboard a NASA helicopter. It processes raw pseudo and delta range measurements from a single channel sequential GPS receiver. The Kalman filter software interfaces are described in detail, followed by a description of the filter algorithm, including the basic propagation and measurement update equations. The performance during flight tests is reviewed and discussed. Task 2 describes a refinement performed on the lateral and vertical steering algorithms developed on a previous contract. The refinements include modification of the internal logic to allow more diverse inflight initialization procedures, further data smoothing and compensation for system induced time delays. Task 3 describes the TAU Corp participation in the analysis of the real time Kalman navigation filter. The performance was compared to that of the Z-set filter in flight and to the laser tracker position data during post test analysis. This analysis allowed a more optimum selection of the parameters of the filter.

Geier, G. J.↗
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 NTRS1990

Artificial Intelligence (AI) Based Tactical Guidance for Fighter Aircraft

A research program investigating the use of Artificial Intelligence (AI) techniques to aid in the development of a Tactical Decision Generator (TDG) for Within Visual Range (WVR) air combat engagements is discussed. The application of AI programming and problem solving methods in the development and implementation of the Computerized Logic For Air-to-Air Warfare Simulations (CLAWS), a second generation TDG, is presented. The Knowledge-Based Systems used by CLAWS to aid in the tactical decision-making process are outlined in detail, and the results of tests to evaluate the performance of CLAWS versus a baseline TDG developed in FORTRAN to run in real-time in the Langley Differential Maneuvering Simulator (DMS), are presented. To date, these test results have shown significant performance gains with respect to the TDG baseline in one-versus-one air combat engagements, and the AI-based TDG software has proven to be much easier to modify and maintain than the baseline FORTRAN TDG programs. Alternate computing environments and programming approaches, including the use of parallel algorithms and heterogeneous computer networks are discussed, and the design and performance of a prototype concurrent TDG system are presented.

McManus, John W.↗
NASA NTRS2007

Comparing Consider-Covariance Analysis with Sigma-Point Consider Filter and Linear-Theory Consider Filter Formulations

Recent literature in applied estimation theory reflects growing interest in the sigma-point (also called unscented ) formulation for optimal sequential state estimation, often describing performance comparisons with extended Kalman filters as applied to specific dynamical problems [c.f. 1, 2, 3]. Favorable attributes of sigma-point filters are described as including a lower expected error for nonlinear even non-differentiable dynamical systems, and a straightforward formulation not requiring derivation or implementation of any partial derivative Jacobian matrices. These attributes are particularly attractive, e.g. in terms of enabling simplified code architecture and streamlined testing, in the formulation of estimators for nonlinear spaceflight mechanics systems, such as filter software onboard deep-space robotic spacecraft. As presented in [4], the Sigma-Point Consider Filter (SPCF) algorithm extends the sigma-point filter algorithm to the problem of consider covariance analysis. Considering parameters in a dynamical system, while estimating its state, provides an upper bound on the estimated state covariance, which is viewed as a conservative approach to designing estimators for problems of general guidance, navigation and control. This is because, whether a parameter in the system model is observable or not, error in the knowledge of the value of a non-estimated parameter will increase the actual uncertainty of the estimated state of the system beyond the level formally indicated by the covariance of an estimator that neglects errors or uncertainty in that parameter. The equations for SPCF covariance evolution are obtained in a fashion similar to the derivation approach taken with standard (i.e. linearized or extended) consider parameterized Kalman filters (c.f. [5]). While in [4] the SPCF and linear-theory consider filter (LTCF) were applied to an illustrative linear dynamics/linear measurement problem, in the present work examines the SPCF as applied to nonlinear sequential consider covariance analysis, i.e. in the presence of nonlinear dynamics and nonlinear measurements. A simple SPCF for orbit determination, exemplifying an algorithm hosted in the guidance, navigation and control (GN&C) computer processor of a hypothetical robotic spacecraft, was implemented, and compared with an identically-parameterized (standard) extended, consider-parameterized Kalman filter. The onboard filtering scenario examined is a hypothetical spacecraft orbit about a small natural body with imperfectly-known mass. The formulations, relative complexities, and performances of the filters are compared and discussed.

Lisano, Michael E.↗
NASA NTRS1987

A direct algorithm for solution of incompressible three-dimensional unsteady Navier-Stokes equations

A direct, implicit, numerical solution algorithm, with second-order accuracy in space and time, is constructed for the three-dimensional unsteady incompressible Navier-Stokes equations formulated in terms of velocity and vorticity, using generalized orthogonal coordinates to achieve the accurate solution of complex viscous flow configurations. A numerically stable, efficient, direct inversion procedure is developed for the computationally intensive divergence-curl elliptic velocity problem. This overdetermined partial differential operator is first formulated as a uniquely determined, nonsingular matrix-vector problem; this aspect of the procedure is a unique feature of the present analysis. The three-dimensional vorticity-transport equation is solved by a modified factorization technique which completely eliminates the need for any block-matrix inversions and only scalar tridiagonal matrices need to be inverted. The method is applied to the test problem of the three-dimensional flow within a shear-driven cubical box. Coherent streamwise vortex structures are observed within the steady-state flow at Re = 100.

Osswald, G. A.↗
NASA NTRS1993

Trajectory optimization based on differential inclusion

A method for generating finite-dimensional approximations to the solutions of optimal control problems is introduced. By employing a description of the dynamical system in terms of its attainable sets in favor of using differential equations, the controls are completely eliminated from the system model. Besides reducing the dimensionality of the discretized problem compared to state-of-the-art collocation methods, this approach also alleviates the search for initial guesses from where standard gradient search methods are able to converge. The mechanics of the new method are illustrated on a simple double integrator problem. The performance of the new algorithm is demonstrated on a 1-D rocket ascent problem ('Goddard Problem') in presence of a dynamic pressure constraint.

Seywald, Hans↗
NASA NTRS1993

Trajectory optimization based on differential inclusion

A method for generating finite-dimensional approximations to the solutions of optimal control problems is introduced. By employing a description of the dynamical system in terms of its attainable sets in favor of using differential equations, the controls are completely eliminated from the system model. Besides reducing the dimensionality of the discretized problem compared to state-of-the-art collocation methods, this approach also alleviates the search for initial guesses from where standard gradient search methods are able to converge. The mechanics of the new method are illustrated on a simple double integrator problem. The performance of the new algorithm is demonstrated on a I-D rocket ascent problem ('Goddard Problem') in presence of a dynamic pressure constraint.

Seywald, Hans↗
NASA NTRS1993

Trajectory optimization based on differential inclusion

A method for generating finite-dimensional approximations to the solutions of optimal control problems is introduced. By employing a description of the dynamical system in terms of its attainable sets in favor of using differential equations, the controls are completely eliminated from the system model. Besides reducing the dimensionality of the discretized problem compared to state-of-the-art collocation methods, this approach also alleviates the search for initial guesses from where standard gradient search methods are able to converge. The mechanics of the new method are illustrated on a simple double integrator problem. The performance of the new algorithm is demonstrated on a 1-D rocket ascent problem (`Goddard Problem') in presence of a dynamic pressure constraint.

Seywald, Hans↗
NASA NTRS2003

Enabling computer decisions based on EEG input

Multilayer neural networks were successfully trained to classify segments of 12-channel electroencephalogram (EEG) data into one of five classes corresponding to five cognitive tasks performed by a subject. Independent component analysis (ICA) was used to segregate obvious artifact EEG components from other sources, and a frequency-band representation was used to represent the sources computed by ICA. Examples of results include an 85% accuracy rate on differentiation between two tasks, using a segment of EEG only 0.05 s long and a 95% accuracy rate using a 0.5-s-long segment.

Validation Studies↗
NASA NTRS1984

A study of the application of differential techniques to the global positioning system for a helicopter precision approach

The results of a simulation study to define the functional characteristics of a airborne and ground reference GPS receiver for use in a Differential GPS system are doumented. The operations of a variety of receiver types (sequential-single channel, continuous multi-channel, etc.) are evaluated for a typical civil helicopter mission scenario. The math model of each receiver type incorporated representative system errors including intentional degradation. The results include the discussion of the receiver relative performance, the spatial correlative properties of individual range error sources, and the navigation algorithm used to smooth the position data.

Mccall, D. L.↗
NASA NTRS1986

Partitioning and packing mathematical simulation models for calculation on parallel computers

The development of multiprocessor simulations from a serial set of ordinary differential equations describing a physical system is described. Degrees of parallelism (i.e., coupling between the equations) and their impact on parallel processing are discussed. The problem of identifying computational parallelism within sets of closely coupled equations that require the exchange of current values of variables is described. A technique is presented for identifying this parallelism and for partitioning the equations for parallel solution on a multiprocessor. An algorithm which packs the equations into a minimum number of processors is also described. The results of the packing algorithm when applied to a turbojet engine model are presented in terms of processor utilization.

Arpasi, D. J.↗
NASA NTRS1994

Computing Plasma Interactions Of A Spacecraft

NASCAP/LEO (NASA Spacecraft Charging Analyzer Program for Low Earth Orbit) implements collection of mathematical models and algorithms designed to study electrostatic interaction between cold, dense plasma and spacecraft surfaces. Computes variety of electrostatic, plasma, and flow effects. Appropriate for conditions in which temperature of plasma small in comparison with spacecraft-generated potentials and Debye screening length short in comparison with dimensions of spacecraft. Related NASCAP/GEO (LEW-12973) code (NASA Charging Analyzer Program for Geosynchronous Orbit, denoted as NASCAP) appropriate for conditions which spacecraft differential potentials result from interactions with hot plasma and Debye screening length larger than dimensions of spacecraft. Object-definition portion of NASCAP/GEO code provided as part of package. NASCAP/LEO written in FORTRAN 77 and C language.

Mandell, M. J.↗
NASA NTRS2009

Constructing LDPC Codes from Loop-Free Encoding Modules

A method of constructing certain low-density parity-check (LDPC) codes by use of relatively simple loop-free coding modules has been developed. The subclasses of LDPC codes to which the method applies includes accumulate-repeat-accumulate (ARA) codes, accumulate-repeat-check-accumulate codes, and the codes described in Accumulate-Repeat-Accumulate-Accumulate Codes (NPO-41305), NASA Tech Briefs, Vol. 31, No. 9 (September 2007), page 90. All of the affected codes can be characterized as serial/parallel (hybrid) concatenations of such relatively simple modules as accumulators, repetition codes, differentiators, and punctured single-parity check codes. These are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. These codes can also be characterized as hybrid turbolike codes that have projected graph or protograph representations (for example see figure); these characteristics make it possible to design high-speed iterative decoders that utilize belief-propagation algorithms. The present method comprises two related submethods for constructing LDPC codes from simple loop-free modules with circulant permutations. The first submethod is an iterative encoding method based on the erasure-decoding algorithm. The computations required by this method are well organized because they involve a parity-check matrix having a block-circulant structure. The second submethod involves the use of block-circulant generator matrices. The encoders of this method are very similar to those of recursive convolutional codes. Some encoders according to this second submethod have been implemented in a small field-programmable gate array that operates at a speed of 100 megasymbols per second. By use of density evolution (a computational- simulation technique for analyzing performances of LDPC codes), it has been shown through some examples that as the block size goes to infinity, low iterative decoding thresholds close to channel capacity limits can be achieved for the codes of the type in question having low maximum variable node degrees. The decoding thresholds in these examples are lower than those of the best-known unstructured irregular LDPC codes constrained to have the same maximum node degrees. Furthermore, the present method enables the construction of codes of any desired rate with thresholds that stay uniformly close to their respective channel capacity thresholds.

Divsalar, Dariush↗
NASA NTRS1988

The equation of state for stellar envelopes. II - Algorithm and selected results

A free-energy-minimization method for computing the dissociation and ionization equilibrium of a multicomponent gas is discussed. The adopted free energy includes terms representing the translational free energy of atoms, ions, and molecules; the internal free energy of particles with excited states; the free energy of a partially degenerate electron gas; and the configurational free energy from shielded Coulomb interactions among charged particles. Internal partition functions are truncated using an occupation probability formalism that accounts for perturbations of bound states by both neutral and charged perturbers. The entire theory is analytical and differentiable to all orders, so it is possible to write explicit analytical formulas for all derivatives required in a Newton-Raphson iteration; these are presented to facilitate future work. Some representative results for both Saha and free-energy-minimization equilibria are presented for a hydrogen-helium plasma with N(He)/N(H) = 0.10. These illustrate nicely the phenomena of pressure dissociation and ionization, and also demonstrate vividly the importance of choosing a reliable cutoff procedure for internal partition functions.

Mihalas, Dimitri↗
NASA NTRS1982

Evaluation of SLAR and simulated thematic mapper MSS data for forest cover mapping using computer-aided analysis techniques

Kershaw County, South Carolina was selected as the study site for analyzing simulated thematic mapper MSS data and dual-polarized X-band synthetic aperture radar (SAR) data. The impact of the improved spatial and spectral characteristics of the LANDSAT D thematic mapper data on computer aided analysis for forest cover type mapping was examined as well as the value of synthetic aperture radar data for differentiating forest and other cover types. The utility of pattern recognition techniques for analyzing SAR data was assessed. Topics covered include: (1) collection and of TMS and reference data; (2) reformatting, geometric and radiometric rectification, and spatial resolution degradation of TMS data; (3) development of training statistics and test data sets; (4) evaluation of different numbers and combinations of wavelength bands on classification performance; (5) comparison among three classification algorithms; and (6) the effectiveness of the principal component transformation in data analysis. The collection, digitization, reformatting, and geometric adjustment of SAR data are also discussed. Image interpretation results and classification results are presented.

Hoffer, R. M.↗