Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Symbolics”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
NASA NTRS1975

Symbol synchronizer assembly instability study, part 2

Data processing to develop a third-order phase model and to translate all such processed data to the frequency realm for further analysis was described. The frequency study yields a long frequency modulation (FM) drift sinusoid (1600-sec period), an impressed secondary drift wave with a period of about 116 sec, and a set of even harmonics of twice the ramp period-the latter arising from, and used to modify, the phase detector model. The result is applied secondarily to estimate the strong-signal SSA phase detector response "out-of-lock." Finally, the main drift components are verified against all available data, and the result is used to estimate minimum lock conditions and the SSA drift effect under normal operating modes. The instability problem appears marginally resolvable if the acquisition technique is modified.

Bunce, R. C.↗
NASA NTRS1977

Symbolic Laplace transforms of special functions

A MACSYMA implementation of the Laplace transform for special functions is described. The generalized hypergeometric functions are used as a basis for the representation of approximately fifty special functions. Only a relatively small number of formulas that generally involve generalized hypergeometric functions are utilized for the integration stage. A sample of actual examples and their timing is provided.

Avgoustis, Y.↗
NASA NTRS1977

A special purpose symbolic manipulation program for the derivation of the equations of motion for large flexible structures

This paper outlines a computer program especially tailored to the task of deriving explicit equations of motion for structures with point-connected substructures. The special purpose program is written in FORTRAN and is designed for performing the specific algebraic operations encountered in the derivation of explicit equations of motion. The derivation is by the Lagrangian approach. Using an orderly kinematical procedure and a discretization and/or truncation scheme, it is possible to write the kinetic and potential energy of each substructure in a compact vector-matrix form. Then, if each element of the matrices and vectors encountered in the kinetic and potential energy is a known algebraic expression, the computer program performs the necessary operations to evaluate the kinetic and potential energy of the system explicitly. Lagrange's equations for small motions about equilibrium can be deduced directly from the explicit form of the system kinetic and potential energy.

Hale, A. L.↗
NASA NTRS1978

Derivation of the equations of motion for complex structures by symbolic manipulation

This paper outlines a computer program especially tailored to the task of deriving explicit equations of motion for structures with point-connected substructures. The special purpose program is written in FORTRAN and is designed for performing the specific algebraic operations encountered in the derivation of explicit equations of motion. The derivation is by the Lagrangian approach. Using an orderly kinematical procedure and a discretization and/or truncation scheme, it is possible to write the kinetic and potential energy of each substructure in a compact vector-matrix form. Then, if each element of the matrices and vectors encountered in the kinetic and potential energy is a known algebraic expression, the computer program performs the necessary operations to evaluate the kinetic and potential energy of the system explicitly. Lagrange's equations for small motions about equilibrium can be deduced directly from the explicit form of the system kinetic and potential energy.

Hale, A. L.↗
NASA NTRS1981

Symbolic Solution of Linear Differential Equations

An algorithm for solving linear constant-coefficient ordinary differential equations is presented. The computational complexity of the algorithm is discussed and its implementation in the FORMAC system is described. A comparison is made between the algorithm and some classical algorithms for solving differential equations.

Feinberg, R. B.↗
NASA NTRS1985

Asymptotic matching by the symbolic manipulator MACSYMA

The delegation of the labor of calculating higher-order terms in singular perturbation (SP) expansions to a computer by the use of MACSYMA is considered. The method of matched asymptotic expansions is studied in detail for two model SP problems: a model resembling the boundary layer equation with a small parameter multiplying the highest derivatives; and a turning-point problem. It is shown that MACSYMA has successfully performed the higher-order matching in both problems.

Lo, L. L.↗
NASA NTRS1988

Investigations into the shape-preserving interpolants using symbolic computation

Shape representation is a central issue in computer graphics and computer-aided geometric design. Many physical phenomena involve curves and surfaces that are monotone (in some directions) or are convex. The corresponding representation problem is given some monotone or convex data, and a monotone or convex interpolant is found. Standard interpolants need not be monotone or convex even though they may match monotone or convex data. Most of the methods of investigation of this problem involve the utilization of quadratic splines or Hermite polynomials. In this investigation, a similar approach is adopted. These methods require derivative information at the given data points. The key to the problem is the selection of the derivative values to be assigned to the given data points. Schemes for choosing derivatives were examined. Along the way, fitting given data points by a conic section has also been investigated as part of the effort to study shape-preserving quadratic splines.

Lam, Maria↗
NASA NTRS1990

On the periodicity of symbolic observations of piecewise smooth discrete-time systems

A study is made of the behavior of discrete-time systems composed of a set of smooth transition maps coupled by a quantized feedback function. The feedback function partitions the state space into disjoint regions and assigns a smooth transition function to each region. The main result is that under a constraint on the norm of the derivative of the transition maps, a bounded state trajectory with limit points in the interior of the switching regions leads to a region index sequence that is eventually periodic. Under these assumptions, it is shown that eventually the feedback function is determined by a finite state automaton. A similar result is proved in the case of finite state dynamic feedback.

Ramadge, Peter J.↗
NASA NTRS1991

The symbolic computation and automatic analysis of trajectories

Research was generally done on computation of trajectories of dynamical systems, especially control systems. Algorithms were further developed for rewriting expressions involving differential operators. The differential operators involved arise in the local analysis of nonlinear control systems. An initial design was completed of the system architecture for software to analyze nonlinear control systems using data base computing.

Grossman, Robert↗
NASA NTRS1990

Synthesizing information-update functions using off-line symbolic processing

This paper explores the synthesis of programs that track dynamic conditions in their environment. An approach is proposed in which the designer specifies, in a declarative language, aspects of the environment in which the program will be embedded. This specification is then automatically compiled into a program that, when executed, updates internal data structures so as to maintain as an invariant a desired correspondence between internal data structures and states of the external environment. This approach retains much of the flexibility of declarative programming while guaranteeing a hard bound on the execution time of information-update functions.

Rosenschein, Stanley J.↗
NASA NTRS1990

An implementation of a reference symbol approach to generic modulation in fading channels

As mobile satellite communications systems evolve over the next decade, they will have to adapt to a changing tradeoff between bandwidth and power. This paper presents a flexible approach to digital modulation and coding that will accommodate both wideband and narrowband schemes. This architecture could be the basis for a family of modems, each satisfying a specific power and bandwidth constraint, yet all having a large number of common signal processing blocks. The implementation of this generic approach, with general purpose digital processors for transmission of 4.8 kilobits per sec. digitally encoded speech, is described.

Young, R. J.↗