Search NASA⌕ Search

SEARCH · Search NASA

Results for “training data”

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 397 records · Page 22

Fisher's Peak Ecological Forecasting - Mapping Biomass to Inform Conservation Planning of a Future State Park in Southern Colorado

Fisher’s Peak is a 77.5 km2 property southeast of Trinidad, Colorado that is planned to become Colorado’s newest state park. The area has experienced limited anthropogenic disturbance and is home to an abundance of unique habitats and species. A rapid, approximately 900 m change in elevation over the extent of the area nurtures a variety of plants and animals, including the endangered New Mexico meadow jumping mouse. In 2019, the State of Colorado obtained Fisher’s Peak with plans to make it Colorado’s second largest state park. A diverse group of collaborators, including the Colorado State Forest Service and The Nature Conservancy, worked closely to design the state park to maximize recreation opportunity while conserving the property’s rich habitats and biodiversity. The Fisher’s Peak Ecological Forecasting Team utilized Light Detection and Ranging (LiDAR) surveys, in situ forest inventory data, and Earth observations from Landsat 8 Operational Land Imager (OLI), Sentinel-1 C-band Synthetic Aperture Radar (C-SAR), Sentinel-2 Multispectral Instrument (MSI), Advanced Land Observing Satellite 2 (ALOS-2) Phased Array type L-band Synthetic Aperture Radar (PALSAR-2) and the Shuttle Radar Topography Mission (SRTM) to quantify and map biomass over the extent of the study area. The results from modeling biomass had an out-of-bag root mean square error of 55 Mg/ha and an R2 of 12. The resulting map indicates areas where carbon storage on the property is high, informing decision-making processes for future park development. While more in situ training data may improve modeling capacity for biomass in the Fisher’s Peak area, this work represents a feasible attempt to better understand biomass distribution using earth observation

Lauren Lad↗

Unsupervised Learning for Improved Gamma-Ray Spectrometry in Pixelated Cadmium Zinc Telluride (CZT) Detectors

Machine learning has been found to be ubiquitously useful across many industries, presenting an opportunity to improve radiation detection performance using data-driven algorithms. Improved detector resolution can aid in the detection, identification, and quantification of radionuclides. Here, in this work, a novel, data-driven, unsupervised learning approach is developed to improve detector spectral characteristics by learning, and subsequently rejecting, poorly performing regions of the pixelated detector. Feature engineering is used to fit individual characteristic photo peaks to a Doniach lineshape with a linear background model. Then, principal component analysis is used to learn a lower-dimension latent space representation of each photo peak where the pixels are clustered, and subsequently ranked, based on the cluster mean distance to an optimal point. Pixels within the worst cluster(s) are rejected to improve the full-width at half-maximum (FWHM) by 10% to 15% (relative to the bulk detector) at 50% net efficiency when applied to training data obtained from measurements of a 100 μCi 154 Eu source using a H3D M400i pixelated cadmium zinc telluride detector. These results compare well with, but do not outperform, a greedy algorithm that accumulates pixels in order of FWHM from lowest to highest used as a benchmark. In the future, this approach can be extended to include the detector energy and angular response. Finally, the model is applied to newly seen natural and enriched uranium spectra relevant for nuclear safeguards applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Automated thematic mapping and change detection of ERTS-A images

The author has identified the following significant results. A diffraction pattern analysis of MSS images led to the development of spatial signatures for farm land, urban areas and mountains. Four spatial features are employed to describe the spatial characteristics of image cells in the digital data. Three spectral features are combined with the spatial features to form a seven dimensional vector describing each cell. Then, the classification of the feature vectors is accomplished by using the maximum likelihood criterion. It was determined that the recognition accuracy with the maximum likelihood criterion depends on the statistics of the feature vectors. It was also determined that for a given geographic area the statistics of the classes remain invariable for a period of a month, but vary substantially between seasons. Three ERTS-1 images from the Phoenix, Arizona area were processed, and recognition rates between 85% and 100% were obtained for the terrain classes of desert, farms, mountains, and urban areas. To eliminate the need for training data, a new clustering algorithm has been developed. Seven ERTS-1 images from four test sites have been processed through the clustering algorithm, and high recognition rates have been achieved for all terrain classes.

