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 1,279 records · Page 71
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Non-Gaussian wave packet dynamics in anharmonic potential: Cumulant expansion treatment

This manuscript utilizes cumulant expansion as an alternative algebraic approach to evaluating integrals and solving a system of nonlinear differential equations for probing anharmonic dynamics in condensed phase systems using Morse oscillator. These integrals and differential equations become harder to solve as the anharmonicity of the system goes beyond that of Morse oscillator description. This algebraic approach becomes critically important in case of Morse oscillator as it tends to exhibit divergent dynamics and numerical uncertainties at low temperatures. The autocorrelation function is calculated algebraically and compared to the exact one for they match perfectly. It is also compared to the approximate autocorrelation function using the differential equations technique reported in Toutounji (2014) for weak and strong electron–phonon coupling cases. It is found that the present cumulant method is more efficient, and easier to use, than the exact expression. Deviation between the approximate autocorrelation function and the exact autocorrelation function starts to arise as the electron–phonon coupling strength increases. The autocorrelation function obtained using cumulants identically matches the exact autocorrelation function, thereby surpassing the approach presented in Toutounji (2014). The advantage of the present methodology is its applicability to various types of electron–phonon coupling cases. Additionally, the herein approach only uses algebraic techniques, thereby avoiding both the divergence integral and solving a set of linear first- and second-order partial differential equations as was done in previous work. Model calculations are presented to demonstrate the accuracy of the herein work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Analog and symbolic computation through the Koopman framework

We develop a Koopman operator framework for studying the computational structure of dynamical systems. Specifically, we show that the resolvent of the Koopman operator provides a natural abstraction of halting, yielding a ‘Koopman halting problem’ that is recursively enumerable in general. For symbolic systems, such as those defined on Cantor space, this operator formulation captures reachability between clopen sets, while for equicontinuous systems we prove that the Koopman halting problem is decidable. Our framework demonstrates that absorbing (halting) states in coarse-grained finite automata correspond to Koopman eigenfunctions with eigenvalue one, while cycles in the transition graph impose spectral constraints associated with periodic dynamics. These results provide a unifying perspective on computation in symbolic and analog systems, showing how computational universality is reflected in operator spectra, invariant subspaces, and algebraic structures. Beyond symbolic dynamics, this operator-theoretic lens opens pathways to analyze the computational properties of a broader class of dynamical systems, including polynomial and analog models, and suggests that computational hardness may admit dynamical signatures in terms of Koopman spectral structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

String membrane nets from higher-form gauging: An alternate route to 𝑝-string condensation

We present a new perspective on the $p$-string condensation procedure for constructing 3+1D fracton phases by implementing this process via the gauging of higher-form symmetries. Specifically, we show that gauging a 1-form symmetry in 3+1D that is generated by Abelian anyons in isotropic stacks of 2+1D topological orders naturally results in a 3+1D $p$-string condensed phase, providing a controlled non-perturbative construction that realizes fracton orders. This approach clarifies the symmetry principles underlying $p$-string condensation and generalizes the familiar connection between anyon condensation and one-form gauging in two spatial dimensions. We demonstrate this correspondence explicitly in both field theories and lattice models: in field theory, we derive the foliated field theory description of the $\mathbb{Z}_N$ X-Cube model by gauging a higher-form symmetry in stacks of 2+1D $\mathbb{Z}_N$ gauge theories; on the lattice, we show how gauging a diagonal 1-form symmetry in isotropic stacks of $G$-graded string-net models leads to string-membrane-nets hosting restricted mobility excitations. This perspective naturally generalizes to spatial dimensions $d \geq 2$ and provides a step towards building an algebraic theory of $p$-string condensation.

Anyons↗
DOE OSTI2025

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗
NASA NTRS1987

Computer-based phosphoric acid fuel cell analytical tools Descriptions and usages

Simulation models have been developed for the prediction of phosphoric acid fuel cell (PAFC) powerplant system performance under both transient and steady operation conditions, as well as for the design of component configurations and for optimal systems synthesis. These models, which are presently computer-implemented, are an engineering and a system model; the former being solved by the finite difference method to determine the balances and properties of different sections, and the latter using thermodynamic balances to set up algebraic equations that yield physical and chemical properties of the stream for one operating condition.

Lu, C.↗
NASA NTRS1992

Finite element method for optimal guidance of an advanced launch vehicle

