Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “neural 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 OSTI2024

A fast and accurate domain decomposition nonlinear manifold reduced order model

Here, this paper integrates nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD). NM ROMs approximate the full order model (FOM) state in a nonlinear-manifold by training a shallow, sparse autoencoder using FOM snapshot data. These NM-ROMs can be advantageous over linear-subspace ROMs (LS-ROMs) for problems with slowly decaying Kolmogorov n-width. However, the number of NM-ROM parameters that need to be trained scales with the size of the FOM. Moreover, for “extreme-scale” problems, the storage of high-dimensional FOM snapshots alone can make ROM training expensive. To alleviate the training cost, this paper applies DD to the FOM, computes NM-ROMs on each subdomain, and couples them to obtain a global NM-ROM. This approach has several advantages: Subdomain NM-ROMs can be trained in parallel, involve fewer parameters to be trained than global NM-ROMs, require smaller subdomain FOM dimensional training data, and can be tailored to subdomain specific features of the FOM. The shallow, sparse architecture of the autoencoder used in each subdomain NM-ROM allows application of hyper-reduction (HR), reducing the complexity caused by nonlinearity and yielding computational speedup of the NM-ROM. This paper provides the first application of NM-ROM (with HR) to a DD problem. In particular, this paper details an algebraic DD reformulation of the FOM, training a NM-ROM with HR for each sub domain, and a sequential quadratic programming (SQP) solver to evaluate the coupled global NM-ROM. Theoretical convergence results for the SQP method and a priori and a posteriori error estimates for the DD NM-ROM with HR are provided. The proposed DD NM-ROM with HR approach is numerically compared to a DD LS-ROM with HR on the 2D steady-state Burgers’ equation, showing an order of magnitude improvement in accuracy of the proposed DD NM-ROM over the DD LS-ROM.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Machine learning to alleviate Hubbard-model sign problems

Lattice Monte Carlo calculations of interacting systems on nonbipartite lattices exhibit an oscillatory imaginary phase known as the phase or sign problem, even at zero chemical potential. One method to alleviate the sign problem is to analytically continue the integration region of the state variables into the complex plane via holomorphic flow equations. For asymptotically large flow times, the state variables approach manifolds of constant imaginary phase known as Lefschetz thimbles. Furthermore, flowing such variables and calculating the ensuing Jacobian is a computationally demanding procedure. In this paper, we demonstrate that neural networks can be trained to parametrize suitable manifolds for this class of sign problem and drastically reduce the computational cost for different severely afflicted small volume systems. In particular, we apply our method to the Hubbard model on the triangle and tetrahedron, both of which are nonbipartite. At strong interaction strengths and modest temperatures, the tetrahedron suffers from a severe sign problem that cannot be overcome with standard reweighting techniques, while it quickly yields to our method. We benchmark our results with exact calculations and comment on future directions of this work.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

PSF–NET: A Nonparametric Point-spread Function Model for Ground-based Optical Telescopes

Ground-based optical telescopes are seriously affected by atmospheric turbulence induced aberrations. Understanding properties of these aberrations is important both for instrument design and image restoration method development. Because the point-spread function can reflect performance of the whole optic system, it is appropriate to use the point-spread function to describe atmospheric turbulence induced aberrations. Assuming point-spread functions induced by the atmospheric turbulence with the same profile belong to the same manifold space, we propose a nonparametric point-spread function—PSF–NET. The PSF–NET has a cycle convolutional neural network structure and is a statistical representation of the manifold space of PSFs induced by the atmospheric turbulence with the same profile. Testing the PSF–NET with simulated and real observation data, we find that a well trained PSF–NET can restore any short exposure images blurred by atmospheric turbulence with the same profile. Besides, we further use the impulse response of the PSF–NET, which can be viewed as the statistical mean PSF, to analyze interpretation properties of the PSF–NET. We find that variations of statistical mean PSFs are caused by variations of the atmospheric turbulence profile: as the difference of the atmospheric turbulence profile increases, the difference between statistical mean PSFs also increases. The PSF–NET proposed in this paper provides a new way to analyze atmospheric turbulence induced aberrations, which would benefit the development of new observation methods for ground-based optical telescopes.

79 ASTRONOMY AND ASTROPHYSICS↗
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↗
NASA NTRS1992

