Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algebraic models”

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 955 records · Page 53
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Automated label flows for excited states of correlation functions in lattice gauge theory

Extracting excited states from lattice gauge theory correlation functions can be achieved through $χ^2$ minimization fits or algebraic approaches such as the variational method and Prony's method. Performing any kind of error analysis often leads to overlapping confidence regions of model parameters, even when the spectrum is not particularly dense. To correctly estimate errors, one must beware of mislabeling the states. In this work, we provide an algorithm that we call automated label flows which consistently and systematically identifies a deterministic labeling of states. This is a black-box approach in the sense that it gives a sensible set of labels without user guidance. Further, as an example, we pair one black box method with another, analyzing a lattice correlation function from real data using automated label flows in the context of Prony's method.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1992

Use of symbolic computation in robotics education

An application of symbolic computation in robotics education is described. A software package is presented which combines generality, user interaction, and user-friendliness with the systematic usage of symbolic computation and artificial intelligence techniques. The software utilizes MACSYMA, a LISP-based symbolic algebra language, to automatically generate closed-form expressions representing forward and inverse kinematics solutions, the Jacobian transformation matrices, robot pose error-compensation models equations, and Lagrange dynamics formulation for N degree-of-freedom, open chain robotic manipulators. The goal of such a package is to aid faculty and students in the robotics course by removing burdensome tasks of mathematical manipulations. The software package has been successfully tested for its accuracy using commercially available robots.

Vira, Naren↗
NASA NTRS1995

Dynamic sensitivity analysis of frictional contact/impact response of axisymmetric composite structures

A computational procedure is presented for evaluating the sensitivity coefficients of the dynamic frictional contact/impact response of axisymmetric composite structures. The structures are assumed to consist of an arbitrary number of perfectly bonded homogeneous anisotropic layers. The material of each layer is assumed to be hyperelastic, and the effect of geometric nonlinearity is included. The sensitivity coefficients measure the sensitivity of the response to variations in different material, lamination and geometric parameters of the structure. A displacement finite element model is used for the discretization. The normal contact conditions are incorporated into the formulation by using a perturbed Lagrangian approach with the fundamental unknowns consisting of the nodal displacements, and the Lagrange multipliers associated with the contact conditions. The Lagrange multipliers are allowed to be discontinuous at interelement boundaries. Tangential contact conditions are incorporated by using a penalty method in conjunction with the classical Coulomb's friction model. Temporal integration is performed by using Newmark method. The Newton-Raphson iterative scheme is used for the solution of the resulting nonlinear algebraic equations, and for the determination of the contact region, contact conditions (sliding or sticking), and the contact pressures. The sensitivity coefficients are evaluated by using a direct differentiation approach. Numerical results are presented from the frictional contact/impact response of a composite spherical cap impacting on a rigid plate.

Karaoglan, Levent↗
NASA NTRS1993

A Grid-resolved Analysis of Base Flowfield for a Four-Engine Clustered Nozzle Configuration

The objective of this study is to propose a computational methodology that can effectively anchor the base flowfield of a four-engine clustered nozzle configuration. This computational methodology is based on a three-dimensional, viscous flow, pressure-based computational fluid dynamics (CFD) formulation. For efficient CFD calculation, a Prandtl-Meyer solution treatment is applied to the algebraic grid lines for initial plume expansion resolution. As the solution evolves, the computational grid is adapted to the pertinent flow gradients. The CFD model employs an upwind scheme in which second- and fourth-order central differencing schemes with artificial dissipation are used. The computed quantitative base flow properties such as the radial base pressure distributions, model centerline static pressure, Mach number and impact pressure variations, and base pressure characteristic curve agreed reasonably well with those of the measurement.

Wang, Ten-See↗
NASA NTRS2006

Development of Comprehensive Reduced Kinetic Models for Supersonic Reacting Shear Layer Simulations

Large-scale simulations of multi-dimensional unsteady turbulent reacting flows with detailed chemistry and transport can be computationally extremely intensive even on distributed computing architectures. With the development of suitable reduced chemical kinetic models, the number of scalar variables to be integrated can be decreased, leading to a significant reduction in the computational time required for the simulation with limited loss of accuracy in the results. A general MATLAB-based automated mechanism reduction procedure is presented to reduce any complex starting mechanism (detailed or skeletal) with minimal human intervention. Based on the application of the quasi steady-state (QSS) approximation for certain chemical species and on the elimination of the fast reaction rates in the mechanism, several comprehensive reduced models, capable of handling different fuels such as C2H4, CH4 and H2, have been developed and thoroughly tested for several combustion problems (ignition, propagation and extinction) and physical conditions (reactant compositions, temperatures, and pressures). A key feature of the present reduction procedure is the explicit solution of the concentrations of the QSS species, needed for the evaluation of the elementary reaction rates. In contrast, previous approaches relied on an implicit solution due to the strong coupling between QSS species, requiring computationally expensive inner iterations. A novel algorithm, based on the definition of a QSS species coupling matrix, is presented to (i) introduce appropriate truncations to the QSS algebraic relations and (ii) identify the optimal sequence for the explicit solution of the concentration of the QSS species. With the automatic generation of the relevant source code, the resulting reduced models can be readily implemented into numerical codes.

