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.

SourceResearch connectionFrom yearThrough year

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

At least 415 records · Page 23

All sources NASA NTRS DOE OSTI

NASA NTRS1990

SIAM Conference on Parallel Processing for Scientific Computing, 4th, Chicago, IL, Dec. 11-13, 1989, Proceedings

Attention is given to such topics as an evaluation of block algorithm variants in LAPACK and presents a large-grain parallel sparse system solver, a multiprocessor method for the solution of the generalized Eigenvalue problem on an interval, and a parallel QR algorithm for iterative subspace methods on the CM2. A discussion of numerical methods includes the topics of asynchronous numerical solutions of PDEs on parallel computers, parallel homotopy curve tracking on a hypercube, and solving Navier-Stokes equations on the Cedar Multi-Cluster system. A section on differential equations includes a discussion of a six-color procedure for the parallel solution of elliptic systems using the finite quadtree structure, data parallel algorithms for the finite element method, and domain decomposition methods in aerodynamics. Topics dealing with massively parallel computing include hypercube vs. 2-dimensional meshes and massively parallel computation of conservation laws. Performance and tools are also discussed.

Dongarra, Jack↗

NASA NTRS1989

Numerical algorithms for steady and unsteady incompressible Navier-Stokes equations

The numerical analysis of the incompressible Navier-Stokes equations are becoming important tools in the understanding of some fluid flow problems which are encountered in research as well as in industry. With the advent of the supercomputers, more realistic problems can be studied with a wider choice of numerical algorithms. An alternative formulation is presented for viscous incompressible flows. The incompressible Navier-Stokes equations are cast in a velocity/vorticity formulation. This formulation consists of solving the Poisson equations for the velocity components and the vorticity transport equation. Two numerical algorithms for the steady two-dimensional laminar flows are presented. The first method is based on the actual partial differential equations. This uses a finite-difference approximation of the governing equations on a staggered grid. The second method uses a finite element discretization with the vorticity transport equation approximated using a Galerkin approximation and the Poisson equations are obtained using a least squares method. The equations are solved efficiently using Newton's method and a banded direct matrix solver (LINPACK). The method is extended to steady three-dimensional laminar flows and applied to a cubic driven cavity using finite difference schemes and a staggered grid arrangement on a Cartesian mesh. The equations are solved iteratively using a plane zebra relaxation scheme. Currently, a two-dimensional, unsteady algorithm is being developed using a generalized coordinate system. The equations are discretized using a finite-volume approach. This work will then be extended to three-dimensional flows.

Hafez, Mohammed↗

NASA NTRS1995

Grid Sensitivity and Aerodynamic Optimization of Generic Airfoils

An algorithm is developed to obtain the grid sensitivity with respect to design parameters for aerodynamic optimization. The procedure is advocating a novel (geometrical) parameterization using spline functions such as NURBS (Non-Uniform Rational B- Splines) for defining the airfoil geometry. An interactive algebraic grid generation technique is employed to generate C-type grids around airfoils. The grid sensitivity of the domain with respect to geometric design parameters has been obtained by direct differentiation of the grid equations. A hybrid approach is proposed for more geometrically complex configurations such as a wing or fuselage. The aerodynamic sensitivity coefficients are obtained by direct differentiation of the compressible two-dimensional thin-layer Navier-Stokes equations. An optimization package has been introduced into the algorithm in order to optimize the airfoil surface. Results demonstrate a substantially improved design due to maximized lift/drag ratio of the airfoil.

Sadrehaghighi, Ideen↗

NASA NTRS1973

An historical survey of computational methods in optimal control.

Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.

Polak, E.↗

NASA NTRS1992

Comparison Of Two Viscous-Flow Computer Codes

Two viscous-flow computer codes compared by applying them to five test cases of steady-state transonic viscous flows about transonic airfoils. Two codes were: FLOMG, which solves Navier-Stokes differential equations of flow by implementing explicit, Runge-Kutta, finite-volume, multigrid numerical-integration algorithm; and ARC2D, which implements implicit, finite-difference, approximate-factorization, eigenvector-diagonalization numerical-integration algorithm.

Maksymiuk, C. M.↗

NASA NTRS1991

Distributed parameter estimation for NASA Mini-Mast truss through displacement measurements

Most methods of system identification of large flexible structures by far are based on the lumped parameter approach. Because of the considerable computational burden due to the large number of unknown parameters, distributed parameter approach, which greatly decreases the number of unknowns, has being investigated. In this paper a distributed parameter model for the estimation of modal characteristics of NASA Mini-Mast truss has been formulated. Both Bernoulli-Euler beam and Timoshenko beam equations are used to characterize the lateral bending vibrations of the truss. The measurement of the lateral displacement at the tip of the truss is provided to the maximum likelihood estimator. Closed-form solutions of the partial differential equations and closed-form expressions of the sensitivity functions are derived so that the estimation algorithm is highly efficient. The resulting estimates from test data by using Timoshenko beam model are found to be comparable to those derived from finite element analysis.

Huang, Jen-Kuang↗