Gramenopoulos, N.↗

Physics-Informed Machine Learning Model for Ceramic Matrix Composite Creep

A physics-informed recurrent neural network (RNN) based surrogate model is developed to emulate the nonlinear, time-dependent constitutive behavior of ceramic matrix composites (CMCs) driven by matrix damage and constituent creep at the microscale. Physics-informed constraints are introduced into the surrogate model through regularization to ground the prediction in physics and improve its predictive capabilities. Training data is generated using the high-fidelity generalized method of cells (HFGMC) approach which calls appropriate creep and damage models for each of the constituents. This coupling permits simulating the nonlinear behavior of CMCs based on constituent response at the microscale along with microstructural features such as fiber and porosity volume fraction and fiber radius. The microscale repeating unit cell is loaded under creep fatigue conditions to replicate the material loading experienced in a turbine engine. Therefore, the RNN-based surrogate model is tasked with predicting, as a function of variable input stress sequence, temperature, and microstructural features, the resulting strain history response while satisfying physical constraints related to creep rate, isochoric inelastic deformation, and strain energy density. The trained surrogate model is shown to effectively match the strain history over quantified distributions of microstructural features and relevant loading regimes and temperatures. Neural network based surrogate models can offer efficient alternatives to running computationally intensive multiscale material models to simulate the nonlinear response of large structural models. Therefore, the presented work provides evidence towards the feasibility of developing, training, and running such models for CMCs with complex microstructures, nonlinear time-dependent material response, and under non-monotonic loading conditions.

ceramic matrix composites↗

Event Classifications on DNE2 Main Experiment Data using a Convolutional Neural Network Ensemble

The Dynamic Networks (DN) Experiment for FY24 (DNE2) is an experiment within DN with the goal of quantitatively evaluating the effectiveness of solutions developed so far by various researchers under the Low Yield Nuclear Monitoring (LYNM) program using a shared set of metrics and datasets. A key component of this experiment is the mimicking of a signature processing pipeline, and comparing currently accepted and standard-use processing methods to more state-of-the-art processes developed under DN. In this work, we focus specifically on the Event Characterization (EC) Focus Area (FA) of the pipeline, where a seismic event’s magnitude, yield and class are identified. We use Deep Learning (DL) to classify the type of events being processed as either earthquakes (EQs) or explosions (EXs) for three iterations of experiment datasets. The model is noticeably more confident and accurate in classifying explosions than earthquakes, reflecting a known shortcoming of the model, that being of a bias towards predicting explosions over earthquakes in the west coast due to training data biases.

97 MATHEMATICS AND COMPUTING↗

Combining Data with Physical Knowledge for Uncertainty Quantification in Certification and Reliability Analysis

Unifying empirical data with predictive models can enable engineering cost-savings through certification by analysis and reliability-based design. Both concepts require rigorous uncertainty quantification (UQ) and robust understanding and treatment of relevant physics. Combining sampling-based UQ algorithms with high-fidelity simulations creates a computational bottleneck that is often alleviated through the use of machine learning (ML). ML can be used to create computationally efficient surrogates for simulations of complex or high-dimensional physical interactions (e.g., multi-phase interactions associated with melt pools in laser powder bed fusion or spatially-dependent material properties in functionally graded materials). However, negative side effects of ML may include a lack of interpretability and negative correlation between event rarity and simulation accuracy due to a lack of training data. As such, it is important to infuse ML algorithms with physics-based guardrails to provide confidence in their predictions. This talk will provide a brief review of recent NASA research at this intersection of physics-based simulation, ML, and UQ with a focus on certification and reliability analysis.

uncertainty quantification↗

Identifying Heterogeneous Micromechanical Properties of Biological Tissues via Physics–Informed Neural Networks

