Search NASA⌕ Search

SEARCH · Search NASA

Results for “Abstract 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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Scalar fields in 3D asymptotically flat higher-spin gravity

Abstract In this work we construct a novel associative algebra and use it to define a theory of higher-spin gravity in (2 + 1)-dimensional asymptotically flat spacetimes. Our construction is based on a quotient of the universal enveloping algebra of i s l ( 2 , R ) with respect to the ideal generated by its Casimir elements, the mass squared M 2 and the three-dimensional analogue of the square of the Pauli–Lubanski vector S and propose to call the resulting associative algebra i h s ( M 2 , S ) . We provide a definition of its generators and even though we are not yet able to provide the complete set of multiplication rules of this algebra our analysis allows us to study many interesting and relevant sub-structures of i h s ( M 2 , S ) . We then show how to consistently couple a scalar field to an i h s ( M 2 , S ) higher-spin gauge theory.

Physics↗
DOE OSTI2024

Surface science insight note: A linear algebraic approach to elucidate native films on Fe 3 O 4 surface

Standard materials are often used to obtain spectra that can be compared to those from unknown samples. Spectra measured from these known substances are also used as a means of computing sensitivity factors to allow quantification by X-ray photoelectron spectroscopy (XPS) of less well-defined materials. Spectra from known materials also provide line shapes suitable for inclusion in spectral models which, when fitted to spectra, permit the chemical state for a sample to be assessed. Both types of information depend on isolating photoemission signals from the inelastically scattered signal. In this Insight note, technical issues associated with the use of XPS of as received Fe 3 O 4 powder sample surface are discussed. The Insight note is designed to show how linear algebraic techniques applied to data collected from a sample marketed as pure Fe 3 O 4 powder are used to verify that XPS has been performed on chemistry representative of the sample. The methods described in this Insight note can further be utilized in elucidating complex XPS data obtained from thin films formed or evolved during cyclic/non-steady use of complex (electro)catalyst surfaces, especially in the presence of contaminants.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1969

Introduction to abstract analysis

This book, which grew out of lectures given at the NASA Lewis Research Center, introduces the scientist and engineer with the usual background in applied mathematics to the concepts of abstract analysis. The emphasis is not on preparing the reader to do research in the field but on giving him some of the background necessary for reading the literature of pure mathematics. Although the material here is by no means original, the presentation differs in some respects from texts on material of this nature. The proofs are more detailed herein and quite easy to follow. We have attempted to indicate how the material relates to and serves as a foundation for more advanced sub- jects. We have also attempted at several places to show how the material covered here relates to the more familiar “real mathematics.” Enough examples are included to illustrate the concepts. No attempt is made to indicate the original sources of the material or even to point out the originators of all the concepts. Contrary to the usual practice, the relation between convergence and continuity on the one hand and algebraic operations on the other is dis- cussed in the abstract setting of linear spaces. This is done principally to familiarize the reader with these very important concepts in a reasonably simple way.

Marvin E Goldstein↗
DOE OSTI2022

A symbolic framework to obtain mid-fidelity models of flexible multibody systems with application to horizontal-axis wind turbines

Abstract. The article presents a symbolic framework (also called computer algebra program) that is used to obtain, in symbolic mathematical form, the linear and nonlinear equations of motion of a mid-fidelity multibody system including rigid and flexible bodies. Our approach is based on Kane's method and a nonlinear shape function representation for flexible bodies. The shape function approach does not represent the state of the art for flexible multibody dynamics but is an effective trade-off to obtain mid-fidelity models with few degrees of freedom, taking advantage of the separation of space and time. The method yields compact symbolic equations of motion with implicit account of the constraints. The general and automatic framework facilitates the creation and manipulation of models with various levels of complexity by adding or removing degrees of freedom. The symbolic treatment allows for analytical gradients and linearized equations of motion. The linear and nonlinear equations can be exported to Python code or dedicated software. There are multiple applications, such as time domain simulation, stability analyses, frequency domain analyses, advanced controller design, state observers, and digital twins. In this article, we describe the method we used to systematically generate the equations of motion of multibody systems and present the implementation of the framework using the Python package SymPy. We apply the framework to generate illustrative land-based and offshore wind turbine models. We compare our results with OpenFAST simulations and discuss the advantages and limitations of the method. The Python implementation is provided as an open-source project.

Branlard, Emmanuel (ORCID:0000000277506128)↗
NASA NTRS1987

Stochastic control of infinite dimensional systems in Hilbert space: A factorization perspective

