Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer algebra system”

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
All sourcesNASA NTRSDOE OSTI
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 NTRS1985

Comparison of Two Algebraic Methods for Curve/curve Intersection

Most geometric modeling systems use either polynomial or rational functions to represent geometry. In such systems most computational problems can be formulated as systems of polynomials in one or more variables. Classical elimination theory can be used to solve such systems. Here Cayley's method of elimination is summarized and it is shown how it can best be used to solve the curve/curve intersection problem. Cayley's method was found to be a more straightforward approach. Furthermore, it is computationally simpler, since the elements of the Cayley matrix are one variable instead of two variable polynomials. Researchers implemented and tested both methods and found Cayley's to be more efficient. Six pairs of curves, representing mixtures of lines, circles, and cubic arcs were used. Several examples had multiple intersection points. For all six cases Cayley's required less CPU time than the other method. The average time ratio of method 1 to method 2 was 3.13:1, the least difference was 2.33:1, and the most dramatic was 6.25:1. Both of the above methods can be extended to solve the surface/surface intersection problem.

Demontaudouin, Y.↗
NASA NTRS1987

Algorithmic phase diagrams

Algorithmic phase diagrams are a neat and compact representation of the results of comparing the execution time of several algorithms for the solution of the same problem. As an example, the recent results are shown of Gannon and Van Rosendale on the solution of multiple tridiagonal systems of equations in the form of such diagrams. The act of preparing these diagrams has revealed an unexpectedly complex relationship between the best algorithm and the number and size of the tridiagonal systems, which was not evident from the algebraic formulae in the original paper. Even so, for a particular computer, one diagram suffices to predict the best algorithm for all problems that are likely to be encountered the prediction being read directly from the diagram without complex calculation.

Hockney, Roger↗
NASA NTRS1992

Hybrid analytical technique for the nonlinear analysis of curved beams

The application of a two-step hybrid technique to the geometrically nonlinear analysis of curved beams is used to demonstrate the potential of hybrid analytical techniques in nonlinear structural mechanics. The hybrid technique is based on successive use of the perturbation method and a classical direct variational procedure. The functions associated with the various-order terms in the perturbation expansion of the fundamental unknowns, and their sensitivity derivatives with respect to material and geometric parameters of the beam, are first obtained by using the perturbation method. These functions are selected as coordinate functions (or modes) and the classical direct variational technique is then used to compute their amplitudes. The potential of the proposed hybrid technique for nonlinear analysis of structures is discussed. The effectiveness of the hybrid technique is demonstrated by means of numerical examples. The symbolic computation system Mathematica is used in the present study. The tasks performed on Mathematica include: (1) generation of algebraic expressions for the perturbation functions of the different response quantities and their sensitivity derivatives: and (2) determination of the radius of convergence of the perturbation series.

Noor, A. K.↗
NASA NTRS1990

Constraint treatment techniques and parallel algorithms for multibody dynamic analysis