NASA NTRS1993

On the spectral stability of time integration algorithms for a class of constrained dynamics problems

Incomplete field formulations have recently been the subject of intense research because of their potential in coupled analysis of independently modeled substructures, adaptive refinement, domain decomposition, and parallel processing. This paper discusses the design and analysis of time-integration algorithms for these formulations and emphasizes the treatment of their inter-subdomain constraint equations. These constraints are shown to introduce a destabilizing effect in the dynamic system that can be analyzed by investigating the behavior of the time-integration algorithm at infinite and zero frequencies. Three different approaches for constructing penalty-free unconditionally stable second-order accurate solution procedures for this class of hybrid formulations are presented, discussed and illustrated with numerical examples. The theoretical results presented in this paper also apply to a large family of nonlinear multibody dynamics formulations. Some of the algorithms outlined herein are important alternatives to the popular technique consisting of transforming differential/algebraic equations into ordinary differential equations via the introduction of a stabilization term that depends on arbitrary constants and that influences the computed so1ution.

Farhat, Charbel↗

NASA NTRS1995

Extensional flow convecting a reactant undergoing a first order homogeneous reaction and diffusional mass transfer from a sphere at low to intermediate Peclet and Damkohler numbers

Forced convective diffusion-reaction is considered for viscous axisymmetric extensional convecting velocity in the neighborhood of a sphere. For Peclet numbers in the range 0.1 less than or equal to Pe less than or equal to 500 and for Damkohler numbers increasing with increasing Pe but in the overall range 0.02 less than or equal to Da less than or equal to 10, average and local Sherwood numbers have been computed. By introducing the eigenfunction expansion c(r, Theta) = Sum of c(n)(r)P(n)(cos Theta) into the forced convective diffusion equation for the concentration of a chemical species undergoing a first order homogeneous reaction and by using properties of the Legendre functions Pn(cos Theta), the variable coefficient PDE can be reduced to a system of N + 1 second order ODEs for the radial functions c(sub n)(r), n = 0, 1, 2,..., N. The adaptive grid algorithm of Pereyra and Lentini can be used to solve the corresponding 2(N + 1) first order differential equations as a two-point boundary value problem on 1 less than or equal to r less than or equal to r(sub infinity). Convergence of the expansion for a specific value of N can thus be established and provides 'spectral' behavior as well as the full concentration field c(r, Theta).

Shah, N. Y.↗

NASA NTRS1998

Flow Applications of the Least Squares Finite Element Method

The main thrust of the effort has been towards the development, analysis and implementation of the least-squares finite element method (LSFEM) for fluid dynamics and electromagnetics applications. In the past year, there were four major accomplishments: 1) special treatments in computational fluid dynamics and computational electromagnetics, such as upwinding, numerical dissipation, staggered grid, non-equal order elements, operator splitting and preconditioning, edge elements, and vector potential are unnecessary; 2) the analysis of the LSFEM for most partial differential equations can be based on the bounded inverse theorem; 3) the finite difference and finite volume algorithms solve only two Maxwell equations and ignore the divergence equations; and 4) the first numerical simulation of three-dimensional Marangoni-Benard convection was performed using the LSFEM.

Jiang, Bo-Nan↗

NASA NTRS1990

Kalman filter based range estimation for autonomous navigation using imaging sensors

Rotorcraft operating in high-threat environments fly close to the surface of the earth to utilize surrounding terrain, vegetation, or man-made objects to minimize the risk of being detected by the enemy. Two basic requirements for obstacle avoidance are detection and range estimation of the object from the current rotorcraft position. There are many approaches to the estimation of range using a sequence of images. The approach used in this analysis differes from previous methods in two significant ways: an attempt is not made to estimate the rotorcraft's motion from the images; and the interest lies in recursive algorithms. The rotorcraft parameters are assumed to be computed using an onboard inertial navigation system. Given a sequence of images, using image-object differential equations, a Kalman filter (Sridhar and Phatak, 1988) can be used to estimate both the relative coordinates and the earth coordinates of the objects on the ground. The Kalman filter can also be used in a predictive mode to track features in the images, leading to a significant reduction of search effort in the feature extraction step of the algorithm. The purpose is to summarize early results obtained in extending the Kalman filter for use with actual image sequences. The experience gained from the application of this algorithm to real images is very valuable and is a necessary step before proceeding to the estimation of range during low-altitude curvilinear flight. A simple recursive method is presented to estimate range to objects using a sequence of images. The method produces good range estimates using real images in a laboratory set up and needs to be evaluated further using several different image sequences to test its robustness. The feature generation part of the algorithm requires further refinement on the strategies to limit the number of features (Sridhar and Phatak, 1989). The extension of the work reported here to curvilinear flight may require the use of the extended Kalman filter.

Sridhar, Banavar↗

NASA NTRS1993

The use of linked lists in the simulation of controller-structure interaction