Zambon, A. C.↗
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 OSTI2024

Enhancing Lattice Kinetic Schemes for Fluid Dynamics with Lattice-Equivariant Neural Networks

A new class of equivariant neural networks is presented, hereby dubbed lattice-equivariant neural networks (LENNs), designed to satisfy local symmetries of a lattice structure. The approach develops within a recently introduced framework aimed at learning neural network-based surrogate models’ lattice Boltzmann collision operators. Whenever neural networks are employed to model physical systems, respecting symmetries and equivariance properties has been shown to be key for accuracy, numerical stability, and performance. Here, hinging on ideas from group representation theory, trainable layers are defined whose algebraic structure is equivariant with respect to the symmetries of the lattice cell. In this work, the presented method naturally allows for efficient implementations, in terms of both memory usage and computational costs, supporting scalable training/testing for lattices in two spatial dimensions and higher (in which the size of symmetry group grows). The approach is validated and tested considering 2D and 3D flowing dynamics, both in laminar and turbulent regimes. It is compared with group-averaged-based symmetric networks and with plain, nonsymmetric, networks, showing how the presented approach unlocks the (a posteriori) accuracy and training stability of the former models and the train/inference speed of the latter networks. (LENNs are about one order of magnitude faster than group-averaged networks in 3D.) The work in this paper opens toward practical use of machine learning-augmented lattice Boltzmann CFD in real-world simulations.

97 MATHEMATICS AND COMPUTING↗
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 NTRS1988

Nondestructive construction error detection in large space structures

Continuum modeling of large space structures is extended to the problem of detecting construction errors in large space structures such as the proposed space station. First-order dynamic sensitivity equations for structures involving eigenfrequencies, modal masses, modal stiffnesses, and modal damping are presented. Matrix equations relating changes in element parameters to dynamic sensitivities are summarized. The sensitivity equations for the entire dynamical system are rearranged as a system of algebraic equations with unknowns of stiffness losses at selected locations. The feasibility of the formulation is numerically demonstrated on a simply-supported Euler-Bernouilli beam with simulated construction defects. The method is next extended to large space structures modelled as equivalent continua with simulated construction defects.

Stubbs, Norris↗
NASA NTRS1998

Frequency-Domain Analysis of Diffusion-Cooled Hot-Electron Bolometer Mixers

A new theoretical model is introduced to describe heterodyne mixer conversion efficiency and noise (from thermal fluctuation effects) in diffusion-cooled superconducting hot-electron bolometers. The model takes into account the non-uniform internal electron temperature distribution generated by Wiedemann-Franz heat conduction, and accepts for input an arbitrary (analytical or experimental) superconducting resistance-versus- temperature curve. A non-linear large-signal solution is solved iteratively to calculate the temperature distribution, and a linear frequency-domain small-signal formulation is used to calculate conversion efficiency and noise. In the small-signal solution the device is discretized into segments, and matrix algebra is used to relate the heating modulation in the segments to temperature and resistance modulations. Matrix expressions are derived that allow single-sideband mixer conversion efficiency and coupled noise power to be directly calculated. The model accounts for self-heating and electrothermal feedback from the surrounding bias circuit.

Skalare, A.↗
DOE OSTI2021

Toward performance-portable PETSc for GPU-based exascale systems

The Portable Extensible Toolkit for Scientific computation (PETSc) library delivers scalable solvers for nonlinear time-dependent differential and algebraic equations and for numerical optimization. The PETSc design for performance portability addresses fundamental GPU accelerator challenges and stresses flexibility and extensibility by separating the programming model used by the application from that used by the library, and it enables application developers to use their preferred programming model, such as Kokkos, RAJA, SYCL, HIP, CUDA, or OpenCL, on upcoming exascale systems. Furthermore, a blueprint for using GPUs from PETSc-based codes is provided, and case studies emphasize the flexibility and high performance achieved on current GPU-based systems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1979

Programs for high-speed Fourier, Mellin and Fourier-Bessel transforms

Several FORTRAN program modules for performing one-dimensional and two-dimensional discrete Fourier transforms, Mellin, and Fourier-Bessel transforms are described along with programs that realize the algebra of high speed Fourier transforms on a computer. The programs can perform numerical harmonic analysis of functions, synthesize complex optical filters on a computer, and model holographic image processing methods.