A factorization perspective on problems of optimal causal estimation and optimal causal control of linear stochastic systems defined on an infinite-dimensional Hilbert space is presented. A separation principle is derived for the case in which the system input/output map is generated by an abstract evolution operator. The factorization formalism allows for an essentially algebraic approach to these problems.

Milman, Mark M.↗
NASA NTRS1978

Extending reliability: Transformational tailoring of abstract mathematical software

Methods for automatically constructing concrete executable programs from an abstract prototype program by applying transformations based on theorems of matrix algebra and on algebraic properties of programming languages are described. These methods provide a user with highly efficient programs tailored to his environment while maintaining the advantages of high reliability and low cost associated with routines from the best mathematical software libraries. Also, the transformations which produce such programs represent a formal codification of rules for writing linear algebra programs.

Boyle, J. M.↗
NASA NTRS1989

A spatial operator algebra for manipulator modeling and control

A recently developed spatial operator algebra, useful for modeling, control, and trajectory design of manipulators is discussed. The elements of this algebra are linear operators whose domain and range spaces consist of forces, moments, velocities, and accelerations. The effect of these operators is equivalent to a spatial recursion along the span of a manipulator. Inversion of operators can be efficiently obtained via techniques of recursive filtering and smoothing. The operator algebra provides a high level framework for describing the dynamic and kinematic behavior of a manipulator and control and trajectory design algorithms. The interpretation of expressions within the algebraic framework leads to enhanced conceptual and physical understanding of manipulator dynamics and kinematics. Furthermore, implementable recursive algorithms can be immediately derived from the abstract operator expressions by inspection. Thus, the transition from an abstract problem formulation and solution to the detailed mechanizaton of specific algorithms is greatly simplified. The analytical formulation of the operator algebra, as well as its implementation in the Ada programming language are discussed.

Rodriguez, G.↗
DOE OSTI2021

Preparing an Incompressible-Flow Fluid Dynamics Code for Exascale-Class Wind Energy Simulations

The U.S. Department of Energy has identified exascale-class wind farm simulation as critical to wind energy scientific discovery. A primary objective of the ExaWind project is to build high-performance, predictive computational fluid dynamics (CFD) tools that satisfy these modeling needs. GPU accelerators will serve as the computational thoroughbreds of next-generation, exascale-class supercomputers. Here, we report on our efforts in preparing the ExaWind unstructured mesh solver, Nalu-Wind, for exascale-class machines. For computing at this scale, a simple port of the incompressible-flow algorithms to GPUs is insufficient. To achieve high performance, one needs novel algorithms that are application aware, memory efficient, and optimized for the latest-generation GPU devices. The result of our efforts are unstructured-mesh simulations of wind turbines that can effectively leverage thousands of GPUs. In particular, we demonstrate a first-of-its-kind, incompressible-flow simulation using Algebraic Multigrid solvers that strong scales to more than 4000 GPUs on the Summit supercomputer.

algebraic multigrid↗
DOE OSTI2021

Porting hypre to heterogeneous computer architectures: Strategies and experiences

We report that linear systems are occurring in many applications, and solving them can take a large amount of the total simulation time. The high performance library hypre provides a variety of interfaces and linear solvers, including various multigrid methods, that have achieved good scalability on a variety of homogeneous parallel computer architectures. Heterogeneous architectures with nodes that have both CPUs and accelerators provide new challenges, since they require more fine-grained parallelism and reduced data movement between different memories on a single node as well as across nodes. We will discuss our experiences and strategies to port hypre to heterogeneous computers with accelerators, including the design of a new memory model, the use of abstractions, the BoxLoop macros in the structured and semi-structured interfaces, and the restructuring of algebraic multigrid (AMG) into modular components. We present numerical experiments comparing CPU and GPU performance for several test problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Co-design for Particle Applications at Exascale

Co-design across the Exascale Computing Project (ECP) has been critical for both enabling science applications and bringing disparate communities together. Developing and porting applications to the various high-performance computing (HPC) architectures on pre-exascale and exascale computers has been quite challenging due to the diversity of hardware features and software stacks. The Co-design Center for Particle Applications (CoPA) has developed and enhanced the Cabana and PROGRESS/BML libraries to facilitate the creation of new particle applications, make existing particle applications exascale capable, and allow teams to explore new capabilities. Particle methods from atomistic, mesoscale, continuum, through cosmological scales have been built with Cabana, along with new possibilities for application coupling. Similarly, the PROGRESS/BML library has enabled quantum particle applications with linear algebra solvers to use advanced hardware. Across these CoPA-developed libraries, the co-design abstraction layer combines performance portability with math library support to facilitate separation of concerns and directly support science runs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

