SEARCH · Search NASA

Results for “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 271 records · Page 15

All sources NASA NTRS DOE OSTI

NASA NTRS1993

Development of an algebraic stress/two-layer model for calculating thrust chamber flow fields

Following the consensus of a workshop in Turbulence Modeling for Liquid Rocket Thrust Chambers, the current effort was undertaken to study the effects of second-order closure on the predictions of thermochemical flow fields. To reduce the instability and computational intensity of the full second-order Reynolds Stress Model, an Algebraic Stress Model (ASM) coupled with a two-layer near wall treatment was developed. Various test problems, including the compressible boundary layer with adiabatic and cooled walls, recirculating flows, swirling flows and the entire SSME nozzle flow were studied to assess the performance of the current model. Detailed calculations for the SSME exit wall flow around the nozzle manifold were executed. As to the overall flow predictions, the ASM removes another assumption for appropriate comparison with experimental data, to account for the non-isotropic turbulence effects.

Chen, C. P.↗

NASA NTRS1992

Application of algebraic-RNG eddy viscosity model to simulation of transitional boundary layer flow

An algebraic eddy-viscosity model is derived from the renormalization group (RNG) theory of turbulence. A new length scale, based on boundary layer characteristics (displacement thickness, shape factor), is proposed. The model was applied to transitional boundary layer flow over a flat plate. Integral characteristics, such as the total skin friction coefficient, and mean velocity profile across the boundary layer, are found to be in good agreement with experimental data.

Yakhot, Alexander↗

NASA NTRS1995

Implementation of algebraic stress models in a general 3-D Navier-Stokes method (PAB3D)

A three-dimensional multiblock Navier-Stokes code, PAB3D, which was developed for propulsion integration and general aerodynamic analysis, has been used extensively by NASA Langley and other organizations to perform both internal (exhaust) and external flow analysis of complex aircraft configurations. This code was designed to solve the simplified Reynolds Averaged Navier-Stokes equations. A two-equation k-epsilon turbulence model has been used with considerable success, especially for attached flows. Accurate predicting of transonic shock wave location and pressure recovery in separated flow regions has been more difficult. Two algebraic Reynolds stress models (ASM) have been recently implemented in the code that greatly improved the code's ability to predict these difficult flow conditions. Good agreement with Direct Numerical Simulation (DNS) for a subsonic flat plate was achieved with ASM's developed by Shih, Zhu, and Lumley and Gatski and Speziale. Good predictions were also achieved at subsonic and transonic Mach numbers for shock location and trailing edge boattail pressure recovery on a single-engine afterbody/nozzle model.

Abdol-Hamid, Khaled S.↗

NASA NTRS1996

A Galilean Invariant Explicit Algebraic Reynolds Stress Model for Curved Flows

A Galilean invariant weak-equilbrium hypothesis that is sensitive to streamline curvature is proposed. The hypothesis leads to an algebraic Reynolds stress model for curved flows that is fully explicit and self-consistent. The model is tested in curved homogeneous shear flow: the agreement is excellent with Reynolds stress closure model and adequate with available experimental data.

Girimaji, Sharath↗

NASA NTRS1996

An Algebraic Multigrid Solver for Navier-Stokes Problems in the Discrete Second-Order Approximation

An algebraic multigrid scheme is presented for solving the discrete Navier-Stokes equations to second-order accuracy using the defect-correction method. Solutions have been obtained for problems involving both structured and unstructured meshes, with the resolution and resolution grading controlled by global and local mesh refinements. The solver is efficient and robust to the extent that no underrelaxation of variables has been required to ensure convergence, but rates of convergence can be improved with small amounts of underrelaxation of the velocity-pressure coupling. Provided that the computational mesh can resolve the flow field, convergence characteristics are almost mesh independent. Rates of convergence actually improve with refinement, asymptotically approaching mesh independent values. For extremely coarse meshes where dispersive truncation errors would be expected to prevent convergence (or even induce divergence), solutions can still be obtained by using explicit underrelaxation in the iterative cycle.

Webster, R.↗

NASA NTRS1999

Statecharts Via Process Algebra

Statecharts is a visual language for specifying the behavior of reactive systems. The Language extends finite-state machines with concepts of hierarchy, concurrency, and priority. Despite its popularity as a design notation for embedded system, precisely defining its semantics has proved extremely challenging. In this paper, a simple process algebra, called Statecharts Process Language (SPL), is presented, which is expressive enough for encoding Statecharts in a structure-preserving and semantic preserving manner. It is establish that the behavioral relation bisimulation, when applied to SPL, preserves Statecharts semantics

Luttgen, Gerald↗

NASA NTRS1999

Combining Automated Theorem Provers with Symbolic Algebraic Systems: Position Paper

In contrast to pure mathematical applications where automated theorem provers (ATPs) are quite capable, proof tasks arising form real-world applications from the area of Software Engineering show quite different characteristics: they usually do not only contain much arithmetic (albeit often quite simple one), but they also often contain reasoning about specific structures (e.g. graphics, sets). Thus, an ATP must be capable of performing reasoning together with a fair amount of simplification, calculation and solving. Therefore, powerful simplifiers and other (symbolic and semi-symbolic) algorithms seem to be ideally suited to augment ATPs. In the following we shortly describe two major points of interest in combining SASs (symbolic algebraic systems) with top-down automated theorem provers (here: SETHEO [Let92, GLMS94]).

