Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

Cellerator: extending a computer algebra system to include biochemical arrows for signal transduction simulations

Cellerator describes single and multi-cellular signal transduction networks (STN) with a compact, optionally palette-driven, arrow-based notation to represent biochemical reactions and transcriptional activation. Multi-compartment systems are represented as graphs with STNs embedded in each node. Interactions include mass-action, enzymatic, allosteric and connectionist models. Reactions are translated into differential equations and can be solved numerically to generate predictive time courses or output as systems of equations that can be read by other programs. Cellerator simulations are fully extensible and portable to any operating system that supports Mathematica, and can be indefinitely nested within larger data structures to produce highly scaleable models.

Non-NASA Center↗
DOE OSTI2023

Rigorous Analytic Combinatorics in Several Variables in SageMath

We introduce the new [sage_acsv] package for the SageMath computer algebra system, allowing users to rigorously compute asymptotics for a large variety of multivariate sequences with rational generating functions. Using Sage's support for exact computations over the algebraic number field, this package provides the first rigorous implementation of algorithms from the theory of analytic combinatorics in several variables.

Hackl, Benjamin↗
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↗
DOE OSTI2022

tapir: A tool for topologies, amplitudes, partial fraction decomposition and input for reductions

The demand for precision predictions in the field of high energy physics has dramatically increased over recent years. Experiments conducted at the LHC, as well as precision measurements at the intensity frontier such as Belle II require equally precise theoretical predictions to make full use of the acquired data. To match the experimental precision, second-, third- and, for certain quantities, even higher-order calculations in perturbative quantum field theory are required. To facilitate such calculations, computer software automating as many steps as possible is required. Yet, each calculation poses different challenges and thus, a high level of configurability is required. In this context we present tapir: a tool for identification, manipulation and minimization of Feynman integral families. It is designed to integrate in toolchains based on the computer algebra system FORM, the use of which is common practice in the field. tapir can be used to reduce the complexity of multi-loop problems with cut-filters, topology mapping, partial fraction decomposition and alike. Program Title:tapir CPC Library link to program files:https://doi.org/10.17632/ptc9t46xyn.1 Developer's repository link:https://gitlab.com/tapir-devs/tapir Licensing provisions: GPLv3 Programming language:python 3, C++ Nature of problem: Multi-loop computations require the automatization of a large number of different tasks related to Feynman integral topologies. Among them are the identification and minimization of integral topologies, partial fraction decomposition of topologies in the case of linearly dependent propagators as well as mapping scalar products of loop momenta to scalar functions. Solution method: The minimization of topologies is performed by comparison of their respective Nickel indices [1], even further minimization utilizes Pak's algorithm [2]. To efficiently map scalar products of loop momenta to scalar functions FORM [3] code is generated. Additional comments including restrictions and unusual features: Minimization based on Pak's algorithm slows down for many lines and scales. A coarser minimization using the Nickel indices, however, is still possible. [1]B. Nickel, D. Meiron, G.A.J. Baker, Compilation of 2-pt and 4-pt graphs for continuous spin model, Report, University of Guelph, 1977.[2]A. Pak, J. Phys. Conf. Ser. 368 (2012) 012049, https://doi.org/10.1088/1742-6596/368/1/012049, arXiv:1111.0868.[3]B. Ruijl, T. Ueda, J. Vermaseren, FORM version 4.2, arXiv:1707.06453, 7 2017.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Moments of the Boltzmann collision operator for Coulomb interactions

Exact moments of the Boltzmann collision operator are calculated in the irreducible Hermitian moment expansion written in terms of the random-velocity variable of each species. The formulas are presented in closed, algebraic form and can be straightforwardly implemented in computer algebra systems. They are valid for two arbitrary masses, temperatures, and flow velocities, and hence include all other existing results derived for distribution functions expanded with respect to reference states of one temperature and flow velocity. In comparison, the Landau collisional moments are good approximations for large Coulomb logarithm and small relative flow velocity, but they fail to predict the correct behavior of most collisional moments for large relative flow even for weakly coupled plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1985

Parametric Stiffness Control of Flexible Structures

An unconventional method for control of flexible space structures using feedback control of certain elements of the stiffness matrix is discussed. The advantage of using this method of configuration control is that it can be accomplished in practical structures by changing the initial stress state in the structure. The initial stress state can be controlled hydraulically or by cables. The method leads, however, to nonlinear control equations. In particular, a long slender truss structure under cable induced initial compression is examined. both analytical and numerical analyses are presented. Nonlinear analysis using center manifold theory and normal form theory is used to determine criteria on the nonlinear control gains for stable or unstable operation. The analysis is made possible by the use of the exact computer algebra system MACSYMA.

Moon, F. C.↗
NASA NTRS1979

A computer algorithm for performing interactive algebraic computation on the GE Image-100 system

A subroutine which performs specialized algebraic computations upon ocean color scanner multispectral data is presented. The computed results are displayed on a video display. The subroutine exists as a component of the aircraft sensor analysis package. The user specifies the parameters of the computations by directly interacting with the computer. A description of the conversational options is also given.

Hart, W. D.↗
NASA NTRS1993

Applications of computer algebra to distributed parameter systems

In the analysis of vibrations of continuous elastic systems, one often encounters complicated transcendental equations with roots directly related to the system's natural frequencies. Typically, these equations contain system parameters whose values must be specified before a numerical solution can be obtained. The present paper presents a method whereby the fundamental frequency can be obtained in analytical form to any desired degree of accuracy. The method is based upon truncation of rapidly converging series involving inverse powers of the system natural frequencies. A straightforward method to developing these series and summing them in closed form is presented. It is demonstrated how Computer Algebra can be exploited to perform the intricate analytical procedures which otherwise would render the technique difficult to apply in practice. We illustrate the method by developing two analytical approximations to the fundamental frequency of a vibrating cantilever carrying a rigid tip body. The results are compared to the numerical solution of the exact (transcendental) frequency equation over a range of system parameters.

