SEARCH · Engineering Papers

Results for “Algebraic structures”

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 217 records · Page 12

All sources NASA NTRS DOE OSTI

NASA NTRS1990

Third-sound propagation in thick films of superfluid He-4

Atkins' (1959) basic theory of third sound in thick films of superfluid He-4 is extended here to include a heat source for exciting third sound. A one-dimensional model obeying periodic boundary conditions is developed which can represent a variety of experimentally important configurations. General solutions for the model equations are found which give a complete description of third-sound waves in terms of displacement of the film surface, superfluid velocity, and temperature change as functions of space and time. Algebraic expressions for quantities that occur in general formulas are found for special excitation signals. The structure of third sound is calculated for the first time and the results are found to be inconsistent with previous findings. A direct method for accurately measuring the vaporization coefficient is also presented.

Jackson, H. W.↗

NASA NTRS1991

Modelling the pressure-strain correlation of turbulence - An invariant dynamical systems approach

The modeling of the pressure-strain correlation of turbulence is examined from a basic theoretical standpoint with a view toward developing improved second-order closure models. Invariance considerations along with elementary dynamical systems theory are used in the analysis of the standard hierarchy of closure models. In these commonly used models, the pressure-strain correlation is assumed to be a linear function of the mean velocity gradients with coefficients that depend algebraically on the anisotropy tensor. It is proven that for plane homogeneous turbulent flows the equilibrium structure of this hierarchy of models is encapsulated by a relatively simple model which is only quadratically nonlinear in the anisotropy tensor. This new quadratic model - the SSG model - is shown to outperform the Launder, Reece, and Rodi model (as well as more recent models that have a considerably more complex nonlinear structure) in a variety of homogeneous turbulent flows. Some deficiencies still remain for the description of rotating turbulent shear flows that are intrinsic to this general hierarchy of models and, hence, cannot be overcome by the mere introduction of more complex nonlinearities. It is thus argued that the recent trend of adding substantially more complex nonlinear terms containing the anisotropy tensor may be of questionable value in the modeling of the pressure-strain correlation. Possible alternative approaches are discussed briefly.

Speziale, Charles G.↗

NASA NTRS1992

More box codes

A new investigation shows that, starting from the BCH (21,15;3) code represented as a 7 x 3 matrix and adding a row and column to add even parity, one obtains an 8 x 4 matrix (32,15;8) code. An additional dimension is obtained by specifying odd parity on the rows and even parity on the columns, i.e., adjoining to the 8 x 4 matrix, the matrix, which is zero except for the fourth column (of all ones). Furthermore, any seven rows and three columns will form the BCH (21,15;3) code. This box code has the same weight structure as the quadratic residue and BCH codes of the same dimensions. Whether there exists an algebraic isomorphism to either code is as yet unknown.

Solomon, G.↗

NASA NTRS1997

Geopotential Error Analysis from Satellite Gradiometer and Global Positioning System Observables on Parallel Architecture

The recovery of a high resolution geopotential from satellite gradiometer observations motivates the examination of high performance computational techniques. The primary subject matter addresses specifically the use of satellite gradiometer and GPS observations to form and invert the normal matrix associated with a large degree and order geopotential solution. Memory resident and out-of-core parallel linear algebra techniques along with data parallel batch algorithms form the foundation of the least squares application structure. A secondary topic includes the adoption of object oriented programming techniques to enhance modularity and reusability of code. Applications implementing the parallel and object oriented methods successfully calculate the degree variance for a degree and order 110 geopotential solution on 32 processors of the Cray T3E. The memory resident gradiometer application exhibits an overall application performance of 5.4 Gflops, and the out-of-core linear solver exhibits an overall performance of 2.4 Gflops. The combination solution derived from a sun synchronous gradiometer orbit produce average geoid height variances of 17 millimeters.

Schutz, Bob E.↗

DOE OSTI2021

Covariant color-kinematics duality

