Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algebraic topology”

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.

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

Diagrammatic state sums for 2D pin-minus TQFTs

The two dimensional state sum models of Barrett and Tavares are extended to unoriented spacetimes. The input to the construction is an algebraic structure dubbed half twist algebras, a class of examples of which is real separable superalgebras with a continuous parameter. The construction generates pin-minus TQFTs, including the root invertible theory with partition function the Arf-Brown-Kervaire invariant. Decomposability, the stacking law, and Morita invariance of the construction are discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Orientation reversal and the Chern-Simons natural boundary

We show that the fundamental property of preservation of relations, underlying resurgent analysis, provides a new perspective on crossing a natural boundary, an important general problem in theoretical and mathematical physics. This reveals a deeper rigidity aspect of resurgence in a quantum field theory path integral. The physical context here is the non-perturbative completion of complex Chern-Simons theory that associates to a 3-manifold a collection of q-series invariants labeled by Spinc structures, for which crossing the natural boundary corresponds to orientation reversal of the 3-manifold. Our new resurgent perspective leads to a practical numerical algorithm that generates q-series which are dual to unary q-series composed of false theta functions. Until recently, these duals were only known in a limited number of cases, essentially based on Ramanujan’s mock theta functions, and the common belief was that the duals might not even exist in the general case. Resurgence analysis identifies as primary objects Mordell integrals: up to changes of variables, they are Laplace transforms of resurgent functions. Their unique Borel summed transseries decomposition on either side of the Stokes line is simply the unique decomposition into real and imaginary parts. In turn, the latter are combinations of unary q-series in terms of q and its modular counterpart $\overset{\sim }{q}$ , and are resurgent by construction. The Mordell integral is analytic across the natural boundary of the q and $\overset{\sim }{q}$ series, and uniqueness of a similar decomposition which preserves algebraic relations on the other side of the boundary defines the unique boundary crossing of the q series. We demonstrate that this continuation can be efficiently implemented numerically. In the cases where unique mock modular identities are known, they are found by this numerical procedure, but the procedure can go well beyond the known list of identities. A particularly interesting feature of the resurgent approach is that it reveals new aspects, and is very different from other known approaches based on indefinite theta series, Appell-Lerch sums, and representation theory of logarithmic vertex operator algebras.

Chern-Simons theories↗
NASA NTRSDate not supplied

Introducing Tropical Geometric Approaches to Delay Tolerant Networking Optimization

Delay Tolerant Networking (DTN) is the standard approach to the networking of space systems with the goal of supporting the Solar System Internet (SSI). Current space networks have a small scale and often depend on rigorously scheduled (pre-determined) contact opportunities; this manual approach inhibits scalability. The goal of this paper is to recast these scheduling problems in order to apply the optimization machinery of tropical geometry. Contact opportunities in space are dependent on such factors as orbital mechanics and asset availability, which induce time-varying connectivity; indeed, end-to-end connectivity might never occur. Routing optimization within this structure is classically difficult and typically utilizes Dijkstra's algorithm as applied to contact graphs. Alternatively, we follow the successes of tropical geometry in train schedule optimization, job assignments, and even traditional networking, by extending this approach to this more general (i.e. disconnected) problem space. These successes imply tropical geometry provides a useful framework in the context of DTNs, starting with applications to queuing theory and long-haul links. Recently, tropical geometry has been applied to parametric path optimization on graphs with variable edge weights. In this work, we extend these advances to account for the problem of routing in a space network, and find that tropical geometry is well-suited to the challenges offered by this new setting, including contact schedules featuring probabilities. Our approach leverages the combinatorial nature of the problem to give feasible shortest path trees in the presence of variable channel conditions and latency, evolving topologies, and uncertainty inherent in space routing. We discuss our tropical approach to DTN for two Python implementations, a Verilog Tropical ALU implementation, tropical frameworks for other parametric graph problems, and solution stability. Lastly, a program for future work is included to illuminate the path ahead.

Delay Tolerant Networking↗
DOE OSTI2023

A fast Fourier transform-based solver for elastic micropolar composites

