Search NASA⌕ Search

SEARCH · Search NASA

Results for “Polytopes”

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 19 records

Statistics of base polytopes in F-theory

We propose a new statistical ensemble of toric bases for elliptic Calabi-Yaus used in F-theory models, by focusing on only the convex hull of the base, i.e., the base polytope. This physically motivated coarse-graining greatly simplifies the combinatorial complexity of the part of the 4d F-theory landscape with toric bases. We develop a Monte Carlo approach that randomly samples the base polytopes within fixed boxes, with proper statistical weights. We first apply the algorithm to the set of 2d base polytopes, generating an enlarged set of toric 2d bases that include certain types of codimension-two (4,6) points, and we validate our approach against exact numbers. We then explore the set of 3d base polytopes which fit in a set of “maximal” 3d boxes, and estimate the total number of inequivalent 3d base polytopes to be 10 85 –10 90 . We provide statistical data such as the distribution of non-Higgsable gauge groups on these bases. Amusingly, a similar method can also be applied to generate reflexive polytopes in various dimensions. In both the reflexive and base polytope cases, the number of relevant polytopes obeys a Gaussian distribution as a function of the number of vertices, which can be understood in terms of other results on random polytopes in the math literature.

Differential and algebraic geometry↗

Reducing Conservativeness of Polytopic Linear-Parameter-Varying Robust Vehicle Sideslip Angle Observer Through Minimum-Area Convex Quadrilateral Design

The polytopic linear-parameter-varying (LPV) method has become increasingly popular for designing intelligent control and estimation systems for ground vehicles, particularly for the vehicle sideslip angle observer. In vehicle lateral dynamics, the vehicle longitudinal velocity-induced nonlinearities are conventionally outer-approximated with polytopes such as rectangles or triangles to obtain a polytopic LPV system. Yet, such polytopic approximations tend to be conservative and may lead to inadequate observer performance. To address this issue, a minimum-area convex quadrilateral construction is proposed in this paper to reduce design conservatism. The suggested design is demonstrated through the synthesis of an LPV H ∞ robust vehicle sideslip angle observer. Furthermore, a dSPACE-ASM simulation study is conducted to demonstrate the effectiveness and the advantage of the proposed polytopic construction over a baseline approach.

Zhou, Xingyu↗

A polynomial time algorithm for checking the robust stability of a polytope of polynomials

An efficient algorithm to check the robust stability of a polytope of polynomials is proposed. This problem is equivalent to a zero-exclusion condition at each frequency. It is shown that such a condition has to be checked at only a finite number of frequencies. This problem is formulated as a parametric linear program, which can be solved by the simplex procedure with additional computations between steps, consisting of polynomial evaluations and calculation of positive polynomial roots. The algorithm requires a finite number of steps (corresponding to frequency checks), and, in the important case of the polytope of parameters being a hypercube, this number is at most O(m3n), where n is the degree of the polynomials in the family and m is the number of parameters.

Sideris, Athanasios↗

Polytopic vector analysis in igneous petrology: Application to lunar petrogenesis

Lunar samples represent a heterogeneous assemblage of rocks with complex inter-relationships that are difficult to decipher using standard petrogenetic approaches. These inter-relationships reflect several distinct petrogenetic trends as well as thermomechanical mixing of distinct components. Additional complications arise from the unequal quality of chemical analyses and from the fact that many samples (e.g., breccia clasts) are too small to be representative of the system from which they derived. Polytopic vector analysis (PVA) is a multi-variate procedure used as a tool for exploratory data analysis. PVA allows the analyst to classify samples and clarifies relationships among heterogenous samples with complex petrogenetic histories. It differs from orthogonal factor analysis in that it uses non-orthogonal multivariate sample vectors to extract sample endmember compositions. The output from a Q-mode (sample based) factor analysis is the initial step in PVA. The Q-mode analysis, using criteria established by Miesch and Klovan and Miesch, is used to determine the number of endmembers in the data system. The second step involves determination of endmembers and mixing proportions with all output expressed in the same geochemical variable as the input. The composition of endmembers is derived by analysis of the variability of the data set. Endmembers need not be present in the data set, nor is it necessary for their composition to be known a priori. A set of any endmembers defines a 'polytope' or classification figure (triangle for a three component system, tetrahedron for a four component system, a 'five-tope' in four dimensions for five component system, et cetera).

Shervais, John W.↗

A variational mimetic finite difference method for elliptic interface problems on non-matching polytopal meshes with geometric interface inconsistencies

A new variational mimetic finite difference method for elliptic interface problems with perfect and imperfect thermal contacts on non-matching polytopal meshes with geometric interface inconsistencies is developed and analyzed theoretically and numerically. The method is defined on multiple non-matching submeshes with gaps and overlaps along their interfaces. The discrete equations are derived from a minimization problem for the augmented Dirichlet functional. For a perfect thermal contact, the functional uses a modified mimetic gradient with extended stencil which couples unknowns from both sides of an interface, as well as penalty terms to enforce weak continuity of temperature across the interface. The method leads to a symmetric positive definite matrix for any scaling of the penalty terms. For an imperfect thermal contact, the Dirichlet functional is supplemented with a quadratic jump term along the interface related to the interface thermal resistance. We prove that the method conserves the total heat flux across each interface. In conclusion, the obtained results are verified with numerical experiments showing convergence in the discrete L 2 and L ∞ norms.

