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 649 records · Page 36

All sources NASA NTRS DOE OSTI

NASA NTRS1989

Personal computer study of finite-difference methods for the transonic small disturbance equation

Calculation of unsteady flow phenomena requires careful attention to the numerical treatment of the governing partial differential equations. The personal computer provides a convenient and useful tool for the development of meshes, algorithms, and boundary conditions needed to provide time accurate solution of these equations. The one-dimensional equation considered provides a suitable model for the study of wave propagation in the equations of transonic small disturbance potential flow. Numerical results for effects of mesh size, extent, and stretching, time step size, and choice of far-field boundary conditions are presented. Analysis of the discretized model problem supports these numerical results. Guidelines for suitable mesh and time step choices are given.

Bland, Samuel R.↗

NASA NTRS1990

Personal computer study of finite-difference methods for the transonic small disturbance equation

Calculation of unsteady flow phenomena requires careful attention to the numerical treatment to the governing partial differential equations. The personal computer provides a convenient and useful tool for the development of meshes, algorithms, and boundary conditions needed to provide time accurate solution of these equations. The one-dimensional equation considered provides a suitable model for the study of wave propagation in the equations of transonic small disturbance potential flow. Numerical results for effects of mesh size, extent, and stretching, time step size, and choice of far-field boundary conditions are presented. Analysis of the discretized model problem supports these numerical results. Guidelines for suitable mesh and time step choices are given.

Bland, Samuel R.↗

NASA NTRS1990

A fully Sinc-Galerkin method for Euler-Bernoulli beam models

A fully Sinc-Galerkin method in both space and time is presented for fourth-order time-dependent partial differential equations with fixed and cantilever boundary conditions. The Sinc discretizations for the second-order temporal problem and the fourth-order spatial problems are presented. Alternate formulations for variable parameter fourth-order problems are given which prove to be especially useful when applying the forward techniques to parameter recovery problems. The discrete system which corresponds to the time-dependent partial differential equations of interest are then formulated. Computational issues are discussed and a robust and efficient algorithm for solving the resulting matrix system is outlined. Numerical results which highlight the method are given for problems with both analytic and singular solutions as well as fixed and cantilever boundary conditions.

Smith, R. C.↗

NASA NTRS1994

A sensitivity equation approach to shape optimization in fluid flows

A sensitivity equation method to shape optimization problems is applied. An algorithm is developed and tested on a problem of designing optimal forebody simulators for a 2D, inviscid supersonic flow. The algorithm uses a BFGS/Trust Region optimization scheme with sensitivities computed by numerically approximating the linear partial differential equations that determine the flow sensitivities. Numerical examples are presented to illustrate the method.

Borggaard, Jeff↗

NASA NTRS2007

Two-Stage Path Planning Approach for Designing Multiple Spacecraft Reconfiguration Maneuvers

The paper presents a two-stage approach for designing optimal reconfiguration maneuvers for multiple spacecraft. These maneuvers involve well-coordinated and highly-coupled motions of the entire fleet of spacecraft while satisfying an arbitrary number of constraints. This problem is particularly difficult because of the nonlinearity of the attitude dynamics, the non-convexity of some of the constraints, and the coupling between the positions and attitudes of all spacecraft. As a result, the trajectory design must be solved as a single 6N DOF problem instead of N separate 6 DOF problems. The first stage of the solution approach quickly provides a feasible initial solution by solving a simplified version without differential constraints using a bi-directional Rapidly-exploring Random Tree (RRT) planner. A transition algorithm then augments this guess with feasible dynamics that are propagated from the beginning to the end of the trajectory. The resulting output is a feasible initial guess to the complete optimal control problem that is discretized in the second stage using a Gauss pseudospectral method (GPM) and solved using an off-the-shelf nonlinear solver. This paper also places emphasis on the importance of the initialization step in pseudospectral methods in order to decrease their computation times and enable the solution of a more complex class of problems. Several examples are presented and discussed.

Aoude, Georges S.↗

NASA NTRS2004

Rapid Switching and Modulation by use of Coupled VCSELs

Devices incorporating coupled vertical-cavity surface-emitting lasers (VCSELs) have been proposed as means to effect unprecedentedly rapid modulation and/or switching of light beams in advanced optical communication and information-processing systems. A basic device according to the proposal would comprise two or more VCSELs (1) positioned so close to each other that they are coupled and (2) connected to a current source that biases them at a steady current above the threshold current for lasing. The operation of VCSELs under the conditions stated above has been simulated computationally with an algorithm that solves an approximation of the Maxwell-Bloch equations. (These are nonlinear coupled partial differential equations that model the relevant aspects of the physics of semiconductor lasers.) The results of the simulations show that the intensities of the beams oscillate, out of phase relative to each other, at a frequency that is typically of the order of tens of gigahertz. In particular, one simulation was performed for two coupled VCSELs, each having a circular aperture 5.6 microns in diameter, operating at a wavelength of 980 nm. The results of the simulation showed that the intensities of the two beams oscillated in opposite phase (see Figure 1) at a frequency of 42 GHz. In the far field, the beams were found to be separated by an angle of approx.=8deg. The intensities of the beams were also found to oscillate in the near field, 90deg out of phase with the oscillation in the far field. Figure 2 depicts a simple near-field switching device in which an assembly of microlenses would couple the two oscillating beams to two receivers.

Goorjian, Peter M.↗

NASA NTRS1982

Algorithmic aspects of transient heat transfer problems in structures

It is noted that the application of finite element or finite difference techniques to the solution of transient heat transfer problems in structures often results in a stiff system of ordinary differential equations. Such systems are usually handled most efficiently by implicit integration techniques which require the solution of large and sparse systems of algebraic equations. The assembly and solution of these systems using the incomplete Cholesky conjugate gradient algorithm is examined. Several examples are used to demonstrate the advantage of the algorithm over other techniques.

Haftka, R. T.↗

DOE OSTI2025

jaxhps: An elliptic PDE solver built with machine learning in mind

Elliptic partial differential equations (PDEs) can model many physical phenomena, such as electrostatics, acoustics, wave propagation, and diffusion. In scientific machine learning settings, a high-throughput PDE solver may be required to generate a training dataset, run in the inner loop of an iterative algorithm, or interface directly with a deep neural network. To provide value to machine learning users, such a PDE solver must be compatible with standard automatic differentiation frameworks, scale efficiently when run on graphics processing units (GPUs), and maintain high accuracy for a large range of input parameters. We have designed the jaxhps package with these use-cases in mind by implementing a highly efficient and accurate solver for elliptic problems with native hardware acceleration and automatic differentiation support.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1972

Numerical method for the solution of large systems of differential equations of the boundary layer type

A numerical method for the solution of large systems of nonlinear differential equations of the boundary-layer type is described. The method is a modification of the technique for satisfying asymptotic boundary conditions. The present method employs inverse interpolation instead of the Newton method to adjust the initial conditions of the related initial-value problem. This eliminates the so-called perturbation equations. The elimination of the perturbation equations not only reduces the user's preliminary work in the application of the method, but also reduces the number of time-consuming initial-value problems to be numerically solved at each iteration. For further ease of application, the solution of the overdetermined system for the unknown initial conditions is obtained automatically by applying Golub's linear least-squares algorithm. The relative ease of application of the proposed numerical method increases directly as the order of the differential-equation system increases. Hence, the method is especially attractive for the solution of large-order systems. After the method is described, it is applied to a fifth-order problem from boundary-layer theory.

Green, M. J.↗

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↗