Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Symbolic computing”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

SymPy: symbolic computing in Python

SymPy is an open source computer algebra system written in pure Python. It is built with a focus on extensibility and ease of use, through both interactive and programmatic applications. These characteristics have led SymPy to become a popular symbolic library for the scientific Python ecosystem. This paper presents the architecture of SymPy, a description of its features, and a discussion of select submodules. The supplementary material provide additional examples and further outline details of the architecture and features of SymPy.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1990

Application of symbolic computations to the constitutive modeling of structural materials

In applications involving elevated temperatures, the derivation of mathematical expressions (constitutive equations) describing the material behavior can be quite time consuming, involved and error-prone. Therefore intelligent application of symbolic systems to faciliate this tedious process can be of significant benefit. Presented here is a problem oriented, self contained symbolic expert system, named SDICE, which is capable of efficiently deriving potential based constitutive models in analytical form. This package, running under DOE MACSYMA, has the following features: (1) potential differentiation (chain rule), (2) tensor computations (utilizing index notation) including both algebraic and calculus; (3) efficient solution of sparse systems of equations; (4) automatic expression substitution and simplification; (5) back substitution of invariant and tensorial relations; (6) the ability to form the Jacobian and Hessian matrix; and (7) a relational data base. Limited aspects of invariant theory were also incorporated into SDICE due to the utilization of potentials as a starting point and the desire for these potentials to be frame invariant (objective). The uniqueness of SDICE resides in its ability to manipulate expressions in a general yet pre-defined order and simplify expressions so as to limit expression growth. Results are displayed, when applicable, utilizing index notation. SDICE was designed to aid and complement the human constitutive model developer. A number of examples are utilized to illustrate the various features contained within SDICE. It is expected that this symbolic package can and will provide a significant incentive to the development of new constitutive theories.

Arnold, Steven M.↗
NASA NTRSDate not supplied

GASP Advancements With Symbolic Computations, Optimization, and Decoupled Numerical Methods

NASA is exploring advancements in hybrid-electric propulsion concepts for aircraft design. A new analysis capability has been deployed at NASA’s Ames Research Center using a new mathematical modeling framework in Python that leverages symbolic representation of mathematical expressions, optimization-based problem formulations, and standalone numerical methods. This capability, called Gascon, has been verified against NASA’s General Aviation Synthesis Program (GASP) results for several vehicles that exercise the analysis capability for a variety of aircraft classes and engine models, including both turbofans and turboprops. We believe this capability will set the stage for more rapid development of novel aircraft models with more flexible design assessments using optimization, and more traceable analysis for reproducibility. Additionally, a novel Pareto optimization-based design space exploration that shows the trade between range flown and fuel burn by manipulating the thrust split during cruise for a true parallel hybrid aircraft was developed by leveraging the unique features of Gascon.

aircraft design↗
DOE OSTI2018

Symmetry Analysis Using Symbolic Computation

The symmetry group of a system of differential equations reveals basic invariant properties of the underlying model and its solutions. In many cases symmetry groups have simple geometric interpretations that can be applied to simplify the model and determine certain classes of solutions explicitly. The general procedure to compute the symmetry group of a given system of differential equations follows a well-known algorithm. However, this procedure involves a large number of laborious and usually error-prone calculations, especially in the case of higher-order systems. The purpose of this report is explain how to use an existing software program designed to automate the major steps of this algorithm in order to calculate the symmetry group of any system of differential equations more efficiently.

97 MATHEMATICS AND COMPUTING↗
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 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 NTRS1995

Applications of symbolic computation in fracture mechanics

A FORTRAN program for calculating the stresses of n cracks embedded in an isotropic plate is presented. Formulas are given for calculating the stresses of one crack, two cracks, and n cracks in an isotropic plate. Then the program code that accomplishes this is provided.

Tan, Hui-Qian↗
NASA NTRS2010

Symbolic Computation of Strongly Connected Components Using Saturation

Finding strongly connected components (SCCs) in the state-space of discrete-state models is a critical task in formal verification of LTL and fair CTL properties, but the potentially huge number of reachable states and SCCs constitutes a formidable challenge. This paper is concerned with computing the sets of states in SCCs or terminal SCCs of asynchronous systems. Because of its advantages in many applications, we employ saturation on two previously proposed approaches: the Xie-Beerel algorithm and transitive closure. First, saturation speeds up state-space exploration when computing each SCC in the Xie-Beerel algorithm. Then, our main contribution is a novel algorithm to compute the transitive closure using saturation. Experimental results indicate that our improved algorithms achieve a clear speedup over previous algorithms in some cases. With the help of the new transitive closure computation algorithm, up to 10(exp 150) SCCs can be explored within a few seconds.

