Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Pyomo.DOE: An open-source package for model-based design of experiments in Python

Predictive mathematical models are a cornerstone of science and engineering. Yet selecting, calibrating, and validating said science-based models often remains an art in practice. Model-based design of experiments (MBDoE) provides a systematic framework to maximize information gain from experiments while minimizing time and resource costs. But MBDoE remains limited to niche application areas, in part because practitioners must integrate expertise in statistics, computational optimization, and modeling. To help reduce this barrier, we introduce Pyomo.DOE, an open-source package for MBDoE. Pyomo.DOE uses a nonlinear sensitivity analysis code k_aug to quickly approximate the Fisher information matrix and leverages a new stochastic programming abstraction. We demonstrate Pyomo.DOE with the first application of MBDoE to fixed-bed breakthrough experiments, which highlights the power of Pyomo.DOE to quantify the value of experimental modifications a priori for large-scale partial differential-algebraic equation (PDAE) models. Here we also provide a mathematical primer on MBDoE targeted at general chemical engineers.

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

A geometric modeler based on a dual-geometry representation polyhedra and rational b-splines

For speed and data base reasons, solid geometric modeling of large complex practical systems is usually approximated by a polyhedra representation. Precise parametric surface and implicit algebraic modelers are available but it is not yet practical to model the same level of system complexity with these precise modelers. In response to this contrast the GEOMOD geometric modeling system was built so that a polyhedra abstraction of the geometry would be available for interactive modeling without losing the precise definition of the geometry. Part of the reason that polyhedra modelers are effective is that all bounded surfaces can be represented in a single canonical format (i.e., sets of planar polygons). This permits a very simple and compact data structure. Nonuniform rational B-splines are currently the best representation to describe a very large class of geometry precisely with one canonical format. The specific capabilities of the modeler are described.

Klosterman, A. L.↗
NASA NTRS1995

DRS: Derivational Reasoning System

The high reliability requirements for airborne systems requires fault-tolerant architectures to address failures in the presence of physical faults, and the elimination of design flaws during the specification and validation phase of the design cycle. Although much progress has been made in developing methods to address physical faults, design flaws remain a serious problem. Formal methods provides a mathematical basis for removing design flaws from digital systems. DRS (Derivational Reasoning System) is a formal design tool based on advanced research in mathematical modeling and formal synthesis. The system implements a basic design algebra for synthesizing digital circuit descriptions from high level functional specifications. DRS incorporates an executable specification language, a set of correctness preserving transformations, verification interface, and a logic synthesis interface, making it a powerful tool for realizing hardware from abstract specifications. DRS integrates recent advances in transformational reasoning, automated theorem proving and high-level CAD synthesis systems in order to provide enhanced reliability in designs with reduced time and cost.

Bose, Bhaskar↗
NASA NTRS2004

Putting Priors in Mixture Density Mercer Kernels

This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly infinite dimensional feature space. We describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using predefined kernels. These data adaptive kernels can en- code prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS). The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains template for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic- algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code. The results show that the Mixture Density Mercer-Kernel described here outperforms tree-based classification in distinguishing high-redshift galaxies from low- redshift galaxies by approximately 16% on test data, bagged trees by approximately 7%, and bagged trees built on a much larger sample of data by approximately 2%.

Srivastava, Ashok N.↗
DOE OSTI2022

Causal diamonds, cluster polytopes and scattering amplitudes

The “amplituhedron” for tree-level scattering amplitudes in the bi-adjoint φ 3 theory is given by the ABHY associahedron in kinematic space, which has been generalized to give a realization for all finite-type cluster algebra polytopes, labelled by Dynkin diagrams. In this letter we identify a simple physical origin for these polytopes, associated with an interesting (1 + 1)-dimensional causal structure in kinematic space, along with solutions to the wave equation in this kinematic “spacetime” with a natural positivity property. The notion of time evolution in this kinematic spacetime can be abstracted away to a certain “walk”, associated with any acyclic quiver, remarkably yielding a finite cluster polytope for the case of Dynkin quivers. The A n–3 , B n–1 /C n–1 and D n polytopes are the amplituhedra for n-point tree amplitudes, one-loop tadpole diagrams, and full integrand of one-loop amplitudes. We also introduce a polytope D¯ n , which chops the D n polytope in half along a symmetry plane, capturing one-loop amplitudes in a more efficient way.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS2005