Sensor fusion IV: Control paradigms and data structures; Proceedings of the Meeting, Boston, MA, Nov. 12-15, 1991

Various papers on control paradigms and data structures in sensor fusion are presented. The general topics addressed include: decision models and computational methods, sensor modeling and data representation, active sensing strategies, geometric planning and visualization, task-driven sensing, motion analysis, models motivated biology and psychology, decentralized detection and distributed decision, data fusion architectures, robust estimation of shapes and features, application and implementation. Some of the individual subjects considered are: the Firefly experiment on neural networks for distributed sensor data fusion, manifold traversing as a model for learning control of autonomous robots, choice of coordinate systems for multiple sensor fusion, continuous motion using task-directed stereo vision, interactive and cooperative sensing and control for advanced teleoperation, knowledge-based imaging for terrain analysis, physical and digital simulations for IVA robotics.

Schenker, Paul S.↗
NASA NTRSDate not supplied

Deep Neural Network Based Unsteady Flamelet Progress Variable Approach in a Supersonic Combustor

Higher dimensional flamelet manifolds are essential in capturing the coupled effects of pressure gradients and unsteady chemical kinetics observed in supersonic combustion applications. Previous studies have validated the feasibility of using deep neural networks as an alternative to computation-ally intensive multidimensional flamelet table storage and lookup. This approach has demonstrated a significant reduction in memory footprint and enabled the use of larger dimensional tabulated manifolds for supersonic combustion in canonical problems. In this study, the Unsteady Flamelet Progress Variable (UFPV)-ANN model implemented in the VULCAN-CFD code is validated by the Burrows-Kurkov supersonic mixing/combustion configuration. The well characterized experimental problem consists of hydrogen injection into a supersonic vitiated crossflow that results in a lifted flame structure. The initial model consists of a 4-dimensional table where the independent variables Z, C, Xst, P are tabulated using an unsteady flamelet code with boundary conditions corresponding to the vitiated air conditions. The results show the development of a lifted flame structure and over-all acceptable agreement with finite-rate chemistry (FRC) simulation and the experimental data. Moreover, direct mapping between the independent variables and the flamelet table is replaced by a deep neural network for significant memory reduction. The results indicate that the UFPV-ANN approach can retrieve the same solution as the memory intensive lookup table approach.

Flamelet↗
DOE OSTI2023

PCAfold 2.0—Novel tools and algorithms for low-dimensional manifold assessment and optimization

We describe an update to our open-source Python package, PCAfold, designed to help researchers generate, analyze and improve low-dimensional data manifolds. In the current version, PCAfold 2.0, we introduce novel tools and algorithms for assessing and optimizing low-dimensional manifolds. This includes a method that generates a “map” of local feature sizes that can help pinpoint researchers to problematic regions on a manifold. We introduce a novel cost function that characterizes the quality of a manifold topology with a single number. We develop two algorithms for feature selection based on principal component analysis (PCA) that use the cost function as an objective function to minimize. We introduce a quantity of interest (QoI)-aware dimensionality reduction strategy where data projections are computed using an artificial neural network and are directly optimized towards representing various projection-independent and projection-dependent QoIs. We also introduce an implementation of partition of unity networks (POUnets) for efficient reconstruction of QoIs from low-dimensional manifolds based on combining neural network classification with localized polynomial regression. Our software can be broadly applicable in all domains of science and engineering that aim to reduce data dimensionality, as well as in the fundamental research on representation learning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Data-driven recovery of hidden physics in reduced order modeling of fluid flows

In this article, we introduce a modular hybrid analysis and modeling (HAM) approach to account for hidden physics in reduced order modeling (ROM) of parameterized systems relevant to fluid dynamics. The hybrid ROM framework is based on using first principles to model the known physics in conjunction with utilizing the data-driven machine learning tools to model the remaining residual that is hidden in data. This framework employs proper orthogonal decomposition as a compression tool to construct orthonormal bases and Galerkin projection (GP) as a model to build the dynamical core of the system. Our proposed methodology hence compensates structural or epistemic uncertainties in models and utilizes the observed data snapshots to compute true modal coefficients spanned by these bases. The GP model is then corrected at every time step with a data-driven rectification using a long short-term memory (LSTM) neural network architecture to incorporate hidden physics. A Grassmannian manifold approach is also adopted for interpolating basis functions to unseen parametric conditions. The control parameter governing the system's behavior is thus implicitly considered through true modal coefficients as input features to the LSTM network. The effectiveness of the HAM approach is then discussed through illustrative examples that are generated synthetically to take hidden physics into account. Furthermore, our approach thus provides insights addressing a fundamental limitation of the physics-based models when the governing equations are incomplete to represent underlying physical processes.

