Search NASA⌕ Search

SEARCH · Search NASA

Results for “generation equation”

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 91 records · Page 5

A grid generation and flow solution method for the Euler equations on unstructured grids

A grid generation and flow solution algorithm for the Euler equations on unstructured grids is presented. The grid generation scheme utilizes Delaunay triangulation and self-generates the field points for the mesh based on cell aspect ratios and allows for clustering near solid surfaces. The flow solution method is an implicit algorithm in which the linear set of equations arising at each time step is solved using a Gauss Seidel procedure which is completely vectorizable. In addition, a study is conducted to examine the number of subiterations required for good convergence of the overall algorithm. Grid generation results are shown in two dimensions for a National Advisory Committee for Aeronautics (NACA) 0012 airfoil as well as a two-element configuration. Flow solution results are shown for two-dimensional flow over the NACA 0012 airfoil and for a two-element configuration in which the solution has been obtained through an adaptation procedure and compared to an exact solution. Preliminary three-dimensional results are also shown in which subsonic flow over a business jet is computed.

Anderson, W. Kyle↗

Grid generation for the solution of partial differential equations

A general survey of grid generators is presented with a concern for understanding why grids are necessary, how they are applied, and how they are generated. After an examination of the need for meshes, the overall applications setting is established with a categorization of the various connectivity patterns. This is split between structured grids and unstructured meshes. Altogether, the categorization establishes the foundation upon which grid generation techniques are developed. The two primary categories are algebraic techniques and partial differential equation techniques. These are each split into basic parts, and accordingly are individually examined in some detail. In the process, the interrelations between the various parts are accented. From the established background in the primary techniques, consideration is shifted to the topic of interactive grid generation and then to adaptive meshes. The setting for adaptivity is established with a suitable means to monitor severe solution behavior. Adaptive grids are considered first and are followed by adaptive triangular meshes. Then the consideration shifts to the temporal coupling between grid generators and PDE-solvers. To conclude, a reflection upon the discussion, herein, is given.

Eiseman, Peter R.↗

Grid generation for the solution of partial differential equations

A general survey of grid generators is presented with a concern for understanding why grids are necessary, how they are applied, and how they are generated. After an examination of the need for meshes, the overall applications setting is established with a categorization of the various connectivity patterns. This is split between structured grids and unstructured meshes. Altogether, the categorization establishes the foundation upon which grid generation techniques are developed. The two primary categories are algebraic techniques and partial differential equation techniques. These are each split into basic parts, and accordingly are individually examined in some detail. In the process, the interrelations between the various parts are accented. From the established background in the primary techniques, consideration is shifted to the topic of interactive grid generation and then to adaptive meshes. The setting for adaptivity is established with a suitable means to monitor severe solution behavior. Adaptive grids are considered first and are followed by adaptive triangular meshes. Then the consideration shifts to the temporal coupling between grid generators and PDE-solvers. To conclude, a reflection upon the discussion, herein, is given.

Eiseman, Peter R.↗

On the flight dynamics of aeroelastic vehicles

The nonlinear equations of motion for an elasic airplane are developed from first principles. Lagrange's Equation and the Principle of Virtual Work are used to generate the equations of motion and strip theory is then employed to obtain closed form integral expressions for the generalized forces. The inertial coupling is minimized by appropriate choice of the body reference axes and by making use of free vibration modes of the body. In addition, particular attention is paid to the simplifying assumptions used during the development of the equations of motion. A unique aspect of this modeling process is that since the generalized aerodynamic forces are determined from closed form, analytic expressions, this method can be used to gain insight into the effects of parameter variations not easily obtained from numerical models. A numerical example is also presented in which the modeling method is applied to a representative elastic aircraft. The model is used to address the effects of aerodynamic coupling which occurs between the rigid body degrees of freedom and the elastic degrees of freedom. Finally, model simplification is addressed and two methods are evaluated. The resulting frequency responses are compared.

Schmidt, D. K.↗

Simplified clustering of nonorthogonal grids generated by elliptic partial differential equations

A simple clustering transformation is combined with the Thompson, Thames, and Mastin (TTM) method of generating computational grids to produce controlled mesh spacings. For various practical grids, the resulting hybrid scheme is easier to apply than the inhomogeneous clustering terms included in the TTM method for this purpose. The technique is illustrated in application to airfoil problems, and listings of a FORTRAN computer code for this usage are included.

Sorenson, R. L.↗

Solution of Poisson equations for 3-dimensional grid generations

