A Modeling Based Design of Polymer Manifolds for Heat Exchangers with Reduced Maldistribution
Explore the source record for details and available documents.
Zhang, Mingkan↗
SEARCH · Search NASA
Results for “Manifolds”
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.
Double-sided cooling cold plates with overhanging heat sinks and through body busbar for high-power density power electronics
A double-sided cold plate includes a manifold comprising openings extending from a first surface of the manifold through the manifold to a second surface of the manifold forming recesses within the manifold and an inlet channel and an outlet channel fluidly coupled to the recesses within the manifold, a plurality of first heat sinks coupled to the first surface of the manifold enclosing the openings on the first surface, and a plurality of second heat sinks positioned adjacent each other along a length of the manifold and coupled to the second surface of the manifold, enclosing the openings on the second surface, a width of the plurality of second heat sinks is greater than a width of the manifold thereby forming an overhanging portion on each lengthwise side of the manifold, the overhanging portion configured to mechanically support a plurality of electrical components positioned around a perimeter of the manifold.
Zhou, Feng↗
Geometric Interpretation of the Cluster Location Problem Part I: Theory
We present a new framing of the seismic location problem using principles drawn from differential geometry. Our interpretation relies upon the common assumption that travel times observed across a network are continuous, differentiable functions of source location. In consequence, travel‐time functions constitute a differentiable map between the source region and a Riemannian manifold. The manifold is said to be the image of the source region embedded in a generally high‐dimension travel‐time vector space. A cluster of events in the source region has an image of discrete points on the manifold, that, except in the simplest cases, cannot be viewed directly. However, it is possible to project the image of a cluster into a tangent space of the manifold for direct visualization. The projection operator can be computed directly from the data without a velocity model, but produces a distorted rendering of the cluster geometry. With a model we can predict the distortions and correct them to estimate cluster geometry. We develop these points with the simplest possible example, one for which direct visualization of the manifold is possible, using the example as an introduction to the relevant concepts from differential geometry in a familiar setting. The tangent space, a local linearization of the manifold, plays a key role. We develop a metric to estimate the limits of linearization, that is, to determine when the curvature of the manifold invalidates the linear assumption. We also examine the interplay of model error, inadequate network geometry, and pick error. We then generalize our results from the simple case to the general case of 3D source regions observed by general networks. Although we do suggest a new “project and correct” method for location, we do not develop it into a practical algorithm. In conclusion, our intention rather is to highlight new analytical methods grounded in differential geometry.
East Pacific Ocean Islands↗
Remote detectability from entanglement bootstrap I: Kirby’s torus trick
Remote detectability is often taken as a physical assumption in the study of topologically ordered systems, and it is a central axiom of mathematical frameworks of topological quantum field theories. We show under the entanglement bootstrap approach that remote detectability is a necessary property; that is, we derive it as a theorem. Starting from a single wave function on a topologically-trivial region satisfying the entanglement bootstrap axioms, we can construct states on closed manifolds. The crucial technique is to immerse the punctured manifold into the topologically trivial region and then heal the puncture. This is analogous to Kirby’s torus trick. We then analyze a special class of such manifolds, which we call pairing manifolds. For each pairing manifold, which pairs two classes of excitations, we identify an analog of the topological S S -matrix. This pairing matrix is unitary, which implies remote detectability between two classes of excitations. These matrices are in general not associated with the mapping class group of the manifold. As a by-product, we can count excitation types (e.g., graph excitations in 3+1d). The pairing phenomenon occurs in many physical contexts, including systems in different dimensions, with or without gapped boundaries. We provide a variety of examples to illustrate its scope.
Shi, Bowen (ORCID:0000000206899964)↗
Deep nonparametric estimation of intrinsic data structures by chart autoencoders: Generalization error and robustness
Autoencoders have demonstrated remarkable success in learning low-dimensional latent features of high-dimensional data across various applications. Assuming that data are sampled near a low-dimensional manifold, we employ chart autoencoders, which encode data into low-dimensional latent features on a collection of charts, preserving the topology and geometry of the data manifold. Our paper establishes statistical guarantees on the generalization error of chart autoencoders, and we demonstrate their denoising capabilities by considering n noisy training samples, along with their noise-free counterparts, on a d-dimensional manifold. By training autoencoders, we show that chart autoencoders can effectively denoise the input data with normal noise. We prove that, under proper network architectures, chart autoencoders achieve a squared generalization error in the order of n–$\frac{2}{d+2}$log 4 n, which depends on the intrinsic dimension of the manifold and only weakly depends on the ambient dimension and noise level. We further extend our theory on data with noise containing both normal and tangential components, where chart autoencoders still exhibit a denoising effect for the normal component. As a special case, our theory also applies to classical autoencoders, as long as the data manifold has a global parametrization. Furthermore, our results provide a solid theoretical foundation for the effectiveness of autoencoders, which is further validated through several numerical experiments.
97 MATHEMATICS AND COMPUTING↗
Data-based filtered dissipation rate modelling for multi-modal turbulent combustion: evaluating a priori model generalizability
Manifold-based models offer a computationally efficient alternative to directly transporting the thermochemical state in computational simulations of turbulent reacting flows, projecting the high-dimensional thermochemical state-space onto a low-dimensional manifold. Recent efforts have yielded a manifold-based model applicable to multi-modal combustion, enabling reconstruction of the thermochemical state from solutions to two-dimensional manifold equations in mixture fraction and generalized progress variable that are parameterised by three scalar dissipation rates. In coarse-grained simulations such as Large Eddy Simulation (LES), closure of the multi-modal manifold equations and subfilter variances/covariance requires closure of three filtered scalar dissipation rates. Here, the present work adopts a data-based approach, providing closure for the three filtered scalar dissipation rates via deep neural networks (DNNs). High-fidelity datasets corresponding to an autoigniting n-dodecane jet flame and a bluff body swirl-stabilized confined lifted spray flame of two aviation fuels (Jet-A and C1) with different ignition propensities are leveraged to generate training data that spans a diverse range of thermodynamic conditions and combustion modes, including low- and high-temperature ignition regimes in addition to premixed and nonpremixed behaviour. A final DNN model is trained to enforce inherent physical constraints by learning nonlinear functional transformations of the three filtered scalar dissipation rates. The generalizability of this constrained DNN model is demonstrated a priori via conditional statistics evaluated on the lifted spray flame with C1–a configuration that had not been included in the training data. Excellent DNN agreement with conditional DNS statistics is observed, and integrated gradients are computed to identify the most sensitive input variables. The similarity of the marginal PDFs of the most informative input variables and outputs across configurations are quantified via the Wasserstein metric, demonstrating that data-based models may successfully generalize to unseen parametric conditions so long as the most informative input variables share similar distributions across training and testing datasets.
Data-based modelling↗
3d-3d correspondence for mapping tori
One of the main challenges in 3d-3d correspondence is that no existent approach offers a complete description of 3d N = 2 SCFT T [ M 3 ] — or, rather, a “collection of SCFTs” as we refer to it in the paper — for all types of 3-manifolds that include, for example, a 3-torus, Brieskorn spheres, and hyperbolic surgeries on knots. The goal of this paper is to overcome this challenge by a more systematic study of 3d-3d correspondence that, first of all, does not rely heavily on any geometric structure on M 3 and, secondly, is not limited to a particular supersymmetric partition function of T [ M 3 ]. In particular, we propose to describe such “collection of SCFTs” in terms of 3d N = 2 gauge theories with “non-linear matter” fields valued in complex group manifolds. As a result, we are able to recover familiar 3-manifold invariants, such as Turaev torsion and WRT invariants, from twisted indices and half-indices of T [ M 3 ], and propose new tools to compute more recent q -series invariants Z * ( M 3 ) in the case of manifolds with b 1 > 0. Although we use genus-1 mapping tori as our “case study,” many results and techniques readily apply to more general 3-manifolds, as we illustrate throughout the paper.
Topological Field Theories↗
Weyl-ambient geometries
Weyl geometry is a natural extension of conformal geometry with Weyl covariance mediated by a Weyl connection. We generalize the Fefferman-Graham (FG) ambient construction for conformal manifolds to a corresponding construction for Weyl manifolds. We first introduce the Weyl-ambient metric motivated by the Weyl-Fefferman-Graham (WFG) gauge. From a top-down perspective, we show that the Weyl-ambient space as a pseudo-Riemannian geometry induces a codimension-2 Weyl geometry. Then, from a bottom-up perspective, we start from promoting a conformal manifold into a Weyl manifold by assigning a Weyl connection to the principal R+-bundle realizing a Weyl structure. We show that the Weyl structure admits a well-defined initial value problem, which determines the Weyl-ambient metric. Through the Weyl-ambient construction, we also investigate Weyl-covariant tensors on the Weyl manifold and define extended Weyl-obstruction tensors explicitly.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Apparatus and method associated with reformer-less fuel cell
An electrolyte membrane for a reformer-less fuel cell is provided. The electrolyte membrane is assembled with fuel and air manifolds to form the fuel cell. The fuel manifold receives an oxidizable fuel from a fuel supply in a gaseous, liquid, or slurry form. The air manifold receives air from an air supply. The electrolyte membrane conducts oxygen in an ionic superoxide form when the fuel cell is exposed to operating temperatures above the boiling point of water to electrochemically combine the oxygen with the fuel to produce electricity. The electrolyte membrane includes a porous electrically non-conductive substrate, an anode catalyst layer deposited along a fuel manifold side of the substrate, a cathode catalyst layer deposited along an air manifold side of the substrate, and an ionic liquid filling the substrate between the anode and cathode catalyst layers. Methods for manufacturing and operating the electrolyte membrane are also provided.
Sahu, Saroj Kumar↗
Grassmannian diffusion maps based surrogate modeling via geometric harmonics
Abstract A novel surrogate model based on the Grassmannian diffusion maps (GDMaps) and utilizing geometric harmonics (GH) is developed for predicting the response of complex physical phenomena. The method utilizes GDMaps to obtain a low‐dimensional representation of the underlying behavior of physical/mathematical systems with respect to uncertain input parameters. Using this representation, GH, an out‐of‐sample extension technique, is employed to create a global map from the input parameter space to a Grassmannian diffusion manifold. GH is further employed to locally map points on the diffusion manifold onto the tangent space of a Grassmann manifold. The exponential map is then used to project the points in the tangent space onto the Grassmann manifold, where reconstruction of the full solution is performed. The performance of the proposed surrogate model is verified with three examples. The first problem is a toy example used to illustrate the technique. In the second example, errors associated with the various mappings are assessed by studying response predictions of the electric potential of a dielectric cylinder in a homogeneous electric field. The last example applies the method for uncertainty prediction in the strain field evolution in a model amorphous material using the shear transformation zone theory of plasticity.
42 ENGINEERING↗
Riemannian Optimization Applied to AC Optimal Power Flow: Preprint
The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. They demonstrate that these are viable computational alternatives to interior point methods. This is done by using Julia and the packages PowerModels.jl and Manopt.jl.
manifold optimization↗
Latent map Gaussian processes for mixed variable metamodeling
Gaussian processes (GPs) are ubiquitously used in sciences and engineering as metamodels. Standard GPs, however, can only handle numerical or quantitative variables. Here we introduce latent map Gaussian processes (LMGPs) that inherit the attractive properties of GPs and are also applicable to mixed data which have both quantitative and qualitative inputs. The core idea behind LMGPs is to learn a continuous, low-dimensional latent space or manifold which encodes all qualitative inputs. To learn this manifold, we first assign a unique prior vector representation to each combination of qualitative inputs. We then use a low-rank linear map to project these priors on a manifold that characterizes the posterior representations. As the posteriors are quantitative, they can be directly used in any standard correlation function such as the Gaussian or Matern. Hence, the optimal map and the corresponding manifold, along with other hyperparameters of the correlation function, can be systematically learned via maximum likelihood estimation. Through a wide range of analytic and real-world examples, we demonstrate the advantages of LMGPs over state-of-the-art methods in terms of accuracy and versatility. In particular, we show that LMGPs can handle variable-length inputs, have an explainable neural network interpretation, and provide insights into how qualitative inputs affect the response or interact with each other. We also employ LMGPs in Bayesian optimization and illustrate that they can discover optimal compound compositions more efficiently than conventional methods that convert compositions to qualitative variables via manual featurization.
42 ENGINEERING↗
Power Flow Geometry and Approximation
Here, the power flow equations are important in numerous power systems problems of practical interest which consider alternating current power flow (ACPF) physics. Perhaps the most well studied being the alternating current optimal power flow problem (ACOPF), seeking to optimize the operation of an electric power system. Due to their non-linearity, problems which include the power flow equations are typically challenging, particularly in optimization. Interestingly, the set of solutions to the power flow equations forms a smooth manifold. As a result, differential geometry can be used to describe and analyze this set of equations. This approach has proven effective in several engineering applications (e.g., solving ACOPF and analyzing the solution space boundary). Central to the success of this approach is an understanding of the power flow manifold's geometry. In this work, we develop the geometric and topological properties of this manifold using concepts from differential geometry. After demonstrating the convenience of this manifold's representation as a function's graph, computational methods are emphasized: we develop retractions, error bounds for linear approximation, and formulas for evaluating the Riemannian metric (including associated objects such as geodesics and the curvature tensor). Scalar curvature and the second fundamental form play a new role in quantifying the quality of linear approximations, like the popular direct current approximation. All functions are implemented in Julia and available in an online repository. Proofs are included for completeness.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Grassmannian Diffusion Maps--Based Dimension Reduction and Classification for High-Dimensional Data
This work introduces the Grassmannian diffusion maps (GDMaps), a novel nonlinear dimensionality reduction technique that defines the affinity between points through their representation as low-dimensional subspaces corresponding to points on the Grassmann manifold. Here, the method is designed for applications, such as image recognition and data-based classification of constrained high-dimensional data where each data point itself is a high-dimensional object (i.e., a large matrix) that can be compactly represented in a lower-dimensional subspace. The GDMaps is composed of two stages. The first is a pointwise linear dimensionality reduction wherein each high-dimensional object is mapped onto the Grassmann manifold representing the low-dimensional subspace on which it resides. The second stage is a multipoint nonlinear kernel-based dimension reduction using diffusion maps to identify the subspace structure of the points on the Grassmann manifold. To this end, an appropriate Grassmannian kernel is used to construct the transition matrix of a random walk on a graph connecting points on the Grassmann manifold. Spectral analysis of the transition matrix yields low-dimensional Grassmannian diffusion coordinates embedding the data into a low-dimensional reproducing kernel Hilbert space. Further, a novel data classification/recognition technique is developed based on the construction of an overcomplete dictionary of reduced dimension whose atoms are given by the Grassmannian diffusion coordinates. Three examples are considered. First, a "toy" example shows that the GDMaps can identify an appropriate parametrization of structured points on the unit sphere. The second example demonstrates the ability of the GDMaps to revealing the intrinsic subspace structure of high-dimensional random field data. In the last ex- ample, a face recognition problem is solved considering face images subject to varying illumination conditions, changes in face expressions, and occurrence of occlusions. The technique presented high recognition rates (i.e., 95% in the best case) using a fraction of the data required by conventional methods.
42 ENGINEERING↗
$\mathrm{A}$ $\mathrm{CFT}$ distance conjecture
We formulate a series of conjectures relating the geometry of conformal manifolds to the spectrum of local operators in conformal field theories in d > 2 spacetime dimensions. We focus on conformal manifolds with limiting points at infinite distance with respect to the Zamolodchikov metric. Our central conjecture is that all theories at infinite distance possess an emergent higher-spin symmetry, generated by an infinite tower of currents whose anomalous dimensions vanish exponentially in the distance. Stated geometrically, the diameter of a non-compact conformal manifold must diverge logarithmically in the higher-spin gap. In the holographic context our conjectures are related to the Distance Conjecture in the swampland program. Interpreted gravitationally, they imply that approaching infinite distance in moduli space at fixed AdS radius, a tower of higher-spin fields becomes massless at an exponential rate that is bounded from below in Planck units. We discuss further implications for conformal manifolds of superconformal field theories in three and four dimensions.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Mocking the u-plane integral
Abstract The u -plane integral is the contribution of the Coulomb branch to correlation functions of $${\mathcal {N}}=2$$ N = 2 gauge theory on a compact four-manifold. We consider the u -plane integral for correlators of point and surface observables of topologically twisted theories with gauge group $$\mathrm{SU}(2)$$ SU ( 2 ) , for an arbitrary four-manifold with $$(b_1,b_2^+)=(0,1)$$ ( b 1 , b 2 + ) = ( 0 , 1 ) . The u -plane contribution equals the full correlator in the absence of Seiberg–Witten contributions at strong coupling, and coincides with the mathematically defined Donaldson invariants in such cases. We demonstrate that the u -plane correlators are efficiently determined using mock modular forms for point observables, and Appell–Lerch sums for surface observables. We use these results to discuss the asymptotic behavior of correlators as function of the number of observables. Our findings suggest that the vev of exponentiated point and surface observables is an entire function of the fugacities.
Mathematics↗
The Stellar decomposition: A compact representation for simplicial complexes and beyond
Here, we introduce the Stellar decomposition, a model for efficient topological data structures over a broad range of simplicial and cell complexes. A Stellar decomposition of a complex is a collection of regions indexing the complex’s vertices and cells such that each region has sufficient information to locally reconstruct the star of its vertices, i.e., the cells incident in the region’s vertices. Stellar decompositions are general in that they can compactly represent and efficiently traverse arbitrary complexes with a manifold or non-manifold domain. They are scalable to complexes in high dimension and of large size, and they enable users to easily construct tailored application-dependent data structures using a fraction of the memory required by a corresponding global topological data structure on the complex. As a concrete realization of this model for spatially embedded complexes, we introduce the Stellar tree, which combines a nested spatial tree with a simple tuning parameter to control the number of vertices in a region. Stellar trees exploit the complex’s spatial locality by reordering vertex and cell indices according to the spatial decomposition and by compressing sequential ranges of indices. Stellar trees are competitive with state-of-the-art topological data structures for manifold simplicial complexes and offer significant improvements for cell complexes and non-manifold simplicial complexes. We conclude with a high-level description of several mesh processing and analysis applications that utilize Stellar trees to process large datasets.
97 MATHEMATICS AND COMPUTING↗
Reduced order modeling for flow and transport problems with Barlow Twins self-supervised learning
Abstract We propose a unified data-driven reduced order model (ROM) that bridges the performance gap between linear and nonlinear manifold approaches. Deep learning ROM (DL-ROM) using deep-convolutional autoencoders (DC–AE) has been shown to capture nonlinear solution manifolds but fails to perform adequately when linear subspace approaches such as proper orthogonal decomposition (POD) would be optimal. Besides, most DL-ROM models rely on convolutional layers, which might limit its application to only a structured mesh. The proposed framework in this study relies on the combination of an autoencoder (AE) and Barlow Twins (BT) self-supervised learning, where BT maximizes the information content of the embedding with the latent space through a joint embedding architecture. Through a series of benchmark problems of natural convection in porous media, BT–AE performs better than the previous DL-ROM framework by providing comparable results to POD-based approaches for problems where the solution lies within a linear subspace as well as DL-ROM autoencoder-based techniques where the solution lies on a nonlinear manifold; consequently, bridges the gap between linear and nonlinear reduced manifolds. We illustrate that a proficient construction of the latent space is key to achieving these results, enabling us to map these latent spaces using regression models. The proposed framework achieves a relative error of 2% on average and 12% in the worst-case scenario (i.e., the training data is small, but the parameter space is large.). We also show that our framework provides a speed-up of $$7 \times 10^{6}$$ 7 × 10 6 times, in the best case, and $$7 \times 10^{3}$$ 7 × 10 3 times on average compared to a finite element solver. Furthermore, this BT–AE framework can operate on unstructured meshes, which provides flexibility in its application to standard numerical solvers, on-site measurements, experimental data, or a combination of these sources.
97 MATHEMATICS AND COMPUTING↗