Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Differential algebra”

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 379 records · Page 21

Hypercomplex Automatic Differentiation in the Eulerian Hydrocode PAGOSA

Enabling the computation of partial derivatives or sensitivities in production hydrocodes is beneficial for design, optimization, sensitivity analysis, and uncertainty quantification. Traditional finite difference approximations of these sensitivities are inefficient since convergence studies of the step size is required for each parameter of interest. For these reasons, HYPercomplex Automatic Differentiation (HYPAD) was implemented in the Eulerian hydrocode PAGOSA. HYPAD is analogous to forward-mode automatic differentiation except hypercomplex numbers (numbers with multiple imaginary parts) are used instead of dual numbers. Accurate partial derivatives can be computed of all state variables with respect to multiple input variables in a single run. The method was implemented using operator overloading to handle hypercomplex algebra. HYPAD was demonstrated and verified on Sod’s shock tube problem to compute derivatives of the state variables with respect to a material parameter, initial conditions, and geometry.

97 MATHEMATICS AND COMPUTING↗

Relative control effectiveness technique with application to airplane control coordination

A method to select optimal combinations of the control variables of a linear system is reported. The combinations are chosen so that the control channels have their principal influences on selected fundamental modes of the system. A series of algebraic maximization problems is used to maximize the effects of the control channels on selected modes while simultaneously minimizing the effects on the remaining modes. The method is applied to the lateral and directional control of a linearized airplane model having ailerons, a rudder, and differential tail surfaces. Integration of these control eliminates oscillations present in the roll rate for a step lateral-control input and improves the sideslip response with reduced rolling motions for a step directional-control input. Inclusion of thrust-vectoring engine nozzles improves the roll rate capability of the airplane.

Lallman, F. J.↗

Cellerator: extending a computer algebra system to include biochemical arrows for signal transduction simulations

Cellerator describes single and multi-cellular signal transduction networks (STN) with a compact, optionally palette-driven, arrow-based notation to represent biochemical reactions and transcriptional activation. Multi-compartment systems are represented as graphs with STNs embedded in each node. Interactions include mass-action, enzymatic, allosteric and connectionist models. Reactions are translated into differential equations and can be solved numerically to generate predictive time courses or output as systems of equations that can be read by other programs. Cellerator simulations are fully extensible and portable to any operating system that supports Mathematica, and can be indefinitely nested within larger data structures to produce highly scaleable models.

Non-NASA Center↗

A numerical and experimental study of confined swirling jets

A numerical and experimental study of a confined strong swirling flow is presented. Detailed velocity measurements are made using a two-component laser Doppler velocimeter (LDV) technique. Computations are performed using a differential second-moment (DSM) closure. The effect of inlet dissipation rate on calculated mean and turbulence fields is investigated. Various model constants are employed in the pressure-strain model to demonstrate their influences on the predicted results. Finally, comparison of the DSM calculations with the algebraic second-monent (ASM) closure results shows that the DSM is better suited for complex swirling flow analysis.

Nikjooy, M.↗

Scalable multilevel Monte Carlo methods exploiting parallel redistribution on coarse levels

Here, we study an element agglomeration coarsening strategy that requires data redistribution at coarse levels when the number of coarse elements becomes smaller than the number of MPI processes used on the finest level. The overall procedure generates coarse elements (general unstructured unions of fine grid elements) within the framework of element-based algebraic multigrid methods (or AMGe) studied previously. The AMGe-generated coarse spaces have the ability to exhibit approximation properties of the same order as the fine-level spaces since by construction they contain the piecewise polynomials of the same order as on the fine level. These approximation properties are key for the successful use of AMGe in multilevel solvers for nonlinear partial differential equations as well as for multilevel Monte Carlo (MLMC) simulations. The ability to coarsen without being constrained by the number of MPI processes, as described in the present paper, allows to improve the scalability of these solvers as well as the overall MLMC method. The paper illustrates this latter fact with detailed scalability study of MLMC simulations applied to model Darcy equations with a stochastic log-normal permeability field.

AMGe↗

Numerical stability in problems of linear algebra.

Mathematical problems are introduced as mappings from the space of input data to that of the desired output information. Then a numerical process is defined as a prescribed recurrence of elementary operations creating the mapping of the underlying mathematical problem. The ratio of the error committed by executing the operations of the numerical process (the roundoff errors) to the error introduced by perturbations of the input data (initial error) gives rise to the concept of lambda-stability. As examples, several processes are analyzed from this point of view, including, especially, old and new processes for solving systems of linear algebraic equations with tridiagonal matrices. In particular, it is shown how such a priori information can be utilized as, for instance, a knowledge of the row sums of the matrix. Information of this type is frequently available where the system arises in connection with the numerical solution of differential equations.

Babuska, I.↗

Legendre-Tau approximation for functional differential equations. Part 3: Eigenvalue approximations and uniform stability