An algorithm for the computer simulation of large space structures under active control is considered. Linked lists are used in a matrix data structure to implement the trapezoidal rule on system differential equations. The use of the trapezoidal rule ensures that the numerical stability is equivalent to the system stability, which is essential for this type of simulation. The sparsity of the system matrices is exploited by the linked lists, and the algorithm efficiently steps through the lists in an orderly fashion. Results of simulations on a NASA large space structure experiment are reported.

Quan, R.↗

NASA NTRS1993

Grid and aerodynamic sensitivity analyses of airplane components

An algorithm is developed to obtain the grid sensitivity with respect to design parameters for aerodynamic optimization. The procedure is advocating a novel (geometrical) parameterization using spline functions such as NURBS (Non-Uniform Rational B-Splines) for defining the wing-section geometry. An interactive algebraic grid generation technique, known as Two-Boundary Grid Generation (TBGG) is employed to generate C-type grids around wing-sections. The grid sensitivity of the domain with respect to geometric design parameters has been obtained by direct differentiation of the grid equations. A hybrid approach is proposed for more geometrically complex configurations such as a wing or fuselage. The aerodynamic sensitivity coefficients are obtained by direct differentiation of the compressible two-dimensional thin-layer Navier-Stokes equations. An optimization package has been introduced into the algorithm in order to optimize the wing-section surface. Results demonstrate a substantially improved design due to maximized lift/drag ratio of the wing-section.

Sadrehaghighi, Ideen↗

NASA NTRS1993

The use of linked lists in the simulation of controller-structure interaction

An algorithm for the computer simulation of large space structures under active control is considered. Linked lists are used in a matrix data structure to implement the trapezoidal rule on the system differential equations. The use of the trapezoidal rule ensures that the numerical stability is equivalent to the system stability, which is essential for this type of simulation. The sparsity of the system matrices is exploited by the linked lists, and the algorithm efficiently steps through the lists in an orderly fashion. Results of simulations on a NASA large space structure experiment are reported.

Quan, Ralph↗

NASA NTRS1972

IBM system/360 assembly language interval arithmetic software

Computer software designed to perform interval arithmetic is described. An interval is defined as the set of all real numbers between two given numbers including or excluding one or both endpoints. Interval arithmetic consists of the various elementary arithmetic operations defined on the set of all intervals, such as interval addition, subtraction, union, etc. One of the main applications of interval arithmetic is in the area of error analysis of computer calculations. For example, it has been used sucessfully to compute bounds on sounding errors in the solution of linear algebraic systems, error bounds in numerical solutions of ordinary differential equations, as well as integral equations and boundary value problems. The described software enables users to implement algorithms of the type described in references efficiently on the IBM 360 system.

Phillips, E. J.↗

NASA NTRS1989

Parameter identification for an abstract Cauchy problem by quasilinearization

A parameter identification problem is considered in the context of a linear abstract Cauchy problem with a parameter-dependent evolution operator. Conditions are investigated under which the gradient of the state with respect to a parameter possesses smoothness properties which lead to local convergence of an estimation algorithm based on quasi-linearization. Numerical results are presented concerning estimation of unknown parameters in delay-differential equations.

Brewer, Dennis W.↗

NASA NTRS1993

Parameter identification for an abstract Cauchy problem by quasilinearization

Brewer, Dennis W.↗

NASA NTRS1993

Optimal convolution SOR acceleration of waveform relaxation with application to semiconductor device simulation

In this paper we describe a novel generalized SOR (successive overrelaxation) algorithm for accelerating the convergence of the dynamic iteration method known as waveform relaxation. A new convolution SOR algorithm is presented, along with a theorem for determining the optimal convolution SOR parameter. Both analytic and experimental results are given to demonstrate that the convergence of the convolution SOR algorithm is substantially faster than that of the more obvious frequency-independent waveform SOR algorithm. Finally, to demonstrate the general applicability of this new method, it is used to solve the differential-algebraic system generated by spatial discretization of the time-dependent semiconductor device equations.

Reichelt, Mark↗

NASA NTRS2002

Estimating Single-Trial Responses in EEG

Accurate characterization of single-trial field potential responses is critical from a number of perspectives. For example, it allows differentiation of an evoked response from ongoing EEG. We previously developed the multiple component Event Related Potential (mcERP) algorithm to improve resolution of the single-trial evoked response. The mcERP model states that multiple components, each specified by a stereotypic waveform varying in latency and amplitude from trial to trial, comprise the evoked response. Application of the mcERP algorithm to simulated data with three independent, synthetic components has shown that the model is capable of separating these components and estimating their variability. Application of the model to single trial, visual evoked potentials recorded simultaneously from all V1 laminae in an awake, fixating macaque yielded local and far-field components. Certain local components estimated by the model were distributed in both granular and supragranular laminae. This suggests a linear coupling between the responses of thalamo-recipient neuronal ensembles and subsequent responses of supragranular neuronal ensembles, as predicted by the feedforward anatomy of V1. Our results indicate that the mcERP algorithm provides a valid estimation of single-trial responses. This will enable analyses that depend on trial-to-trial variations and those that require separation of the evoked response from background EEG rhythms

Shah, A. S.↗