LaRIS: Targeting Portability and Productivity for LAPACK Codes on Extreme Heterogeneous Systems by Using IRIS

In keeping with the trend of heterogeneity in high-performance computing, hardware manufacturers and vendors are developing new architectures and associated software stacks (e.g., libraries) to harness the best possible performance from commonly used kernels (e.g., linear algebra kernels). However, kernels tuned for one architecture are not portable to others. Moreover, the coexistence of different architectures in a single node makes orchestration difficult. To address these challenges, we introduce LaRIS, a portable framework for LAPACK functionalities. LaRIS ensures a separation between linear algebra algorithms and vendor-library kernels by using the IRIS run time and IRIS-BLAS library. Such abstraction at the algorithm level makes the implementation completely agnostic to the vendor library and architecture. LaRIS uses the IRIS run time to dynamically select the vendor-library kernel and suitable processor architecture at run time. Through LU factorization, we demonstrate that LaRIS can fully utilize different heterogeneous systems by launching and orchestrating different vendor-library kernels without any change in the source code.

Monil, M. A. H.↗
DOE OSTI2024

Effective rationality for local unitary invariants of mixed states of two qubits

Abstract We calculate the field of rational local unitary invariants for mixed states of two qubits, by employing methods from algebraic geometry. We prove that this field is rational (i.e. purely transcendental), and that it is generated by nine algebraically independent polynomial invariants. We do so by constructing a relative section, in the sense of invariant theory, whose Weyl group is a finite abelian group. From this construction, we are able to give explicit expressions for the generating invariants in terms of the Bloch matrix representation of mixed states of two qubits. We also prove similar rationality results for the local unitary invariants of symmetrically mixed states of two qubits. We also provide a sketch of how to generalize our results to the case of an arbitrary number of qubits. Our results apply to both complex-valued and real-valued invariants.

Physics↗
DOE OSTI2024

3-Manifolds and VOA Characters

Abstract By studying the properties ofq-series$$\widehat{Z}$$ Z ^ -invariants, we develop a dictionary between 3-manifolds and vertex algebras. In particular, we generalize previously known entries in this dictionary to Lie groups of higher rank, to 3-manifolds with toral boundaries, and to BPS partition functions with line operators. This provides a new physical realization of logarithmic vertex algebras in the framework of the 3d-3d correspondence and opens new avenues for their future study. For example, we illustrate how invoking a knot-quiver correspondence for$$\widehat{Z}$$ Z ^ -invariants leads to many infinite families of new fermionic formulae for VOA characters.

Physics↗
DOE OSTI2022

Deep Learning for Subgrid‐Scale Turbulence Modeling in Large‐Eddy Simulations of the Convective Atmospheric Boundary Layer

Abstract In large‐eddy simulations, subgrid‐scale (SGS) processes are parameterized as a function of filtered grid‐scale variables. First‐order, algebraic SGS models are based on the eddy‐viscosity assumption, which does not always hold for turbulence. Here we apply supervised deep neural networks (DNNs) to learn SGS stresses from a set of neighboring coarse‐grained velocity from direct numerical simulations of the convective boundary layer at friction Reynolds numbers Re τ up to 1243 without invoking the eddy‐viscosity assumption. The DNN model was found to produce higher correlation between SGS stresses compared to the Smagorinsky model and the Smagorinsky‐Bardina mixed model in the surface and mixed layers and can be applied to different grid resolutions and various stability conditions ranging from near neutral to very unstable. The DNN model can capture key statistics of turbulence in a posteriori (online) tests when applied to large‐eddy simulations of the atmospheric boundary layer.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1989

Efficient computer algebra algorithms for polynomial matrices in control design

The theory of polynomial matrices plays a key role in the design and analysis of multi-input multi-output control and communications systems using frequency domain methods. Examples include coprime factorizations of transfer functions, cannonical realizations from matrix fraction descriptions, and the transfer function design of feedback compensators. Typically, such problems abstract in a natural way to the need to solve systems of Diophantine equations or systems of linear equations over polynomials. These and other problems involving polynomial matrices can in turn be reduced to polynomial matrix triangularization procedures, a result which is not surprising given the importance of matrix triangularization techniques in numerical linear algebra. Matrices with entries from a field and Gaussian elimination play a fundamental role in understanding the triangularization process. In the case of polynomial matrices, matrices with entries from a ring for which Gaussian elimination is not defined and triangularization is accomplished by what is quite properly called Euclidean elimination. Unfortunately, the numerical stability and sensitivity issues which accompany floating point approaches to Euclidean elimination are not very well understood. New algorithms are presented which circumvent entirely such numerical issues through the use of exact, symbolic methods in computer algebra. The use of such error-free algorithms guarantees that the results are accurate to within the precision of the model data--the best that can be hoped for. Care must be taken in the design of such algorithms due to the phenomenon of intermediate expressions swell.