Zhao, Yang↗
NASA NTRS1991

The analysis of control trajectories using symbolic and database computing

The research broadly concerned the symbolic computation, mixed numeric-symbolic computation, and data base computation of trajectories of dynamical systems, especially control systems. It was determined that trees can be used to compute symbolically series which approximate solutions to differential equations.

Grossman, Robert↗
NASA NTRS1989

Computers for symbolic processing

A detailed survey on the motivations, design, applications, current status, and limitations of computers designed for symbolic processing is provided. Symbolic processing computations are performed at the word, relation, or meaning levels, and the knowledge used in symbolic applications may be fuzzy, uncertain, indeterminate, and ill represented. Various techniques for knowledge representation and processing are discussed from both the designers' and users' points of view. The design and choice of a suitable language for symbolic processing and the mapping of applications into a software architecture are then considered. The process of refining the application requirements into hardware and software architectures is treated, and state-of-the-art sequential and parallel computers designed for symbolic processing are discussed.

Wah, Benjamin W.↗
NASA NTRS1975

The transformation of aerodynamic stability derivatives by symbolic mathematical computation

The formulation of mathematical models of aeronautical systems for simulation or other purposes, involves the transformation of aerodynamic stability derivatives. It is shown that these derivatives transform like the components of a second order tensor having one index of covariance and one index of contravariance. Moreover, due to the equivalence of covariant and contravariant transformations in orthogonal Cartesian systems of coordinates, the transformations can be treated as doubly covariant or doubly contravariant, if this simplifies the formulation. It is shown that the tensor properties of these derivatives can be used to facilitate their transformation by symbolic mathematical computation, and the use of digital computers equipped with formula manipulation compilers. When the tensor transformations are mechanised in the manner described, man-hours are saved and the errors to which human operators are prone can be avoided.

Howard, J. C.↗
NASA NTRS1991

HyperCLIPS

Integration of CLIPS computer program into HyperCard computer program combines intuitive, interactive user interface of MacIntosh computer with powerful symbolic computation of expert-system interpreter. HyperCard provides excellent programming environment for quickly developing front end of application program with buttons, dialogs, and pictures, while CLIPS interpreter provides powerful inference engine for analysis and solution of complicated problems. Advantages of both packages available for wide range of uses: rapid prototyping of knowledge-based expert-systems software, interactive simulations of physical systems, and intelligent control of hypertext processes. Written in C language and Pascal.

Hill, Randall W., Jr.↗
NASA NTRS1992

The explicit computation of integration algorithms and first integrals for ordinary differential equations with polynomials coefficients using trees

This note is concerned with the explicit symbolic computation of expressions involving differential operators and their actions on functions. The derivation of specialized numerical algorithms, the explicit symbolic computation of integrals of motion, and the explicit computation of normal forms for nonlinear systems all require such computations. More precisely, if R = k(x(sub 1),...,x(sub N)), where k = R or C, F denotes a differential operator with coefficients from R, and g member of R, we describe data structures and algorithms for efficiently computing g. The basic idea is to impose a multiplicative structure on the vector space with basis the set of finite rooted trees and whose nodes are labeled with the coefficients of the differential operators. Cancellations of two trees with r + 1 nodes translates into cancellation of O(N(exp r)) expressions involving the coefficient functions and their derivatives.

Crouch, P. E.↗
NASA NTRS1991

Time-domain finite elements in optimal control with application to launch-vehicle guidance

A time-domain finite element method is developed for optimal control problems. The theory derived is general enough to handle a large class of problems including optimal control problems that are continuous in the states and controls, problems with discontinuities in the states and/or system equations, problems with control inequality constraints, problems with state inequality constraints, or problems involving any combination of the above. The theory is developed in such a way that no numerical quadrature is necessary regardless of the degree of nonlinearity in the equations. Also, the same shape functions may be employed for every problem because all strong boundary conditions are transformed into natural or weak boundary conditions. In addition, the resulting nonlinear algebraic equations are very sparse. Use of sparse matrix solvers allows for the rapid and accurate solution of very difficult optimization problems. The formulation is applied to launch-vehicle trajectory optimization problems, and results show that real-time optimal guidance is realizable with this method. Finally, a general problem solving environment is created for solving a large class of optimal control problems. The algorithm uses both FORTRAN and a symbolic computation program to solve problems with a minimum of user interaction. The use of symbolic computation eliminates the need for user-written subroutines which greatly reduces the setup time for solving problems.

Bless, Robert R.↗