Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 361 records · Page 20

Comparison of Turbulent Thermal Diffusivity and Scalar Variance Models

In this study, several variable turbulent Prandtl number formulations are examined for boundary layers, pipe flow, and axisymmetric jets. The model formulations include simple algebraic relations between the thermal diffusivity and turbulent viscosity as well as more complex models that solve transport equations for the thermal variance and its dissipation rate. Results are compared with available data for wall heat transfer and profile measurements of mean temperature, the root-mean-square (RMS) fluctuating temperature, turbulent heat flux and turbulent Prandtl number. For wall-bounded problems, the algebraic models are found to best predict the rise in turbulent Prandtl number near the wall as well as the log-layer temperature profile, while the thermal variance models provide a good representation of the RMS temperature fluctuations. In jet flows, the algebraic models provide no benefit over a constant turbulent Prandtl number approach. Application of the thermal variance models finds that some significantly overpredict the temperature variance in the plume and most underpredict the thermal growth rate of the jet. The models yield very similar fluctuating temperature intensities in jets from straight pipes and smooth contraction nozzles, in contrast to data that indicate the latter should have noticeably higher values. For the particular low subsonic heated jet cases examined, changes in the turbulent Prandtl number had no effect on the centerline velocity decay.

computational fluid dynamics↗

Advances in Modeling Solar System Internet Structures and their Data Flows

With an ever-increasing presence in space, there is also an increasing burden on existing communications infrastructure. We are heading towards an inflection point where the traditional approach of scheduled, single-path communications for space will no longer be viable. One answer is Delay Tolerant Networking (DTN), which takes the once disparate system of point-to-point links and unifies them in a networked architecture, thereby making communications more scalable. However, much work remains for discovering and harnessing the underlying theory of DTN. For example, in the terrestrial setting the interplay between routing domains is well-understood, however this is not the case in DTNs. In this paper, we build up the fundamental foundations of DTN, with an emphasis on modeling time varying networks and data flows across them, with examples of cross-domain routing in a DTN. A lofty goal of DTN is to enable the so-called Solar System Internet (SSI), which implies a standardized and robust suite of protocols. These protocols include routing across disconnected networks using store, carry, and forward mechanisms, which is necessary due to the disconnections, delays, and mobility intrinsic to space networks. Due to these factors, each of which generalize traditional networking, there is a deep and rich theory of DTNs. Here we build off of past successes to broaden this theory while striving to keep actionable results a goal for future implementations and operations. The approach includes modeling the unicast, broadcast, and multicast communications using the language of hypergraphs, which capture the geometric properties of such networked communications algebraically. Also inherent to these networks is their time-varying nature, particularly given mobility, and hence we also cultivate modeling techniques that respect this time dependence. This leads us to develop models using tools from category theory and algebraic geometry, which provide a language well-suited to describing synchronization and optimization over such networks. We also introduce and study a novel generalization of curvature applicable to time-evolving networks, which provides quantitative controls on diffusion processes on the network. Because an interplanetary network would feature links with propagation delays the preclude discovery (feedback) mechanisms, they will always feature a scheduled component. However, it is beneficial to support discovery where possible. While DTNs do not yet have strong definitions for their analogues of autonomous systems or network areas, we show how to join dynamic and schedule-based routing domains, using the language of sheaves, which marks progress towards such definitions. We conclude with a discussion of the progress made, as well as suggestions for future work.

Delay Tolerant Networking↗

Absorption and Emission Characteristics of Diffuse Spherical Enclosures

An analysis was made to determine the energy absorbed when radiation from an external source enters a spherical cavity with diffusely reflecting walls. It was found that both the overall energy absorbed in the cavity and the local distribution of absorbed energy could be expressed in terms of simple algebraic equations that are valid for any arbitrary spatial and directional distribution of the incoming radiation. In addition, the characteristics of an isothermal spherical cavity as a possible source of near black-body radiation were investigated. This information was also expressed by simple algebraic relations.

ABSORPTION↗

On a programming language for graph algorithms

An algorithmic language, GRAAL, is presented for describing and implementing graph algorithms of the type primarily arising in applications. The language is based on a set algebraic model of graph theory which defines the graph structure in terms of morphisms between certain set algebraic structures over the node set and arc set. GRAAL is modular in the sense that the user specifies which of these mappings are available with any graph. This allows flexibility in the selection of the storage representation for different graph structures. In line with its set theoretic foundation, the language introduces sets as a basic data type and provides for the efficient execution of all set and graph operators. At present, GRAAL is defined as an extension of ALGOL 60 (revised) and its formal description is given as a supplement to the syntactic and semantic definition of ALGOL. Several typical graph algorithms are written in GRAAL to illustrate various features of the language and to show its applicability.

Rheinboldt, W. C.↗

Design of minimax output feedback controller for system with parameter uncertainty

