Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer Algebra”

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 1,117 records · Page 62
All sourcesNASA NTRSDOE OSTI
NASA NTRS2005

Foundations of Tensor Analysis for Students of Physics and Engineering With an Introduction to the Theory of Relativity

Tensor analysis is one of the more abstruse, even if one of the more useful, higher math subjects enjoined by students of physics and engineering. It is abstruse because of the intellectual gap that exists between where most physics and engineering mathematics leave off and where tensor analysis traditionally begins. It is useful because of its great generality, computational power, and compact, easy to use, notation. This paper bridges the intellectual gap. It is divided into three parts: algebra, calculus, and relativity. Algebra: In tensor analysis, coordinate independent quantities are sought for applications in physics and engineering. Coordinate independence means that the quantities have such coordinate transformations as to leave them invariant relative to a particular observer s coordinate system. Calculus: Non-zero base vector derivatives contribute terms to dynamical equations that correspond to pseudoaccelerations in accelerated coordinate systems and to curvature or gravity in relativity. These derivatives have a specific general form in tensor analysis. Relativity: Spacetime has an intrinsic geometry. Light is the tool for investigating that geometry. Since the observed geometry of spacetime cannot be made to match the classical geometry of Euclid, Einstein applied another more general geometry differential geometry. The merger of differential geometry and cosmology was accomplished in the theory of relativity. In relativity, gravity is equivalent to curvature.

Kolecki, Joseph C.↗
NASA NTRS2003

Optimal Feedback Control of Thermal Networks

An improved approach to the mathematical modeling of feedback control of thermal networks has been devised. Heretofore software for feedback control of thermal networks has been developed by time-consuming trial-and-error methods that depend on engineers expertise. In contrast, the present approach is a systematic means of developing algorithms for feedback control that is optimal in the sense that it combines performance with low cost of implementation. An additional advantage of the present approach is that a thermal engineer need not be expert in control theory. Thermal networks are lumped-parameter approximations used to represent complex thermal systems. Thermal networks are closely related to electrical networks commonly represented by lumped-parameter circuit diagrams. Like such electrical circuits, thermal networks are mathematically modeled by systems of differential-algebraic equations (DAEs) that is, ordinary differential equations subject to a set of algebraic constraints. In the present approach, emphasis is placed on applications in which thermal networks are subject to constant disturbances and, therefore, integral control action is necessary to obtain steady-state responses. The mathematical development of the present approach begins with the derivation of optimal integral-control laws via minimization of an appropriate cost functional that involves augmented state vectors. Subsequently, classical variational arguments provide optimality conditions in the form of the Hamiltonian equations for the standard linear-quadratic-regulator (LQR) problem. These equations are reduced to an algebraic Riccati equation (ARE) with respect to the augmented state vector. The solution of the ARE leads to the direct computation of the optimal proportional- and integral-feedback control gains. In cases of very complex networks, large numbers of state variables make it difficult to implement optimal controllers in the manner described in the preceding paragraph.

Papalexandris, Miltiadis↗
DOE OSTI2015

Design Choices for Thermofluid Flow Components and Systems that are Exported as Functional Mockup Units

This paper discusses design decisions for exporting Modelica thermofluid flow components as Functional Mockup Units. The purpose is to provide guidelines that will allow building energy simulation programs and HVAC equipment manufacturers to effectively use FMUs for modeling of HVAC components and systems. We provide an analysis for direct input-output dependencies of such components and discuss how these dependencies can lead to algebraic loops that are formed when connecting thermofluid flow components. Based on this analysis, we provide recommendations that increase the computing efficiency of such components and systems that are formed by connecting multiple components. We explain what code optimizations are lost when providing thermofluid flow components as FMUs rather than Modelica code. We present an implementation of a package for FMU export of such components, explain the rationale for selecting the connector variables of the FMUs and finally provide computing benchmarks for different design choices. It turns out that selecting temperature rather than specific enthalpy as input and output signals does not lead to a measurable increase in computing time, but selecting nine small FMUs rather than a large FMU increases computing time by 70%.

Wetter, Michael↗
DOE OSTI2023

Semantic embedding for quantum algorithms

The study of classical algorithms is supported by an immense understructure, founded in logic, type, and category theory, that allows an algorithmist to reason about the sequential manipulation of data irrespective of a computation’s realizing dynamics. As quantum computing matures, a similar need has developed for an assurance of the correctness of high-level quantum algorithmic reasoning. Parallel to this need, many quantum algorithms have been unified and improved using quantum signal processing (QSP) and quantum singular value transformation (QSVT), which characterize the ability, by alternating circuit ansätze, to transform the singular values of sub-blocks of unitary matrices by polynomial functions. However, while the algebraic manipulation of polynomials is simple (e.g., compositions and products), the QSP/QSVT circuits realizing analogous manipulations of their embedded polynomials are non-obvious. This work constructs and characterizes the runtime and expressivity of QSP/QSVT protocols where circuit manipulation maps naturally to the algebraic manipulation of functional transforms (termed semantic embedding). In this way, QSP/QSVT can be treated and combined modularly, purely in terms of the functional transforms they embed, with key guarantees on the computability and modularity of the realizing circuits. We also identify existing quantum algorithms whose use of semantic embedding is implicit, spanning from distributed search to proofs of soundness in quantum cryptography. The methods used, based in category theory, establish a theory of semantically embeddable quantum algorithms, and provide a new role for QSP/QSVT in reducing sophisticated algorithmic problems to simpler algebraic ones.