A temporal finite element based on a mixed form of Hamilton's weak principle is summarized for optimal control problems. The resulting weak Hamiltonian finite element method is extended to allow for discontinuities in the states and/or discontinuities in the system equations. An extension of the formulation to allow for control inequality constraints is also presented. The formulation does not require element quadrature, and it produces a sparse system of nonlinear algebraic equations. To evaluate its feasibility for real-time guidance applications, this approach is applied to the trajectory optimization of a four-state, two-stage model with inequality constraints for an advanced launch vehicle. Numerical results for this model are presented and compared to results from a multiple-shooting code. The results show the accuracy and computational efficiency of the finite element method.

Hodges, Dewey H.↗
NASA NTRS2003

Flutter and Divergence Analysis using the Generalized Aeroelastic Analysis Method

The Generalized Aeroelastic Analysis Method (GAAM) is applied to the analysis of three well-studied checkcases: restrained and unrestrained airfoil models, and a wing model. An eigenvalue iteration procedure is used for converging upon roots of the complex stability matrix. For the airfoil models, exact root loci are given which clearly illustrate the nature of the flutter and divergence instabilities. The singularities involved are enumerated, including an additional pole at the origin for the unrestrained airfoil case and the emergence of an additional pole on the positive real axis at the divergence speed for the restrained airfoil case. Inconsistencies and differences among published aeroelastic root loci and the new, exact results are discussed and resolved. The generalization of a Doublet Lattice Method computer code is described and the code is applied to the calculation of root loci for the wing model for incompressible and for subsonic flow conditions. The error introduced in the reduction of the singular integral equation underlying the unsteady lifting surface theory to a linear algebraic equation is discussed. Acknowledging this inherent error, the solutions of the algebraic equation by GAAM are termed 'exact.' The singularities of the problem are discussed and exponential series approximations used in the evaluation of the kernel function shown to introduce a dense collection of poles and zeroes on the negative real axis. Again, inconsistencies and differences among published aeroelastic root loci and the new 'exact' results are discussed and resolved. In all cases, aeroelastic flutter and divergence speeds and frequencies are in good agreement with published results. The GAAM solution procedure allows complete control over Mach number, velocity, density, and complex frequency. Thus all points on the computed root loci can be matched-point, consistent solutions without recourse to complex mode tracking logic or dataset interpolation, as in the k and p-k solution methods.

Edwards, John W.↗
NASA NTRS2017

SpaRibs Geometry Parameterization for Wings with Multiple Sections using Single Design

The SpaRibs topology of an aircraft wing has a significant effect on its structural behavior and stability as well as the flutter performance. The development of additive manufacturing techniques like Electron Beam Free Form Fabrication (EBF3) has made it feasible to manufacture aircraft wings with curvilinear spars, ribs (SpaRibs) and stiffeners. In this article a new global-local optimization framework for wing with multiple sections using curvilinear SpaRibs is described. A single design space is used to parameterize the SpaRibs geometry. This method has been implemented using MSC-PATRAN to create a broad range of SpaRibs topologies using limited number of parameters. It ensures C0 and C1 continuities in SpaRibs geometry at the junction of two wing sections with airfoil thickness gradient discontinuity as well as mesh continuity between all structural components. This method is advantageous in complex multi-disciplinary optimization due to its potential to reduce the number of design variables. For the global-local optimization the local panels are generated by an algorithm which is totally based on a set algebra on the connectivity matrix data. The great advantage of this method is that it is completely independent of the coordinates of the nodes of the finite element model. It is also independent of the order in which the elements are distributed in the FEM. The code is verified by optimizing of the CRM Baseline model at trim condition at Mach number equal to 0.85 for five different angle of attack (-2deg, 0deg,2deg,4deg and 6deg). The final weight of the wing is 19,090.61 lb. This value is comparable to that obtained by Qiang et al. 6 (19,269 lb).

wing sections↗
NASA NTRSDate not supplied

CFD Modeling & Validation of Single Bubble Growth During Cavitation in Zero Gravity