An Ensemble Approach to Building Mercer Kernels with Prior Information

This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly dimensional feature space. we describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using pre-defined kernels. These data adaptive kernels can encode prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. Specifically, we demonstrate the use of the algorithm in situations with extremely small samples of data. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS) and demonstrate the method's superior performance against standard methods. The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains templates for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic-algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code.

Srivastava, Ashok N.↗
DOE OSTI2024

A T-duality of non-supersymmetric heterotic strings and an implication for Topological Modular Forms

Abstract Motivated by recent developments connecting non-supersymmetric heterotic string theory to the theory of Topological Modular Forms (TMF), we show that the worldsheet theory with central charge (17,$$ \frac{3}{2} $$ 3 2 ) obtained by fibering the (E 8 ) 1 × (E 8 ) 1 current algebra over the two$$ \mathcal{N} $$ N = (0, 1) sigma model onS 1 with antiperiodic spin structure (such that theE 8 factors are exchanged as we go around the circle), is continuously connected to the (E 8 ) 2 theory in the Gaiotto Johnson-Freyd Witten sense of going “up and down the RG trajectories”. Combined with the work of Tachikawa and Yamashita, this furnishes a physical derivation of the fact that the (E 8 ) 2 theory corresponds to the unique nontrivial torsion element [(E 8 ) 2 ] of TMF 31 with zero mod-2 elliptic genus.

Physics↗
DOE OSTI2024

A cluster of results on amplituhedron tiles

Abstract The amplituhedron is a mathematical object which was introduced to provide a geometric origin of scattering amplitudes in $$\mathcal {N}=4$$ N = 4 super Yang–Mills theory. It generalizes cyclic polytopes and the positive Grassmannian and has a very rich combinatorics with connections to cluster algebras. In this article, we provide a series of results about tiles and tilings of the $$m=4$$ m = 4 amplituhedron. Firstly, we provide a full characterization of facets of BCFW tiles in terms of cluster variables for $$\text{ Gr}_{4,n}$$ Gr 4 , n . Secondly, we exhibit a tiling of the $$m=4$$ m = 4 amplituhedron which involves a tile which does not come from the BCFW recurrence—the spurion tile, which also satisfies all cluster properties. Finally, strengthening the connection with cluster algebras, we show that each standard BCFW tile is the positive part of a cluster variety, which allows us to compute the canonical form of each such tile explicitly in terms of cluster variables for $$\text{ Gr}_{4,n}$$ Gr 4 , n . This paper is a companion to our previous paper “Cluster algebras and tilings for the $$m=4$$ m = 4 amplituhedron.”

Physics↗
DOE OSTI2023

Structure of pressure-gradient-driven current singularity in ideal magnetohydrodynamic equilibrium