The heterogeneous micromechanical properties of biological tissues have profound implications across diverse medical and engineering domains. However, identifying full-field heterogeneous elastic properties of soft materials using traditional engineering approaches is fundamentally challenging due to difficulties in estimating local stress fields. Recently, there has been a growing interest in data-driven models for learning full-field mechanical responses, such as displacement and strain, from experimental or synthetic data. However, research studies on inferring full-field elastic properties of materials, a more challenging problem, are scarce, particularly for large deformation, hyperelastic materials. Here, a physics-informed machine learning approach is proposed to identify the elasticity map in nonlinear, large deformation hyperelastic materials. This study reports the prediction accuracies and computational efficiency of physics-informed neural networks (PINNs) in inferring the heterogeneous elasticity maps across materials with structural complexity that closely resemble real tissue microstructure, such as brain, tricuspid valve, and breast cancer tissues. Further, the improved architecture is applied to three hyperelastic constitutive models: Neo-Hookean, Mooney Rivlin, and Gent. Furthermore, the improved network architecture consistently produces accurate estimations of heterogeneous elasticity maps, even when there is up to 10% noise present in the training data.

59 BASIC BIOLOGICAL SCIENCES↗

Evaluating the potential of disaggregated memory systems for HPC applications

Summary Disaggregated memory is a promising approach that addresses the limitations of traditional memory architectures by enabling memory to be decoupled from compute nodes and shared across a data center. Cloud platforms have deployed such systems to improve overall system memory utilization, but performance can vary across workloads. High‐performance computing (HPC) is crucial in scientific and engineering applications, where HPC machines also face the issue of underutilized memory. As a result, improving system memory utilization while understanding workload performance is essential for HPC operators. Therefore, learning the potential of a disaggregated memory system before deployment is a critical step. This paper proposes a methodology for exploring the design space of a disaggregated memory system. It incorporates key metrics that affect performance on disaggregated memory systems: memory capacity, local and remote memory access ratio, injection bandwidth, and bisection bandwidth, providing an intuitive approach to guide machine configurations based on technology trends and workload characteristics. We apply our methodology to analyze thirteen diverse workloads, including AI training, data analysis, genomics, protein, fusion, atomic nuclei, and traditional HPC bookends. Our methodology demonstrates the ability to comprehend the potential and pitfalls of a disaggregated memory system and provides motivation for machine configurations. Our results show that eleven of our thirteen applications can leverage injection bandwidth disaggregated memory without affecting performance, while one pays a rack bisection bandwidth penalty and two pay the system‐wide bisection bandwidth penalty. In addition, we also show that intra‐rack memory disaggregation would meet the application's memory requirement and provide enough remote memory bandwidth.

Ding, Nan↗

Upscaling Methods Applied to a Fine-Scale Reservoir Model

This study was conducted as part of the Southwest Regional Partnership on Carbon Sequestration (SWP) project to evaluate how upscaling fine-scale simulation models to coarse-scale simulation models impacted the results. The focus was on the Farnsworth Unit (FWU) and its Morrow' B' Sandstone reservoir, specifically the west half of the field. Due to data limitations and the geologic characteristics of the surrounding area, the upscaling was limited to the west half of the FWU rather than a broader basinscale model. The primary aim was to explore how upscaling impacts numerical simulation models, particularly regarding CO 2 -enhanced oil recovery (EOR) and storage capacity predictions. Upscaling was necessary to reduce computational demands when transitioning from high-resolution geological models to coarser grids, as large-scale simulations with finer grids can be computationally prohibitive. This study expands on previous work by the SWP to understand how additional upscaling, applied to already fine-scale numerical simulation models, affects reservoir performance simulations (Ampomah, Balch, & Grigg, 2015). This is key to understanding how loss of resolution can affect coarsescale model results that may be used for large sensitivity analyses, uncertainty quantifications, and training data for machine learning applications.

02 PETROLEUM↗