Physics↗
DOE OSTI2018

Color Confinement, Hadron Dynamics, and Hadron Spectroscopy from Light-Front Holography and Superconformal Algebra

The QCD light-front Hamiltonian equation H L F Ψ = M 2 Ψ derived from quantization at fixed LF time τ = t + z / c provides a causal, frame-independent method for computing hadron spectroscopy as well as dynamical observables such as structure functions, transverse momentum distributions, and distribution amplitudes. The QCD Lagrangian with zero quark mass has no explicit mass scale. de Alfaro, Fubini, and Furlan (dAFF) have made an important observation that a mass scale can appear in the equations of motion without affecting the conformal invariance of the action if one adds a term to the Hamiltonian proportional to the dilatation operator or the special conformal operator. If one applies the dAFF procedure to the QCD light-front Hamiltonian, it leads to a color-confining potential κ 4 ζ 2 for mesons, where ζ 2 is the LF radial variable conjugate to the q q ¯ invariant mass squared. The same result, including spin terms, is obtained using light-front holography, the duality between light-front dynamics and A d S 5 , if one modifies the A d S 5 action by the dilaton e κ 2 z 2 in the fifth dimension z . When one generalizes this procedure using superconformal algebra, the resulting light-front eigensolutions provide a unified Regge spectroscopy of meson, baryon, and tetraquarks, including remarkable supersymmetric relations between the masses of mesons and baryons and a universal Regge slope. The pion q q ¯ eigenstate has zero mass at m q = 0 . The superconformal relations also can be extended to heavy-light quark mesons and baryons. This approach also leads to insights into the physics underlying hadronization at the amplitude level. I will also discuss the remarkable features of the Poincaré invariant, causal vacuum defined by light-front quantization and its impact on the interpretation of the cosmological constant. AdS/QCD also predicts the analytic form of the nonperturbative running coupling α s ( Q 2 ) ∝ e - Q 2 / 4 κ 2 . The mass scale κ underlying hadron masses can be connected to the parameter Λ M S ¯ in the QCD running coupling by matching the nonperturbative dynamics to the perturbative QCD regime. The result is an effective coupling α s ( Q 2 ) defined at all momenta. One obtains empirically viable predictions for spacelike and timelike hadronic form factors, structure functions, distribution amplitudes, and transverse momentum distributions. Finally, I address the interesting question of whether the momentum sum rule is valid for nuclear structure functions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1988

A spatial operator algebra for manipulator modeling and control

A powerful new spatial operator algebra for modeling, control, and trajectory design of manipulators is discussed along with its implementation in the Ada programming language. Applications of this algebra to robotics include an operator representation of the manipulator Jacobian matrix; the robot dynamical equations formulated in terms of the spatial algebra, showing the complete equivalence between the recursive Newton-Euler formulations to robot dynamics; the operator factorization and inversion of the manipulator mass matrix which immediately results in O(N) recursive forward dynamics algorithms; the joint accelerations of a manipulator due to a tip contact force; the recursive computation of the equivalent mass matrix as seen at the tip of a manipulator; and recursive forward dynamics of a closed chain system. Finally, additional applications and current research involving the use of the spatial operator algebra are discussed in general terms.

Rodriguez, G.↗
DOE OSTI2024

Light-front puzzles

Abstract Light-front formulations of quantum field theories have many advantages for computing electroweak matrix elements of strongly interacting systems and other quantities that are used to study hadronic structure. The theory can be formulated in Hamiltonian form so non-perturbative calculations of the strongly interacting initial and final states are in principle reduced to linear algebra. These states are needed for calculating parton distribution functions and other types of distribution amplitudes that are used to understand the structure of hadrons. Light-front boosts are kinematic transformations so the strongly interacting states can be computed in any frame. This is useful for computing current matrix elements involving electroweak probes where the initial and final hadronic states are in different frames related by the momentum transferred by the probe. Finally in many calculations the vacuum is trivial so the calculations can be formulated in Fock space. The advantages of light front-field theory would not be interesting if the light-front formulation was not equivalent to the covariant or canonical formulations of quantum field theory. Many of the distinguishing properties of light-front quantum field theory are difficult to reconcile with canonical or covariant formulations of quantum field theory. This paper discusses the resolution of some of the apparent inconsistencies in canonical, covariant and light-front formulations of quantum field theory. The puzzles that will be discussed are (1) the problem of inequivalent representations (2) the problem of the trivial vacuum (3) the problem of ill-posed initial value problems (4) the problem of rotational covariance (5) the problem of zero modes and (6) the problem of spontaneously broken symmetries.

Physics↗
DOE OSTI2018

Discrete Hahn polynomials for numerical solution of two-dimensional variable-order fractional Rayleigh–Stokes problem