Abstract Singular currents typically appear on rational surfaces in non-axisymmetric ideal magnetohydrodynamic (MHD) equilibria with a continuum of nested flux surfaces and a continuous rotational transition. These currents have two components: a surface current (Dirac δ -function in flux surface labeling) that prevents the formation of magnetic islands, and an algebraically divergent Pfirsch–Schlüter current density when a pressure gradient is present across the rational surface. On flux surfaces adjacent to the rational surface, the traditional treatment gives the Pfirsch–Schlüter current density scaling as J ∼ 1 / Δ ι , where Δ ι is the difference of the rotational transform relative to the rational surface. If the distance s between flux surfaces is proportional to Δ ι , the scaling relation J ∼ 1 / Δ ι ∼ 1 / s will lead to a paradox that the Pfirsch–Schlüter current is not integrable. In this work, we investigate this issue by considering the pressure-gradient-driven singular current in the Hahm–Kulsrud–Taylor problem, which is a prototype for singular currents arising from resonant magnetic perturbations. We show that not only the Pfirsch–Schlüter current density but also the diamagnetic current density are divergent as ∼ 1 / Δ ι . However, due to the formation of a Dirac δ -function current sheet at the rational surface, the neighboring flux surfaces are strongly packed with s ∼ ( Δ ι ) 2 . Consequently, the singular current density J ∼ 1 / s , making the total current finite, thus resolving the paradox. Furthermore, the strong packing of flux surfaces causes a steepening of the pressure gradient near the rational surface, with ∇ p ∼ d p / d s ∼ 1 / s . In general non-axisymmetric MHD equilibrium, contrary to Grad’s conjecture that the pressure profile is flat around densely distributed rational surfaces, our result suggests a pressure profile that densely steepens around them.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Light-front puzzles

Abstract Light-front formulations of quantum field theories have many advantages for computing electroweak matrix elements of strongly interacting systems and other quantities that are used to study hadronic structure. The theory can be formulated in Hamiltonian form so non-perturbative calculations of the strongly interacting initial and final states are in principle reduced to linear algebra. These states are needed for calculating parton distribution functions and other types of distribution amplitudes that are used to understand the structure of hadrons. Light-front boosts are kinematic transformations so the strongly interacting states can be computed in any frame. This is useful for computing current matrix elements involving electroweak probes where the initial and final hadronic states are in different frames related by the momentum transferred by the probe. Finally in many calculations the vacuum is trivial so the calculations can be formulated in Fock space. The advantages of light front-field theory would not be interesting if the light-front formulation was not equivalent to the covariant or canonical formulations of quantum field theory. Many of the distinguishing properties of light-front quantum field theory are difficult to reconcile with canonical or covariant formulations of quantum field theory. This paper discusses the resolution of some of the apparent inconsistencies in canonical, covariant and light-front formulations of quantum field theory. The puzzles that will be discussed are (1) the problem of inequivalent representations (2) the problem of the trivial vacuum (3) the problem of ill-posed initial value problems (4) the problem of rotational covariance (5) the problem of zero modes and (6) the problem of spontaneously broken symmetries.

Physics↗
DOE OSTI2023

Monte Carlo goodness-of-fit tests for degree corrected and related stochastic blockmodels

Abstract We construct Bayesian and frequentist finite-sample goodness-of-fit tests for three different variants of the stochastic blockmodel for network data. Since all of the stochastic blockmodel variants are log-linear in form when block assignments are known, the tests for the latent block model versions combine a block membership estimator with the algebraic statistics machinery for testing goodness-of-fit in log-linear models. We describe Markov bases and marginal polytopes of the variants of the stochastic blockmodel and discuss how both facilitate the development of goodness-of-fit tests and understanding of model behaviour. The general testing methodology developed here extends to any finite mixture of log-linear models on discrete data, and as such is the first application of the algebraic statistics machinery for latent-variable models.

Karwa, Vishesh↗
DOE OSTI2021

QLiG: Query Like a Graph For Subgraph Matching

A graph is a natural and flexible modeling approach to represent entities and relationships between them in real-world. A Knowledge Graphs (KG) is a specialized graph with formal and structured representation of facts, relationships, annotated with semantic descriptions. Subgraph matching is one of the fundamental graph problems to identify relationships, interactions and activities of interest within a large graph. A query specification is a collection of abstract components, operations, and constraints to express a pattern. The specification can be implemented in different ways based on underlying data model. Various graph query specifications have been developed over the years and have led to the development of different open-sourced and vendor-specific query languages. Such specification are modeled as an extension of relational algebra used to develop relational query languages such as SQL. Such relational concepts do not inherently support graph queries. There is a need to represent graph queries in terms on graph-based components to expedite query construction by non-database experts. We present a graph-based query approach QLiG (pronounced cleeg), to perform subgraph matching in Labeled Property Graph. We present the query specifications, salient features, and a use case to show functional examples.