Data-Efficient Strategies for Probabilistic Voltage Envelopes under Network Contingencies

This work presents an efficient data-driven method to construct probabilistic voltage envelopes (PVE) using power flow learning in grids with network contingencies. First, a network-aware Gaussian process (GP) termed Vertex-Degree Kernel (VDK-GP), developed in prior work, is used to estimate voltage–power functions for a few network configurations. The paper introduces a novel multi-task vertex degree kernel (MT-VDK) that amalgamates the learned VDK-GPs to determine power flows for unseen networks, with a significant reduction in the computational complexity and hyperparameter requirements compared to alternate approaches. Simulations on the IEEE 30-Bus network demonstrate the retention and transfer of power flow knowledge in both N-1 and N-2 contingency scenarios. The MT-VDK-GP approach achieves over 50 % reduction in mean prediction error for novel N-1 contingency network configurations in low training data regimes (50–250 samples) over VDK-GP. Additionally, MT-VDK-GP outperforms a hyper-parameter based transfer learning approach in over 75 % of N-2 contingency network structures, even without historical N-2 outage data. Furthermore, the proposed method demonstrates the ability to achieve PVEs using sixteen times fewer power flow solutions compared to Monte-Carlo sampling-based methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Generative learning for slow manifolds and bifurcation diagrams

