Search NASA⌕ Search

SEARCH · Search NASA

Results for “MANIFOLD”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions

Here we propose a manifold sampling algorithm for minimizing a nonsmooth composition $f= h\circ F$, where we assume $h$ is nonsmooth and may be inexpensively computed in closed form and $F$ is smooth but its Jacobian may not be available. We additionally assume that the composition $h\circ F$ defines a continuous selection. Manifold sampling algorithms can be classified as model-based derivative-free methods, in that models of $F$ are combined with particularly sampled information about $h$ to yield local models for use within a trust-region framework. We demonstrate that cluster points of the sequence of iterates generated by the manifold sampling algorithm are Clarke stationary. We consider the tractability of three particular subproblems generated by the manifold sampling algorithm and the extent to which inexact solutions to these subproblems may be tolerated. Numerical results demonstrate that manifold sampling as a derivative-free algorithm is competitive with state-of-the-art algorithms for nonsmooth optimization that utilize first-order information about $f$.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Machine-Learned Manifold-Based Models for Large Eddy Simulation of Turbulent Combustion

Reduced-order manifold combustion models are commonly used to lower the cost of reacting Large Eddy Simulations (LES) and may be derived either from physical principles as in flamelet models or from data-driven methods like Principal Component Analysis (PCA). In either case, neural networks are increasingly used as part of these models to provide a nonlinear mapping between a small set of pre-defined variables that parameterize the manifold and outputs of interest, such as reaction rates. In this work, we propose a new manifold-based modeling approach that combines the definition of the manifold-parameterizing variables (linear combinations of species), the nonlinear mapping to the outputs, and closure of filtered quantities for LES into the structure of a single neural network. This allows the process used to train the neural network to simultaneously optimize both the functional form of the model and the identities of the inputs to the model. The new approach can flexibly incorporate thermochemical data from any combustion system; if trained on data from 1D flames it can be interpreted as an optimized flamelet model, but it can also be used to learn models from data from more complex configurations. This work presents a priori evaluations of the new approach in both contexts. Evaluation using data from 1D premixed flames demonstrates the physical interpretability of the manifold variables generated by the new approach. Evaluation using data from direct numerical simulations of turbulent flames shows improved predictions relative to either flamelet or PCA-based models in a more complex configuration.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Combining complex flow manifold with three dimensional woven lattices as a thermal management unit

The present invention is directed to a manifold for directing cooling fluid and/or gas to a heat exchanger in a flow configuration designed to optimize heat transfer from the heat exchanger. The manifold can take many different forms such as a layered construction with distributed inlet paths, local outlet paths, a central collection changer and a path for fluid removal. The manifold can be formed from a metal, plastic, rubber, ceramic, or other heat resistant material known to or conceivable by one of skill in the art. The manifold can also be combined with any type of heat exchanger known to or conceivable by one of skill in the art to form a thermal management unit. To optimize overall properties such as low pressure drop, high heat transfer, and excellent temperature uniformity of the thermal management unit, the manifold can be graded, expanded and scaled as needed.

Hemker, Kevin J.↗
DOE OSTI2021

Differentiating densities on smooth manifolds

Lebesgue integration of derivatives of strongly-oscillatory functions is a recurring challenge in computational science and engineering. Integration by parts is an effective remedy for huge computational costs associated with Monte Carlo integration schemes. In case of Lebesgue integrals over a smooth manifold, however, integration by parts gives rise to a derivative of the density implied by charts describing the domain manifold. This paper focuses on the computation of that derivative, which we call the density gradient function, on general smooth manifolds. We analytically derive formulas for the density gradient and present examples of manifolds determined by popular differential equation-driven systems. Furthermore, we highlight the significance of the density gradient by demonstrating a numerical example of Monte Carlo integration involving oscillatory integrands.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Meshfree methods on manifolds for hydrodynamic flows on curved surfaces: A Generalized Moving Least-Squares (GMLS) approach

