Search NASA⌕ Search

SEARCH · Search NASA

Results for “polytopal method”

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 37 records · Page 2

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↗

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↗

A Fully Computable A Posteriori Error Estimate for the Stokes Equations on Polytopal Meshes

Here in this paper, we present a simple a posteriori error estimate for the weak Galerkin finite element method for the Stokes equation. This residual type estimator can be applied to general meshes such as polytopal mesh or meshes with hanging nodes. The reliability and efficiency of the estimator are proved in this paper. Five numerical tests demonstrate the effectiveness and flexibility of the adaptive mesh refinement guided by the designed error estimator.

finite element methods↗

Compatible, energy conserving, bounds preserving remap of hydrodynamic fields for an extended ALE scheme

From the very origins of numerical hydrodynamics in the Lagrangian work of von Neumann and Richtmyer [83], the issue of total energy conservation as well as entropy production has been problematic. Because of well known problems with mesh deformation, Lagrangian schemes have evolved into Arbitrary Lagrangian–Eulerian (ALE) methods [39] that combine the best properties of Lagrangian and Eulerian methods. Energy issues have persisted for this class of methods. We believe that fundamental issues of energy conservation and entropy production in ALE require further examination. The context of the paper is an ALE scheme that is extended in the sense that it permits cyclic or periodic remap of data between grids of the same or differing connectivity. The principal design goals for a remap method then consist of total energy conservation, bounded internal energy, and compatibility of kinetic energy and momentum. We also have secondary objectives of limiting velocity and stress in a non-directional manner, keeping primitive variables monotone, and providing a higher than second order reconstruction of remapped variables. Particularly, the new contributions fall into three categories associated with: energy conservation and entropy production, reconstruction and bounds preservation of scalar and tensor fields, and conservative remap of nonlinear fields. Our paper presents a derivation of the methods, details of implementation, and numerical results for a number of test problems. The methods requires volume integration of polynomial functions in polytopal cells with planar facets, and the requisite expressions are derived for arbitrary order.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical experiments with the extended virtual element method for the Laplace problem with strong discontinuities

The virtual element method (VEM) is a stabilized Galerkin formulation on arbitrary polytopal meshes. In the VEM, the basis functions are implicit (virtual) — they are not known nor do they need to be computed within the problem domain. Suitable projection operators are used to decompose the bilinear form at the element-level into two parts: a consistent term that reproduces a given polynomial space and a correction term that ensures stability. In this study, we consider a low-order extended virtual element method (X-VEM) that is in the spirit of the extended finite element method for crack problems. Herein, we focus on the two-dimensional Laplace crack problem. In the X-VEM, we enrich the standard virtual element space with additional discontinuous functions through the framework of partition-of-unity. The nodal basis functions in the VEM are chosen as the partition-of-unity functions, and we study means to stabilize the standard and enriched sub-matrices that constitute the element stiffness matrix. Numerical experiments are performed on the problem of a cracked membrane under mode III loading to affirm the accuracy, and to establish the optimal convergence in energy of the method.

97 MATHEMATICS AND COMPUTING↗

Extended virtual element method for the Laplace problem with singularities and discontinuities

In this paper, we propose the extended virtual element method (X-VEM) to treat singularities and crack discontinuities that arise in the Laplace problem. The virtual element method (VEM) is a stabilized Galerkin formulation on arbitrary polytopal meshes, wherein the basis functions are implicit (virtual)—they are not known explicitly nor do they need to be computed within the problem domain. In this work, suitable projection operators are used to decompose the bilinear form on each element into two parts: a consistent term that reproduces the first-order polynomial space and a correction term that ensures stability. A similar approach is pursued in the X-VEM with a few notable extensions. To capture singularities and discontinuities in the discrete space, we augment the standard virtual element space with an additional contribution that consists of the product of virtual nodal basis (partition-of-unity) functions with enrichment functions. For discontinuities, basis functions are discontinuous across the crack and for singularities a weakly singular enrichment function that satisfies the Laplace equation is chosen. For the Laplace problem with a singularity, we devise an extended projector that maps functions that lie in the extended virtual element space onto linear polynomials and the enrichment function, whereas for the discontinuous problem, the consistent element stiffness matrix has a block-structure that is readily computed. An adaptive homogeneous numerical integration method is used to accurately and efficiently (no element-partitioning is required) compute integrals with integrands that are weakly singular. Once the element projection matrix is computed, the same steps as in the standard VEM are followed to compute the element stabilization matrix. Numerical experiments are performed on quadrilateral and polygonal (convex and nonconvex elements) meshes for the problem of an $\textit{L}$-shaped domain with a corner singularity and the problem of a cracked membrane under mode III loading, and results are presented that affirm the sound accuracy and demonstrate the optimal rates of convergence in the $\textit{L}^2$ norm and energy of the proposed method.