In dynamical systems characterized by separation of time scales, the approximation of so called “slow manifolds”, on which the long term dynamics lie, is a useful step for model reduction. Initializing on such slow manifolds is a useful step in modeling, since it circumvents fast transients, and is crucial in multiscale algorithms (like the equation-free approach) alternating between fine scale (fast) and coarser scale (slow) simulations. In a similar spirit, when one studies the infinite time dynamics of systems depending on parameters, the system attractors (e.g., its steady states) lie on bifurcation diagrams (curves for one-parameter continuation, and more generally, on manifolds in state parameter space. Sampling these manifolds gives us representative attractors (here, steady states of ODEs or PDEs) at different parameter values. Algorithms for the systematic construction of these manifolds (slow manifolds, bifurcation diagrams) are required parts of the “traditional” numerical nonlinear dynamics toolkit. In more recent years, as the field of Machine Learning develops, conditional score-based generative models (cSGMs) have been demonstrated to exhibit remarkable capabilities in generating plausible data from target distributions that are conditioned on some given label. It is tempting to exploit such generative models to produce samples of data distributions (points on a slow manifold, steady states on a bifurcation surface) conditioned on (consistent with) some quantity of interest (QoI, observable). In this work, we present a framework for using cSGMs to quickly (a) initialize on a low-dimensional (reduced-order) slow manifold of a multi-time-scale system consistent with desired value(s) of a QoI (a “label”) on the manifold, and (b) approximate steady states in a bifurcation diagram consistent with a (new, out-of-sample) parameter value. This conditional sampling can help uncover the geometry of the reduced slow-manifold and/or approximately “fill in” missing segments of steady states in a bifurcation diagram. Finally, the quantity of interest, which determines how the sampling is conditioned, is either known a priori or identified using manifold learning-based dimensionality reduction techniques applied to the training data.

Dynamical systems↗

Cislunar Trajectory Design and Maneuver Autonomy for NASA's Moon to Mars Architecture

NASA’s Moon to Mars architecture is an ambitious roadmap of manned cislunar and deep space exploration. The extensive amount of orbital assets required will place a significant burden on ground-based resources, such as communication networks and operations facilities. Spacecraft autonomy is essential for maintaining a vast number of complex missions beyond Earth orbit. To achieve full autonomy, spacecraft must be able to employ methods of robust maneuver design without an explicit dependence on commands sent from the ground. This level of autonomy is needed not only for stationkeeping, but also for outbound transfers. To address the need of spacecraft maneuver design autonomy, this work investigates the use of neural networks (NNs) in a supervised learning environment. A supervised learning approach for NNs allows for a curated training data set, consisting exclusively of perturbations applied to a desired mission concept of operations (ConOps). The proposed approach allows humans on the ground to design a specific mission ConOps before flight, then employ NNs to fly the mission robustly and autonomously. This investigation numerically tests maneuver autonomy in four highly sensitive regions of flight: orbit raising, translunar injection burns, powered lunar flybys, and invariant manifold insertion burns. These straining cases are contextualized by testing them in a demonstration mission, targeting an Earth-Moon L3 orbit. The study first establishes feasibility by automating impulsive burn maneuvers. However, some guidance algorithms will need more intensive commands, such as inertial pointing and angular rates. To validate this method, NN maneuver autonomy is applied to a finite burn model of the demonstration mission. The use of sequential, mission specific maneuvers provide an appropriate testbed to demonstrate the robustness of a NN trained on feasible perturbed states. Moreover, these scenarios provide preliminary proof-of-concept for fully autonomous missions that execute maneuvers without dependence upon explicit command uplinks. As a result, the technological advancement proposed in this work may significantly ease the strain on ground-based mission operations. This would enable complex and autonomous mission execution in cislunar and deep space regimes, filling a technology gap required to support future manned missions.

NASA↗

Stress intensity factor models using mechanics-guided decomposition and symbolic regression

The finite element method can be used to compute accurate stress intensity factors (SIFs) for cracks with complex geometries and boundary conditions. In contrast, handbook solutions act as surrogate SIF models that provide significantly faster evaluation times. However, the development of conventional surrogate SIF models relies on manual development based on low-order parameterizations. This limits surrogate model accuracy and generalizability. Here, in this paper, we develop a framework for the automated development of mechanics-guided handbook SIF solutions by using interpretable machine learning via genetic programming for symbolic regression (GPSR). Formalizing the mechanics-based approach of Raju and Newman, SIF training data is decomposed into multiple subsets. This decomposition enables parallel GPSR model development of subfunctions, each of which accounts for specific geometrical corrections with respect to a known analytical model. Using this mechanics-based approach with GPSR allows for equations to be learned with improved accuracy and reduced complexity relative to the Raju Newman equations while maintaining the inherent interpretability of mathematical expressions. In this paper, we present equations that match the complexity of the Raju Newman equations while having reduced error, as well as equations with similar errors and reduced complexity.

42 ENGINEERING↗

A neural network approach to cloud classification

It is shown that, using high-spatial-resolution data, very high cloud classification accuracies can be obtained with a neural network approach. A texture-based neural network classifier using only single-channel visible Landsat MSS imagery achieves an overall cloud identification accuracy of 93 percent. Cirrus can be distinguished from boundary layer cloudiness with an accuracy of 96 percent, without the use of an infrared channel. Stratocumulus is retrieved with an accuracy of 92 percent, cumulus at 90 percent. The use of the neural network does not improve cirrus classification accuracy. Rather, its main effect is in the improved separation between stratocumulus and cumulus cloudiness. While most cloud classification algorithms rely on linear parametric schemes, the present study is based on a nonlinear, nonparametric four-layer neural network approach. A three-layer neural network architecture, the nonparametric K-nearest neighbor approach, and the linear stepwise discriminant analysis procedure are compared. A significant finding is that significantly higher accuracies are attained with the nonparametric approaches using only 20 percent of the database as training data, compared to 67 percent of the database in the linear approach.

Lee, Jonathan↗

Single- and Multiple-Objective Optimization with Differential Evolution and Neural Networks

Genetic and evolutionary algorithms have been applied to solve numerous problems in engineering design where they have been used primarily as optimization procedures. These methods have an advantage over conventional gradient-based search procedures became they are capable of finding global optima of multi-modal functions and searching design spaces with disjoint feasible regions. They are also robust in the presence of noisy data. Another desirable feature of these methods is that they can efficiently use distributed and parallel computing resources since multiple function evaluations (flow simulations in aerodynamics design) can be performed simultaneously and independently on ultiple processors. For these reasons genetic and evolutionary algorithms are being used more frequently in design optimization. Examples include airfoil and wing design and compressor and turbine airfoil design. They are also finding increasing use in multiple-objective and multidisciplinary optimization. This lecture will focus on an evolutionary method that is a relatively new member to the general class of evolutionary methods called differential evolution (DE). This method is easy to use and program and it requires relatively few user-specified constants. These constants are easily determined for a wide class of problems. Fine-tuning the constants will off course yield the solution to the optimization problem at hand more rapidly. DE can be efficiently implemented on parallel computers and can be used for continuous, discrete and mixed discrete/continuous optimization problems. It does not require the objective function to be continuous and is noise tolerant. DE and applications to single and multiple-objective optimization will be included in the presentation and lecture notes. A method for aerodynamic design optimization that is based on neural networks will also be included as a part of this lecture. The method offers advantages over traditional optimization methods. It is more flexible than other methods in dealing with design in the context of both steady and unsteady flows, partial and complete data sets, combined experimental and numerical data, inclusion of various constraints and rules of thumb, and other issues that characterize the aerodynamic design process. Neural networks provide a natural framework within which a succession of numerical solutions of increasing fidelity, incorporating more realistic flow physics, can be represented and utilized for optimization. Neural networks also offer an excellent framework for multiple-objective and multi-disciplinary design optimization. Simulation tools from various disciplines can be integrated within this framework and rapid trade-off studies involving one or many disciplines can be performed. The prospect of combining neural network based optimization methods and evolutionary algorithms to obtain a hybrid method with the best properties of both methods will be included in this presentation. Achieving solution diversity and accurate convergence to the exact Pareto front in multiple objective optimization usually requires a significant computational effort with evolutionary algorithms. In this lecture we will also explore the possibility of using neural networks to obtain estimates of the Pareto optimal front using non-dominated solutions generated by DE as training data. Neural network estimators have the potential advantage of reducing the number of function evaluations required to obtain solution accuracy and diversity, thus reducing cost to design.

Rai, Man Mohan↗

Modeling Deformable Linear Objects for Autonomous Robotic Outfitting of Lunar Surface Systems

This paper presents structural models of deformable linear objects (DLOs). DLOs are a subclass of deformable objects that encompasses common outfitting elements such as cables and ropes. Models are validated through hardware experiments, and integration in a robotic autonomy architecture for space environments is discussed. A persistent human presence on the lunar surface is one of the next major milestones in space exploration. This requires the development of robust extraplanetary construction technologies including structures and materials modeling and robotic systems. Previous robotic construction technology development has primarily focused on structural assembly, with significantly less focus on robotically performed outfitting tasks to instantiate subsystems providing power, data, life support, etc. These tasks involve manipulation of highly flexible elements, which are difficult to model, such as cable harnesses, ropes, and hoses. Robotic manipulation of DLOs, especially cable harnesses, is an active area of research as cable harnesses are essential for providing power and data to space assets. DLO models that can be used for robot manipulator trajectory generation are necessary for autonomous operation of lunar infrastructure. There are many proposed methods for modeling DLOs, and they primarily fall into three types: 1) discrete model-based, 2) continuum model-based, and 3) Neural Network-based. These types each have pros and cons, and the tradeoff between model accuracy and computational speed informs which type should be used. An understanding of this trade-off is imperative for real-time control of autonomous systems. High computational requirements reduce the speed of the model, making real-time control difficult, while accuracy is critical to preventing collisions. Discrete models, such as a mass-spring multibody representation, require relatively few calculations, and accuracy is directly tied to the step size of the discretization. Continuum models, such as a B-spline representation or a Cosserat rod model (a mix of continuous and discrete), are more informed of the structural properties of the cable and are much more accurate than a rigid body mass-spring model, but at significant computational cost. A Neural Network approach can provide an online solution with very few computational steps, but properly generating training data can be difficult and validation for an in-space application is not trivial. This paper explores the trade-off between different modeling approaches and compares accuracy and computational speed/complexity of the three types mentioned above. Model accuracy is evaluated using a cable in a static configuration. True cable shape is obtained using a depth camera for RGB images and point-cloud segmentation. The purpose of this experiment is to evaluate the trade-offs of different approaches to the DLO modeling problem. Understanding the tradeoffs between different cable modeling techniques paves the way for developing robotic control and planning architectures necessary for real-time manipulation of DLOs for lunar infrastructure outfitting. Real-time control is required for robotic systems to be able to actively manipulate a cable in a harsh environment where model and sensor errors compound, and environmental conditions can cause significant disturbances. Cable routing must be performed in areas with high density of objects/obstacles: through truss structures, near solar panels or mirror arrays, next to bundles of electrical equipment. Understanding the best way to plan and manipulate a cable without disrupting the environment or damaging the cable is imperative to robotic outfitting operations on the lunar surface.