We utilize generalized moving least squares (GMLS) to develop meshfree techniques for discretizing hydrodynamic flow problems on manifolds. We use exterior calculus to formulate incompressible hydrodynamic equations in the Stokesian regime and handle the divergence-free constraints via a generalized vector potential. This provides less coordinate-centric descriptions and enables the development of efficient numerical methods and splitting schemes for the fourth-order governing equations in terms of a system of second-order elliptic operators. Using a Hodge decomposition, we develop methods for manifolds having spherical topology. We show the methods exhibit high-order convergence rates for solving hydrodynamic flows on curved surfaces. The methods also provide general high-order approximations for the metric, curvature, and other geometric quantities of the manifold and associated exterior calculus operators. The approaches also can be utilized to develop high-order solvers for other scalar-valued and vector-valued problems on manifolds.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Pressure drop in a prototypical 3D magnetohydrodynamic flow across contraction of a fusion blanket manifold

Predicting 3D magnetohydrodynamic (MHD) pressure losses associated with liquid metal flows in complex geometry ducts is required to design breeding blankets for fusion reactors. Of such components, manifolds exhibit major pressure losses. Recent correlations [T. Rhodeset al. Magnetohydrodynamic pressure drop and flow balancing of liquid metal flow in a prototypic fusion blanket manifold. Phys. Fluids. 2018; 30: 057101.] demonstrate promise for predicting pressure drops in electrically insulated inlet manifolds. In the present work, the extend to which these correlations can be applied to outlet manifolds, which feature sudden contractions, is investigated in both viscous-electromagnetic (VE) and inertial-electromagnetic (IE) regimes for Reynolds numbers 50 < Re < 1500, Hartmann numbers 2500 < Ha < 5475, and expansion/contraction ratio 10. Numerical computations have shown that the MHD pressure drops in the eutectic lead-lithium (PbLi) flows in contractions are almost identical to those in the flows featuring expansion with slightly higher magnitudes in the contraction cases. The small discripancy in the MHD pressure drop between contractions and expansions (<8%) suggests that the earlier obtained correlations for the 3D MHD pressure drop in a duct flow with a sudden expansion can also be applied to flows with a sudden contraction.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Bootstrap bounds on closed Einstein manifolds

A compact Riemannian manifold is associated with geometric data given by the eigenvalues of various Laplacian operators on the manifold and the triple overlap integrals of the corresponding eigenmodes. This geometric data must satisfy certain consistency conditions that follow from associativity and the completeness of eigenmodes. We show that it is possible to obtain nontrivial bounds on the geometric data of closed Einstein manifolds by using semidefinite programming to study these consistency conditions, in analogy to the conformal bootstrap bounds on conformal field theories. These bootstrap bounds translate to constraints on the tree-level masses and cubic couplings of Kaluza-Klein modes in theories with compact extra dimensions. We show that in some cases the bounds are saturated by known manifolds.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Generating accurate density matrices on the tangent space of a Grassmann manifold

Interpolating a density matrix from a set of known density matrices is not a trivial task. This is because a linear combination of density matrices does not necessarily correspond to another density matrix. In this Communication, density matrices are examined as objects of a Grassmann manifold. Although this manifold is not a vector space, its tangent space is a vector space. As a result, one can map the density matrices on this manifold to their corresponding vectors in the tangent space and then perform interpolations on that tangent space. The resulting interpolated vector can be mapped back to the Grassmann manifold, which can then be utilized (1) as an optimal initial guess for a self-consistent field (SCF) calculation or (2) to derive energy directly without time-consuming SCF iterations. Such a promising approach is denoted as Grassmann interpolation (G-Int). The hydrogen molecule has been used to illustrate that the described interpolated method in this work preserves the essential attributes of a density matrix. For phosphorus mononitride and ferrocene, it was demonstrated numerically that reference points for the definition of the corresponding tangent spaces can be chosen arbitrarily. In addition, the interpolated density matrices provide a superior and essentially converged initial guess for an SCF calculation to make the SCF procedure itself unnecessary. Finally, this accurate, efficient, robust, and systematically improved G-Int strategy has been used for the first time to generate highly accurate potential energy surfaces with fine details for the difficult case, ferrocene.