Ikhabisimov, D. K.↗
NASA NTRS1983

Experimental feasibility study of a thermoelectric heat flux gage

An experiment was conducted to determine the feasibility of using a commercially available thermoelectric device as a heat flux gage at near ambient conditions. In certain research applications, the thermoelectric heat flux gage can provide a relatively simple means to model a warm fluid cold wall convection environment. The experiment showed that heat flux through the gage could be correlated within 2.5 percent with a simple algebraic equation which considered the thermoelectric current through the device and the hot and cold side temperatures.

Vanfossen, G. J.↗
NASA NTRS1991

Iterative solution techniques in boundary element analysis

Iterative techniques for the solution of the algebraic equations associated with the direct boundary element analysis (BEA) method are discussed. Continuum structural response analysis problems are considered, employing single- and multizone boundary element models with and without zone condensation. The impact on convergence rate and computer resource requirements associated with the sparse and blocked matrices, resulting in multizone BEA, is studied. Both conjugate gradient and generalized minimum residual preconditioned iterative solvers are applied for these problems and the performance of these algorithms is reported. Included is a quantification of the impact of the preconditioning utilized to render the boundary element matrices solvable by the respective iterative methods in a time competitive with direct methods.

Kane, J. H.↗
NASA NTRS1998

Formal Modeling of Multi-Agent Systems using the Pi-Calculus and Epistemic Logic

Multi-agent systems have become important recently in computer science, especially in artificial intelligence (AI). We allow a broad sense of agent, but require at least that an agent has some measure of autonomy and interacts with other agents via some kind of agent communication language. We are concerned in this paper with formal modeling of multi-agent systems, with emphasis on communication. We propose for this purpose to use the pi-calculus, an extension of the process algebra CCS. Although the literature on the pi-calculus refers to agents, the term is used there in the sense of a process in general. It is our contention, however, that viewing agents in the AI sense as agents in the pi-calculus sense affords significant formal insight. One formalism that has been applied to agents in the AI sense is epistemic logic, the logic of knowledge. The success of epistemic logic in computer science in general has come in large part from its ability to handle concepts of knowledge that apply to groups. We maintain that the pi-calculus affords a natural yet rigorous means by which groups that are significant to epistemic logic may be identified, encapsulated, structured into hierarchies, and restructured in a principled way. This paper is organized as follows: Section 2 introduces the pi-calculus; Section 3 takes a scenario from the classical paper on agent-oriented programming [Sh93] and translates it into a very simple subset of the n-calculus; Section 4 then shows how more sophisticated features of the pi-calculus may bc brought into play; Section 5 discusses how the pi-calculus may be used to define groups for epistemic logic; and Section 6 is the conclusion.

Rorie, Toinette↗
DOE OSTI2025

A Theoretical Operational Model for Complex Experiments and its Invariance Theorems

We develop and systematize the Theoretical–Operational Model (TOM), a framework that treats preparation and measurement —including their operational residues— as intrinsic structures of physical theory. The central contribution is a principled geometric–algebraic organization of admissible operational deformations, formulated using quantum channels, renormalization-style flows, and information-geometric tools. Within this structure, operational residues and background processes are represented as effective morphisms attached to these operational components, whose invariants yield constraints on how theoretical parameters vary under specified classes of deformations. Illustrations drawn from muon–electron conversion, long-baseline neutrino oscillations, and quark–gluon-plasma phenomenology show how TOM maps operational effects into inferences about theoretical parameters, enables systematic cross-experimental comparisons, and stabilizes parameter estimation against defined deformation families. By embedding the operational layer—together with its residues—within a structured theoretical setting, TOM supports both theory testing and theory development, clarifying the conceptual relation between experimental realization and the physical quantities represented by the theory.

Pronskikh, Vitaly [Fermilab] (ORCID:00000002518174↗
DOE OSTI2020

Estimating posterior quantity of interest expectations in a multilevel scalable framework

Scalable approaches for uncertainty quantification are necessary for characterizing prediction confidence in large-scale subsurface flow simulations with uncertain permeability. To this end we explore a multilevel Monte Carlo approach for estimating posterior moments of a particular quantity of interest, where we employ an element-agglomerated algebraic multigrid (AMG) technique to generate the hierarchy of coarse spaces with guaranteed approximation properties for both the generation of spatially correlated random fields and the forward simulation of Darcy's law to model subsurface flow. In both these components (sampling and forward solves), we exploit solvers that rely on state-of-the-art scalable AMG. To illustrate the applicability of this approach, numerical tests are performed on two 3D examples-a unit cube and an egg-shaped domain with an irregular boundary-where the scalability of each simulation as well as the scalability of the overall algorithm are demonstrated.

97 MATHEMATICS AND COMPUTING↗