The problem of controlling a time-invariant system with parameter uncertainty is considered with incomplete state feedback. The controller is designed by minimaximizing a quadratic performance criterion and a sensitivity (or loss) criterion, involving the state of the system, the control, and the uncertainty vector. The resulting optimal controller is linear and optimal feedback gain matrix must satisfy a set of nonlinear algebraic equations. some algorithms for algebraic minimax problems are presented.

Basuthakur, S.↗

Description of electrical networks using wiring operators.

A scheme is presented for describing the interconnection of elements and subnetworks into networks by means of 'wiring operators.' This scheme is algebraic and is intended for conversing with computers. It is especially suitable for two-ports such as amplifiers, filters, microwave networks, and in general, transmission-type networks with an input and an output. The algebra is direct, convenient, and versatile. Each of the wiring operators corresponds to a specific set of calculations on the parameters of the networks involved.

Penfield, P., Jr.↗

High speed flow past wings

The analytical solution to the transonic small perturbation equation which describes steady compressible flow past finite wings at subsonic speeds can be expressed as a nonlinear integral equation with the perturbation velocity potential as the unknown function. This known formulation is substituted by a system of nonlinear algebraic equations to which various methods are applicable for its solution. Due to the presence of mathematical discontinuities in the flow solutions, however, a main computational difficulty was to ensure uniqueness of the solutions when local velocities on the wing exceeded the speed of sound. For continuous solutions this was achieved by embedding the algebraic system in an one-parameter operator homotopy in order to apply the method of parametric differentiation. The solution to the initial system of equations appears then as a solution to a Cauchy problem where the initial condition is related to the accompanying incompressible flow solution. In using this technique, however, a continuous dependence of the solution development on the initial data is lost when the solution reaches the minimum bifurcation point. A steepest descent iteration technique was therefore, added to the computational scheme for the calculation of discontinuous flow solutions. Results for purely subsonic flows and supersonic flows with and without compression shocks are given and compared with other available theoretical solutions.

Norstrud, H.↗

Analysis and synthesis of distributed-lumped-active networks by digital computer

The use of digital computational techniques in the analysis and synthesis of DLA (distributed lumped active) networks is considered. This class of networks consists of three distinct types of elements, namely, distributed elements (modeled by partial differential equations), lumped elements (modeled by algebraic relations and ordinary differential equations), and active elements (modeled by algebraic relations). Such a characterization is applicable to a broad class of circuits, especially including those usually referred to as linear integrated circuits, since the fabrication techniques for such circuits readily produce elements which may be modeled as distributed, as well as the more conventional lumped and active ones.

Source record↗

A method of revitalizing Sampson's theory of the Galilean satellites

A method is developed by which Sampson's theory of motion of Jupiter's Galilean satellites can be revitalized by use of algebraic manipulation software on a digital computer. The technique seeks (1) to remove algebraic errors existing in the current Sampson theory, (2) to introduce some neglected effects due to solar interactions and the 3-7 commensurability between the outer two satellites, (3) to allow for nonzero amplitude and phase of the libration, (4) to allow future revision of the arbitrary constants of integration, (5) to express the final results as analytic functions of variations in the numerous arbitrary constants of integration and arbitrary parameters, and (6) to provide analytic partial derivatives by means of which the numerical values of coefficients in the expressions for the coordinates can be adjusted. The level of precision desired is one arc second (Jovicentric) for the coordinates (2, 3.3, 5.2, and 9.1 km, respectively, for satellites I through IV).

Lieske, J. H.↗

A Computing Method for Sound Propagation Through a Nonuniform Jet Stream

Understanding the principles of jet noise propagation is an essential ingredient of systematic noise reduction research. High speed computer methods offer a unique potential for dealing with complex real life physical systems whereas analytical solutions are restricted to sophisticated idealized models. The classical formulation of sound propagation through a jet flow was found to be inadequate for computer solutions and a more suitable approach was needed. Previous investigations selected the phase and amplitude of the acoustic pressure as dependent variables requiring the solution of a system of nonlinear algebraic equations. The nonlinearities complicated both the analysis and the computation. A reformulation of the convective wave equation in terms of a new set of dependent variables is developed with a special emphasis on its suitability for numerical solutions on fast computers. The technique is very attractive because the resulting equations are linear in nonwaving variables. The computer solution to such a linear system of algebraic equations may be obtained by well-defined and direct means which are conservative of computer time and storage space. Typical examples are illustrated and computational results are compared with available numerical and experimental data.

Padula, S. L.↗

Modulator for tone and binary signals

Tones and binary information are transmitted as phase variations on a carrier wave of constant amplitude and frequency. The carrier and tones are applied to a balanced modulator for deriving an output signal including a pair of sidebands relative to the carrier. The carrier is phase modulated by a digital signal so that it is + or - 90 deg out of phase with the predetermined phase of the carrier. The carrier is combined in an algebraic summing device with the phase modulated signal and the balanced modulator output signal. The output of the algebraic summing device is hard limited to derive a constant amplitude and frequency signal having very narrow bandwidth requirements. At a receiver, the tones and binary data are detected with a phase locked loop having a voltage controlled oscillator driving a pair of orthogonal detection channels.

