Search NASASearch

SEARCH · Search NASA

Results for “representation theory”

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 19 records

Fractional representation theory - Robustness results with applications to finite dimensional control of a class of linear distributed systems

This paper reviews and extends the fractional representation theory. In particular, new and powerful robustness results are presented. This new theory is utilized to develop a preliminary design methodology for finite dimensional control of a class of linear evolution equations on a Banach space. The design is for stability in an input-output sense, but particular attention is paid to internal stability as well.

Nett, C. N.

Representation theory of Sp/4/ and SO/5/

Five dimensional rotations and representation of isomorphic spinor groups by boson operators calculus, expanding Gelfand states in Weyl patterns

Holman, W. J., III

Symmetric linear systems - An application of algebraic systems theory

Dynamical systems which contain several identical subsystems occur in a variety of applications ranging from command and control systems and discretization of partial differential equations, to the stability augmentation of pairs of helicopters lifting a large mass. Linear models for such systems display certain obvious symmetries. In this paper, we discuss how these symmetries can be incorporated into a mathematical model that utilizes the modern theory of algebraic systems. Such systems are inherently related to the representation theory of algebras over fields. We will show that any control scheme which respects the dynamical structure either implicitly or explicitly uses the underlying algebra.

Hazewinkel, M.

Towards a Rational Model for the Triple Velocity Correlations of Turbulence

This paper presents a rational approach to modelling the triple velocity correlations that appear in the transport equations for the Reynolds stresses. All existing models of these correlations have largely been formulated on phenomenological grounds and are defective in one important aspect: they all neglect to allow for the dependence of these correlations on the local gradients of mean velocity. The mathematical necessity for this dependence will be demonstrated in the paper. The present contribution lies in the novel use of Group Representation Theory to determine the most general tensorial form of these correlations in terms of all the second- and third-order tensor quantities that appear in the exact equations that govern their evolution. The requisite representation did not exist in the literature and therefore had to be developed specifically for this purpose by Professor G. F. Smith. The outcome of this work is a mathematical framework for the construction of algebraic, explicit, and rational models for the triple velocity correlations that are theoretically consistent and include all the correct dependencies. Previous models are reviewed, and all are shown to be an incomplete subset of this new representation, even to lowest order.

Younis, B. A.

An improved plate theory of order (1,2) for thick composite laminates

A new (1,2)-order theory is proposed for the linear elasto-static analysis of laminated composite plates. The basic assumptions are those concerning the distribution through the laminate thickness of the displacements, transverse shear strains and the transverse normal stress, with these quantities regarded as some weighted averages of their exact elasticity theory representations. The displacement expansions are linear for the inplane components and quadratic for the transverse component, whereas the transverse shear strains and transverse normal stress are respectively quadratic and cubic through the thickness. The main distinguishing feature of the theory is that all strain and stress components are expressed in terms of the assumed displacements prior to the application of a variational principle. This is accomplished by an a priori least-square compatibility requirement for the transverse strains and by requiring exact stress boundary conditions at the top and bottom plate surfaces. Equations of equilibrium and associated Poisson boundary conditions are derived from the virtual work principle. It is shown that the theory is particularly suited for finite element discretization as it requires simple C(sup 0)- and C(sup -1)-continuous displacement interpolation fields. Analytic solutions for the problem of cylindrical bending are derived and compared with the exact elasticity solutions and those of our earlier (1,2)-order theory based on the assumed displacements and transverse strains.

Tessler, A.

Elimination sequence optimization for SPAR

SPAR is a large-scale computer program for finite element structural analysis. The program allows user specification of the order in which the joints of a structure are to be eliminated since this order can have significant influence over solution performance, in terms of both storage requirements and computer time. An efficient elimination sequence can improve performance by over 50% for some problems. Obtaining such sequences, however, requires the expertise of an experienced user and can take hours of tedious effort to affect. Thus, an automatic elimination sequence optimizer would enhance productivity by reducing the analysts' problem definition time and by lowering computer costs. Two possible methods for automating the elimination sequence specifications were examined. Several algorithms based on the graph theory representations of sparse matrices were studied with mixed results. Significant improvement in the program performance was achieved, but sequencing by an experienced user still yields substantially better results. The initial results provide encouraging evidence that the potential benefits of such an automatic sequencer would be well worth the effort.

Hogan, Harry A.

Time Evolution of Modeled Reynolds Stresses in Planar Homogeneous Flows

The analytic expression of the time evolution of the Reynolds stress anisotropy tensor in all planar homogeneous flows is obtained by exact integration of the modeled differential Reynolds stress equations. The procedure is based on results of tensor representation theory, is applicable for general pressure-strain correlation tensors, and can account for any additional turbulence anisotropy effects included in the closure. An explicit solution of the resulting system of scalar ordinary differential equations is obtained for the case of a linear pressure-strain correlation tensor. The properties of this solution are discussed, and the dynamic behavior of the Reynolds stresses is studied, including limit cycles and sensitivity to initial anisotropies.