We show that color-kinematics duality is a manifest property of the equations of motion governing currents and field strengths. For the nonlinear sigma model (NLSM), this insight enables an implementation of the double copy at the level of fields, as well as an explicit construction of the kinematic algebra and associated kinematic current. As a byproduct, we also derive new formulations of the special Galileon (SG) and Born-Infeld (BI) theory. For Yang-Mills (YM) theory, this same approach reveals a novel structure — covariant color-kinematics duality — whose only difference from the conventional duality is that 1/$\square$ is replaced with covariant 1/D 2 . Remarkably, this structure implies that YM theory is itself the covariant double copy of gauged biadjoint scalar (GBAS) theory and an F 3 theory of field strengths encoding a corresponding kinematic algebra and current. Directly applying the double copy to equations of motion, we derive general relativity (GR) from the product of Einstein-YM and F 3 theory. This exercise reveals a trivial variant of the classical double copy that recasts any solution of GR as a solution of YM theory in a curved background. Covariant color-kinematics duality also implies a new decomposition of tree-level amplitudes in YM theory into those of GBAS theory. Using this representation we derive a closed-form, analytic expression for all BCJ numerators in YM theory and the NLSM for any number of particles in any spacetime dimension. By virtue of the double copy, this constitutes an explicit formula for all tree-level scattering amplitudes in YM, GR, NLSM, SG, and BI.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1990

Algebraic grid generation with boundary orthogonality control

This paper presents a new approach in applying the blending function method to the generation of structured finite-difference meshes. It is shown that the surface equation developed by Coons (1967) can be easily adapted to generate two-dimensional meshes, and its extension to hyperspace allows the construction of three-dimensional meshes. The robust method in its basic form blends among the boundary curves/surfaces conforming to their intrinsic slopes. When parameter-controlled boundary-slope corrections are introduced, it is possible to establish varying degrees of orthogonality along the boundaries. Additional controls are made possible by moving points in the parameter space, which affects the movement of points in the physical space. The combination of these controls provides a simple and yet powerful means for exploiting the blending-function method to satisfy the needs of practical CFD applications. Results from a validation program for two-dimensions are shown for a variety of geometries.

Luh, Raymond Ching-Chung↗

DOE OSTI2021

Hypernetwork Science: From Multidimensional Networks to Computational Topology

As data structures and mathematical objects used for complex systems modeling, hypergraphs sit nicely poised between on the one hand the world of network models, and on the other that of higher-order mathematical abstractions from algebra, lattice theory, and topology. They are able to represent complex systems interactions more faithfully than graphs and networks, while also being some of the simplest classes of systems representing topological structures as collections of multidimensional objects connected in a particular pattern. In this paper we discuss the role of (undirected) hypergraphs in the science of complex networks, and provide a mathematical overview of the core concepts needed for hypernetwork modeling, including duality and the relationship to bicolored graphs, quantitative adjacency and incidence, the nature of walks in hypergraphs, and available topological relationships and properties. We close with a brief discussion of two example applications: biomedical databases for disease analysis, and domain-name system (DNS) analysis of cyber data.

Joslyn, Cliff A.↗

DOE OSTI2023

Extending PETSc's Composable Hierarchical Solvers (Final Technical Report)

This report documents research activities conducted at CU Boulder as part of Extending PETSc’s Composable Hierarchical Solvers, which has been part of a collaboration with Argonne National Laboratory (separate award). Our work has focused on performance-portable end-to-end GPU solvers demonstrated via exemplary applications in nonlinear fluid and structural mechanics. We describe advances in algorithmic composition and analysis in the context of these applications, but the implementations are fully documented and decoupled, and in use by other projects. We believe the vertical integration achieved through collaboration with ECP’s CEED and the PSAAP center at CU was necessary to take risks with data structures and algorithms.

42 ENGINEERING↗

DOE OSTI2022

Model Predictive Control of Discrete-Continuous Energy Systems via Generalized Disjunctive Programming

Generalized Disjunctive Programming (GDP) provides an alternative framework to model optimization problems with both discrete and continuous variables. The key idea behind GDP involves the use of logical disjunctions to represent discrete decisions in the continuous space, and logical propositions to denote algebraic constraints in the discrete space. Compared to traditional mixed-integer programming (MIP), the inherent logic structure in GDP yields tighter relaxations that are exploited by global branch and bound algorithms to improve solution quality. In this paper, we present a general GDP model for optimal control of hybrid systems that exhibit both discrete and continuous dynamics. Specifically, we use GDP to formulate a model predictive control (MPC) model for piecewise-affine systems with implicit switching logic. As an example, the GDP-based MPC approach is used as a supervisory control to improve energy efficiency in residential buildings with binary on/off, relay-based thermostats. A simulation study is used to demonstrate the validity of the proposed approach, and the improved solution quality compared to existing MIPbased control approaches.