This work presents a spectral micromechanical formulation for obtaining the full-field and homogenized response of elastic micropolar composites. The algorithm relies on a coupled set of convolution integral equations for the micropolar strains, where periodic Green’s operators associated with a linear homogeneous reference medium are convolved with functions of the Cauchy and couple stress fields that encode the material’s heterogeneity, as well as any potential material nonlinearity. Such convolution integral equations take an algebraic form in the reciprocal Fourier space that can be solved iteratively. In this vein, the fast Fourier transform (FFT) algorithm is leveraged to accelerate the numerical solution, resulting in a mesh-free formulation in which the periodic unit cell representing the heterogeneous material can be discretized by a regular grid of pixels in two dimensions (or voxels in three dimensions). For verification, the numerical solutions obtained with the micropolar FFT solver are compared with analytical solutions for a matrix with a dilute circular inclusion subjected to plane strain loading. The developed computational framework is then used to study length-scale effects and effective (micropolar) moduli of composites with various topological configurations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

The kinetic origin of the fluid helicity—A symmetry in the kinetic phase space

Helicity, a topological degree that measures the winding and linking of vortex lines, is preserved by ideal (barotropic) fluid dynamics. In the context of the Hamiltonian description, the helicity is a Casimir invariant characterizing a foliation of the associated Poisson manifold. Casimir invariants are special invariants that depend on the Poisson bracket, not on the particular choice of the Hamiltonian. The total mass (or particle number) is another Casimir invariant, whose invariance guarantees the mass (particle) conservation (independent of any specific choice of the Hamiltonian). In a kinetic description (e.g., that of the Vlasov equation), the helicity is no longer an invariant (although the total mass remains a Casimir of the Vlasov’s Poisson algebra). The implication is that some “kinetic effect” can violate the constancy of the helicity. To elucidate how the helicity constraint emerges or submerges, we examine the fluid reduction of the Vlasov system; the fluid (macroscopic) system is a “sub-algebra” of the kinetic (microscopic) Vlasov system. In the Vlasov system, the helicity can be conserved if a special helicity symmetry condition holds. To put it another way, breaking helicity symmetry induces a change in the helicity. We delineate the geometrical meaning of helicity symmetry and show that for a special class of flows (the so-called epi-two-dimensional flows), the helicity symmetry is written as ∂γ = 0 for a coordinate γ of the configuration space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1980

Hamiltonian indices and rational spectral densities

Several (global) topological properties of various spaces of linear systems, particularly symmetric, lossless, and Hamiltonian systems, and multivariable spectral densities of fixed McMillan degree are announced. The study is motivated by a result asserting that on a connected but not simply connected manifold, it is not possible to find a vector field having a sink as its only critical point. In the scalar case, this is illustrated by showing that only on the space of McMillan degree = /Cauchy index/ = n, scalar transfer functions can one define a globally convergent vector field. This result holds both in discrete-time and for the nonautonomous case. With these motivations in mind, theorems of Bochner and Fogarty are used in showing that spaces of transfer functions defined by symmetry conditions are, in fact, smooth algebraic manifolds.

Byrnes, C. I.↗
NASA NTRS2013

Scheduling Operations for Massive Heterogeneous Clusters

High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.

Humphrey, John↗
NASA NTRS1990

On three dimensional object recognition and pose-determination: An abstraction based approach

A method of computing reliable Gaussian and mean curvature sign-map descriptors from the polynomial approximation of surfaces was demonstrated. Such descriptors which are invariant under perspective variation are suitable for hypothesis generation. A means for determining the pose of constructed geometric forms whose algebraic surface descriptors are nonlinear in terms of their orienting parameters was developed. This was done by means of linear functions which are capable of approximating nonlinear forms and determining their parameters. It was shown that biquadratic surfaces are suitable companion linear forms for cylindrical approximation and parameter estimation. The estimates provided the initial parametric approximations necessary for a nonlinear regression stage to fine tune the estimates by fitting the actual nonlinear form to the data. A hypothesis-based split-merge algorithm for extraction and pose determination of cylinders and planes which merge smoothly into other surfaces was developed. It was shown that all split-merge algorithms are hypothesis-based. A finite-state algorithm for the extraction of the boundaries of run-length regions was developed. The computation takes advantage of the run list topology and boundary direction constraints implicit in the run-length encoding.

Quek, Kok How Francis↗
DOE OSTI2022