Chemistry↗
DOE OSTI2025

Link Scheduling in Satellite Networks via Machine Learning Over Riemannian Manifolds

Low Earth Orbit (LEO) satellites play a crucial role in enhancing global connectivity, serving a complementary solution to existing terrestrial systems. In wireless networks, scheduling is a vital process that allocates time-frequency resources to users for interference management. However, LEO satellite networks face significant challenges in scheduling their links towards ground users due to the satellites’ mobility and overlapping coverage. This paper addresses the dynamic link scheduling problem in LEO satellite networks by considering spatio-temporal correlations introduced by the satellites’ movements. The first step in the proposed solution involves modeling the network over Riemannian manifolds, thanks to their representation as symmetric positive definite matrices. We introduce two machine learning (ML)-based link scheduling techniques that model the dynamic evolution of satellite positions and link conditions over time and space. To accurately predict satellite link states, we present a recurrent neural network (RNN) over Riemannian manifolds, which captures spatio-temporal characteristics over time. Furthermore, we introduce a separate model, the convolutional neural network (CNN) over Riemannian manifolds, which captures geometric relationships between satellites and users by extracting spatial features from the network topology across all links. Simulation results demonstrate that both RNN and CNN over Riemannian manifolds deliver comparable performance to the fractional programming-based link scheduling (FPLinQ) benchmark. Remarkably, unlike other ML-based models that require extensive training data, both models only need 30 training samples to achieve over 99% of the sum rate while maintaining similar computational complexity relative to the benchmark.

42 ENGINEERING↗
DOE OSTI2024

CMLM (Co-Optimized Machine-Learned Manifolds) [SWR-23-41]