42 ENGINEERING↗

A Virtual Element Method for the Full MHD system

In this manuscript we present a novel discretization for the incompressible MHD system. Our approach follows the framework of the Virtual Element Method and offers two main advantages. The method can be implemented in unstructured meshes making it highly versatile and capable of handling a wide array of problems involving interfaces, free-boundaries or adaptive refinements on the mesh. The second advantage involves the divergence of the magnetic field, our approach guarantees that it remains solenoidal. We include a theoretical proof of the condition on the magnetic field as well as energy estimates and a well-posedness study. The latter sheds light as to the stability properties of the method.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Design, analysis and preliminary numerical results for the nonconforming VEM for parabolic problems

The virtual element method (VEM) is a numerical methodology for solving partial differential equations on unstructured polytopal meshes. In this work, we extend the nonconforming high-order formulation suitable to time-dependent diffusion problems with possibly nonlinear forcing terms. Coupling high-order virtual element formulations in space with time-marching schemes based on Backward Differention Formulas (BDFs) makes a fully discrete method with optimal order of convergence in the Method of Lines framework. We investigate and assess the performance of the method through theoretical analysis and a set of numerical experiments.

97 MATHEMATICS AND COMPUTING↗

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.

36 MATERIALS SCIENCE↗

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.↗

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↗

Discontinuous Galerkin gradient discretisations for the approximation of second-order differential operators in divergence form

We include in the gradient discretisation method (GDM) framework two numerical schemes based on discontinuous Galerkin approximations: the symmetric interior penalty Galerkin (SIPG) method, and the scheme obtained by averaging the jumps in the SIPG method. We prove that these schemes meet the main mathematical gradient discretisation properties on any kind of polytopal mesh, by adapting discrete functional analysis properties to our precise geometrical hypotheses. Therefore, these schemes inherit the general convergence properties of the GDM, which hold for instance in the cases of the p-Laplace problem and of the anisotropic and heterogeneous diffusion problem. This is illustrated by simple 1D and 2D numerical examples.

97 MATHEMATICS AND COMPUTING↗

Characterizing Time Series Data Diversity for Wind Forecasting

Wind forecasting plays an important role in integrating variable and uncertain wind power into the power grid. Various forecasting models have been developed to improve the forecasting accuracy. However, it is challenging to accurately compare the true forecasting performances from different methods and forecasters due to the lack of diversity in forecasting test datasets. This paper proposes a time series characteristic analysis approach to visualize and quantify wind time series diversity. The developed method first calculates six time series characteristic indices from various perspectives. Then the principal component analysis is performed to reduce the data dimension while preserving the important information. The diversity of the time series dataset is visualized by the geometric distribution of the newly constructed principal component space. The volume of the 3-dimensional (3D) convex polytope (or the length of 1D number axis, or the area of the 2D convex polygon) is used to quantify the time series data diversity. The method is tested with five datasets with various degrees of diversity.

big data visualization↗

Characterizing Time Series Data Diversity for Wind Forecasting: Preprint

Wind forecasting plays an important role in integrating variable and uncertain wind power into the power grid. Various forecasting models have been developed to improve the forecasting accuracy. However, it is challenging to accurately compare the true forecasting performances from different methods and forecasters due to the lack of diversity in forecasting test datasets. This paper proposes a time series characteristic analysis approach to visualize and quantify wind time series diversity. The developed method first calculates six time series characteristic indices from various perspectives. Then the principal component analysis is performed to reduce the data dimension while preserving the important information. The diversity of the time series dataset is visualized by the geometric distribution of the newly constructed principal component space. The volume of the 3-dimensional (3D) convex polytope (or the length of 1D number axis, or the area of the 2D convex polygon) is used to quantify the time series data diversity. The method is tested with five datasets with various degrees of diversity.

17 WIND ENERGY↗

A new weak Galerkin finite element method for elliptic interface problems