42 ENGINEERING↗
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↗
DOE OSTI2020

Parameterized Neural Ordinary Differential Equations: Applications to Computational Physics Problems

This work proposes an extension of neural ordinary differential equations (NODEs) by introducing an additional set of ODE input parameters to NODEs. This extension allows NODEs to learn multiple dynamics specified by the input parameter instances. Our extension is inspired by the concept of parameterized ordinary differential equations, which are widely investigated in computational science and engineering contexts, where characteristics of the governing equations vary over the input parameters. We apply the proposed parameterized NODEs (PNODEs) for learning latent dynamics of complex dynamical processes that arise in computational physics, which is an essential component for enabling rapid numerical simulations for time-critical physics applications. For this, we propose an encoder-decoder-type framework, which models latent dynamics as PNODEs. We demonstrate the effectiveness of PNODEs with important benchmark problems from computational physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Topological and Dynamical Representations for Radio Frequency Signal Classification

Radio Frequency (RF) signals are found throughout our world, carrying over-the-air information for both digital and analog uses with applications ranging from WiFi to the radio. One area of focus in RF signal analysis is determining the modulation schemes employed in these signals which is crucial in many RF signal processing domains from secure communication to spectrum monitoring. This work investigates the accuracy and noise robustness of novel Topological Data Analysis (TDA) and dynamic representation based approaches paired with a small convolution neural network for RF signal modulation classification with a comparison to state-of-the-art deep neural network approaches. We show that using TDA tools, like Vietoris-Rips and lower star filtrations, and the Takens' embedding in conjunction with a standard shallow neural network we can capture the intrinsic dynamical, geometric, and topological features of the underlying signal's manifold, offering informative representations of the RF signals. Our approach is effective in handling the modulation classification task and is notably noise robust, outperforming the commonly used deep neural network approaches in mode classification. Moreover, our fusion of dynamical and topological information is able to attain similar performance to deep neural network architectures with significantly smaller training datasets.

Myers, Audun D.↗
DOE OSTI2025

An adaptive and stability-promoting layerwise training approach for sparse deep neural network architecture

This work presents a two-stage adaptive framework for progressively developing deep neural network (DNN) architectures that generalize well for a given training data set. In the first stage, a layerwise training approach is adopted where a new layer is added each time and trained independently by freezing parameters in the previous layers. We impose desirable structures on the DNN by employing manifold regularization, sparsity regularization, and physics-informed terms. We introduce a ε – δ – stability-promoting concept as a desirable property for a learning algorithm and show that employing manifold regularization yields a ε – δ stability-promoting algorithm. Further, we also derive the necessary conditions for the trainability of a newly added layer and investigate the training saturation problem. In the second stage of the algorithm (post-processing), a sequence of shallow networks is employed to extract information from the residual produced in the first stage, thereby improving the prediction accuracy. Numerical investigations on prototype regression and classification problems demonstrate that the proposed approach can outperform fully connected DNNs of the same size. Moreover, by equipping the physics-informed neural network (PINN) with the proposed adaptive architecture strategy to solve partial differential equations, we numerically show that adaptive PINNs not only are superior to standard PINNs but also produce interpretable hidden layers with provable stability. As a result, we also apply our architecture design strategy to solve inverse problems governed by elliptic partial differential equations.

42 ENGINEERING↗
DOE OSTI2022

Implementation of Manifold-Based Combustion Models in a Highly Scalable Low Mach Number Reacting Flow Solver: Preprint

Manifold-based representations of the thermochemistry are often employed in conjunction with large eddy eimulation (LES) to lower the cost of combustion simulations. This work describes steps taken to implement this modeling approach in PeleLM, a scalable and performance-portable low Mach number flow solver. Most significantly, this includes adapting the projection method used by PeleLM to satisfy the mass conservation constraint for use with manifold-based models. The implementation is designed to be general across manifold-based models, including both those that employ traditional tabulation and those that employ neural networks. An initial demonstration for simple test cases is presented and will be used for performance assessment.