A method for generating three dimensional, finite difference grids about complicated geometries by using Poisson equations is developed. The inhomogenous terms are automatically chosen such that orthogonality and spacing restrictions at the body surface are satisfied. Spherical variables are used to avoid the axis singularity, and an alternating-direction-implicit (ADI) solution scheme is used to accelerate the computations. Computed results are presented that show the capability of the method. Since most of the results presented have been used as grids for flow-field computations, this is indicative that the method is a useful tool for generating three-dimensional grids about complicated geometries.

Fujii, K.↗

Noise from turbulent shear flows

The generation of sound in turbulent shear flows with high Reynolds numbers is discussed. Solid surface effects, representation of incident turbulence, sound generation and the role of instability waves, sound generation by turbulence interacting with itself (the jet noise problem), compressible Rayleigh equations, sound generation from streamwise variations in mean flow, complex turbulent flows, and supersonic flows are among the topics discussed.

Goldstein, M. E.↗

A Step Towards CO2-Neutral Aviation

An approximation method for evaluation of the caloric equations used in combustion chemistry simulations is described. The method is applied to generate the equations of specific heat, static enthalpy, and Gibb's free energy for fuel mixtures of interest to gas turbine engine manufacturers. Liquid-phase fuel properties are also derived. The fuels include JP-8, synthetic fuel, and two fuel blends consisting of a mixture of JP-8 and synthetic fuel. The complete set of fuel property equations for both phases are implemented into a computational fluid dynamics (CFD) flow solver database, and multi-phase, reacting flow simulations of a well-tested liquid-fueled combustor are performed. The simulations are a first step in understanding combustion system performance and operational issues when using alternate fuels, at practical engine operating conditions.

Brankovic, Andreja↗

A Step Towards CO2-Neutral Aviation

An approximation method for evaluation of the caloric equations used in combustion chemistry simulations is described. The method is applied to generate the equations of specific heat, static enthalpy, and Gibb's free energy for fuel mixtures of interest to gas turbine engine manufacturers. Liquid-phase fuel properties are also derived. The fuels investigated include JP-8, synthetic fuel, and two blends of JP-8 and synthetic fuel. The complete set of fuel property equations for both phases are implemented into a computational fluid dynamics (CFD) flow solver database, and multiphase, reacting flow simulations of a well-tested liquid-fueled combustor are performed. The simulations are a first step in understanding combustion system performance and operational issues when using alternate fuels, at practical engine operating conditions.

Brankovic, Andreja↗

The Use of General Purpose Computer Programs to Derive Equations of Motion for Optimal Isolation Studies

Techniques were developed that utilize general purpose structural analysis computer programs to generate the equations of motion necessary for limiting performance studies. The methodology necessary to couple available general purpose finite element structural programs to a limiting performance capability was developed. Primary emphasis was given to the use of the general purpose program to develop equations of motion in a form that can be used by the limiting performance program.

Pilkey, W. D.↗

Spacecraft attitude and velocity control system

A spacecraft attitude and/or velocity control system includes a controller which responds to at least attitude errors to produce command signals representing a force vector F and a torque vector T, each having three orthogonal components, which represent the forces and torques which are to be generated by the thrusters. The thrusters may include magnetic torquer or reaction wheels. Six difference equations are generated, three having the form ##EQU1## where a.sub.j is the maximum torque which the j.sup.th thruster can produce, b.sub.j is the maximum force which the j.sup.th thruster can produce, and .alpha..sub.j is a variable representing the throttling factor of the j.sup.th thruster, which may range from zero to unity. The six equations are summed to produce a single scalar equation relating variables .alpha..sub.j to a performance index Z: ##EQU2## Those values of .alpha. which maximize the value of Z are determined by a method for solving linear equations, such as a linear programming method. The Simplex method may be used. The values of .alpha..sub.j are applied to control the corresponding thrusters.

Paluszek, Michael A.↗

Discrete generative diffusion models without stochastic differential equations: A tensor network approach

Diffusion models (DMs) are a class of generative machine learning methods that sample a target distribution by transforming samples of a trivial (often Gaussian) distribution using a learned stochastic differential equation. In standard DMs, this is done by learning a “score function” that reverses the effect of adding diffusive noise to the distribution of interest. Here we consider the generalisation of DMs to lattice systems with discrete degrees of freedom, and where noise is added via Markov chain jump dynamics. We show how to use tensor networks (TNs) to efficiently define and sample such “discrete diffusion models” (DDMs) without explicitly having to solve a stochastic differential equation. We show the following: (i) by parametrising the data and evolution operators as TNs, the denoising dynamics can be represented exactly; (ii) the auto-regressive nature of TNs allows to generate samples efficiently and without bias; (iii) for sampling Boltzmann-like distributions, TNs allow to construct an efficient learning scheme that integrates well with Monte Carlo. We illustrate this approach to study the equilibrium of two models with non-trivial thermodynamics, the d = 1 constrained Fredkin chain and the d = 2 Ising model. Published by the American Physical Society 2025