We introduce and analyze a new weak Galerkin (WG) finite element method in this paper for solving second order elliptic equations with discontinuous coefficients and interfaces. Comparing with the existing WG algorithm for solving the same type problems, the present WG method has a simpler variational formulation and fewer unknowns. Moreover, the new WG algorithm allows the use of finite element partitions consisting of general polytopal meshes and can be easily generalized to high orders. Optimal order error estimates in both H1 and L2 norms are established for the present WG finite element solutions. We conducted extensive numerical experiments in order to examine the accuracy, flexibility, and robustness of the proposed WG interface approach. In solving regular elliptic interface problems, high order convergences are numerically confirmed by using piecewise polynomial basis functions of high degrees. Moreover, the WG method is shown to be able to accommodate very complicated interfaces, due to its flexibility in choosing finite element partitions. Finally, in dealing with challenging problems with low regularities, the piecewise linear WG method is capable of delivering a second order of accuracy in L∞ norm for both C1 and H2 continuous solutions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Positive geometries and canonical forms

Recent years have seen a surprising connection between the physics of scattering amplitudes and a class of mathematical objects — the positive Grassmannian, positive loop Grassmannians, tree and loop Amplituhedra — which have been loosely referred to as “positive geometries”. The connection between the geometry and physics is provided by a unique differential form canonically determined by the property of having logarithmic singularities (only) on all the boundaries of the space, with residues on each boundary given by the canonical form on that boundary. The structures seen in the physical setting of the Amplituhedron are both rigid and rich enough to motivate an investigation of the notions of “positive geometries” and their associated “canonical forms” as objects of study in their own right, in a more general mathematical setting. In this paper we take the first steps in this direction. We begin by giving a precise definition of positive geometries and canonical forms, and introduce two general methods for finding forms for more complicated positive geometries from simpler ones — via “triangulation” on the one hand, and “push-forward” maps between geometries on the other. We present numerous examples of positive geometries in projective spaces, Grassmannians, and toric, cluster and flag varieties, both for the simplest “simplex-like” geometries and the richer “polytope-like” ones. We also illustrate a number of strategies for computing canonical forms for large classes of positive geometries, ranging from a direct determination exploiting knowledge of zeros and poles, to the use of the general triangulation and push-forward methods, to the representation of the form as volume integrals over dual geometries and contour integrals over auxiliary spaces. These methods yield interesting representations for the canonical forms of wide classes of positive geometries, ranging from the simplest Amplituhedra to new expressions for the volume of arbitrary convex polytopes.

97 MATHEMATICS AND COMPUTING↗

The mimetic finite difference method for the Landau–Lifshitz equation

The Landau–Lifshitz equation describes the dynamics of the magnetization inside ferromagnetic materials. This equation is highly nonlinear and has a non-convex constraint (the magnitude of the magnetization is constant) which poses interesting challenges in developing numerical methods. We develop and analyze explicit and implicit mimetic finite difference schemes for this equation. These schemes work on general polytopal meshes which provide enormous flexibility to model magnetic devices with various shapes. A projection on the unit sphere is used to preserve the magnitude of the magnetization. We also provide a proof that shows the exchange energy is decreasing in certain conditions. The developed schemes are tested on general meshes that include distorted and randomized meshes. As a result, the numerical experiments include a test proposed by the National Institute of Standard and Technology and a test showing formation of domain wall structures in a thin film.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An algorithm for linearizing convex extremal problems

This paper suggests a method of approximating the solution of minimization problems for convex functions of several variables under convex constraints is suggested. The main idea of this approach is the approximation of a convex function by a piecewise linear function, which results in replacing the problem of convex programming by a linear programming problem. To carry out such an approximation, the epigraph of a convex function is approximated by the projection of a polytope of greater dimension. In the first part of the paper, the problem is considered for functions of one variable. In this case, an algorithm for approximating the epigraph of a convex function by a polygon is presented, it is shown that this algorithm is optimal with respect to the number of vertices of the polygon, and exact bounds for this number are obtained. After this, using an induction procedure, the algorithm is generalized to certain classes of functions of several variables. Applying the suggested method, polynomial algorithms for an approximate calculation of the L{sub p}-norm of a matrix and of the minimum of the entropy function on a polytope are obtained. Bibliography: 19 titles.

97 MATHEMATICS AND COMPUTING↗