Amy M Quartaro↗

Exploring data-driven modeling of boundary layer transition

Prediction of laminar-turbulent transition in boundary layer flows is an important component of predicting the aerodynamic performance of a number of aerospace configurations. According to the CFD Vision 2030 [1], transition modeling represents acriticalarea in CFD simulation capability that will remain a pacing item for the foreseeable future. The fact thattransition can take placevia either one of a myriad possible paths adds to the challenges inreliable transition predictions, despite a limited knowledge of the relevant input parameters. In the low disturbance environments typical of flight applications, transition is often initiated by small amplitude disturbances in the form of linear instability waves of the laminar boundary layer. These disturbances amplify linearly at first and eventually undergo a sequence of nonlinear interactions that result in transition to turbulence. Because the nonlinear phase is rather rapid, the amplification of boundary layer instabilities is governed by the linearstability theory over a majority of the distance leading up to the onset of transition. Semi-empirical transition correlations based on the linear stability theory have been successful in explaining the observed trends in transition location within a broad class of flows. However, the application of stability theory is highly non-robust and often requires a significant domain expertise. Recent work at the NASA Langley Research Center has beenaimed at bridging the gap between physics based transition analyses such as those based on linear stability theory and practical applications that require transition prediction by users that may not be well versed in transition physics. The applications of deep learning have been at the center of these efforts. This presentation will focus on the progress achieved thus far, highlighting the applications of neural networks to selectedtransition scenarios across a range of Mach numbers and flow configuration, as well as the lessons learnedand remaining challengeswithrespect to the selection of training data and neural networks architectures, hyperparameter tuning, and the physical insights distilled from the otherwise black-box models.

