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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,135 records · Page 63

All sources NASA NTRS DOE OSTI

NASA NTRS1987

Pointing compensation system for spacecraft instruments

A closed loop system reduces pointing errors in one or more spacecraft instruments. Associated with each instrument is a electronics package (3) for commanding motion in that instrument and a pointing control system (5) for imparting motion in that instrument in response to a command (4) from the commanding package (3). Spacecraft motion compensation logic (25) compensates for instrument pointing errors caused by instrument-motion-induced spacecraft motion. Any finite number of instruments can be so compensated, by providing each pointing control system (5) and each commanding package (3), for the instruments desired to be compensated, with a link to the spacecraft motion compensation logic (25). The spacecraft motion compensation logic (25) is an electronic manifestation of the algebraic negative of a model of the dynamics of motion of the spacecraft. An example of a suitable model, and computer-simulated results, are presented.

Plescia, Carl T.↗

NASA NTRS2009

Improved Model of a Mercury Ring Damper

A short document discusses the general problem of mathematical modeling of the three-dimensional rotational dynamics of rigid bodies and of the use of Euler parameters to eliminate the singularities occasioned by the use of Euler angles in such modeling. The document goes on to characterize a Hamiltonian model, developed by the authors, that utilizes the Euler parameters and, hence, is suitable for use in computational simulations that involve arbitrary rotational motion. In this formulation unlike in prior Euler-parameter-based formulations, there are no algebraic constraints. This formulation includes a general potential energy function, incorporates a minimum set of momentum variables, and takes an explicit state-space form convenient for numerical implementation. Practical application of this formulation has been demonstrated by the development of a new and simplified model of the rotational motion of a rigid rotor to which is attached a partially filled mercury ring damper. Models like this one are used in guidance and control of spin-stabilized spacecraft and gyroscope-stabilized seekers in guided missiles.

Fahrenthold, Eric P.↗

NASA NTRS1988

A decade of computer simulations for space shuttle aerodynamics

Ten years ago computer simulations of the flow field around the Space Shuttle Orbiter were limited to inviscid calculations for the windward side of the forebody and viscous calculations for selected 2-D problems. Advances in computer hardware and numerical methods during the past ten years made it possible to calculate viscous flow over the complete orbiter configuration at angle of attack. The equations solved are the Reynolds-averaged, Navier-Stokes equation, simplified by either the thin-layer or parabolized approximation. An algebraic eddy viscosity model is used for turbulent flow. The free stream is assumed to be a perfect gas for wind tunnel conditions and a real gas in thermodynamic equilibrium for flight conditions. Four examples of recent computer simulations are presented. Flow field results include oil flow patterns on the surface and Mach number contours, isobars, and cross-flow velocity vectors in the shock layer.

Inouye, Mamoru↗

NASA NTRS1988

A decade of computer simulations for Space Shuttle aerodynamics

Inouye, Mamoru↗

DOE OSTI2026

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗

NASA NTRS1995

A portable MPI-based parallel vector template library

This paper discusses the design and implementation of a polymorphic collection library for distributed address-space parallel computers. The library provides a data-parallel programming model for C++ by providing three main components: a single generic collection class, generic algorithms over collections, and generic algebraic combining functions. Collection elements are the fourth component of a program written using the library and may be either of the built-in types of C or of user-defined types. Many ideas are borrowed from the Standard Template Library (STL) of C++, although a restricted programming model is proposed because of the distributed address-space memory model assumed. Whereas the STL provides standard collections and implementations of algorithms for uniprocessors, this paper advocates standardizing interfaces that may be customized for different parallel computers. Just as the STL attempts to increase programmer productivity through code reuse, a similar standard for parallel computers could provide programmers with a standard set of algorithms portable across many different architectures. The efficacy of this approach is verified by examining performance data collected from an initial implementation of the library running on an IBM SP-2 and an Intel Paragon.

Sheffler, Thomas J.↗

NASA NTRS1995

A Portable MPI-Based Parallel Vector Template Library

This paper discusses the design and implementation of a polymorphic collection library for distributed address-space parallel computers. The library provides a data-parallel programming model for C + + by providing three main components: a single generic collection class, generic algorithms over collections, and generic algebraic combining functions. Collection elements are the fourth component of a program written using the library and may be either of the built-in types of c or of user-defined types. Many ideas are borrowed from the Standard Template Library (STL) of C++, although a restricted programming model is proposed because of the distributed address-space memory model assumed. Whereas the STL provides standard collections and implementations of algorithms for uniprocessors, this paper advocates standardizing interfaces that may be customized for different parallel computers. Just as the STL attempts to increase programmer productivity through code reuse, a similar standard for parallel computers could provide programmers with a standard set of algorithms portable across many different architectures. The efficacy of this approach is verified by examining performance data collected from an initial implementation of the library running on an IBM SP-2 and an Intel Paragon.

Sheffler, Thomas J.↗

DOE OSTI2014

Non-Hermitian systems of Euclidean Lie algebraic type with real energy spectra