Mcchesney, J. R.↗

A computing method for sound propagation through a nonuniform jet stream

The classical formulation of sound propagation through a jet flow was found to be inadequate for computer solutions. Previous investigations selected the phase and amplitude of the acoustic pressure as dependent variables requiring the solution of a system of nonlinear algebraic equations. The nonlinearities complicated both the analysis and the computation. A reformulation of the convective wave equation in terms of a new set of dependent variables is developed with a special emphasis on its suitability for numerical solutions on fast computers. The technique is very attractive because the resulting equations are linear in nonwaving variables. The computer solution to such a linear system of algebraic equations may be obtained by well-defined and direct means which are conservative of computer time and storage space. Typical examples are illustrated and computational results are compared with available numerical and experimental data.

Padula, S. L.↗

Computation of separated transonic turbulent flows

The two-dimensional Reynolds-averaged compressible Navier-Stokes equations are solved using MacCormack's second-order-accurate explicit finite difference method to simulate the separated transonic turbulent flow field over an airfoil. Four different algebraic eddy viscosity models are tested for viability to achieve turbulence closure for the class of flows considered. These models range from an unmodified boundary-layer mixing-length model to a relaxation model incorporating special considerations for the separation bubble region. Results of this study indicate the necessity for special attention to the separated flow region and suggest limits of applicability of algebraic turbulence models to these separated flow fields.

Deiwert, G. S.↗

Some properties of extremal solutions of zero-sum differential games

Necessary conditions for infinite-time linear-quadratic two-player differential games with perfect state information are examined in the light of Willems' work on the algebraic Riccati equation. Necessary conditions for the nonzero-sum game do not always reduce precisely to those of the zero-sum game, when the weighting parameters of the cost index are taken as those of a zero-sum game. Formulation of zero-sum game problems in extended L2-spaces reveals the existence of nonstabilizing but infimal controls, and explicit frequency-domain conditions for existence of solutions and stabilizing solutions are established through the algebraic Riccati equation (ARE).

Johnson, T. L.↗

Low temperature simulation of subliming boundary layer flow in Jupiter atmosphere

A low-temperature approximate simulation for the sublimation of a graphite heat shield under Jovian entry conditions is studied. A set of algebraic equations is derived to approximate the governing equation and boundary conditions, based on order-of-magnitude analysis. Characteristic quantities such as the wall temperature and the subliming velocity are predicted. Similarity parameters that are needed to simulate the most dominant phenomena of the Jovian entry flow are also given. An approximate simulation of the sublimation of the graphite heat shield is performed with an air-dry-ice model. The simulation with the air-dry-ice model may be carried out experimentally at a lower temperature of 3000 to 6000 K instead of the entry temperature of 14,000 K. The rate of graphite sublimation predicted by the present algebraic approximation agrees to the order of magnitude with extrapolated data. The limitations of the simulation method and its utility are discussed.

Chen, C. J.↗

Thermodynamics

The fundamental structure of thermodynamics is purely algebraic, in the sense of atopological, and it is also independent of partitions, composite systems, the zeroth law, and entropy. The algebraic structure requires the notion of heat, but not the first law. It contains a precise definition of entropy and identifies it as a purely mathematical concept. It also permits the construction of an entropy function from heat measurements alone when appropriate conditions are satisfied. Topology is required only for a discussion of the continuity of thermodynamic properties, and then the weak topology is the relevant topology. The integrability of the differential form of the first law can be examined independently of Caratheodory's theorem and his inaccessibility axiom. Criteria are established by which one can determine when an integrating factor can be made intensive and the pseudopotential extensive and also an entropy. Finally, a realization of the first law is constructed which is suitable for all systems whether they are solids or fluids, whether they do or do not exhibit chemical reactions, and whether electromagnetic fields are or are not present.

Zeleznik, F. J.↗

Multidimensional Hermite-Gaussian quadrature formulae and their application to nonlinear estimation

A simplified technique is proposed for calculating multidimensional Hermite-Gaussian quadratures that involves taking the square root of a matrix by the Cholesky algorithm rather than computation of the eigenvectors of the matrix. Ways of reducing the dimension, number, and order of the quadratures are set forth. If the function f(x) under the integral sign is not well approximated by a low-order algebraic expression, the order of the quadrature may be reduced by factoring f(x) into an expression that is nearly algebraic and one that is Gaussian.

Mcreynolds, S. R.↗

Integration-free interval doubling for Riccati equation solutions

Various algorithms are given for the case of constant coefficients. The algorithms are based on two ideas: first, relate the Re solution with general initial conditions to anchored RE solutions; and second, when the coefficients are constant the anchored solutions have a basic shift-invariance property. These ideas are used to construct an integration free superlinearly convergent iterative solution to the algebraic RE. The algorithm, arranged in square-root form, is thought to be numerically stable and competitive with other methods of solving the algebraic RE.

Bierman, G. J.↗