Schumann, Johann↗

NASA NTRS1998

Algebraic Nonoverlapping Domain Decomposition Methods for Stabilized FEM and FV Discretizations

We consider preconditioning methods for convection dominated fluid flow problems based on a nonoverlapping Schur complement domain decomposition procedure for arbitrary triangulated domains. The triangulation is first partitioned into a number of subdomains and interfaces which induce a natural 2 x 2 partitioning of the p.d.e. discretization matrix. We view the Schur complement induced by this partitioning as an algebraically derived coarse space approximation. This avoids the known difficulties associated with the direct formation of an effective coarse discretization for advection dominated equations. By considering various approximations of the block factorization of the 2 x 2 system, we have developed a family of robust preconditioning techniques. A computer code based on these ideas has been developed and tested on the IBM SP2 using MPI message passing protocol. A number of 2-D CFD calculations will be presented for both scalar advection-diffusion equations and the Euler equations discretized using stabilized finite element and finite volume methods. These results show very good scalability of the preconditioner for various discretizations as the number of processors is increased while the number of degrees of freedom per processor is fixed.

Barth, Timothy J.↗

NASA NTRS2002

A Deterministic Interfacial Cyclic Oxidation Spalling Model: Algebraic Approximation, Descriptive Parameters, and Normalized Universal Curve - Part 2

A cyclic oxidation interfacial spalling model has been developed in Part 1. The governing equations have been simplified here by substituting a new algebraic expression for the series (Good-Smialek approximation). This produced a direct relationship between cyclic oxidation weight change and model input parameters. It also allowed for the mathematical derivation of various descriptive parameters as a function of the inputs. It is shown that the maximum in weight change varies directly with the parabolic rate constant and cycle duration and inversely with the spall fraction, all to the 1/2 power. The number of cycles to reach maximum and zero weight change vary inversely with the spall fraction, and the ratio of these cycles is exactly 1:3 for most oxides. By suitably normalizing the weight change and cycle number, it is shown that all cyclic oxidation weight change model curves can be represented by one universal expression for a given oxide scale.

Smialek, James L.↗

NASA NTRS2005

Assessment of an Explicit Algebraic Reynolds Stress Model

This study assesses an explicit algebraic Reynolds stress turbulence model in the in the three-dimensional Reynolds averaged Navier-Stokes (RANS) solver, ISAAC (Integrated Solution Algorithm for Arbitrary Con gurations). Additionally, it compares solutions for two select configurations between ISAAC and the RANS solver PAB3D. This study compares with either direct numerical simulation data, experimental data, or empirical models for several different geometries with compressible, separated, and high Reynolds number flows. In general, the turbulence model matched data or followed experimental trends well, and for the selected configurations, the computational results of ISAAC closely matched those of PAB3D using the same turbulence model.

Carlson, Jan-Renee↗

NASA NTRS2008

Improved Linear Algebra Methods for Redshift Computation from Limited Spectrum Data - II

Given photometric broadband measurements of a galaxy, Gaussian processes may be used with a training set to solve the regression problem of approximating the redshift of this galaxy. However, in practice solving the traditional Gaussian processes equation is too slow and requires too much memory. We employed several methods to avoid this difficulty using algebraic manipulation and low-rank approximation, and were able to quickly approximate the redshifts in our testing data within 17 percent of the known true values using limited computational resources. The accuracy of one method, the V Formulation, is comparable to the accuracy of the best methods currently used for this problem.

Foster, Leslie↗

NASA NTRSDate not supplied

Sparse Linear Algebra Toolkit for Computational Aerodynamics

Finding solutions to sparse linear systems of equations is an essential step in Computational Engineering applications of interest to NASA. Linear systems of equations are composed and solved in almost every computational engineering application. The characteristics of linear systems vary greatly from one application to another. Accordingly, there are a wide variety of methods for the solution of linear systems of equations. The operations and methods prepared by the authors are focused on linear systems of interest to NASA, primarily those associated with Computational Fluid Dynamics (CFD), Aeroelasticity, and Aeroacoustics. The Sparse Linear Algebra Toolkit (SLAT) is a coordinated collection of software featuring operations, methods, and data structures that are useful when solving sparse linear systems of equations on modern computer architectures. The implemented operations and methods are designed and tuned for parallelism in shared memory, in distributed memory, and across the hybrid combination of distributed-shared memory. The toolkit includes novel methods and implementations for modern architectures and facilitates development of new approaches for meeting NASA’s evolving computational engineering challenges using evolving computer architectures that are not available in vendor libraries. In this paper, significant features and interfaces within SLAT are presented and verified for simulations performed with NASA’s CFD solver, FUN3D. The runtime and scaling performance of the Generalized Minimum Residual (GMRES) method implemented in SLAT is analyzed for the linear subproblems within the solution of turbulent Navier-Stokes equations employed in the simulation of high-lift configurations. Prior to this work, the SPARSKIT GMRES implementation was the only Krylov subspace method available within FUN3D. A strong scaling study shows the SLAT GMRES implementation facilitates accurate Reynolds-averaged Navier-Stokes CFD solutions between 15% and 56% faster than the SPARSKIT GMRES implementation.

