Search NASA⌕ Search

SEARCH · Search NASA

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 109 records · Page 6

REDUCE 2: A computer program for the symbolic reduction of large block diagrams

REDUCE 2 is reported as a FORMAC program which symbolically calculates the transfer function(s) of any linear-block-diagram output variable to any or all input variables. The program requires as input a set of algebraic expressions representing the block diagram, the desired transfer function(s), and a string of variables indicating the desired order of reduction. The solution is presented in the compact form of a set of nested functions (super G's). The program can handle systems as large as 600 equations and is intended as a tool for the analysis of complex control and dynamic systems. A companion FORTRAN program, EVAL 2, which numerically evaluates the solution set to obtain amplitude ratio and phase angle as functions of frequency is also presented.

Lorenzo, C. F.↗

Application of symbolic and algebraic manipulation software in solving applied mechanics problems

As its name implies, symbolic and algebraic manipulation is an operational tool which not only can retain symbols throughout computations but also can express results in terms of symbols. This report starts with a history of symbolic and algebraic manipulators and a review of the literatures. With the help of selected examples, the capabilities of symbolic and algebraic manipulators are demonstrated. These applications to problems of applied mechanics are then presented. They are the application of automatic formulation to applied mechanics problems, application to a materially nonlinear problem (rigid-plastic ring compression) by finite element method (FEM) and application to plate problems by FEM. The advantages and difficulties, contributions, education, and perspectives of symbolic and algebraic manipulation are discussed. It is well known that there exist some fundamental difficulties in symbolic and algebraic manipulation, such as internal swelling and mathematical limitation. A remedy for these difficulties is proposed, and the three applications mentioned are solved successfully. For example, the closed from solution of stiffness matrix of four-node isoparametrical quadrilateral element for 2-D elasticity problem was not available before. Due to the work presented, the automatic construction of it becomes feasible. In addition, a new advantage of the application of symbolic and algebraic manipulation found is believed to be crucial in improving the efficiency of program execution in the future. This will substantially shorten the response time of a system. It is very significant for certain systems, such as missile and high speed aircraft systems, in which time plays an important role.

Tsai, Wen-Lang↗

A computer program for anisotropic shallow-shell finite elements using symbolic integration

A FORTRAN computer program for anisotropic shallow-shell finite elements with variable curvature is described. A listing of the program is presented together with printed output for a sample case. Computation times and central memory requirements are given for several different elements. The program is based on a stiffness (displacement) finite-element model in which the fundamental unknowns consist of both the displacement and the rotation components of the reference surface of the shell. Two triangular and four quadrilateral elements are implemented in the program. The triangular elements have 6 or 10 nodes, and the quadrilateral elements have 4 or 8 nodes. Two of the quadrilateral elements have internal degrees of freedom associated with displacement modes which vanish along the edges of the elements (bubble modes). The triangular elements and the remaining two quadrilateral elements do not have bubble modes. The output from the program consists of arrays corresponding to the stiffness, the geometric stiffness, the consistent mass, and the consistent load matrices for individual elements. The integrals required for the generation of these arrays are evaluated by using symbolic (or analytic) integration in conjunction with certain group-theoretic techniques. The analytic expressions for the integrals are exact and were developed using the symbolic and algebraic manipulation language.

Andersen, C. M.↗

A view of Kanerva's sparse distributed memory

Pentti Kanerva is working on a new class of computers, which are called pattern computers. Pattern computers may close the gap between capabilities of biological organisms to recognize and act on patterns (visual, auditory, tactile, or olfactory) and capabilities of modern computers. Combinations of numeric, symbolic, and pattern computers may one day be capable of sustaining robots. The overview of the requirements for a pattern computer, a summary of Kanerva's Sparse Distributed Memory (SDM), and examples of tasks this computer can be expected to perform well are given.

Denning, P. J.↗

Iterative Demodulation and Decoding of Non-Square QAM

It has been shown that a non-square (NS) 2(sup 2n+1)-ary (where n is a positive integer) quadrature amplitude modulation [(NS)2(sup 2n+1)-QAM] has inherent memory that can be exploited to obtain coding gains. Moreover, it should not be necessary to build new hardware to realize these gains. The present scheme is a product of theoretical calculations directed toward reducing the computational complexity of decoding coded 2(sup 2n+1)-QAM. In the general case of 2(sup 2n+1)-QAM, the signal constellation is not square and it is impossible to have independent in-phase (I) and quadrature-phase (Q) mapping and demapping. However, independent I and Q mapping and demapping are desirable for reducing the complexity of computing the log likelihood ratio (LLR) between a bit and a received symbol (such computations are essential operations in iterative decoding). This is because in modulation schemes that include independent I and Q mapping and demapping, each bit of a signal point is involved in only one-dimensional mapping and demapping. As a result, the computation of the LLR is equivalent to that of a one-dimensional pulse amplitude modulation (PAM) system. Therefore, it is desirable to find a signal constellation that enables independent I and Q mapping and demapping for 2(sup 2n+1)-QAM.

Li, Lifang↗

Fuzzy multiple linear regression: A computational approach

This paper presents a new computational approach for performing fuzzy regression. In contrast to Bardossy's approach, the new approach, while dealing with fuzzy variables, closely follows the conventional regression technique. In this approach, treatment of fuzzy input is more 'computational' than 'symbolic.' The following sections first outline the formulation of the new approach, then deal with the implementation and computational scheme, and this is followed by examples to illustrate the new procedure.

Juang, C. H.↗

SDA: a symbolic differential algebra package in C++

Truncated Power Series Algebra (TPSA), or Differential Algebra (DA), is a well-established tool in accelerator physics, commonly used for generating high-order maps of dynamic systems, as well as in symplectic tracking, normal form analysis, verified integration, optimization, and fast multipole methods. This package is the first to perform symbolic DA computations, enabling traceability of initial condition contributions and runtime reduction for repeated DA calculations, potentially expanding DA’s applications.

97 MATHEMATICS AND COMPUTING↗

Prioritized LT Codes

The original Luby Transform (LT) coding scheme is extended to account for data transmissions where some information symbols in a message block are more important than others. Prioritized LT codes provide unequal error protection (UEP) of data on an erasure channel by modifying the original LT encoder. The prioritized algorithm improves high-priority data protection without penalizing low-priority data recovery. Moreover, low-latency decoding is also obtained for high-priority data due to fast encoding. Prioritized LT codes only require a slight change in the original encoding algorithm, and no changes at all at the decoder. Hence, with a small complexity increase in the LT encoder, an improved UEP and low-decoding latency performance for high-priority data can be achieved. LT encoding partitions a data stream into fixed-sized message blocks each with a constant number of information symbols. To generate a code symbol from the information symbols in a message, the Robust-Soliton probability distribution is first applied in order to determine the number of information symbols to be used to compute the code symbol. Then, the specific information symbols are chosen uniform randomly from the message block. Finally, the selected information symbols are XORed to form the code symbol. The Prioritized LT code construction includes an additional restriction that code symbols formed by a relatively small number of XORed information symbols select some of these information symbols from the pool of high-priority data. Once high-priority data are fully covered, encoding continues with the conventional LT approach where code symbols are generated by selecting information symbols from the entire message block including all different priorities. Therefore, if code symbols derived from high-priority data experience an unusual high number of erasures, Prioritized LT codes can still reliably recover both high- and low-priority data. This hybrid approach decides not only "how to encode" but also "what to encode" to achieve UEP. Another advantage of the priority encoding process is that the majority of high-priority data can be decoded sooner since only a small number of code symbols are required to reconstruct high-priority data. This approach increases the likelihood that high-priority data is decoded first over low-priority data. The Prioritized LT code scheme achieves an improvement in high-priority data decoding performance as well as overall information recovery without penalizing the decoding of low-priority data, assuming high-priority data is no more than half of a message block. The cost is in the additional complexity required in the encoder. If extra computation resource is available at the transmitter, image, voice, and video transmission quality in terrestrial and space communications can benefit from accurate use of redundancy in protecting data with varying priorities.

Woo, Simon S.↗

SyReNN: A tool for analyzing deep neural networks

Deep Neural Networks (DNNs) are rapidly gaining popularity in a variety of important domains. Unfortunately, modern DNNs have been shown to be vulnerable to a variety of attacks and buggy behavior. This has motivated recent work in formally analyzing the properties of such DNNs. Furthermore, this paper introduces SyReNN, a tool for understanding and analyzing a DNN by computing its symbolic representation. The key insight is to decompose the DNN into linear functions. Our tool is designed for analyses using low-dimensional subsets of the input space, a unique design point in the space of DNN analysis tools. We describe the tool and the underlying theory, then evaluate its use and performance on three case studies: computing Integrated Gradients, visualizing a DNN’s decision boundaries, and repairing buggy DNNs.

97 MATHEMATICS AND COMPUTING↗

Identification of phenological stages and vegetative types for land use classification

The author has identified the following significant results. Multispectral reflectance signatures have been obtained from computer printouts from scene 1049-20505. Those signatures have been grouped for 13 dominant physical features in the Matanuska Susitna Valley area of Alaska. The derived signatures will be validated and tested by requesting another symbol-coded computer printout for the same area. It is expected that ERTS-1 imagery collected during late autumn and early spring will provide separations of signatures that are confounded in the 1049-20505 scene. Separating bogs and forests should be much improved when either snow covered or when grasses are brown. Photographs have been made of projections on the color additive viewer, each scene being projected with six different filter combinations. The products will be analyzed and those best suited used for producing color transparencies at a scale of 1:250,000 for overlaying on standard quadrangle maps. Color prints will be processed for use in the field. From digital MSS signatures derived to date, identification has been made of which bands are the most powerful for automated classification of dominant physical features. It has been found that separations among density ranges increase with longer wavelengths. Deriving MSS digital signatures has proven valuable to both digital and visual processing of ERTS-1 data.

Branton, C. I.↗

Symbol alphabets from plabic graphs

Symbol alphabets of n-particle amplitudes in N = 4 super-Yang-Mills theory are known to contain certain cluster variables of Gr(4, n) as well as certain algebraic functions of cluster variables. In this paper we suggest an algorithm for computing these symbol alphabets from plabic graphs by solving matrix equations of the form C ∙ Z = 0 to associate functions on Gr(m, n) to parameterizations of certain cells of Gr(k, n) indexed by plabic graphs. For m = 4 and n = 8 we show that this association precisely reproduces the 18 algebraic symbol letters of the two-loop NMHV eight-particle amplitude from four plabic graphs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computer formulations of aircraft models for simulation studies

Recent developments in formula manipulation compilers and the design of several symbol manipulation languages, enable computers to be used for symbolic mathematical computation. A computer system and language that can be used to perform symbolic manipulations in an interactive mode are used to formulate a mathematical model of an aeronautical system. The example demonstrates that once the procedure is established, the formulation and modification of models for simulation studies can be reduced to a series of routine computer operations.

Howard, J. C.↗

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↗

A diagrammatic approach for automatically deriving analytical gradients of tensor hyper-contracted electronic structure methods

In this work, we introduce a diagrammatic approach to facilitate the automatic derivation of analytical nuclear gradients for tensor hyper-contraction (THC) based electronic structure methods. The automatically derived gradients are guaranteed to have the same scaling in terms of both operation count and memory footprint as the underlying energy calculations, and the computation of a gradient is roughly three times as costly as the underlying energy. The new diagrammatic approach enables the first cubic scaling implementation of nuclear derivatives for THC tensors fitted in molecular orbital basis (MO-THC). Furthermore, application of this new approach to THC-MP2 analytical gradients leads to an implementation, which is at least four times faster than the previously reported, manually derived implementation. Finally, we apply the new approach to the 14 tensor contraction patterns appearing in the supporting subspace formulation of multireference perturbation theory, laying the foundation for developments of analytical nuclear gradients and nonadiabatic coupling vectors for multi-state CASPT2.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Integration of symbolic and algorithmic hardware and software for the automation of space station subsystems

Expert systems that require access to data bases, complex simulations and real time instrumentation have both symbolic as well as algorithmic computing needs. These needs could both be met using a general computing workstation running both symbolic and algorithmic code, or separate, specialized computers networked together. The later approach was chosen to implement TEXSYS, the thermal expert system, developed to demonstrate the ability of an expert system to autonomously control the thermal control system of the space station. TEXSYS has been implemented on a Symbolics workstation, and will be linked to a microVAX computer that will control a thermal test bed. Integration options are explored and several possible solutions are presented.

Gregg, Hugh↗

Mahakala: A Python-based Modular Ray-tracing and Radiative Transfer Algorithm for Curved Spacetimes

We introduce Mahakala, a Python-based, modular, radiative ray-tracing code for curved spacetimes. We employ Google's JAX framework for accelerated automatic differentiation, which can efficiently compute Christoffel symbols directly from the metric, allowing the user to easily and quickly simulate photon trajectories through non-Kerr spacetimes. JAX also enables Mahakala to run in parallel on both CPUs and GPUs. Mahakala natively uses the Cartesian Kerr–Schild coordinate system, which avoids numerical issues caused by the pole in spherical coordinate systems. We demonstrate Mahakala's capabilities by simulating 1.3 mm wavelength images (the wavelength of Event Horizon Telescope observations) of general relativistic magnetohydrodynamic simulations of low-accretion rate supermassive black holes. The modular nature of Mahakala allows us to quantitatively explore how different regions of the flow influence different image features. We show that most of the emission seen in 1.3 mm images originates close to the black hole and peaks near the photon orbit. We also quantify the relative contribution of the disk, forward jet, and counterjet to 1.3 mm images.

79 ASTRONOMY AND ASTROPHYSICS↗

The two-loop five-point amplitude in $\mathcal{N}$ = 8 supergravity

We compute the symbol of the two-loop five-point amplitude in $\mathcal{N}$ = 8 supergravity. We write an ansatz for the amplitude whose rational prefactors are based on not only 4-dimensional leading singularities, but also d-dimensional ones, as the former are insufficient. Our novel d-dimensional unitarity-based approach to the systematic construction of an amplitude’s rational structures is likely to have broader applications, for example to analogous QCD calculations. We fix parameters in the ansatz by performing numerical integration-by-parts reduction of the known integrand. We find that the two-loop five-point $\mathcal{N}$ = 8 supergravity amplitude is uniformly transcendental. We then verify the soft and collinear limits of the amplitude. There is considerable similarity with the corresponding amplitude for $\mathcal{N}$ = 4 super-Yang-Mills theory: all the rational prefactors are double copies of the Yang-Mills ones and the transcendental functions overlap to a large degree. As a byproduct, we find new relations between color-ordered loop amplitudes in $\mathcal{N}$ = 4 super-Yang-Mills theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Generalized Bose–Hubbard Hamiltonians exhibiting a complete non-Hermitian degeneracy

Highlights: • Hot topic: physics with non-Hermitian Hamiltonians. • Computer algebra used to construct new, next-to-BH models. • Degeneracy verification via variable-precision arithmetics. • Unfolding patterns at N>5 (recent problem solved). - Abstract: The method of construction of the tridiagonal and symmetric complex-matrix Hamiltonians H{sup (N)}(z) exhibiting an exceptional-point (EP) degeneracy of the Nth (i.e., maximal) order at a preselected parameter z=z{sup (EPN)}=1 is proposed and tested. In general, the implementation of the method requires the use of computer-assisted symbolic manipulations, especially at the larger matrix dimensions N. The well known PT−symmetric N-by-N-matrix Bose–Hubbard Hamiltonians as well as their recent N≤5 non-Bose–Hubbard alternatives are obtained as special solutions. Several other N≥6 non-Bose–Hubbard models H{sup (N)}(z) exhibiting the maximal EPN degeneracy are also constructed and analyzed in detail. In particular, their z−dependent, real or complex spectra of energies are displayed and discussed near as well as far from z{sup (EPN)}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