Purohit, Sumit↗
DOE OSTI2026

Phenomena-based graph representations and applications to chemical process simulation

Rapid and robust simulation of chemical processes is critical to conduct process design, optimization, techno-economic analysis, and sustainability analysis. Yet, efficiently solving simulation models remains a challenge due to the highly coupled and nonlinear nature of the underlying algebraic equations that capture the physical phenomena taking place in the process (e.g., material and energy conservation, phase equilibrium, reactions). In this work, we show that graph-theoretic representations of the physical phenomena within unit operations can help navigate and decompose equations to systematically identify alternative approaches for fast and robust numerical solutions. Specifically, we present a graph-theoretic abstraction that captures the connectivity between the model variables/equations and use this abstraction to group variables/equations into fundamental phenomena. We show that phenomena-based decomposition of the underlying equations can help decouple nonlinearities and enforce material/energy conservation at the process level to accelerate convergence. The proposed decomposition approach differs from the more traditional sequential modular simulation approach, in which equations are grouped and decomposed by unit operations. We implemented the phenomena-based decomposition in BioSTEAM—an open-source process simulation platform in Python—and demonstrated that this approach can converge a variety of separation process models. Compared to sequential modular simulation, the phenomena-based approach can converge idealized systems faster, but it can be slower for (or even fail to converge) highly coupled and nonideal process systems.

Convergence↗
NASA NTRS1992

Approximation, abstraction and decomposition in search and optimization

In this paper, I discuss four different areas of my research. One portion of my research has focused on automatic synthesis of search control heuristics for constraint satisfaction problems (CSPs). I have developed techniques for automatically synthesizing two types of heuristics for CSPs: Filtering functions are used to remove portions of a search space from consideration. Another portion of my research is focused on automatic synthesis of hierarchic algorithms for solving constraint satisfaction problems (CSPs). I have developed a technique for constructing hierarchic problem solvers based on numeric interval algebra. Another portion of my research is focused on automatic decomposition of design optimization problems. We are using the design of racing yacht hulls as a testbed domain for this research. Decomposition is especially important in the design of complex physical shapes such as yacht hulls. Another portion of my research is focused on intelligent model selection in design optimization. The model selection problem results from the difficulty of using exact models to analyze the performance of candidate designs.

Ellman, Thomas↗
DOE OSTI2024

From large to small $$ \mathcal{N} $$ = (4, 4) superconformal surface defects in holographic 6d SCFTs

Abstract Two-dimensional (2d)$$ \mathcal{N} $$ N = (4, 4) Lie superalgebras can be either “small” or “large”, meaning their R-symmetry is either$$ \mathfrak{so} $$ so (4) or$$ \mathfrak{so} $$ so (4) ⊕$$ \mathfrak{so} $$ so (4), respectively. Both cases admit a superconformal extension and fit into the one-parameter family$$ \mathfrak{d} $$ d (2,1;γ) ⊕$$ \mathfrak{d} $$ d (2,1;γ), with parameterγ∈ (−∞,∞). The large algebra corresponds to generic values ofγ, while the small case corresponds to a degeneration limit withγ→ −∞. In 11d supergravity, we study known solutions with superisometry algebra$$ \mathfrak{d} $$ d (2,1;γ) ⊕$$ \mathfrak{d} $$ d (2,1;γ) that are asymptotically locally AdS 7 ×𝕊 4 . These solutions are holographically dual to the 6d maximally superconformal field theory with 2d superconformal defects invariant under$$ \mathfrak{d} $$ d (2,1;γ) ⊕$$ \mathfrak{d} $$ d (2,1;γ). We show that a limit of these solutions, in whichγ→ −∞, reproduces another known class of solutions, holographically dual tosmall$$ \mathcal{N} $$ N = (4, 4) superconformal defects. We then use this limit to generate new small$$ \mathcal{N} $$ N = (4, 4) solutions with finite Ricci scalar, in contrast to the known small$$ \mathcal{N} $$ N = (4, 4) solutions. We then use holography to compute the entanglement entropy of a spherical region centered on these small$$ \mathcal{N} $$ N = (4, 4) defects, which provides a linear combination of defect Weyl anomaly coefficients that characterizes the number of defect-localized degrees of freedom. We also comment on the generalization of our results to include$$ \mathcal{N} $$ N = (0,4) surface defects through orbifolding.

