Search NASA⌕ Search

SEARCH · Search NASA

Results for “Convex geometry”

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.

75 records · Page 5

Concavity-based local erosion and sphere-size-based local dilation applied to lithium-ion battery electrode microstructures for particle identification

Performance metrics of lithium-ion batteries can be extracted from the analysis of electrode microstructures nanoscale imaging. The characterization workflow can involve a challenging particle identification, or instance segmentation, step. In this work, we propose a new identification method based on an original transformation: a sphere-size-based local dilation followed by a concavity-based local erosion, that is local morphology closing. The new transformation is much more efficient than the global morphology closing, with correct identification achieved with only 1.7 % dilation volume and 2.6 % erosion volume on a test geometry, compared to 39.2 % and more than 50 %, respectively, with its global counterpart. The new method has been then benchmarked versus other identification algorithms (watershed and pseudo coulomb repulsive field) on a real electrode microstructure with equal or better segmentation achieved.

25 ENERGY STORAGE↗

Adjoint Formulation for an Embedded-Boundary Cartesian Method

Many problems in aerodynamic design can be characterized by smooth and convex objective functions. This motivates the use of gradient-based algorithms, particularly for problems with a large number of design variables, to efficiently determine optimal shapes and configurations that maximize aerodynamic performance. Accurate and efficient computation of the gradient, however, remains a challenging task. In optimization problems where the number of design variables dominates the number of objectives and flow- dependent constraints, the cost of gradient computations can be significantly reduced by the use of the adjoint method. The problem of aerodynamic optimization using the adjoint method has been analyzed and validated for both structured and unstructured grids. The method has been applied to design problems governed by the potential, Euler, and Navier-Stokes equations and can be subdivided into the continuous and discrete formulations. Giles and Pierce provide a detailed review of both approaches. Most implementations rely on grid-perturbation or mapping procedures during the gradient computation that explicitly couple changes in the surface shape to the volume grid. The solution of the adjoint equation is usually accomplished using the same scheme that solves the governing flow equations. Examples of such code reuse include multistage Runge-Kutta schemes coupled with multigrid, approximate-factorization, line-implicit Gauss-Seidel, and also preconditioned GMRES. The development of the adjoint method for aerodynamic optimization problems on Cartesian grids has been limited. In contrast to implementations on structured and unstructured grids, Cartesian grid methods decouple the surface discretization from the volume grid. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin e t al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation.

Nemec, Marian↗

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↗