The stability and convergence properties of the Legendre-tau approximation for hereditary differential systems are analyzed. A charactristic equation is derived for the eigenvalues of the resulting approximate system. As a result of this derivation the uniform exponential stability of the solution semigroup is preserved under approximation. It is the key to obtaining the convergence of approximate solutions of the algebraic Riccati equation in trace norm.

Ito, K.↗

Legendre-tau approximation for functional differential equations. III - Eigenvalue approximations and uniform stability

The stability and convergence properties of the Legendre-tau approximation for hereditary differential systems are analyzed. A characteristic equation is derived for the eigenvalues of the resulting approximate system. As a result of this derivation the uniform exponential stability of the solution semigroup is preserved under approximation. It is the key to obtaining the convergence of approximate solutions of the algebraic Riccati equation in trace norm.

Ito, K.↗

Dynamics and control of a continuum model for a solar power system

An approach for modeling dynamic equations of motion of a plate attached with rigid bodies is presented. The equations of motion are developed using the principle of virtual work. Lagrange multipliers are used as interaction forces and/or moments to maintain prescribed constraints which is the basis of the interconnection between the plate and rigid bodies. The overall approach is unique in the sense that a continuous model described by a family of partial differential equations is established. An approximate formulation by using variational method is established yielding a solution compatible with the assumed degree of approximation. The formulation is useful particularly when parametric study of dynamic response for a satellite power system is desired. As an example, an approximate governing equation of algebraic eigenvalue problem is given for a dual microwave power transmission system. Controller design is discussed.

Juang, J. N.↗

Application of a Reynolds Stress turbulence model to a supersonic hydrogen-air diffusion flame

A second-order differential Reynolds Stress turbulence model has been applied to the Favre-averaged Navier-Stokes equations for the study of supersonic flows undergoing hydrogen-air chemical reactions. An assumed Beta Probability Density Function is applied to account for the chemical source terms in the conservation equations. An algebraic Reynolds Flux model is used for the fluctuating density-velocity as well as the species mass fraction-velocity correlations. The variances of temperature and species fluctuations are also modelled using an algebraic flux technique. A seven-species, seven-reaction finite rate chemistry mechanism is used to simulate the combustion processes. The resulting formulation is validated by comparison with experimental data on reacting supersonic axisymmetric jets. Results obtained for specific conditions indicate that the effect of chemical reaction on the turbulence is significant.

Chandrasekhar, R.↗

JAXtronomy: A JAX port of lenstronomy

Gravitational lensing is a phenomenon where light bends around massive objects, resulting in distorted images seen by an observer. Studying gravitationally lensed systems provides insights into cosmology and astrophysics, including constraints of the expansion rate of the Universe and the distribution of dark matter. Thus, we introduce JAXtronomy, a re-implementation of the gravitational lensing software package lenstronomy (Birrer, 2021; Birrer & Amara, 2018) using JAX (Bradbury et al., 2018). JAX is a Python library that uses an accelerated linear algebra (XLA) compiler to improve the performance of computing software. Our core design principle of JAXtronomy is to maintain an identical API to that of lenstronomy. The main JAX features utilized in JAXtronomy are just-in-time compilation, which can lead to significant reductions in execution time, and automatic differentiation, which allows for the implementation of gradient-based algorithms that were previously impossible. Additionally, JAX allows code to be run on GPUs or parallelized across CPU cores, further boosting the performance of JAXtronomy.

astronomy↗

The cross section for double Compton scattering

Employing elementary methods in nonrelativistic quantum electrodynamics, the cross section for gamma sub 0 + e yields e + gamma + gamma is computed for arbitrary energy in the spectrum of the outgoing photons. The final result is given, differential in the energy of one of these photons, for the case where the incident photon is unpolarized and has energy E sub 0 much less than mc-squared, a polarization sum and angular integration being performed for the final-state photons. The cross section has a simple algebraic form resulting from contributions from the sum of squared direct and exchange amplitudes; interference terms from these amplitudes do not contribute to the angular-integrated cross section.

Gould, R. J.↗

The Finite Analytic Method for steady and unsteady heat transfer problems

A new numerical method called the Finite Analytical Method for solving partial differential equations is introduced. The basic idea of the finite analytic method is the incorporation of the local analytic solution in obtaining the numerical solution of the problem. The finite analytical method first divides the total region of the problem into small subregions in which local analytic solutions are obtained. Then an algebraic equation is derived from the local analytic solution for each subregion relating an interior nodal value at a point P in the subregion to its neighboring nodal values. The assembly of all the local analytic solutions thus provides the finite-analytic numerical solution of the problem. In this paper the finite analytic method is illustrated in solving steady and unsteady heat transfer problems.

Chen, C.-J.↗

Algebraic multigrid