Stephen L Wood↗

NASA NTRSDate not supplied

Memory Optimizations for Sparse Linear Algebra on GPU Hardware

An effort to maximize memory bandwidth utilization for a sparse linear algebra kernel executing on NVIDIA® Tesla V100 and A100 Graphics Processing Units (GPUs) is described. The kernel consists of a block-sparse matrix-vector product and a series of forward/backward triangular solves. The computation is memory-bound and exhibits low arithmetic intensity. Along with a relatively small block size, the data layout poses a challenge to effectively utilize the available memory bandwidth on common GPU architectures. An earlier implementation using a warp to process a single row of the matrix was found to yield good memory performance on the V100 architecture. However, anew approach, which assigns a warp to six rows of the matrix, is proposed for the A100. In addition, two new features offered by the A100 architecture are explored.L2residency control enables a portion of theL2cache to be used for persistent data access, and the asynchronous copy instruction allows data to be loaded directly from main memory into shared memory. Demonstrations show that the new implementation improves memory bandwidth utilization from 71.5% to 81.2% of the peak available on theA100 architecture.

GPU↗

NASA NTRSDate not supplied

Using Multiplicative Algebraic Reconstruction Techniques (MART) to Derive Instrument Requirements for Computed Tomography Imaging Spectrographs

Computed Tomography Imaging Spectrographs (CTISs), which are generally slitless or large-aperture spectrographs that observe a wide, dispersed field of view in multiple dispersion angles or diffraction orders, provide a unique opportunity to capture spectral information over an extended source, such as the Sun, but require software reconstruction techniques to be fully utilized. A useful data product that can be recovered from CTIS observations is intensity maps of solar features in single spectral lines. These intensity maps can then be used to determine temperature, density, abundance, and equilibrium properties of the emitting plasma. We apply the multiplicative algebraic reconstruction technique (MART) to example data from a variety of CTIS configurations to determine the capability and limitations of the method to return spectrally-pure maps. By completing this study, we aim to establish a path to derive requirements for CTIS instruments that rely on reconstruction techniques to meet their science objectives.

Amy Winebarger↗

NASA NTRSDate not supplied

A NASA Perspective on Quantum Computing, with Ties to Operator Algebras

The talk will survey work done by the NASA Quantum Artificial Intelligence Laboratory (QuAIL), particularly algorithms and protocols in which operator algebras may play a role. The talk will focus on recent work advancing quantum error correction and error mitigation, and will touch on other topics related to quantum algorithms and funda- mental quantum physics.

Quantum Computing↗

NASA NTRS2025

Pose Estimation in the Geometric Algebra G (3, 0, 1)

Using techniques from Geometric Algebra, methods for solving attitude determination problems are extended to the problem of simultaneously estimating attitude and location, i.e. pose, from direct or indirect measurements of geometric objects including points, lines, and planes. Wahba’s problem is generalized for the solution of initial pose. The multiplicative extended Kalman filter is generalized for the maintenance of pose solutions. Farrankopf’s model for biases in rotation rate sensors is generalized to biases in twist rate measurements. A multiplicative extended Kalman filter for pose in the presence of such biases is developed.

Sensor Bias Modeling↗

DOE OSTI2025

Chiral soft algebras for $\mathcal{N}$ = $2$ gauge theory

Some time ago, Seiberg and Witten solved for moduli spaces of vacua parameterized by scalar vacuum expectation values in $\mathcal{N}$ = $2$ gauge theories. More recently, new vacua associated to soft theorems and asymptotic symmetries have been found. Furthermore, this paper takes some first steps towards a complete picture of the infrared geometry of $\mathcal{N}$ = $2$ gauge theory incorporating both of these infrared structures.

N = 2 gauge theory↗

DOE OSTI2025

Structure of Odd-A Ag Isotopes Studied via Algebraic Approaches

The structure of the odd-A silver isotopes Ag 103–115 is discussed within the frame of the interacting boson–fermion model (IBFM). An overview of their key properties is presented, with a particular attention paid to the “ J -1 anomaly”, represented by an abnormal ordering of the lowest 7/2 + and 9/2 + states. By examining previously published data and newly performed calculations, it is demonstrated that the experimentally known level schemes and electromagnetic properties of Ag 103–115 can be reproduced well within IBFM-1 by using a consistent set of model parameters. The contribution of different single-particle orbitals to the structure of the lowest-lying excited nuclear states in Ag 103–115 is discussed. Given that the J-1 anomaly brings down the 7/2 + level from the j −3 multiplet to energies, which can be thermally populated in hot stellar environments, the importance of low-lying excited states in odd-A silver isotopes for astrophysical processes is outlined.

IBFM-1↗