We study several classes of non-Hermitian Hamiltonian systems, which can be expressed in terms of bilinear combinations of Euclidean–Lie algebraic generators. The classes are distinguished by different versions of antilinear (PT)-symmetries exhibiting various types of qualitative behaviour. On the basis of explicitly computed non-perturbative Dyson maps we construct metric operators, isospectral Hermitian counterparts for which we solve the corresponding time-independent Schrödinger equation for specific choices of the coupling constants. In these cases general analytical expressions for the solutions are obtained in the form of Mathieu functions, which we analyze numerically to obtain the corresponding energy spectra. We identify regions in the parameter space for which the corresponding spectra are entirely real and also domains where the PT symmetry is spontaneously broken and sometimes also regained at exceptional points. In some cases it is shown explicitly how the threshold region from real to complex spectra is characterized by the breakdown of the Dyson maps or the metric operator. We establish the explicit relationship to models currently under investigation in the context of beam dynamics in optical lattices. -- Highlights: •Different PT-symmetries lead to qualitatively different systems. •Construction of non-perturbative Dyson maps and isospectral Hermitian counterparts. •Numerical discussion of the eigenvalue spectra for one of the E(2)-systems. •Established link to systems studied in the context of optical lattices. •Setup for the E(3)-algebra is provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1978

Computational studies of turbulent merger of corotational vortices

A computational study has been conducted to gain a better understanding of the criteria governing the merger of corotating vortices. The zero-equation and one-equation turbulent-flow models are used to model the interaction of two rolled-up, corotational vortices. A model appropriate for the swirling flow under consideration has been proposed to prescribe the algebraic variation of mixing-length in the flow field. The unsteady, two-dimensional equations in a cross-plane are solved for primitive variables using an implicit finite-difference code. The computed downstream merging distances are in good agreement with available wind tunnel data.

Raj, P.↗

NASA NTRS1984

Conduct of the International Multigrid Conference

The 1983 International Multigrid Conference was held at Colorado's Copper Mountain Ski Resort, April 5-8. It was organized jointly by the Institute for Computational Studies at Colorado State University, U.S.A., and the Gasellschaft fur Mathematik und Datenverarbeitung Bonn, F.R. Germany, and was sponsored by the Air Force Office of Sponsored Research and National Aeronautics and Space Administration Headquarters. The conference was attended by 80 scientists, divided by institution almost equally into private industry, research laboratories, and academia. Fifteen attendees came from countries other than the U.S.A. In addition to the fruitful discussions, the most significant factor of the conference was of course the lectures. The lecturers include most of the leaders in the field of multigrid research. The program offered a nice integrated blend of theory, numerical studies, basic research, and applications. Some of the new areas of research that have surfaced since the Koln-Porz conference include: the algebraic multigrid approach; multigrid treatment of Euler equations for inviscid fluid flow problems; 3-D problems; and the application of MG methods on vector and parallel computers.

Mccormick, S.↗

DOE OSTI2020

Quantum Physics without the Physics

This report explains the basic theory and common terminology of quantum physics without assuming any knowledge of physics. It was written by a group of applied mathematicians while they were reading up on the subject. The intended audience consists of applied mathematicians, computer scientists, or anyone else who wants to improve their understanding of quantum physics. We assume that the reader is familiar with fundamental concepts of linear algebra, differential equations, and to some extent the theory of Hilbert spaces. Most of the material can be found in the book by Nielsen and Chuang and in the lecture notes on open quantum systems by Lidar. Another excellent online source of information is Wikipedia, even though most of its articles on quantum physics assume a solid understanding of physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS2009

Numerical Solutions for the CAWAPI Configuration on Structured Grids at NASA LaRC, United States

In this chapter numerical simulations of the flow around F-16XL are performed as a contribution to the Cranked Arrow Wing Aerodynamic Project International (CAWAPI) using the PAB3D CFD code. Two turbulence models are used in the calculations: a standard k-epsilon model, and the Shih-Zhu-Lumley (SZL) algebraic stress model. Seven flight conditions are simulated for the flow around the F-16XL where the free stream Mach number varies from 0.242 to 0.97. The range of angles of attack varies from 0 deg to 20 deg. Computational results, surface static pressure, boundary layer velocity profiles, and skin friction are presented and compared with flight data. Numerical results are generally in good agreement with flight data, considering that only one grid resolution is utilized for the different flight conditions simulated in this study. The Algebraic Stress Model (ASM) results are closer to the flight data than the k-epsilon model results. The ASM predicted a stronger primary vortex, however, the origin of the vortex and footprint is approximately the same as in the k-epsilon predictions.

Elmiligui, Alaa A.↗

DOE OSTI2016

Hopf-algebraic renormalization of QED in the linear covariant gauge

In the context of massless quantum electrodynamics (QED) with a linear covariant gauge fixing, the connection between the counterterm and the Hopf-algebraic approach to renormalization is examined. The coproduct formula of Green’s functions contains two invariant charges, which give rise to different renormalization group functions. All formulas are tested by explicit computations to third loop order. The possibility of a finite electron self-energy by fixing a generalized linear covariant gauge is discussed. An analysis of subdivergences leads to the conclusion that such a gauge only exists in quenched QED.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

A Block-Structured Adaptive Mesh Framework to Solve Radiation Transfer Equation in Irregular Embedded Geometries