The main aim of this paper is to find the numerical solutions of 2D Rayleigh–Stokes problem with the variable-order fractional derivatives in the Riemann–Liouville sense. The presented method is based on collocation procedure in combination with the new operational matrix of the variable-order fractional derivatives, in the Caputo sense, for the discrete Hahn polynomials. The main advantage of the proposed method is obtaining a global approximation for spatial and temporal discretizations, and it reduced the problem to an algebraic system, which is easier to solve. Also, the profit of approximating a continuous function by Hahn polynomials is that for computing the coefficients of the expansion, we only have to compute a summation and the calculation of coefficients is exact. The error bound for the approximate solution is estimated. Finally, we evaluate results of the presented method with other numerical methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Spectral partitioning with blends of eigenvectors

We report many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical accuracy in the context of spectral graph partitioning. We provide pointwise convergence guarantees so that spectral blends (linear combinations of eigenvectors) can be employed to solve data analysis problems with confidence in their accuracy. We apply this theory to an accessible model problem, the ring of cliques, by deriving the relevant eigenpairs and finding necessary and sufficient solver tolerances. Analysis of the ring of cliques provides an upper bound on eigensolver tolerances for graph partitioning problems. These results bridge the gap between linear algebra based data analysis methods and the convergence theory of iterative approximation methods. These results explain how the combinatorial structure of a problem can be recovered much faster than numerically accurate solutions to the associated linear algebra problem.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1974

HAL/S - The programming language for Shuttle

HAL/S is a higher order language and system, now operational, adopted by NASA for programming Space Shuttle on-board software. Program reliability is enhanced through language clarity and readability, modularity through program structure, and protection of code and data. Salient features of HAL/S include output orientation, automatic checking (with strictly enforced compiler rules), the availability of linear algebra, real-time control, a statement-level simulator, and compiler transferability (for applying HAL/S to additional object and host computers). The compiler is described briefly.

Martin, F. H.↗
NASA NTRS1978

On the fundamental structure of Galois switching functions

In connection with investigations conducted by Menger (1969), Benjauthrit and Reed (1976), and Pradhan (1978) two methods have been reported for deriving a unique Galois switching function from a given truth table description of the function. However, neither of the two methods appears satisfactory. One method often contains many redundant terms in its formulation, whereas the second method requires a great number of multiplications and additions. By some algebraic manipulations, an expanded formula is obtained which combines the best features of both methods. This formula makes it possible to compute the coefficients of the desired function more directly and probably with less effort. The conduction of calculations by means of the new formula is illustrated with the aid of examples.

Benjauthrit, B.↗
NASA NTRS1982

A grid spacing control technique for algebraic grid generation methods

A technique which controls the spacing of grid points in algebraically defined coordinate transformations is described. The technique is based on the generation of control functions which map a uniformly distributed computational grid onto parametric variables defining the physical grid. The control functions are smoothed cubic splines. Sets of control points are input for each coordinate directions to outline the control functions. Smoothed cubic spline functions are then generated to approximate the input data. The technique works best in an interactive graphics environment where control inputs and grid displays are nearly instantaneous. The technique is illustrated with the two-boundary grid generation algorithm.

Smith, R. E.↗
NASA NTRS1985

Orbital and Geodetic Error Analysis

Results that previously required several runs determined in more computer-efficient manner. Multiple runs performed only once with GEODYN and stored on tape. ERODYN then performs matrix partitioning and linear algebra required for each individual error-analysis run.

Felsentreger, T.↗
NASA NTRS1986

Elliptic generation of composite three-dimensional grids about realistic aircraft

An elliptic method for generating composite grids about realistic aircraft is presented. A body-conforming grid is first generated about the entire aircraft by the solution of Poisson's differential equation. This grid has relatively coarse spacing, and it covers the entire physical domain. At boundary surfaces, cell size is controlled and cell skewness is nearly eliminated by inhomogeneous terms, which are found automatically by the program. Certain regions of the grid in which high gradients are expected, and which map into rectangular solids in the computational domain, are then designated for zonal refinement. Spacing in the zonal grids is reduced by adding points with a simple, algebraic scheme. Details of the grid generation method are presented along with results of the present application, a wing-body configuration based on the F-16 fighter aircraft.

Sorenson, R. L.↗
NASA NTRS1986

Elliptic generation of composite three-dimensional grids about realistic aircraft

An elliptic method for generating composite grids about realistic aircraft is presented. A body-conforming grid is first generated about the entire aircraft by the solution of Poisson's differential equation. This grid has relatively coarse spacing, and it covers the entire physical domain. At boundary surfaces, cell size is controlled and cell skewness is nearly eliminated by inhomogeneous terms, which are found automatically by the program. Certain regions of the grid in which high gradients are expected, and which map into rectangular solids in the computational domain, are then designated for zonal refinement. Spacing in the zonal grids is reduced by adding points with a simple, algebraic scheme. Details of the grid-generation method are presented along with results of the present application, a wing/body configuration based on the F-16 fighter aircraft.

Sorenson, Reese L.↗