Bhattacharya, Arnab↗

NASA NTRS1972

A method of limit point calculation in finite element structural analysis

An approach is presented for the calculation of limit points for structures described by discrete coordinates, and whose governing equations derive from finite element concepts. The nonlinear load-displacement path of the imperfect structure is first traced by use of a direct iteration scheme and the determinant of the governing algebraic equations is calculated at each solution point. The limit point is then established by extrapolation and imposition of the condition of zero slope of the plot of load vs. determinant. Three problems are solved in illustration of the approach and in comparison with alternative procedures and test data.

Gallagher, R. H.↗

NASA NTRS1982

Conference on Complex Turbulent Flows: Comparison of Computation and Experiment, Stanford University, Stanford, CA, September 14-18, 1981, Proceedings. Volume 2 - Taxonomies, reporters' summaries, evaluation, and conclusions

Computational techniques for simulating turbulent flows were explored, together with the results of experimental investigations. Particular attention was devoted to the possibility of defining a universal closure model, applicable for all turbulence situations; however, conclusions were drawn that zonal models, describing localized structures, were the most promising techniques to date. The taxonomy of turbulent flows was summarized, as were algebraic, differential, integral, and partial differential methods for numerical depiction of turbulent flows. Numerous comparisons of theoretically predicted and experimentally obtained data for wall pressure distributions, velocity profiles, turbulent kinetic energy profiles, Reynolds shear stress profiles, and flows around transonic airfoils were presented. Simplifying techniques for reducing the necessary computational time for modeling complex flowfields were surveyed, together with the industrial requirements and applications of computational fluid dynamics techniques.

Kline, S. J.↗

NASA NTRS1992

Non-scalar uncertainty: Uncertainty in dynamic systems

The following point is stated throughout the paper: dynamic systems are usually subject to uncertainty, be it the unavoidable quantic uncertainty when working with sufficiently small scales or when working in large scales uncertainty can be allowed by the researcher in order to simplify the problem, or it can be introduced by nonlinear interactions. Even though non-quantic uncertainty can generally be dealt with by using the ordinary probability formalisms, it can also be studied with the proposed non-scalar formalism. Thus, non-scalar uncertainty is a more general theoretical framework giving insight into the nature of uncertainty and providing a practical tool in those cases in which scalar uncertainty is not enough, such as when studying highly nonlinear dynamic systems. This paper's specific contribution is the general concept of non-scalar uncertainty and a first proposal for a methodology. Applications should be based upon this methodology. The advantage of this approach is to provide simpler mathematical models for prediction of the system states. Present conventional tools for dealing with uncertainty prove insufficient for an effective description of some dynamic systems. The main limitations are overcome abandoning ordinary scalar algebra in the real interval (0, 1) in favor of a tensor field with a much richer structure and generality. This approach gives insight into the interpretation of Quantum Mechanics and will have its most profound consequences in the fields of elementary particle physics and nonlinear dynamic systems. Concepts like 'interfering alternatives' and 'discrete states' have an elegant explanation in this framework in terms of properties of dynamic systems such as strange attractors and chaos. The tensor formalism proves especially useful to describe the mechanics of representing dynamic systems with models that are closer to reality and have relatively much simpler solutions. It was found to be wise to get an approximate solution to an accurate model than to get a precise solution to a model constrained by simplifying assumptions. Precision has a very heavy cost in present physical models, but this formalism allows the trade between uncertainty and simplicity. It was found that modeling reality sometimes requires that state transition probabilities should be manipulated as nonscalar quantities, finding at the end that there is always a transformation to get back to scalar probability.

Martinez, Salvador Gutierrez↗

DOE OSTI2026

Operationally induced preferred basis in unitary quantum mechanics