Computational procedures for kinematic and dynamic analysis of three-dimensional multibody dynamic (MBD) systems are developed from the differential-algebraic equations (DAE's) viewpoint. Constraint violations during the time integration process are minimized and penalty constraint stabilization techniques and partitioning schemes are developed. The governing equations of motion, a two-stage staggered explicit-implicit numerical algorithm, are treated which takes advantage of a partitioned solution procedure. A robust and parallelizable integration algorithm is developed. This algorithm uses a two-stage staggered central difference algorithm to integrate the translational coordinates and the angular velocities. The angular orientations of bodies in MBD systems are then obtained by using an implicit algorithm via the kinematic relationship between Euler parameters and angular velocities. It is shown that the combination of the present solution procedures yields a computationally more accurate solution. To speed up the computational procedures, parallel implementation of the present constraint treatment techniques, the two-stage staggered explicit-implicit numerical algorithm was efficiently carried out. The DAE's and the constraint treatment techniques were transformed into arrowhead matrices to which Schur complement form was derived. By fully exploiting the sparse matrix structural analysis techniques, a parallel preconditioned conjugate gradient numerical algorithm is used to solve the systems equations written in Schur complement form. A software testbed was designed and implemented in both sequential and parallel computers. This testbed was used to demonstrate the robustness and efficiency of the constraint treatment techniques, the accuracy of the two-stage staggered explicit-implicit numerical algorithm, and the speed up of the Schur-complement-based parallel preconditioned conjugate gradient algorithm on a parallel computer.

Chiou, Jin-Chern↗
NASA NTRS1984

GCKP84--General Chemical Kinetics Code for Gas-Phase Flow and Batch Processes Including Heat Transfer Effects

A general chemical kinetics code is described for complex, homogeneous ideal gas reactions in any chemical system. The main features of the GCKP84 code are flexibility, convenience, and speed of computation for many different reaction conditions. The code, which replaces the GCKP code published previously, solves numerically the differential equations for complex reaction in a batch system or one dimensional inviscid flow. It also solves numerically the nonlinear algebraic equations describing the well stirred reactor. A new state of the art numerical integration method is used for greatly increased speed in handling systems of stiff differential equations. The theory and the computer program, including details of input preparation and a guide to using the code are given.

David A Bittker↗
NASA NTRS2011

Constraint Embedding Technique for Multibody System Dynamics

Multibody dynamics play a critical role in simulation testbeds for space missions. There has been a considerable interest in the development of efficient computational algorithms for solving the dynamics of multibody systems. Mass matrix factorization and inversion techniques and the O(N) class of forward dynamics algorithms developed using a spatial operator algebra stand out as important breakthrough on this front. Techniques such as these provide the efficient algorithms and methods for the application and implementation of such multibody dynamics models. However, these methods are limited only to tree-topology multibody systems. Closed-chain topology systems require different techniques that are not as efficient or as broad as those for tree-topology systems. The closed-chain forward dynamics approach consists of treating the closed-chain topology as a tree-topology system subject to additional closure constraints. The resulting forward dynamics solution consists of: (a) ignoring the closure constraints and using the O(N) algorithm to solve for the free unconstrained accelerations for the system; (b) using the tree-topology solution to compute a correction force to enforce the closure constraints; and (c) correcting the unconstrained accelerations with correction accelerations resulting from the correction forces. This constraint-embedding technique shows how to use direct embedding to eliminate local closure-loops in the system and effectively convert the system back to a tree-topology system. At this point, standard tree-topology techniques can be brought to bear on the problem. The approach uses a spatial operator algebra approach to formulating the equations of motion. The operators are block-partitioned around the local body subgroups to convert them into aggregate bodies. Mass matrix operator factorization and inversion techniques are applied to the reformulated tree-topology system. Thus in essence, the new technique allows conversion of a system with closure-constraints into an equivalent tree-topology system, and thus allows one to take advantage of the host of techniques available to the latter class of systems. This technology is highly suitable for the class of multibody systems where the closure-constraints are local, i.e., where they are confined to small groupings of bodies within the system. Important examples of such local closure-constraints are constraints associated with four-bar linkages, geared motors, differential suspensions, etc. One can eliminate these closure-constraints and convert the system into a tree-topology system by embedding the constraints directly into the system dynamics and effectively replacing the body groupings with virtual aggregate bodies. Once eliminated, one can apply the well-known results and algorithms for tree-topology systems to solve the dynamics of such closed-chain system.

Woo, Simon S.↗
NASA NTRS2011

Ndarts

Ndarts software provides algorithms for computing quantities associated with the dynamics of articulated, rigid-link, multibody systems. It is designed as a general-purpose dynamics library that can be used for the modeling of robotic platforms, space vehicles, molecular dynamics, and other such applications. The architecture and algorithms in Ndarts are based on the Spatial Operator Algebra (SOA) theory for computational multibody and robot dynamics developed at JPL. It uses minimal, internal coordinate models. The algorithms are low-order, recursive scatter/ gather algorithms. In comparison with the earlier Darts++ software, this version has a more general and cleaner design needed to support a larger class of computational dynamics needs. It includes a frames infrastructure, allows algorithms to operate on subgraphs of the system, and implements lazy and deferred computation for better efficiency. Dynamics modeling modules such as Ndarts are core building blocks of control and simulation software for space, robotic, mechanism, bio-molecular, and material systems modeling.

Jain, Abhinandan↗
NASA NTRS1992

Computation of the flow field in a centrifugal impeller with splitter blades

To support the design effort of the Space Transportation Main Engine (STME) Fuel Pump Stage, viscous flow calculations were performed in a centrifugal impeller with splitter blades. These calculations were carried out with a Navier-Stokes solver (MINT), which employs a linearized block-implicit Alternating Direction Implicit (ADI) procedure to iteratively solve a finite difference form of the system of conservation equations of mass, momentum, and energy in body-fitted coordinates. A computational grid was generated algebraically for the 'channel' between two main blades of the impeller and extended both upstream of the impeller inlet and downstream of the impeller exit so that the appropriate boundary conditions could be applied. The results of the calculations show that although the overall level of flow distortion near the impeller exit is not very large, there is a noticeable difference between the flow patterns in the two 'passages' (one passage between the pressure side of the splitter blade and the suction side of the next full blade).

Dejong, Frederik J.↗
NASA NTRS1992

On options for interdisciplinary analysis and design optimization

The interdisciplinary optimization of engineering systems is discussed from the standpoint of the computational alternatives available to the designer. The analysis of such systems typically requires the solution of coupled systems of nonlinear algebraic equations. The solution procedure is necessarily iterative in nature. It is shown that the system can be solved by fixed point iteration, by Newton's method, or by a combination of the two. However, the need for sensitivity analysis may affect the choice of analysis solution method. Similarly, the optimization of the system can be formulated in several ways that are discussed in the paper. It is shown that the effect of the topology of the interaction between disciplines is a key factor in the choice of analysis, sensitivity and optimization methods. Several examples are presented to illustrate the discussion.

Haftka, R. T.↗
NASA NTRS1992

Recursive formulation of operational space control

A recently developed spatial operator algebra approach to modeling and analysis of multibody robotic systems is used to develop O(n) recursive algorithms that compute the operational space mass matrix and the operational space coriolis/centrifugal and gravity terms of an n-link serial manipulator. These algorithms enable an O(n) recursive implementation of operational space control.

Kreutz-Delgado, K.↗
NASA NTRS1978

ORACLS: A system for linear-quadratic-Gaussian control law design

A modern control theory design package (ORACLS) for constructing controllers and optimal filters for systems modeled by linear time-invariant differential or difference equations is described. Numerical linear-algebra procedures are used to implement the linear-quadratic-Gaussian (LQG) methodology of modern control theory. Algorithms are included for computing eigensystems of real matrices, the relative stability of a matrix, factored forms for nonnegative definite matrices, the solutions and least squares approximations to the solutions of certain linear matrix algebraic equations, the controllability properties of a linear time-invariant system, and the steady state covariance matrix of an open-loop stable system forced by white noise. Subroutines are provided for solving both the continuous and discrete optimal linear regulator problems with noise free measurements and the sampled-data optimal linear regulator problem. For measurement noise, duality theory and the optimal regulator algorithms are used to solve the continuous and discrete Kalman-Bucy filter problems. Subroutines are also included which give control laws causing the output of a system to track the output of a prescribed model.

Armstrong, E. S.↗
NASA NTRS1984

User's guide for NASCRIN: A vectorized code for calculating two-dimensional supersonic internal flow fields

A computer program NASCRIN has been developed for analyzing two-dimensional flow fields in high-speed inlets. It solves the two-dimensional Euler or Navier-Stokes equations in conservation form by an explicit, two-step finite-difference method. An explicit-implicit method can also be used at the user's discretion for viscous flow calculations. For turbulent flow, an algebraic, two-layer eddy-viscosity model is used. The code is operational on the CDC CYBER 203 computer system and is highly vectorized to take full advantage of the vector-processing capability of the system. It is highly user oriented and is structured in such a way that for most supersonic flow problems, the user has to make only a few changes. Although the code is primarily written for supersonic internal flow, it can be used with suitable changes in the boundary conditions for a variety of other problems.

Kumar, A.↗
NASA NTRS1986

Physical optics analysis of a four-reflector antenna, part 1

Concern has been raised for the 64-m to 70-m antenna upgrade project that the 70-m system may experience greater S-band beam-pointing perturbations than the 64-m system. The S-band perturbations are due to minor (higher order) mode generation, causing subtle cross-polarization fields affecting beam pointing direction, as described herein. For the antennas in their present configuration (64 m), a slight S-band gain degradation of about 0.05 dB can be attributed to these effects. Therefore, a full physical optics analysis was performed for the present-day 64-m system, as described herein. The results were compared with past analyses and experimental observations in order to verify the algebra and computer code with the intent of deriving a valid analysis method for accurately analyzing the 70-m shaped dual reflector Cassegrainian antenna. The results of the new analysis appear to be in excellent agreement with previous analyses and experimental data.

Cha, A. G.↗
NASA NTRS1986

Physical optics analysis of a four-reflector antenna

Concern has been raised for the 64-m to 70-m antenna upgrade project that the 70-m system may experience greater S-band beam-pointing perturbations than the 64-m system. The S-band perturbations are due to minor (higher order) mode generation, causing subtle cross-polarization fields affecting beam pointing direction, as described herein. For the antennas in their present configuration (64 m), a slight S-band gain degradation of about 0.05 dB can be attributed to these effects. Therefore, a full physical optics analysis was performed for the present-day 64-m system, as described herein. The results were compared with past analyses and experimental observations in order to verify the algebra and computer code with the intent of deriving a valid analysis method for accurately analyzing the 70-m shaped dual reflector Cassegrainian antenna. The results of the new analysis appear to be in excellent agreement with previous analyses and experimental data.

Cha, A. G.↗
NASA NTRS1989

A nearly-linear computational-cost scheme for the forward dynamics of an N-body pendulum

The dynamic equations of motion of an n-body pendulum with spherical joints are derived to be a mixed system of differential and algebraic equations (DAE's). The DAE's are kept in implicit form to save arithmetic and preserve the sparsity of the system and are solved by the robust implicit integration method. At each solution point, the predicted solution is corrected to its exact solution within given tolerance using Newton's iterative method. For each iteration, a linear system of the form J delta X = E has to be solved. The computational cost for solving this linear system directly by LU factorization is O(n exp 3), and it can be reduced significantly by exploring the structure of J. It is shown that by recognizing the recursive patterns and exploiting the sparsity of the system the multiplicative and additive computational costs for solving J delta X = E are O(n) and O(n exp 2), respectively. The formulation and solution method for an n-body pendulum is presented. The computational cost is shown to be nearly linearly proportional to the number of bodies.

Chou, Jack C. K.↗