Topological field theory with Haagerup symmetry

Here, we construct a (1 + 1)d topological field theory (TFT) whose topological defect lines (TDLs) realize the transparent Haagerup $\mathscr{H}$ 3 fusion category. This TFT has six vacua, and each of the three non-invertible simple TDLs hosts three defect operators, giving rise to a total of 15 point-like operators. The TFT data, including the three-point coefficients and lasso diagrams, are determined by solving all the sphere four-point crossing equations and torus one-point modular invariance equations. We further verify that the Cardy states furnish a non-negative integer matrix representation under TDL fusion. While many of the constraints we derive are not limited to this particular TFT with six vacua, we leave open the construction of TFTs with two or four vacua. Finally, TFTs realizing the Haagerup $\mathscr{H}$ 1 and $\mathscr{H}$ 2 fusion categories can be obtained by gauging algebra objects. This article makes a modest offering in our pursuit of exotica and the quest for their eventual conformity.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2008

Observability and Estimation of Distributed Space Systems via Local Information-Exchange Networks

In this work, we develop an approach to formation estimation by explicitly characterizing formation's system-theoretic attributes in terms of the underlying inter-spacecraft information-exchange network. In particular, we approach the formation observer/estimator design by relaxing the accessibility to the global state information by a centralized observer/estimator- and in turn- providing an analysis and synthesis framework for formation observers/estimators that rely on local measurements. The noveltyof our approach hinges upon the explicit examination of the underlying distributed spacecraft network in the realm of guidance, navigation, and control algorithmic analysis and design. The overarching goal of our general research program, some of whose results are reported in this paper, is the development of distributed spacecraft estimation algorithms that are scalable, modular, and robust to variations inthe topology and link characteristics of the formation information exchange network. In this work, we consider the observability of a spacecraft formation from a single observation node and utilize the agreement protocol as a mechanism for observing formation states from local measurements. Specifically, we show how the symmetry structure of the network, characterized in terms of its automorphism group, directly relates to the observability of the corresponding multi-agent system The ramification of this notion of observability over networks is then explored in the context of distributed formation estimation.

observability↗
DOE OSTI2022

Closures for multicomponent reacting flows based on dispersion analysis

This work presents algebraic closure models associated with advective transport and nonlinear reactions in a Reynolds-averaged Navier-Stokes context for a system of species subject to binary reactions and transport by advection and diffusion. Expanding upon analysis originally developed for non-reactive transport in the context of Taylor dispersion of scalars, this work extends the modified gradient diffusion model explicated by Peters [N. Peters, Turbulent Combustion, Cambridge Monographs on Mechanics (Cambridge University Press, Cambridge, 2000)] and based on work by Corrsin [S. Corrsin, The reactant concentration spectrum in turbulent mixing with a first-order reaction, J. Fluid Mech. 11, 407 (1961)] beyond single-component transport phenomena and involving nonlinear reactions. The presented model forms, from this weakly nonlinear extension of the original dispersion theory, lead to an analytic expression for the eddy diffusivity matrix that explicitly captures the influence of the reaction kinetics on the closure operators. Furthermore, we demonstrate that the derived model form directly translates between flow topologies through a priori and a posteriori testing of a binary species system subject to homogeneous isotropic turbulence. Using two- and three-dimensional direct numerical simulations involving laminar and turbulent flows, it is shown that this framework improves prediction of mean quantities compared to previous results. Lastly, the presented model form, collapses to the earlier gradient diffusion and its modified version derived by Corrsin in the limits of nonreactive species and linear reactions, respectively.

42 ENGINEERING↗
NASA NTRS1989

Topology and grid adaption for high-speed flow computations

This study investigates the effects of grid topology and grid adaptation on numerical solutions of the Navier-Stokes equations. In the first part of this study, a general procedure is presented for computation of high-speed flow over complex three-dimensional configurations. The flow field is simulated on the surface of a Butler wing in a uniform stream. Results are presented for Mach number 3.5 and a Reynolds number of 2,000,000. The O-type and H-type grids have been used for this study, and the results are compared together and with other theoretical and experimental results. The results demonstrate that while the H-type grid is suitable for the leading and trailing edges, a more accurate solution can be obtained for the middle part of the wing with an O-type grid. In the second part of this study, methods of grid adaption are reviewed and a method is developed with the capability of adapting to several variables. This method is based on a variational approach and is an algebraic method. Also, the method has been formulated in such a way that there is no need for any matrix inversion. This method is used in conjunction with the calculation of hypersonic flow over a blunt-nose body. A movie has been produced which shows simultaneously the transient behavior of the solution and the grid adaption.