Cryogenic Fluid Management (CFM) in zero gravity represents a vital area of research as NASA pursues future long-duration space missions. Success of these missions relies heavily on the ability to store and transfer the cryogenic liquid fuels efficiently and safely. In the Zero Boil-Off Tank (ZBOT-1) Experiment in 2018, unexpected and intense phase change occurred at the screened Liquid Acquisition Device (LAD) during tank pressure control that was later attributed to cavitation. The cavitation ultimately resulted in pump failure. Since cryogen cavitation during storage and transfer of propellants in microgravity has been a source of serious concern for the aerospace community, a series of drop tower experiments with liquid methane were also performed at the University of Bremen to carefully study cavitation from a single bubble nucleus in an engineered micron-sized wall cavity. As the test cell is depressurized during the 10-second drop, cavitation causes bubble growth from the nucleus. Here, in a collaboration between the Case Western Reserve University and University of Bremen, we present a two-phase Computational Fluid Dynamics (CFD) model of bubble growth from a single wall cavity during depressurization in microgravity. Both 2D axisymmetric and 3D parametric simulation case studies are performed to show the evolution of the bubble growth. The model uses a Volume of Fluid (VOF) approach with and without adaptive mesh refinement and adaptive time stepping to capture the growth dynamics using an explicit formulation with algebraic reconstruction of the interface. CFD results show good agreement with corresponding experiment. Based on the velocity, temperature, and volume fraction fields generated by the validation case studies, detailed discussion and analysis of fluid flow and heat transfer during bubble growth process are presented to delineate the intricacies of the cavitation process. Strengths and shortcomings of the present numerical approach in capturing this phenomenon are also highlighted.

Two Phase Flow↗
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↗
DOE OSTI2016

Tall sections from non-minimal transformations

In previous study, we have shown that elliptic fibrations with two sections, or Mordell-Weil rank one, can always be mapped birationally to a Weierstrass model of a certain form, namely, the Jacobian of a P 112 model. Most constructions of elliptically fibered Calabi-Yau manifolds with two sections have been carried out assuming that the image of this birational map was a “minimal” Weierstrass model. In this paper, we show that for some elliptically fibered Calabi-Yau manifolds with Mordell-Weil rank-one, the Jacobian of the P 112 model is not minimal. Said another way, starting from a Calabi-Yau Weierstrass model, the total space must be blown up (thereby destroying the “Calabi-Yau” property) in order to embed the model into P 112 . In particular, we show that the elliptic fibrations studied recently by Klevers and Taylor fall into this class of models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

A Condensed Constrained Nonconforming Mortar-Based Approach for Preconditioning Finite Element Discretization Problems

This paper presents and studies an approach for constructing auxiliary space preconditioners for finite element problems using a constrained nonconforming reformulation that is based on a proposed modified version of the mortar method. The well-known mortar finite element discretization method is modified to admit a local structure, providing an element-by-element or subdomain-by-subdomain assembly property. This is achieved via the introduction of additional trace finite element spaces and degrees of freedom (unknowns) associated with the interfaces between adjacent elements or subdomains. The resulting nonconforming formulation and a reduced-via-static-condensation Schur complement form on the interfaces are used in the construction of auxiliary space preconditioners for a given conforming finite element discretization problem. Overall, the properties of these preconditioners are studied and their performance is illustrated on model second order scalar elliptic problems utilizing high order elements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Multilevel well modeling in aggregation-based nonlinear multigrid for multiphase flow in porous media

A full approximation scheme (FAS) nonlinear multigrid solver for two-phase flow and transport problems driven by wells with multiple perforations is developed here. It is an extension to our previous work on FAS solvers for diffusion and transport problems. The solver is applicable to discrete problems defined on unstructured grids as the coarsening algorithm is aggregation-based and algebraic. To construct coarse basis that can better capture the radial flow near wells, coarse grids in which perforated well cells are not near the coarse-element interface are desired. This is achieved by an aggregation algorithm proposed in this paper that makes use of the location of well cells in the cell-connectivity graph. Numerical examples in which the FAS solver is compared against Newton's method on benchmark problems are given. In particular, for a refined version of the SAIGUP model, the FAS solver is at least 35% faster than Newton's method for time steps with a CFL number greater than 10.

58 GEOSCIENCES↗
DOE OSTI2025

Simplified calculation of the area specific impedance for solid-state battery design