97 MATHEMATICS AND COMPUTING↗

Efficient distance calculation using the spherically-extended polytope (s-tope) model

An object representation scheme which allows for Euclidean distance calculation is presented. The object model extends the polytope model by representing objects as the convex hull of a finite set of spheres. An algorithm for calculating distances between objects is developed which is linear in the total number of spheres specifying the two objects.

Hamlin, Gregory J.↗

Two arm robot path planning in a static environment using polytopes and string stretching

The two arm robot path planning problem has been analyzed and reduced into components to be simplified. This thesis examines one component in which two Puma-560 robot arms are simultaneously holding a single object. The problem is to find a path between two points around obstacles which is relatively fast and minimizes the distance. The thesis involves creating a structure on which to form an advanced path planning algorithm which could ideally find the optimum path. An actual path planning method is implemented which is simple though effective in most common situations. Given the limits of computer technology, a 'good' path is currently found. Objects in the workspace are modeled with polytopes. These are used because they can be used for rapid collision detection and still provide a representation which is adequate for path planning.

Schima, Francis J., III↗

New Calabi–Yau manifolds from genetic algorithms

Calabi–Yau manifolds can be obtained as hypersurfaces in toric varieties built from reflexive polytopes. We generate reflexive polytopes in various dimensions using a genetic algorithm. As a proof of principle, we demonstrate that our algorithm reproduces the full set of reflexive polytopes in two and three dimensions, and in four dimensions with a small number of vertices and points. Motivated by this result, we construct five-dimensional reflexive polytopes with the lowest number of vertices and points. By calculating the normal form of the polytopes, we establish that many of these are not in existing datasets and therefore give rise to new Calabi–Yau four-folds. In some instances, the Hodge numbers we compute are new as well.

Astronomy & Astrophysics↗

Cosmohedra

It has been a long-standing challenge to find a geometric object underlying the cosmological wavefunction for Tr(ϕ 3 ) theory, generalizing associahedra and surfacehedra for scattering amplitudes. In this note, we describe a new class of polytopes — “cosmohedra” — that provide a natural solution to this problem. The faces of associahedra capture the combinatorics of non-overlapping chords of the momentum polygon, reflecting all partial factorizations of amplitudes. Cosmohedra are far richer — instead of non-overlapping chords, their faces capture the “russian doll” structure of non-overlapping subpolygons that determine the wavefunction. We show that cosmohedra are intimately related to associahedra, obtained by “blowing up” faces of the associahedron in a simple way. We give a full combinatorial description of cosmohedron faces and their factorization properties, and provide an explicit realization in terms of facet inequalities that further “shave” the facet inequalities of the associahedron. We also discuss a novel way for computing the wavefunction from cosmohedron geometry that extends the usual connection with polytope canonical forms. We illustrate cosmohedra with examples at tree-level and one loop; the close connection to surfacehedra suggests the generalization to all loop orders. Moving beyond the wavefunction, we briefly describe “cosmological correlahedra” for full correlators, which are one higher-dimensional polytopes, interpolating between associahedra and cosmohedra on opposite facets in an extra direction associated with the total energy. We speculate on how the existence of cosmohedra might suggest a “stringy” formulation for the cosmological wavefunction/correlators, generalizing the way in which the Minkowski sum decomposition of associahedra naturally extend particle to string amplitudes.

Scattering Amplitudes↗

Large deformations of Tr(Φ 3 ) and the world at infinity

The amplitudes of the non-linear sigma model can be obtained from those of Tr(Φ 3 ) theory by sending the kinematic (Mandelstam) variables to infinity in a certain direction. In this paper we characterize the behavior of Tr(Φ 3 ) amplitudes under a general class of large kinematic shifts called g-vector shifts. The objects that live in this world at infinity retain certain key amplitude-like properties, most notably factorization, and admit descriptions in terms of polytopes, but they are not generally amplitudes of any cognizable theory. We identify particular g-vector shifts that lead at infinity to mixed amplitudes involving two pions and any number of scalars, allowing us to provide polytopal descriptions of these amplitudes.

effective field theories↗

Parametric Modeling and Fault Tolerant Control

Fault tolerant control is considered for a nonlinear aircraft model expressed as a linear parameter-varying system. By proper parameterization of foreseeable faults, the linear parameter-varying system can include fault effects as additional varying parameters. A recently developed technique in fault effect parameter estimation allows us to assume that estimates of the fault effect parameters are available on-line. Reconfigurability is calculated for this model with respect to the loss of control effectiveness to assess the potentiality of the model to tolerate such losses prior to control design. The control design is carried out by applying a polytopic method to the aircraft model. An error bound on fault effect parameter estimation is provided, within which the Lyapunov stability of the closed-loop system is robust. Our simulation results show that as long as the fault parameter estimates are sufficiently accurate, the polytopic controller can provide satisfactory fault-tolerance.