Abolhassani, Jamshid S.↗
DOE OSTI2020

Spin structures and baby universes

We extend a 2d topological model of the gravitational path integral to include sums over spin structure, corresponding to Neveu-Schwarz (NS) or Ramond (R) boundary conditions for fermions. This path integral corresponds to a correlator of boundary creation operators on a non-trivial baby universe Hilbert space, and vanishes when the number of R boundaries is odd. This vanishing implies a non-factorization of the correlator, which necessitates a dual interpretation of the bulk path integral in terms of a product of partition functions (associated to NS boundaries) and Witten indices (associated to R boundaries), averaged over an ensemble of theories with varying Hilbert space dimension and different numbers of bosonic and fermionic states. We also consider a model with End-of-the-World (EOW) branes, for which the dual ensemble then includes a sum over randomly chosen fermionic and bosonic states. We propose two modifications of the bulk path integral which restore an interpretation in a single dual theory: (i) a geometric prescription where we add extra boundaries with a sum over their spin structures, and (ii) an algebraic prescription involving “spacetime D-branes”. We extend our ideas to Jackiw-Teitelboim gravity, and propose a dual description of a single unitary theory with spin structure in a system with eigenbranes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1990

Recursive dynamics for flexible multibody systems using spatial operators

Due to their structural flexibility, spacecraft and space manipulators are multibody systems with complex dynamics and possess a large number of degrees of freedom. Here the spatial operator algebra methodology is used to develop a new dynamics formulation and spatially recursive algorithms for such flexible multibody systems. A key feature of the formulation is that the operator description of the flexible system dynamics is identical in form to the corresponding operator description of the dynamics of rigid multibody systems. A significant advantage of this unifying approach is that it allows ideas and techniques for rigid multibody systems to be easily applied to flexible multibody systems. The algorithms use standard finite-element and assumed modes models for the individual body deformation. A Newton-Euler Operator Factorization of the mass matrix of the multibody system is first developed. It forms the basis for recursive algorithms such as for the inverse dynamics, the computation of the mass matrix, and the composite body forward dynamics for the system. Subsequently, an alternative Innovations Operator Factorization of the mass matrix, each of whose factors is invertible, is developed. It leads to an operator expression for the inverse of the mass matrix, and forms the basis for the recursive articulated body forward dynamics algorithm for the flexible multibody system. For simplicity, most of the development here focuses on serial chain multibody systems. However, extensions of the algorithms to general topology flexible multibody systems are described. While the computational cost of the algorithms depends on factors such as the topology and the amount of flexibility in the multibody system, in general, it appears that in contrast to the rigid multibody case, the articulated body forward dynamics algorithm is the more efficient algorithm for flexible multibody systems containing even a small number of flexible bodies. The variety of algorithms described here permits a user to choose the algorithm which is optimal for the multibody system at hand. The availability of a number of algorithms is even more important for real-time applications, where implementation on parallel processors or custom computing hardware is often necessary to maximize speed.

Jain, A.↗
DOE OSTI2025

Para-particle oscillator simulations on a trapped-ion quantum computer

Deformed oscillators allow for a generalization of the standard fermions and bosons, namely, for the description of para-particles. Such particles remain hypothetical and unobserved in nature; yet, they can model physical phenomena, such as topological phases of matter. Here, we report the digital quantum simulation of para-particle oscillators by mapping para-particle states to the state of a qubit register, which allows us to identify the para-particle oscillator Hamiltonian as an XY model and further digitize the system onto a universal set of gates. In both instances, the gate depth grows polynomially with the number of qubits used. To establish the validity of our results, we experimentally simulate the dynamics of para-fermions and para-bosons, demonstrating full control of para-particle oscillators on a quantum computer. Furthermore, we compare the overall performance of the digital simulation of dynamics of the driven para-Fermi oscillator to a recent analog quantum simulation result.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