The state of the art in algebraic multgrid (AMG) methods is discussed. The interaction between the relaxation process and the coarse grid correction necessary for proper behavior of the solution probes is discussed in detail. Sufficient conditions on relaxation and interpolation for the convergence of the V-cycle are given. The relaxation used in AMG, what smoothing means in an algebraic setting, and how it relates to the existing theory are considered. Some properties of the coarse grid operator are discussed, and results on the convergence of two-level and multilevel convergence are given. Details of an algorithm particularly studied for problems obtained by discretizing a single elliptic, second order partial differential equation are given. Results of experiments with such problems using both finite difference and finite element discretizations are presented.

Ruge, J. W.↗

Optical matrix-vector processing for computational fluid dynamics

An optical processor to solve partial differential equations for computational fluid dynamics applications is considered. This application is new and original for optical processors. The algorithms that are used are optical realizations of the Newton-Raphson method for nonlinear equations and a new optical LU direct decomposition and Gauss-Seidel iterative solution to the resultant linear algebraic equations. These algorithms are used to solve Burger's equation (a specific form of the momentum equation in fluid dynamics). The nonlinear equations provide 1-D velocity data at each time step. Simulation results of optical processing with these algorithms on computational fluid dynamics data is included.

Perlee, Caroline J.↗

Demonstration of Automatically-Generated Adjoint Code for Use in Aerodynamic Shape Optimization

Gradient-based optimization requires accurate derivatives of the objective function and constraints. These gradients may have previously been obtained by manual differentiation of analysis codes, symbolic manipulators, finite-difference approximations, or existing automatic differentiation (AD) tools such as ADIFOR (Automatic Differentiation in FORTRAN). Each of these methods has certain deficiencies, particularly when applied to complex, coupled analyses with many design variables. Recently, a new AD tool called ADJIFOR (Automatic Adjoint Generation in FORTRAN), based upon ADIFOR, was developed and demonstrated. Whereas ADIFOR implements forward-mode (direct) differentiation throughout an analysis program to obtain exact derivatives via the chain rule of calculus, ADJIFOR implements the reverse-mode counterpart of the chain rule to obtain exact adjoint form derivatives from FORTRAN code. Automatically-generated adjoint versions of the widely-used CFL3D computational fluid dynamics (CFD) code and an algebraic wing grid generation code were obtained with just a few hours processing time using the ADJIFOR tool. The codes were verified for accuracy and were shown to compute the exact gradient of the wing lift-to-drag ratio, with respect to any number of shape parameters, in about the time required for 7 to 20 function evaluations. The codes have now been executed on various computers with typical memory and disk space for problems with up to 129 x 65 x 33 grid points, and for hundreds to thousands of independent variables. These adjoint codes are now used in a gradient-based aerodynamic shape optimization problem for a swept, tapered wing. For each design iteration, the optimization package constructs an approximate, linear optimization problem, based upon the current objective function, constraints, and gradient values. The optimizer subroutines are called within a design loop employing the approximate linear problem until an optimum shape is found, the design loop limit is reached, or no further design improvement is possible due to active design variable bounds and/or constraints. The resulting shape parameters are then used by the grid generation code to define a new wing surface and computational grid. The lift-to-drag ratio and its gradient are computed for the new design by the automatically-generated adjoint codes. Several optimization iterations may be required to find an optimum wing shape. Results from two sample cases will be discussed. The reader should note that this work primarily represents a demonstration of use of automatically- generated adjoint code within an aerodynamic shape optimization. As such, little significance is placed upon the actual optimization results, relative to the method for obtaining the results.

Green, Lawrence↗

The effect of surface contamination on thermocapillary flow in a two-dimensional slot

In an analysis of the effect of insoluble surfactants on the steady capillary flow in a shallow slot, the problem is formulated as a two-dimensional channel heated differentially from the side, with a free surface on which an insoluble surface species is adsorbed. The vertical boundaries are considered to be isothermal and impenetrable and the lower horizontal boundary to be insulated and impenetrable. Lubrication theory and matched asymptotic expansions are used to reduce the problem to a single nonlinear integral-algebraic equation. For small elasticity E, the surface velocity is nearly constant, with the result that, for small Pe, the surface concentration is nearly uniform while, for large Pe, it develops a boundary layer near the stagnation point at the cold wall, resulting in high local surface concentrations. Condensed surfactant layers will form only with E much less than one and Pe much greater than one.

Homsy, G. M.↗

Spline-based distributed system identification with application to large space antennas

A parameter and state estimation technique for distributed models is demonstrated through the solution of a problem generic to large space antenna system identification. Assuming the position of the reflective surface of the maypole (hoop/column) antenna to be approximated by the static two-dimensional, stretched-membrane partial differential equation with variable-stiffness coefficient functions, a spline-based approximation procedure is described that estimates the shape and stiffness functions from data set observations. For given stiffness functions, the Galerkin projection with linear spline-based functions is applied to project the distributed problem onto a finite-dimensional subspace wherein algebraic equations exist for determining a static shape (state) prediction. The stiffness functions are then parameterized by cubic splines and the parameters estimated by an output error technique. Numerical results are presented for data descriptive of a 100-m-diameter maypole antenna.

Banks, H. T.↗