M. R. Malik↗

Local reduced-order modeling for electrostatic plasmas by physics-informed solution manifold decomposition

Despite advancements in high-performance computing and modern numerical algorithms, computational cost remains prohibitive for multi-query kinetic plasma simulations. Here, in this work, we develop data-driven reduced-order models (ROMs) for collisionless electrostatic plasma dynamics, based on the kinetic Vlasov-Poisson equation. Our ROM approach projects the equation onto a linear subspace defined by the proper orthogonal decomposition (POD) modes. We introduce an efficient tensorial method to update the nonlinear term using a precomputed third-order tensor. We capture multiscale behavior with a minimal number of POD modes by decomposing the solution manifold into multiple time windows and creating temporally local ROMs. We consider two strategies for decomposition: one based on the physical time and the other based on the electric field energy. Applied to the 1D1V Vlasov–Poisson simulations, that is, prescribed E-field, Landau damping, and two-stream instability, we demonstrate that our ROMs accurately capture the total energy of the system both for parametric and time extrapolation cases. The temporally local ROMs are more efficient and accurate than the single ROM. In addition, in the two-stream instability case, we show that the energy-windowing reduced-order model (EW-ROM) is more efficient and accurate than the time-windowing reduced-order model (TW-ROM). With the tensorial approach, EW-ROM solves the equation approximately 90 times faster than Eulerian simulations while maintaining a maximum relative error of 7.5% for the training data and 11% for the testing data.

Electrostatic plasmas↗