Wu, N. Eva↗

Cooperative chemical adsorption of acid gases in functionalized metal-organic frameworks

A system and method for acid gas separations using porous frameworks of metal atoms coordinatively bound to polytopic linkers that are functionalized with basic nitrogen ligands that expose nitrogen atoms to the pore volumes forming adsorption sites. Adjacent basic nitrogen ligands on the metal-organic framework can form an ammonium from one ligand and a carbamate from the other. The formation of one ammonium carbamate pair influences the formation of ammonium carbamate on adjacent adsorption sites. Adsorption of acid gas at the adsorption sites form covalently linked aggregates of more than one ammonium carbamate ion pair. The acid gas adsorption isotherm can be tuned to match the step position with the partial pressure of acid gas in the gas mixture stream through manipulation of the metal-ligand bond strength by selection of the ligand, metal and polytopic linker materials.

Long, Jeffrey R.↗

Numerical integration in the virtual element method with the scaled boundary cubature scheme

Abstract The virtual element method (VEM) is a stabilized Galerkin method on meshes that consist of arbitrary (convex and nonconvex) polygonal and polyhedral elements. A crucial ingredient in the implementation of low‐ and high‐order VEM is the numerical integration of monomials and nonpolynomial functions over such elements. In this article, we apply the recently proposed scaled boundary cubature (SBC) scheme to compute the weak form integrals in various virtual element formulations over polygonal and polyhedral meshes. In doing so, we demonstrate the flexibility of the approach and the accuracy that it delivers on a broad suite of boundary‐value problems in 2D and 3D over polytopes with affine faces as well as on elements with curved boundaries. In addition, the use of the SBC scheme is exemplified in an enriched Poisson formulation of the VEM in which weakly singular functions are required to be integrated. This study establishes the SBC method as a simple, accurate and efficient integration scheme for use in the VEM.

Chin, Eric B.↗

Arbitrary Order Virtual Element Methods for High‐Order Phase‐Field Modeling of Dynamic Fracture

ABSTRACT Accurate modeling of fracture nucleation and propagation in brittle and ductile materials subjected to dynamic loading is important in predicting material damage and failure under extreme conditions. Phase‐field fracture models have garnered a lot of attention in recent years due to their success in representing damage and fracture processes in a wide class of materials and under a variety of loading conditions. Second‐order phase‐field fracture models are by far the most popular among researchers (and increasingly, among practitioners), but fourth‐order models have started to gain broader acceptance since their more recent introduction. The exact solution corresponding to these high‐order phase‐field fracture models has higher regularity. Thus, numerical solutions of the model equations can achieve improved accuracy and higher spatial convergence rates. In this work, we develop a virtual element framework for the high‐order phase‐field model of dynamic fracture. The virtual element method (VEM) can be regarded as a generalization of the classical finite element method. In addition to many other desirable characteristics, the VEM allows computing on polytopal meshes. Here, we use ‐conforming virtual elements and the generalized‐ time integration method for the momentum balance equation, and adopt ‐conforming virtual elements for the high‐order phase‐field equation. We verify our virtual element framework using classical quasi‐static benchmark problems and demonstrate its capabilities with the aid of numerical simulations of dynamic fracture in brittle materials.

42 ENGINEERING↗

Cosmology meets cohomology

The cosmological polytope and bootstrap programs have revealed interesting connections between positive geometries, modern on-shell methods and bootstrap principles studied in the amplitudes community with the wavefunction of the Universe in toy models of FRW cosmologies. To compute these FRW correlators, one often faces integrals that are too difficult to evaluate by direct integration. Borrowing from the Feynman integral community, the method of (canonical) differential equations provides an efficient alternative for evaluating these integrals. Moreover, we further develop our geometric understanding of these integrals by describing the associated relative twisted cohomology. Leveraging recent progress in our understanding of relative twisted cohomology in the Feynman integral community, we give an algorithm to predict the basis size and simplify the computation of the differential equations satisfied by FRW correlators.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Hidden zeros of the cosmological wavefunction

Motivated by the recent discovery of hidden zeros in particle and string amplitudes, we characterize zeros of individual graph contributions to the cosmological wavefunction of a scalar field theory. We demonstrate that these contributions factorize near these zeros for all tree graphs and provide evidence that this extends to loop graphs as well. We explicitly construct polytopal realizations of the relevant graph associahedra and show that the cosmological zeros have natural geometric and physical interpretations. As a byproduct, we establish an equivalence between the wavefunction coefficients of chain graphs and flat-space Tr(ϕ 3 ) amplitudes, enabling us to leverage the cosmological zeros to uncover the recently discovered hidden zeros of colored amplitudes.

Cosmological models↗

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↗