Simplified algebraic area specific impedance (ASI) correlations have been developed for solid-state composite battery electrodes made of a single ion conducting electrolyte, conductive additive, and intercalation active material. Two ASI expressions were developed, one for short times ( i.e. , pulsed power operation) and another for the pseudo steady state operation (i.e., sustained discharge for energy estimation). A full electrochemical model based on porous electrode theory was developed to examine the accuracy of the simplified ASI expressions. The simplified expressions agree favorably with full model results over a wide range of parameters (i.e. , electrode thicknesses, electrolyte conductivities, solid-state diffusion coefficients, specific surface areas, etc.) and conditions (i.e. , C-rates, states of charge, and pulse times). Under most conditions, the error between the full model and the correlations is well below 7 %. Higher errors were observed for the pseudo steady state expression at high/ low states of charge where the assumption of uniform reaction distributions loses validity. Here, the short time ASI has higher error at low states of charge due to the nonlinearity of the open circuit voltage equation, which is assumed linear in the formulation of the simplified algebraic expression.

25 ENERGY STORAGE↗
NASA NTRS1992

A generalized Lyapunov theory for robust root clustering of linear state space models with real parameter uncertainty

The problem of analyzing and designing controllers for linear systems subject to real parameter uncertainty is considered. An elegant, unified theory for robust eigenvalue placement is presented for a class of D-regions defined by algebraic inequalities by extending the nominal matrix root clustering theory of Gutman and Jury (1981) to linear uncertain time systems. The author presents explicit conditions for matrix root clustering for different D-regions and establishes the relationship between the eigenvalue migration range and the parameter range. The bounds are all obtained by one-shot computation in the matrix domain and do not need any frequency sweeping or parameter gridding. The method uses the generalized Lyapunov theory for getting the bounds.

Yedavalli, R. K.↗
DOE OSTI2021

A simple model of a strong shock driven by a spherical or cylindrical piston

A simple model of piston-driven spherical and cylindrical shocks is suggested. The model is based on a consistent use of two factors: (a) an almost uniform pressure across the shocked layer and, (b) continuous geometrical stretching of the surface elements of the expanding piston. It turns out that for a uniform pre-shock medium the gas between the piston and the shock behaves essentially as an incompressible fluid. An algebraic equation for the shock vs piston position is obtained. Detailed evaluation of the accuracy of the proposed solution shows that its accuracy is a few percent for the adiabatic index γ = 5/3 (as in ideal plasma). A closed-form solution describing enhancement of a weak ambient magnetic field by the shock is presented. The proposed model of piston-driven shocks goes beyond the classical self-similar solutions in that it: (1) naturally covers an early, non-asymptotic dynamics and its transition to asymptotic regime; (2) allows for smooth radial density variation of an ambient gas of the form of bumps, dimples or ramps between two constant values; and (3) allows for smooth temporal variation of piston velocity of the form of bumps, dimples, or ramps. Furthermore, this simple and versatile model provides some new insights into a classical hydrodynamical problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Gauges, loops, and polynomials for partition functions of graphical models

Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and optimization applications. The problem is #P-hard that is of an exponential complexity with respect to the number of variables. Here, aimed at approximating the partition function, we consider multi-graph models where binary variables and multivariable factors are associated with edges and nodes, respectively, of an undirected multi-graph. We suggest a new methodology for analysis and computations that combines the Gauge function technique from Chertkov and Chernyak with the technique developed in Anari and Oveis Gharan 2017 arXiv:1702.02937; Gurvits 2011 arXiv:1106.2844; Straszak and Vishnoi 2017 55th Annual Allerton Conf. on Communication, Control, and Computing, based on the recent progress in the field of real stable polynomials. We show that the Gauge function, representing a single-out term in a finite sum expression for the partition function which achieves extremum at the so-called belief-propagation gauge, has a natural polynomial representation in terms of gauges/variables associated with edges of the multi-graph. Moreover, Gauge function can be used to recover the partition function through a sequence of transformations allowing appealing algebraic and graphical interpretations. Algebraically, one step in the sequence consists of the application of a differential operator over gauges associated with an edge. Graphically, the sequence is interpreted as a repetitive elimination/contraction of edges resulting in multi-graph models on decreasing in size (number of edges) graphs with the same partition function as in the original multi-graph model. Even though the complexity of computing factors in the sequence of the derived multi-graph models and respective Gauge functions grow exponentially with the number of eliminated edges, polynomials associated with the new factors remain bi-stable if the original factors have this property. Moreover, we show that BP estimations in the sequence do not decrease, each low-bounding the partition function.

97 MATHEMATICS AND COMPUTING↗