high-performance computing↗
DOE OSTI2025

Using "AI Poincare" to analyze non-linear integrable optics

This study dives into the applicability of using automated discovery of conserved quantities in dynamical systems relevant to accelerator physics. Specifically, we explore the performance of AI Poincaré in analyzing numerical trajectory data obtained using the McMillan system of non-linear integrable optics. A comprehensive evaluation of the algorithm's performance is conducted through diverse methodologies. These include the analysis of the estimated number of conserved quantities embedded in a dataset and the deviation of interpolated points on the inferred manifold with respect to points in actually in the dataset. the investigation identifies an optimal range of perturbation distances where the underlying manifold extraction algorithm inside AI Poincaré exhibits optimal performance. Additionally, an improved neural network architecture is proposed based on the observed results. Finally, we apply the algorithm to preliminary experimental data from the Integrable Optics Test Accelerator at Fermilab to successfully infer the number of conserved quantities even in the presence of fast decoherence of the measured signal.

Osmanov, Lazare [Free U. Tbilisi]↗
DOE OSTI2024

Data-driven models of nonautonomous systems

Nonautonomous dynamical systems are characterized by time-dependent inputs, which complicates the discovery of predictive models describing the spatiotemporal evolution of the state variables of quantities of interest from their temporal snapshots. When dynamic mode decomposition (DMD) is used to infer a linear model, this difficulty manifests itself in the need to approximate the time-dependent Koopman operators. Our approach is to approximate the original nonautonomous system with a modified system derived via a local parameterization of the time-dependent inputs. The modified system comprises a sequence of local parametric systems, which are subsequently approximated by a parametric surrogate model using the DRIPS (dimension reduction and interpolation in parameter space) framework. The offline step of DRIPS relies on DMD to build a linear surrogate model, endowed with reduced-order bases for the observables mapped from training data. The online step interpolates on suitable manifolds to construct a sequence of iterative parametric surrogate models; the target/test parameter points on these manifolds are specified by a local parameterization of the test time-dependent inputs. Here, we use numerical experimentation to demonstrate the robustness of our method and compare its performance with that of deep neural networks.

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 OSTI2026

FOILPOLARS (Grassmannian Foil Shape Sweeps for Polar Generation) [SWR-26-095]

FOILPOLARS (Grassmannian Foil Shape Sweeps for Polar Generation): Multifidelity aerodynamic polar data generation for hydrofoil/tidal-turbine airfoil sections. Foilpolars ties together three pieces: *AeroSandbox supplies the baseline airfoil coordinates (UIUC database). *G2Aero parameterizes those shapes on a Grassmannian manifold (Karcher mean + PGA basis) and samples new perturbed shapes around that basis. *XFoil (panel method) and NeuralFoil (neural-network surrogate, shipped with AeroSandbox) each solve the resulting shapes for lift, drag, moment, and pressure at the swept angles of attack, Reynolds numbers, and n_crit values. Design optimization of foil shapes in a computationally efficient way requires polars data across many candidate shapes, not just a handful of baseline foils. However, high-fidelity CFD at that scale is too costly, and naive shape perturbation strays from realistic geometries. FOILPOLARS addresses this by loading baseline airfoils (via AeroSandbox) and mapping them onto a Grassmannian manifold (via G2Aero), computing a Karcher mean and principal geodesic analysis (PGA) basis. New shapes are sampled by perturbing PGA coefficients, keeping them close to the manifold of realistic foils. Each sampled shape is evaluated across a configurable sweep of angle of attack, Reynolds number, and critical amplification factor using two solvers: XFoil (panel method) and NeuralFoil (neural-network surrogate), producing a paired dataset of lift, drag, moment, pressure, convergence, and confidence, indexed alongside each shape's PGA coefficients and shared Grassmannian basis in a single xarray dataset. From this, FOILPOLARS produces convergence summaries and comparison plots per shape, Reynolds number, and n_crit. A command-line interface exposes each pipeline stage independently, supporting data-driven design, optimization, and machine-learning workflows for foils.

Sandhu, Rimple [National Laboratory of the Rockies↗