Causer, Luke (ORCID:0000000194243473)↗

Aspects of efficient and reliable multibody system simulation

Multibody system equations can be generated in various forms. All of these may be interpreted as results of two basic approaches, the augmentation- and the elimination-method. The former method yields the descriptor form of the system motion, a set of differential-algebraic equations (DAE), and the latter the state space representation, a minimal set of ordinary differential equations (ODE). Both of these methods are surveyed. Particular emphasis is on the discussion of recursive computational schemes, generating the equations of motion with a number of operations, which is proportional to the number N of system bodies (O(N)-formulations). For simulation purposes one would like to create that set of system equations, which can be generated most efficiently and for which the most efficient and reliable solution techniques are available. Numerical solution techniques for ODE have been studied in great detail and they are well-developed. By contrast, DAE have not been investigated for such a long time. In view of new developments in the latter field the generation of all the equations required for an efficient and reliable solution of DAE describing multibody system motion is discussed. These methods, i.e., an O(N)-formulation and new techniques for solving DAE, are implemented in the SIMPACK code. Its capabilities are illustrated by simulation of multibody robot models.

Schwertassek, R.↗

An implicit, conservative, zonal-boundary scheme for Euler equation calculations

A zonal, or patched, grid approach is one in which the flow region of interest is divided into subregions which are then discretized independently, using existing grid generators. The equations of motion are integrated in each subregion in conjunction with zonal boundary schemes which allow proper information transfer across interfaces that separate subregions. The zonal approach greatly simplifies the treatment of complex geometries and also the addition of grid points to selected regions of the flow. A conservative, zonal boundary condition that could be used with explicit schemes was extended so that it can be used with existing second order accurate implicit integration schemes such as the Beam-Warming and Osher schemes. In the test case considered, the implicit schemes increased the rate of convergence considerably (by a factor of about 30 over that of the explicit scheme). Results demonstrating the time accuracy of the zonal scheme and the feasibility of performing calculations on zones that move relative to each other are also presented.

Rai, M. M.↗

An implicit, conservative, zonal-boundary scheme for Euler equation calculations

A 'zonal', or 'patched-grid', approach is one in which the flow region of interest is divided into subregions which are then discretized independently, using existing grid generators. The equations of motion are integrated in each subregion in conjunction with zonal-boundary schemes which allow proper information transfer across interfaces that separate subregions. The zonal approach greatly simplifies the treatment of complex geometries and also the addition of grid points to selected regions of the flow. In this study a conservative, zonal-boundary condition that could be used with explicit schemes has been extended so that it can be used with existing second-order-accurate implicit integration schemes such as the Beam-Warming and Osher schemes. In the test case considered, the implicit schemes increased the rate of convergence considerably (by a factor of about 30 over that of the explicit scheme). Results demonstrating the time-accuracy of the zonal scheme and the feasibility of performing calculations on zones that move relative to each other are also presented.

Rai, M. M.↗

Patched-grid calculations with the Euler and Navier-Stokes equations: Theory and applications

A patched-grid approach is one in which the flow region of interest is divided into subregions which are then discretized independently using existing grid generator. The equations of motion are integrated in each subregion in conjunction with patch-boundary schemes which allow proper information transfer across interfaces that separate subregions. The patched-grid approach greatly simplifies the treatment of complex geometries and also the addition of grid points to selected regions of the flow. A conservative patch-boundary condition that can be used with explicit, implicit factored and implicit relaxation schemes is described. Several example calculations that demonstrate the capabilities of the patched-grid scheme are also included.

Rai, M. M.↗

An Implicit, Conservative, Zonal-Boundary Scheme for Euler Equation Calculations

A "zonal," or "patched-grid," approach is one in which the flow region of interest is divided into subregions which are then discretized independently, using existing grid generators. The equations of motion are integrated in each subregion in conjunction with zonal-boundary schemes which allow proper information transfer across interfaces that separate subregions. The zonal approach greatly simplifies the treatment of complex geometries and also the addition of grid points to selected regions of the flow. In this study a conservative, zonal-boundary condition that could be used with explicit schemes has been extended so that it can be used with existing second-order accurate implicit integration schemes such as the Beam-Warming and Osher schemes. In the test case considered, the implicit schemes increased the rate of convergence considerably (by a factor of about 30 over that of the explicit scheme). Results demonstrating the time-accuracy of the zonal scheme and the feasibility of performing calculations on zones that move relative to each other are also presented.

Rai, Man Mohan↗