Baras, J. S.↗
NASA NTRS1995

Formal development of a clock synchronization circuit

This talk presents the latest stage in formal development of a fault-tolerant clock synchronization circuit. The development spans from a high level specification of the required properties to a circuit realizing the core function of the system. An abstract description of an algorithm has been verified to satisfy the high-level properties using the mechanical verification system EHDM. This abstract description is recast as a behavioral specification input to the Digital Design Derivation system (DDD) developed at Indiana University. DDD provides a formal design algebra for developing correct digital hardware. Using DDD as the principle design environment, a core circuit implementing the clock synchronization algorithm was developed. The design process consisted of standard DDD transformations augmented with an ad hoc refinement justified using the Prototype Verification System (PVS) from SRI International. Subsequent to the above development, Wilfredo Torres-Pomales discovered an area-efficient realization of the same function. Establishing correctness of this optimization requires reasoning in arithmetic, so a general verification is outside the domain of both DDD transformations and model-checking techniques. DDD represents digital hardware by systems of mutually recursive stream equations. A collection of PVS theories was developed to aid in reasoning about DDD-style streams. These theories include a combinator for defining streams that satisfy stream equations, and a means for proving stream equivalence by exhibiting a stream bisimulation. DDD was used to isolate the sub-system involved in Torres-Pomales' optimization. The equivalence between the original design and the optimized verified was verified in PVS by exhibiting a suitable bisimulation. The verification depended upon type constraints on the input streams and made extensive use of the PVS type system. The dependent types in PVS provided a useful mechanism for defining an appropriate bisimulation.

Miner, Paul S.↗
NASA NTRS1995

The scheme machine: A case study in progress in design derivation at system levels

The Scheme Machine is one of several design projects of the Digital Design Derivation group at Indiana University. It differs from the other projects in its focus on issues of system design and its connection to surrounding research in programming language semantics, compiler construction, and programming methodology underway at Indiana and elsewhere. The genesis of the project dates to the early 1980's, when digital design derivation research branched from the surrounding research effort in programming languages. Both branches have continued to develop in parallel, with this particular project serving as a bridge. However, by 1990 there remained little real interaction between the branches and recently we have undertaken to reintegrate them. On the software side, researchers have refined a mathematically rigorous (but not mechanized) treatment starting with the fully abstract semantic definition of Scheme and resulting in an efficient implementation consisting of a compiler and virtual machine model, the latter typically realized with a general purpose microprocessor. The derivation includes a number of sophisticated factorizations and representations and is also deep example of the underlying engineering methodology. The hardware research has created a mechanized algebra supporting the tedious and massive transformations often seen at lower levels of design. This work has progressed to the point that large scale devices, such as processors, can be derived from first-order finite state machine specifications. This is roughly where the language oriented research stops; thus, together, the two efforts establish a thread from the highest levels of abstract specification to detailed digital implementation. The Scheme Machine project challenges hardware derivation research in several ways, although the individual components of the system are of a similar scale to those we have worked with before. The machine has a custom dual-ported memory to support garbage collection. It consists of four tightly coupled processes--processor, collector, allocator, memory--with a very non-trivial synchronization relationship. Finally, there are deep issues of representation for the run-time objects of a symbolic processing language. The research centers on verification through integrated formal reasoning systems, but is also involved with modeling and prototyping environments. Since the derivation algebra is basd on an executable modeling language, there is opportunity to incorporate design animation in the design process. We are looking for ways to move smoothly and incrementally from executable specifications into hardware realization. For example, we can run the garbage collector specification, a Scheme program, directly against the physical memory prototype, and similarly, the instruction processor model against the heap implementation.

Johnson, Steven D.↗
NASA NTRS1973

Development of guidelines for the definition of the relavant information content in data classes

The problem of experiment design is defined as an information system consisting of information source, measurement unit, environmental disturbances, data handling and storage, and the mathematical analysis and usage of data. Based on today's concept of effective computability, general guidelines for the definition of the relevant information content in data classes are derived. The lack of a universally applicable information theory and corresponding mathematical or system structure is restricting the solvable problem classes to a small set. It is expected that a new relativity theory of information, generally described by a universal algebra of relations will lead to new mathematical models and system structures capable of modeling any well defined practical problem isomorphic to an equivalence relation at any corresponding level of abstractness.

Schmitt, E.↗