Jongen, T.

Systems Engineering Design Via Experimental Operation Research: Complex Organizational Metric for Programmatic Risk Environments (COMPRE)

Unique and innovative graph theory, neural network, organizational modeling, and genetic algorithms are applied to the design and evolution of programmatic and organizational architectures. Graph theory representations of programs and organizations increase modeling capabilities and flexibility, while illuminating preferable programmatic/organizational design features. Treating programs and organizations as neural networks results in better system synthesis, and more robust data modeling. Organizational modeling using covariance structures enhances the determination of organizational risk factors. Genetic algorithms improve programmatic evolution characteristics, while shedding light on rulebase requirements for achieving specified technological readiness levels, given budget and schedule resources. This program of research improves the robustness and verifiability of systems synthesis tools, including the Complex Organizational Metric for Programmatic Risk Environments (COMPRE).

Mog, Robert A.

Two Methods for Efficient Solution of the Hitting-Set Problem

A paper addresses much of the same subject matter as that of Fast Algorithms for Model-Based Diagnosis (NPO-30582), which appears elsewhere in this issue of NASA Tech Briefs. However, in the paper, the emphasis is more on the hitting-set problem (also known as the transversal problem), which is well known among experts in combinatorics. The authors primary interest in the hitting-set problem lies in its connection to the diagnosis problem: it is a theorem of model-based diagnosis that in the set-theory representation of the components of a system, the minimal diagnoses of a system are the minimal hitting sets of the system. In the paper, the hitting-set problem (and, hence, the diagnosis problem) is translated from a combinatorial to a computational problem by mapping it onto the Boolean satisfiability and integer- programming problems. The paper goes on to describe developments nearly identical to those summarized in the cited companion NASA Tech Briefs article, including the utilization of Boolean-satisfiability and integer- programming techniques to reduce the computation time and/or memory needed to solve the hitting-set problem.

Vatan, Farrokh

Harmonic oscillator representation in the theory of scattering and nuclear reactions

The following questions, concerning the application of the harmonic oscillator representation (HOR) in the theory of scattering and reactions, are discussed: the formulation of the scattering theory in HOR; exact solutions of the free motion Schroedinger equation in HOR; separable expansion of the short range potentials and the calculation of the phase shifts; 'isolated states' as generalization of the Wigner-von Neumann bound states embedded in continuum; a nuclear coupled channel problem in HOR; and the description of true three body scattering in HOR. As an illustration the soft dipole mode in the (11)Li nucleus is considered in a frame of the (9)Li+n+n cluster model taking into account of three body continuum effects.

Smirnov, Yuri F.

Analytical learning and term-rewriting systems

Analytical learning is a set of machine learning techniques for revising the representation of a theory based on a small set of examples of that theory. When the representation of the theory is correct and complete but perhaps inefficient, an important objective of such analysis is to improve the computational efficiency of the representation. Several algorithms with this purpose have been suggested, most of which are closely tied to a first order logical language and are variants of goal regression, such as the familiar explanation based generalization (EBG) procedure. But because predicate calculus is a poor representation for some domains, these learning algorithms are extended to apply to other computational models. It is shown that the goal regression technique applies to a large family of programming languages, all based on a kind of term rewriting system. Included in this family are three language families of importance to artificial intelligence: logic programming, such as Prolog; lambda calculus, such as LISP; and combinatorial based languages, such as FP. A new analytical learning algorithm, AL-2, is exhibited that learns from success but is otherwise quite different from EBG. These results suggest that term rewriting systems are a good framework for analytical learning research in general, and that further research should be directed toward developing new techniques.

Laird, Philip

v-representability and density functional theory

It is shown that if n(r) is the discrete density on a lattice (enclosed in a finite box) associated with a nondegenerate ground state in an external potential v(r) (i.e., is 'v-representable'), then the density n(r) + mu(r), with m(r) arbitrary (apart from trivial constraints) and mu small enough, is also associated with a nondegenerate ground state in an external potential v'(r) near v(r); i.e., n(r) + m(r) is also v-representable. Implications for the Hohenberg-Kohn variational principle and the Kohn-Sham equations are discussed.

Kohn, W.

On the development of a reactive sensor-based robotic system

Flexible robotic systems for space applications need to use local information to guide their action in uncertain environments where the state of the environment and even the goals may change. They have to be tolerant of unexpected events and robust enough to carry their task to completion. Tactical goals should be modified while maintaining strategic goals. Furthermore, reactive robotic systems need to have a broader view of their environments than sensory-based systems. An architecture and a theory of representation extending the basic cycles of action and perception are described. This scheme allows for dynamic description of the environment and determining purposive and timely action. Applications of this scheme for assembly and repair tasks using a Universal Machine Intelligence RTX robot are being explored, but the ideas are extendable to other domains. The nature of reactivity for sensor-based robotic systems and implementation issues encountered in developing a prototype are discussed.

Hexmoor, Henry H.