The preferred-basis problem and the definite-outcome aspect of the measurement problem persist even if the detector is modeled unitarily, because experimental data are necessarily represented in a Boolean event algebra of mutually exclusive records whereas the theoretical description is naturally formulated in a noncommutative operator algebra with continuous unitary symmetry. This change of mathematical type constitutes the core of the 'cut': a structurally necessary interface from group-based kinematics to set-based counting. In the presented view the basis relevant for recorded outcomes is not determined by the system Hamiltonian alone; it is induced by the measurement mapping, i.e., by the detector channel together with the coarse-grained readout that defines an instrument. The probabilistic mapping is anchored in symmetry and measure theory: by Gleason-type uniqueness (Gleason for projections in $d>2$ and Busch's extension for Positive Operator-Valued Measures (POVMs) including $d=2$), the trace rule is the unique probability measure consistent with additivity over exclusive events and basis-independence of the unitary sector. A compact qubit--pointer model yields an induced unsharp POVM $E_\pm=\tfrac12(\id\pm η\,σ_z)$ with $η$ fixed by pointer resolution, displaying explicitly how the detector induces the relevant basis. Finally, nested-observer paradoxes are tightened into a non-composability lemma: joint assignment of outcome propositions is obstructed unless a joint instrument exists. This relocates the origin of randomness to the stochasticity of the transition rules.

Pronskikh, Vitaly [Fermilab] (ORCID:00000002518174↗

NASA NTRS1990

Simultaneous expansion and orthogonalization of measured modes for structure identification

Tests of large structures on-orbit will be performed with measurements at a relatively few structure points. Values for the unmeasured degrees of freedom (dofs) can be estimated based on measured dofs and analytical model dynamic information. These 'expanded' mode shapes are useful for optimal-update identification and damage location as well as test/analysis correlation. A new method of expansion for test mode shape vectors is developed from the orthogonal Procrustes problem from computational linear algebra. A subspace defined by the set of measured dofs is compared to a subspace defined by mode shapes from an analytical model of the structure. The method simultaneously expands and orthogonalizes the mode shape vectors. Two demonstration problems are used to compare the new method to current expansion techniques. One demonstration uses test data from a laboratory scale-model truss structure. Performance of the new method is comparable or superior to that of the previous expansion methods which require separate orthogonalization.

Smith, Suzanne Weaver↗

DOE OSTI2023

Batched Sparse Linear Algebra (Final Report for Subcontract B648960)

This report finalizes design specifications for developing batched kernels for small tensor operations for unassembled matrix-free iterative solvers, batched solvers for partially assembled operators, and batched solvers with support for various sparse formats. The outcome of the project milestones is a set of interfaces to Batched Sparse LA solvers running on hardware accelerators for use in ECP Libraries and Applications. It is part of the development of sparse batched kernels, solvers/preconditioners as well as creating interoperability in xSDK libraries with sparse and dense batched functions to benefit ECP applications. The participants included representatives from ECP libraries (not limited to the xSDK project), applications, and vendors (AMD, Intel, and NVIDIA). Batched sparse linear algebra solvers form the new frontier for algorithmic development and performance engineering. Many applications (ECP and non-ECP alike) require simultaneous solutions of small linear systems of equations that are structurally sparse. To move towards high hardware utilization, it is important to provide these applications with appropriate interfaces to efficient batched sparse solvers running on modern hardware accelerators. We present interface designs in use by HPC software libraries supporting batched sparse linear algebra and the development of sparse batched kernel codes for solvers and preconditioners. We also address the potential interoperability opportunities to keep the software portable between the major hardware accelerators from AMD, Intel, and NVIDIA. The presented interface specifications includes batched band, sparse iterative, and sparse direct solvers. This report summarizes progress in Kokkos Kernels and the xSDK libraries MAGMA, Ginkgo, hypre, SUNDIALS, and SuperLU_dist.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1982

Automatic algebraic coordinate generation

A computer software system has been developed to automatically generate two-dimensional coordinates from algebraic transformations. For topologically complex regions, a smooth assembly of the transformations can be used to automatically produce a composite mesh where a general gridded format is retained. The algebraic mesh generation system consists of a collection of operator subroutines which are applied to an established data structure and which automatically perform the necessary parts of mesh construction from a sequence of multisurface transformations. The system operators are discussed, taking into account the data base, the order of application, direct surface generators, geometric surface operators, surface generators from existing surfaces, transverse operators, mesh operators, assembly operators, and data visualization operators. Attention is given to applications related to airfoils.

Eiseman, P. R.↗

NASA NTRS1993

Proper-time relativistic dynamics

Proper-time relativistic single-particle classical Hamiltonian mechanics is formulated using a transformation from observer time to system proper time which is a canonical contact transformation on extended phase space. It is shown that interaction induces a change in the symmetry structure of the system which can be analyzed in terms of a Lie-isotopic deformation of the algebra of observables.

Gill, Tepper L.↗

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↗