Radiation transport arises in various scientific, industrial, and medical fields, and understanding its effect in applications is needed to make accurate predictions, safety assessments and performance optimizations. Solving the Radiation Transport Equation (RTE) is challenging due to its integro-differential nature, which involves both differential and integral terms. The differential term describes the change in radiation intensity due to absorption and emission, while the integral term accounts for scattering. The accurate modeling of radiation is further complicated in many applications due to the complex, irregular geometries. Various methods exist for solving the RTE, including the zonal, Monte Carlo, spherical harmonics, discrete ordinates, and finite volume methods. Traditional mesh-based approaches, which rely on structured or unstructured meshes, struggle with irregular geometries due to: a) the difficulty of conforming structured grids to irregular domains, b) challenges in enforcing boundary conditions correctly, and c) the additional computational cost of unstructured mesh methods. This work presents a second-order accurate method for solving the RTE in irregular geometries. The radiation intensity is discretized using the finite-volume method in both spatial and angular directions on regular Cartesian grid blocks. Leveraging the block-structured adaptive mesh refinement (AMR) framework provided by AMReX, our method refines the grid locally to reduce spatial discretization error, ensuring a converged numerical solution while minimizing computational costs elsewhere. A two-stage deferred correction approach is employed: First, a first-order discretization on grid blocks is solved using an algebraic multigrid method in HYPRE. Second, a correction term is applied explicitly to achieve second-order accuracy. The correction term is calculated by approximating the radiation flux on cell faces using a Total Variation Diminishing (TVD) scheme. This approach ensures quick convergence of the multigrid method while preserving higher-order accuracy of the numerical solution. Irregular geometries are resolved as embedded boundaries (EB), resulting in both cut cells and regular cells. In cut cells, we modify the fluxes using face fractions and incorporate additional contributions from EB boundary conditions. To ensure higher-order convergence near the EB interface, the correction term is modified by interpolating the radiation intensity to fictitious ghost points. The implementation takes advantage of modern supercomputers by leveraging AMReX’sMPI/X parallelization strategy where X can be MPI or a GPU accelerator including CUDA, HIP and DPC++. We validate our solver using classical test cases, both with and without EB, demonstrating accuracy and efficiency. Additionally, we analyze the impact of adaptive mesh refinement on solution accuracy and computational cost, highlighting the advantages of our approach for high-resolution radiation transport simulations.

computational fluid dynamics (CFD)↗

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.↗

DOE OSTI2023

Computing rank‐revealing factorizations of matrices stored out‐of‐core

This paper describes efficient algorithms for computing rank-revealing factorizations of matrices that are too large to fit in main memory (RAM), and must instead be stored on slow external memory devices such as disks (out-of-core or out-of-memory). Traditional algorithms for computing rank-revealing factorizations (such as the column pivoted QR factorization and the singular value decomposition) are very communication intensive as they require many vector-vector and matrix-vector operations, which become prohibitively expensive when data is not in RAM. Randomization allows to reformulate new methods so that large contiguous blocks of the matrix are processed in bulk. The paper describes two distinct methods. The first is a blocked version of column pivoted Householder QR, organized as a “left-looking” method to minimize the number of the expensive write operations. The second method results employs a UTV factorization. It is organized as an algorithm-by-blocks to overlap computations and I/O operations. As it incorporates power iterations, it is much better at revealing the numerical rank. Numerical experiments on several computers demonstrate that the new algorithms are almost as fast when processing data stored on slow memory devices as traditional algorithms are for data stored in RAM.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

Description of spin–orbit coupling in excited states with two-component methods based on approximate coupled-cluster theory

A generalization of the approximated coupled-cluster singles and doubles method and the algebraic diagrammatic construction scheme up to second order to two-component spinors obtained from a relativistic Hartree–Fock calculation is reported. Computational results for zero-field splittings of atoms and monoatomic cations, triplet lifetimes of two organic molecules, and the spin-forbidden part of the UV/Vis absorption spectrum of tris(ethylenediamine)cobalt(III) are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2015

Extremal chiral ring states in the AdS/CFT correspondence are described by free fermions for a generalized oscillator algebra

This paper studies a special class of states for the dual conformal field theories associated with supersymmetric AdS 5 ×X compactifications, where X is a Sasaki-Einstein manifold with additional U(1) symmetries. Under appropriate circumstances, it is found that elements of the chiral ring that maximize the additional U(1) charge at fixed R-charge are in one to one correspondence with multitraces of a single composite field. This is also equivalent to Schur functions of the composite field. It is argued that in the formal zero coupling limit that these dual field theories have, the different Schur functions are orthogonal. Together with large N counting arguments, one predicts that various extremal three point functions are identical to those of N=4 SYM, except for a single normalization factor, which can be argued to be related to the R-charge of the composite word. The leading and subleading terms in 1/N are consistent with a system of free fermions for a generalized oscillator algebra. Finally, one can further test this conjecture by constructing coherent states for the generalized oscillator algebra that can be interpreted as branes exploring a subset of the moduli space of the field theory and use these to compute the effective Kähler potential on this subset of the moduli space.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