Co-optimized Machine-Learned Manifolds (CMLM) is a data-driven approach for developing reduced-order manifold models for high-dimensional chemically reacting systems. It involves a specially designed neural network, the training of which simultaneously optimizes linear combinations of species that define the manifold, nonlinear mapping to outputs of interest such as reaction rates, and (optionally) subfilter closure for large eddy simulation. This software package provides an implementation of the CMLM approach in Python using the PyTorch machine learning library. A few example cases are included, showing how the tool can be applied to different types of data from 0D and 1D reacting simulations performed using Cantera. The neural networks can be saved in a format that is readable by the Pele suite of combustion solvers for use in reacting computational fluid dynamics simulations. This software repository contains several python scripts to perform various tasks associated with the Co-optimized Machine Learned Manifolds (CMLM) model, which is described in Perry, Henry de Frahan, and Yellapantula, CNF, 2022 (https://doi.org/10.1016/j.combustflame.2022.112286). This includes not only the code that defines the CMLM model, but also scripts to generate suitable training data, scripts to pre-process the data, scripts to train the CMLM model, and scripts to plot the output, as well as various other helper files. The scripts depend on several commonly used python libraries for data analysis and chemical reaction computations. The trained models that result from this tool are designed to work with the an interface being implemented in the Pele suite of reacting flow solvers (https://github.com/AMReX-Combustion).

Perry, Bruce↗
DOE OSTI2020

Fluid delivery manifolds and microfluidic systems

Embodiments of fluid distribution manifolds, cartridges, and microfluidic systems are described herein. Fluid distribution manifolds may include an insert member and a manifold base and may define a substantially closed channel within the manifold when the insert member is press-fit into the base. Cartridges described herein may allow for simultaneous electrical and fluidic interconnection with an electrical multiplex board and may be held in place using magnetic attraction.

42 ENGINEERING↗
DOE OSTI2025

Neural Active Manifolds: Nonlinear Dimensionality Reduction for Uncertainty Quantification

We present a new approach for nonlinear dimensionality reduction, specifically designed for computationally expensive mathematical models. We leverage autoencoders to discover a one-dimensional neural active manifold (NeurAM) capturing the model output variability, through the aid of a simultaneously learnt surrogate model with inputs on this manifold. Our method only relies on model evaluations and does not require the knowledge of gradients. The proposed dimensionality reduction framework can then be applied to assist outer loop many-query tasks in scientific computing, like sensitivity analysis and multifidelity uncertainty propagation. In particular, we prove, both theoretically under idealized conditions, and numerically in challenging test cases, how NeurAM can be used to obtain multifidelity sampling estimators with reduced variance by sampling the models on the discovered low-dimensional and shared manifold among models. Several numerical examples illustrate the main features of the proposed dimensionality reduction strategy and highlight its advantages with respect to existing approaches in the literature.

Autoencoders↗
DOE OSTI2021

Manifold learning for coarse-graining atomistic simulations: Application to amorphous solids

In this work, we introduce a generalized machine learning framework to probabilistically parameterize upper-scale models in the form of nonlinear PDEs consistent with a continuum theory, based on coarse-grained atomistic simulation data of mechanical deformation and flow processes. The proposed framework utilizes a hypothesized coarse-graining methodology with manifold learning and surrogate-based optimization techniques. Coarse-grained high-dimensional data describing quantities of interest of the multiscale models are projected onto a nonlinear manifold whose geometric and topological structure is exploited for measuring behavioral discrepancies in the form of manifold distances. A surrogate model is constructed using Gaussian process regression to identify a mapping between stochastic parameters and distances. Derivative-free optimization is employed to adaptively identify a unique set of parameters of the upper-scale model capable of rapidly reproducing the system's behavior while maintaining consistency with coarse-grained atomic-level simulations. The proposed method is applied to learn the parameters of the shear transformation zone (STZ) theory of plasticity that describes plastic deformation in amorphous solids as well as coarse-graining parameters needed to translate between atomistic and continuum representations. We show that the methodology is able to successfully link coarse-grained microscale simulations to macroscale observables and achieve a high-level of parity between the models across scales.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Data-driven surrogates for high dimensional models using Gaussian process regression on the Grassmann manifold

This paper introduces a surrogate modeling scheme based on Grassmannian manifold learning to be used for cost-efficient predictions of high-dimensional stochastic systems. The method exploits subspace-structured features of each solution by projecting it onto a Grassmann manifold. This point-wise linear dimensionality reduction harnesses the structural information to assess the similarity between solutions at different points in the input parameter space. The method utilizes a solution clustering approach in order to identify regions of the parameter space over which solutions are sufficiently similarly such that they can be interpolated on the Grassmannian. In this clustering, the reduced-order solutions are partitioned into disjoint clusters on the Grassmann manifold using the eigen-structure of properly defined Grassmannian kernels and, the Karcher mean of each cluster is estimated. Then, the points in each cluster are projected onto the tangent space with origin at the corresponding Karcher mean using the exponential mapping. For each cluster, a Gaussian process regression model is trained that maps the input parameters of the system to the reduced solution points of the corresponding cluster projected onto the tangent space. Using this Gaussian process model, the full-field solution can be efficiently predicted at any new point in the parameter space. In certain cases, the solution clusters will span disjoint regions of the parameter space. In such cases, for each of the solution clusters we utilize a second, density-based spatial clustering to group their corresponding input parameter points in the Euclidean space. The proposed method is applied to two numerical examples. Here, the first is a nonlinear stochastic ordinary differential equation with uncertain initial conditions where the surrogate is used to predict the time history solution. The second involves modeling of plastic deformation in a model amorphous solid using the Shear Transformation Zone theory of plasticity, where the proposed surrogate is used to predict the full strain field of a material specimen under large shear strains.

42 ENGINEERING↗
DOE OSTI2022

Operator inference for non-intrusive model reduction with quadratic manifolds

This paper proposes a novel approach for learning a data-driven quadratic manifold from high-dimensional data, then employing this quadratic manifold to derive efficient physics-based reduced-order models. The key ingredient of the approach is a polynomial mapping between high-dimensional states and a low-dimensional embedding. This mapping consists of two parts: a representation in a linear subspace (computed in this work using the proper orthogonal decomposition) and a quadratic component. The approach can be viewed as a form of data-driven closure modeling, since the quadratic component introduces directions into the approximation that lie in the orthogonal complement of the linear subspace, but without introducing any additional degrees of freedom to the low-dimensional representation. Combining the quadratic manifold approximation with the operator inference method for projection-based model reduction leads to a scalable non-intrusive approach for learning reduced-order models of dynamical systems. Further, applying the new approach to transport-dominated systems of partial differential equations illustrates the gains in efficiency that can be achieved over approximation in a linear subspace.

42 ENGINEERING↗
DOE OSTI2025

Generative learning of densities on manifolds

A generative modeling framework is proposed that combines diffusion models and manifold learning to efficiently sample data densities on manifolds. The approach utilizes Diffusion Maps to uncover possible low-dimensional underlying (latent) spaces in the high-dimensional data (ambient) space. Two approaches for sampling from the latent data density are described. The first is a score-based diffusion model, which is trained to map a standard normal distribution to the latent data distribution using a neural network. The second one involves solving an Itô stochastic differential equation in the latent space. Additional realizations of the data are generated by lifting the samples back to the ambient space using Double Diffusion Maps , a recently introduced technique typically employed in studying dynamical system reduction; here the focus lies in sampling densities rather than system dynamics. The proposed approaches enable sampling high dimensional data densities restricted to low-dimensional, a priori unknown manifolds. The efficacy of the proposed framework is demonstrated through a benchmark problem and a material with multiscale structure.

Double diffusion maps↗
DOE OSTI2026

A conservative discontinuous Galerkin algorithm for particle kinetics on smooth manifolds

A novel, conservative discontinuous Galerkin algorithm is presented for particle kinetics on manifolds. The motion of particles on the manifold is represented using both canonical and non-canonical Hamiltonian formulations. Our schemes apply to both formulations, but the canonical formulation results in a particularly efficient scheme that also conserves particle density and energy exactly. The collisionless update is coupled to a Bhatnagar-Gross-Krook (BGK) collision operator that provides a simplified model for relaxation to local thermodynamic equilibrium. An iterative scheme is constructed to ensure collisional invariants (density, momentum and energy) are preserved numerically. Rotation of the manifold is incorporated by modifying the Hamiltonian while ensuring a canonical formulation. Several test problems, including a kinetic version of the classical Sod shock problem, Kelvin-Helmholtz instability on the surfaces of a sphere and a hyperboloid, with and without rotations, are presented. A prospectus for further development of this approach to simulation of kinetic theory in general relativity is presented.

Discontinuous Galerkin↗
DOE OSTI2020

Efficient bifurcation and tabulation of multi-dimensional combustion manifolds using deep mixture of experts: An a priori study

This work describes and validates an approach for autonomously bifurcating turbulent combustion man-ifolds to divide regression tasks amongst specialized artificial neural networks (ANNs). This approach relies on the mixture of experts (MoE) framework, where each neural network is trained to be specialized in a given portion of the input space. The assignment of different input regions to the experts is determined by a gating network, which is a neural network classifier. In some previous studies, it has been demonstrated that bifurcation of a complex combustion manifold and fitting different ANNs for each part leads to better fits or faster inference speeds. However, the manner of bifurcation in these studies was based on heuristic approaches or clustering techniques. In contrast, the proposed technique enables automatic bifurcation using non-linear planes in high-dimensional turbulent combustion manifolds that are often associated with complex behavior due to different dominating physics in various zones. Furthermore, the proposed concept is validated using 4-dimensional (4D) and 5D flamelet tables, showing that the errors obtained with a given network size, or conversely the network size required to achieve a given accuracy, is considerably reduced. The effect of the number of experts on inference speed is also investigated, showing that by increasing the number of experts from 1 to 8, the inference time can be approximately reduced by a factor of two. Moreover, it is shown that the MoE approach divides the input manifold in a physically intuitive manner, suggesting that the MoE framework can elucidate high-dimensional datasets in a physically meaningful way.

42 ENGINEERING↗