Storch, Joel A.↗
NASA NTRS1987

Algebraic grid generation

Algebraic grid generation is the direct expression of a physical coordinate system as a function of a uniform grid in a rectangular computational coordinate system. Algebraic grid generation is based on mathematical interpolation and is presented in general terms of multivariate transfinite interpolation. The multisurface method and the two-boundary technique are described as univariate procedures that can be applied within the context of transfinite interpolation. A technique for grid clustering is described. Problems that are commonly encountered in three-dimensional grid generation are discussed and approaches for dealing with complex physical domains using multiple computational grid blocks are presented.

Smith, Robert E.↗
DOE OSTI2024

Solving differential‐algebraic equations in power system dynamic analysis with quantum computing

Abstract Power system dynamics are generally modeled by high dimensional non‐linear differential‐algebraic equations (DAEs) given a large number of components forming the network. These DAEs' complexity can grow exponentially due to the increasing penetration of distributed energy resources, whereas their computation time becomes sensitive due to the increasing interconnection of the power grid with other energy systems. This paper demonstrates the use of quantum computing algorithms to solve DAEs for power system dynamic analysis. We leverage a symbolic programming framework to equivalently convert the power system's DAEs into ordinary differential equations (ODEs) using index reduction methods and then encode their data into qubits using amplitude encoding. The system non‐linearity is captured by Hamiltonian simulation with truncated Taylor expansion so that state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can solve the power system's DAEs accurately with a computational complexity polynomial in the logarithm of the system dimension. We also illustrate the use of recent advanced tools in scientific machine learning for implementing complex computing concepts, that is, Taylor expansion, DAEs/ODEs transformation, and quantum computing solver with abstract representation for power engineering applications.

computational complexity↗
NASA NTRS1984

The semi-Markov unreliability range evaluator program

The SURE program is a design/validation tool for ultrareliable computer system architectures. The system uses simple algebraic formulas to compute accurate upper and lower bounds for the death state probabilities of a large class of semi-Markov models. The mathematical formulas used in the program were derived from a mathematical theorem proven by Allan White under contract to NASA Langley Research Center. This mathematical theorem is discussed along with the user interface to the SURE program.

Butler, R. W.↗
DOE OSTI2018

L{sup ∞} error bound of conservative compact difference scheme for the generalized symmetric regularized long-wave (GSRLW) equations

In this paper, we design a compact finite difference scheme which preserves the original conservative properties to solve the generalized symmetric regularized long-wave equations. The existence of the difference solution is proved by the Brouwer fixed-point theorem. Applying the discrete energy method, the convergence and stability of the difference scheme is obtained, and its numerical convergence order is O(τ{sup 2}+h{sup 4}) in the L{sup ∞}-norm for u and ρ. For computing the nonlinear algebraic system generated by the compact scheme, a decoupled iterative algorithm is constructed and proved to be convergent. Numerical experiment results show that the theory is accurate and the method is efficient and reliable.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1996

Research in Computational Aeroscience Applications Implemented on Advanced Parallel Computing Systems

Improving the numerical linear algebra routines for use in new Navier-Stokes codes, specifically Tim Barth's unstructured grid code, with spin-offs to TRANAIR is reported. A fast distance calculation routine for Navier-Stokes codes using the new one-equation turbulence models is written. The primary focus of this work was devoted to improving matrix-iterative methods. New algorithms have been developed which activate the full potential of classical Cray-class computers as well as distributed-memory parallel computers.

Wigton, Larry↗
DOE OSTI2022

A fast and accurate modeling approach for water and steam thermodynamics with practical applications in district heating system simulation

In U.S. district heating (DH) systems, steam is the most common heat transport medium. Industry demand for new advanced modeling capabilities of complete steam DH systems is increasing; however, the existing models for water/steam thermodynamics are too slow for large system simulations because of computationally expensive algebraic loops that require the solution to nonlinear systems of equations. For practical applications, this work presents a novel split-medium approach that implements numerically efficient liquid water models alongside various water/steam models, breaking costly algebraic loops by decoupling mass and energy balance equations. New component models for steam DH systems are also presented. We implemented the models in the equation based Modelica language and evaluated accuracy and computing speed across multiple scales: from fundamental thermodynamic properties to complete districts featuring 10 to 200 buildings. Compared to district models with the IF97 water/steam model and equipment models from the Modelica Standard Library, the new implementation improves the scaling rate for large districts from cubic to quadratic with negligible compromise to accuracy. Additionally, for an annual simulation with 180 buildings, this translates to a computing time reduction from 33 to 1-1.5 h. These results are critically important for industry practitioners to simulate steam DH systems at large scales.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS1987

Simplified algebraic grid generation in patched mesh systems

Some computational tools and techniques are described that are integrated into a simplified algebraic grid generation procedure. Major steps of such a procedure are also outlined. Grids generated via this approach for several complex geometries are shown to demonstrate the potential for wide application.

Luh, Raymond Ching-Chung↗
NASA NTRS1973

Computer programs for the solution of systems of linear algebraic equations

FORTRAN subprograms for the solution of systems of linear algebraic equations are described, listed, and evaluated in this report. Procedures considered are direct solution, iteration, and matrix inversion. Both incore methods and those which utilize auxiliary data storage devices are considered. Some of the subroutines evaluated require the entire coefficient matrix to be in core, whereas others account for banding or sparceness of the system. General recommendations relative to equation solving are made, and on the basis of tests, specific subprograms are recommended.

Sequi, W. T.↗