Physics↗
NASA NTRS1989

A spatial operator algebra for manipulator modeling and control

A spatial operator algebra for modeling the control and trajectory design of manipulation is discussed, with emphasis on its analytical formulation and implementation in the Ada programming language. 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 the manipulator. Inversion is obtained using techniques of recursive filtering and smoothing. The operator alegbra provides a high-level framework for describing the dynamic and kinematic behavior of a manipulator and control and trajectory design algorithms. Implementable recursive algorithms can be immediately derived from the abstract operator expressions by inspection, thus greatly simplifying the transition from an abstract problem formulation and solution to the detailed mechanization of a specific algorithm.

Rodriguez, G.↗
DOE OSTI2024

Null Raychaudhuri: canonical structure and the dressing time

Abstract We initiate a study of gravity focusing on generic null hypersurfaces, non-perturbatively in the Newton coupling. We present an off-shell account of the extended phase space of the theory, which includes the expected spin-2 data as well as spin-0, spin-1 and arbitrary matter degrees of freedom. We construct the charges and the corresponding kinematic Poisson brackets, employing a Beltrami parameterization of the spin-2 modes. We explicitly show that the constraint algebra closes, the details of which depend on the non-perturbative mixing between spin-0 and spin-2 modes. Finally we show that the spin zero sector encodes a notion of a clock, called dressing time, which is dynamical and conjugate to the constraint. It is well-known that the null Raychaudhuri equation describes how the geometric data of a null hypersurface evolve in null time in response to gravitational radiation and external matter. Our analysis leads to three complementary viewpoints on this equation. First, it can be understood as a Carrollian stress tensor conservation equation. Second, we construct spin-0, spin-2 and matter stress tensors that act as generators of null time reparametrizations for each sector. This leads to the perspective that the null Raychaudhuri equation can be understood as imposing that the sum of CFT-like stress tensors vanishes. Third, we solve the Raychaudhuri constraint non-perturbatively. The solution relates the dressing time to the spin-2 and matter boost charge operators. Finally we establish that the corner charge corresponding to the boost operator in the dressing time frame is monotonic. These results show that the notion of an observer can be thought of as emerging from the gravitational degrees of freedom themselves. We briefly mention that the construction offers new insights into focusing conjectures.

Physics↗
DOE OSTI2021

The IDAES process modeling framework and model library—Flexibility for process simulation and optimization

Abstract Energy systems and manufacturing processes of the 21st century are becoming increasingly dynamic and interconnected, which require new capabilities to effectively model and optimize their design and operations. Such next generation computational tools must leverage state‐of‐the‐art techniques in optimization and be able to rapidly incorporate new advances. To address these requirements, we have developed the Institute for the Design of Advanced Energy Systems (IDAES) Integrated Platform, which builds on the strengths of both process simulators (model libraries) and algebraic modeling languages (advanced solvers). This paper specifically presents the IDAES Core Modeling Framework (IDAES‐CMF), along with a case study demonstrating the application of the framework to solve process optimization problems. Capabilities provided by this framework include a flexible, modifiable, open‐source platform for optimization of process flowsheets utilizing state‐of‐the‐art solvers and solution techniques, fully open and extensible libraries of dynamic unit operations models and thermophysical property models, and integrated support for superstructure‐based conceptual design and optimization under uncertainty.

42 ENGINEERING↗