Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Nonlinear reduction”

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 55 records · Page 3

Accelerating uncertainty quantification in incremental dynamic analysis using dimension reduction-based surrogate modeling

We propose a surrogate modeling framework based on dimension reduction to facilitate the quantification of seismic risk of structural systems in performance-based earthquake engineering. The framework adopts incremental dynamic analysis (IDA) for addressing hazard variability, and promotes significant computational efficiency improvement for propagating epistemic uncertainties associated with the structural models. It utilizes both linear and nonlinear dimension reduction approaches, equipped with inverse mappings, to learn a functional between the input parameter space (e.g., the epistemic uncertainties of the structure) to the high-dimensional output space created through the IDA implementation across different ground motions and seismic intensity levels. Polynomial chaos expansion is adopted as the surrogate model to learn this functional in the reduced space. A nine-story steel moment-resisting frame with uncertain structural properties is used as a testbed. Furthermore, we select the seismic fragility curves as a measure of the structure’s seismic performance, since it provides an estimate of the probability of entering specified damage states for given levels of ground shaking.

42 ENGINEERING↗

Improved multifidelity Monte Carlo estimators based on normalizing flows and dimensionality reduction techniques

Here, we study the problem of multifidelity uncertainty propagation for computationally expensive models. In particular, we consider the general setting where the high-fidelity and low-fidelity models have a dissimilar parameterization both in terms of number of random inputs and their probability distributions, which can be either known in closed form or provided through samples. We derive novel multifidelity Monte Carlo estimators which rely on a shared subspace between the high-fidelity and low-fidelity models where the parameters follow the same probability distribution, i.e., a standard Gaussian. We build the shared space employing normalizing flows to map different probability distributions into a common one, together with linear and nonlinear dimensionality reduction techniques, active subspaces and autoencoders, respectively, which capture the subspaces where the models vary the most. We then compose the existing low-fidelity model with these transformations and construct modified models with an increased correlation with the high-fidelity model, which therefore yield multifidelity estimators with reduced variance. A series of numerical experiments illustrate the properties and advantages of our approaches.

97 MATHEMATICS AND COMPUTING↗

Low‐dimensional manifold learning for uncertainty quantification in complex multi‐scale stochastic systems

Broadly speaking, the goals of the project are to develop techniques to use manifold learning to develop reduced‐order and surrogate models for "hyper‐reduction" of very high‐dimensional complex multi‐scale systems. This is being achieved by employing a newly proposed form of manifold projection and learning that leverages recent advancements in computational geometry and data‐driven modeling. In particular, we are applying a manifold projection technique to project the solutions of very high‐dimensional systems onto the so‐called Grassmannmanifold, a Reimannian manifold comprised of orthonormal matrices. We then apply data‐driven machine learning techniques to classify the solutions on the manifold (e.g. clustering techniques) according to their proximity on the manifold and leverage a further nonlinear dimension reduction to organize the structured data on the manifold. Finally, we are developing novel techniques that enable us to directly interpolate the hyper‐reduced data such that we can predict the solution of the complex, high‐ dimensional system without need to call the full expensive computational model. Given their adherence to the underlying structure of the solution of the physical system, it is expected that these approximate solutions will be sufficiently constrained so as to (approximately) adhere to physical principles.

97 MATHEMATICS AND COMPUTING↗

Physics-constrained, low-dimensional models for magnetohydrodynamics: First-principles and data-driven approaches

Plasmas are highly nonlinear and multiscale, motivating a hierarchy of models to understand and describe their behavior. However, there is a scarcity of plasma models of lower fidelity than magnetohydrodynamics (MHD), although these reduced models hold promise for understanding key physical mechanisms, efficient computation, and real-time optimization and control. Galerkin models, obtained by projection of the MHD equations onto a truncated modal basis, and data-driven models, obtained by modern machine learning and system identification, can furnish this gap in the lower levels of the model hierarchy. This work develops a reduced-order modeling framework for compressible plasmas, leveraging decades of progress in projection-based and data-driven modeling of fluids. We begin by formalizing projection-based model reduction for nonlinear MHD systems. To avoid separate modal decompositions for the magnetic, velocity, and pressure fields, we introduce an energy inner product to synthesize all of the fields into a dimensionally consistent, reduced-order basis. Next, we obtain an analytic model by Galerkin projection of the Hall-MHD equations onto these modes. We illustrate how global conservation laws constrain the model parameters, revealing symmetries that can be enforced in data-driven models, directly connecting these models to the underlying physics. We demonstrate the effectiveness of this approach on data from high-fidelity numerical simulations of a three-dimensional spheromak experiment. Finally, this manuscript builds a bridge to the extensive Galerkin literature in fluid mechanics and facilitates future principled development of projection-based and data-driven models for plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Structure Tuning, Strong Second Harmonic Generation Response, and High Optical Stability of the Polar Semiconductors Na 1- x K x AsQ 2

We report the mixed cation compounds Na 1-x K x AsSe 2 (x = 0.8, 0.65, 0.5) and Na 0.1 K 0.9 AsS 2 crystallize in the polar noncentrosymmetric space group Cc. The AAsQ(2) (A = alkali metals, Q = S, Se) family features one-dimensional (1D) 1 / ∞ [AQ 2 - ] chains comprising corner-sharing pyramidal AQ 3 units in which the packing of these chains is dependent on the alkali metals. The parallel 1 / ∞ [AQ(2) - ] chains interact via short As ∙∙∙Se contacts, which increase in length when the fraction of K atoms is increased. The increase in the As ∙∙∙Se interchain distance increases the band gap from 1.75 eV in γ-NaAsSe 2 to 2.01 eV in Na 0.35 K 0.65 AsSe 2 , 2.07 eV in Na 0.2 K 0.8 AsSe 2 , and 2.18 eV in Na 0.1 K 0.9 AsS 2 . The Na 1-x K x AsSe 2 (x = 0.8, 0.65) compounds melt congruently at approximately 316 °C. Wavelength-dependent second harmonic generation (SHG) measurements on powder samples of Na 1-x K x AsSe 2 (x = 0.8, 0.65, 0.5) and Na 0.1 K 0.9 AsS 2 suggest that Na 0.2 K 0.8 AsSe 2 and Na 0.1 K 0.9 AsS 2 have the highest SHG response and exhibit significantly higher laser-induced damage thresholds (LIDTs). Theoretical SHG calculations on Na 0.5 K 0.5 AsSe 2 confirm its SHG response with the highest value of d 33 = 22.5 pm/V χ 333 (2) = 45.0 pm/V). The effective nonlinearity for a randomly oriented powder is calculated to be d eff = 18.9 pm/V χ eff (2) = 37.8 pm/V), which is consistent with the experimentally obtained value of d eff = 16.5 pm/V χ eff (2) = 33.0 pm/V). Three-photon absorption is the dominant mechanism for the optical breakdown of the compounds under intense excitation at 1580 nm, with Na 0.2 K 0.8 AsSe 2 exhibiting the highest stability.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

tLaSDI: Thermodynamics-informed latent space dynamics identification

Here we propose a latent space dynamics identification method, namely tLaSDI, that embeds the first and second principles of thermodynamics. The latent variables are learned through an autoencoder as a nonlinear dimension reduction model. The latent dynamics are constructed by a neural network-based model that precisely preserves certain structures for the thermodynamic laws through the GENERIC formalism. An abstract error estimate is established, which provides a new loss formulation involving the Jacobian computation of autoencoder. The autoencoder and the latent dynamics are simultaneously trained to minimize the new loss. Computational examples demonstrate the effectiveness of tLaSDI, which exhibits robust generalization ability, even in extrapolation. In addition, an intriguing correlation is empirically observed between a quantity from tLaSDI in the latent space and the behaviors of the full-state solution.

97 MATHEMATICS AND COMPUTING↗

A nudged hybrid analysis and modeling approach for realtime wake-vortex transport and decay prediction

Here, we put forth a long short-term memory (LSTM) nudging framework for the enhancement of reduced order models (ROMs) of fluid flows utilizing noisy measurements for air traffic improvements. Toward emerging applications of digital twins in aviation, the proposed approach allows for constructing a realtime predictive tool for wake-vortex transport and decay systems. We build on the fact that in realistic application, there are uncertainties in initial and boundary conditions, model parameters, as well as measurements. Moreover, conventional nonlinear ROMs based on Galerkin projection (GROMs) suffer from imperfection and solution instabilities, especially for advection-dominated flows with slow decay in the Kolmogorov n-width. In the presented LSTM nudging (LSTM-N) approach, we fuse forecasts from a combination of imperfect GROM and uncertain state estimates, with sparse Eulerian sensor measurements to provide more reliable predictions in a dynamical data assimilation framework. We illustrate our concept by solving the two-dimensional vorticity transport equation. We investigate the effects of measurements noise and state estimate uncertainty on the performance of the LSTM-N behavior. We also demonstrate that it can sufficiently handle different levels of temporal and spatial measurement sparsity, and offer a huge potential in developing next-generation digital twin technologies for aerospace applications.

42 ENGINEERING↗

A Variable Eddington Factor Model for Thermal Radiative Transfer with Closure Based on Data-Driven Shape Function

Here, a new variable Eddington factor (VEF) model is presented for nonlinear problems of thermal radiative transfer (TRT). The VEF model is data-driven and acts on known (a-priori) radiation-diffusion solutions for material temperatures in the TRT problem. A linear auxiliary problem is constructed for the radiative transfer equation (RTE) whose emission source and opacities are evaluated at these known material temperatures. The solution to this RTE approximates the specific intensity distribution in phase-space and time. It is applied as a shape function to define the Eddington tensor for the presented VEF model. The shape function computed via the auxiliary RTE problem will capture some degree of transport effects within the TRT problem. The VEF moment equations closed with this approximate Eddington tensor will thus carry with them these captured transport effects. In this study, the temperature data comes from multigroup P 1 , P 1/3 , and flux-limited diffusion radiative transfer models. The proposed VEF model can be interpreted as a transport-corrected diffusion reduced-order model. Numerical results are presented on the Fleck-Cummings test problem which models a supersonic wavefront of radiation. The VEF model is shown to improve accuracy by 1–2 orders of magnitude compared to the considered radiation-diffusion model solutions to the TRT problem.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Disentangling Ferroelectric Wall Dynamics and Identification of Pinning Mechanisms via Deep Learning

Field-induced domain-wall dynamics in ferroelectric materials underpins multiple applications ranging from actuators to information technology devices and necessitates a quantitative description of the associated mechanisms including giant electromechanical couplings, controlled nonlinearities, or low coercive voltages. While the advances in dynamic piezoresponse force microscopy measurements over the last two decades have rendered visualization of polarization dynamics relatively straightforward, the associated insights into the local mechanisms have been elusive. This work explores the domain dynamics in model polycrystalline materials using a workflow combining deep-learning-based segmentation of the domain structures with nonlinear dimensionality reduction using multilayer rotationally invariant autoencoders (rVAE). The former allows unambiguous identification and classification of the ferroelectric and ferroelastic domain walls. Here, the rVAE discovers the latent representations of the domain wall geometries and their dynamics, consequently providing insight into the intrinsic mechanisms of polarization switching, that can further be compared to simple physical models. The rVAE disentangles the factors affecting the pinning efficiency of ferroelectric walls, offering insights into the correlation of ferroelastic wall distribution and ferroelectric wall pinning.

36 MATERIALS SCIENCE↗

Enhancing Interpretability in Generative Modeling: Statistically Disentangled Latent Spaces Guided by Generative Factors in Scientific Datasets

This study addresses the challenge of statistically extracting generative factors from complex, high-dimensional datasets in unsupervised or semi-supervised settings. We investigate encoder-decoder-based generative models for nonlinear dimensionality reduction, focusing on disentangling low-dimensional latent variables corresponding to independent physical factors. Introducing Aux-VAE, a novel architecture within the classical Variational Autoencoder framework, we achieve disentanglement with minimal modifications to the standard VAE loss function by leveraging prior statistical knowledge through auxiliary variables. These variables guide the shaping of the latent space by aligning latent factors with learned auxiliary variables. We validate the efficacy of Aux-VAE through comparative assessments on multiple datasets, including astronomical simulations.

97 MATHEMATICS AND COMPUTING↗

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↗

Geometric learning for computational mechanics Part II: Graph embedding for interpretable multiscale plasticity

The history-dependent behaviors of classical plasticity models are often driven by internal variables evolved according to phenomenological laws. The difficulty to interpret how these internal variables represent a history of deformation, the lack of direct measurement of these internal variables for calibration and validation, and the weak physical underpinning of those phenomenological laws have long been criticized as barriers to creating realistic models. In this work, geometric machine learning on graph data (e.g. finite element solutions) is used as a means to establish a connection between nonlinear dimensional reduction techniques and plasticity models. Geometric learning-based encoding on graphs allows the embedding of rich time-history data onto a low-dimensional Euclidean space such that the evolution of plastic deformation can be predicted in the embedded feature space. Finally, a corresponding decoder can then convert these low-dimensional internal variables back into a weighted graph such that the dominating topological features of plastic deformation can be observed and analyzed.

42 ENGINEERING↗

Understanding latent timescales in neural ordinary differential equation models of advection-dominated dynamical systems

The neural ordinary differential equation (ODE) framework has shown considerable promise in recent years in developing highly accelerated surrogate models for complex physical systems characterized by partial differential equations (PDEs). For PDE-based systems, state-of-the-art neural ODE strategies leverage a two-step procedure to achieve this acceleration: a nonlinear dimensionality reduction step provided by an autoencoder, and a time integration step provided by a neural-network based model for the resultant latent space dynamics (the neural ODE). This work explores the applicability of such autoencoder-based neural ODE strategies for PDEs in which advection terms play a critical role. More specifically, alongside predictive demonstrations, physical insight into the sources of model acceleration (i.e., how the neural ODE achieves its acceleration) is the scope of the current study. Such investigations are performed by quantifying the effects of both autoencoder and neural ODE components on latent system time-scales using eigenvalue analysis of dynamical system Jacobians. To this end, the sensitivity of various critical training parameters – de-coupled versus end-to-end training, latent space dimensionality, and the role of training trajectory length, for example – to both model accuracy and the discovered latent system timescales is quantified. Furthermore, this work specifically uncovers the key role played by the training trajectory length (the number of rollout steps in the loss function during training) on the latent system timescales: larger trajectory lengths correlate with an increase in limiting neural ODE time-scales, and optimal neural ODEs are found to recover the largest time-scales of the full-order (ground-truth) system. Demonstrations are performed across fundamentally different unsteady fluid dynamics configurations influenced by advection: (1) the Kuramoto–Sivashinsky equations (2) Hydrogen-Air channel detonations (the compressible reacting Navier–Stokes equations with detailed chemistry), and (3) 2D Atmospheric flow.

Advection-dominated dynamical systems↗

Comparing storm resolving models and climates via unsupervised machine learning

Global storm-resolving models (GSRMs) have gained widespread interest because of the unprecedented detail with which they resolve the global climate. However, it remains difficult to quantify objective differences in how GSRMs resolve complex atmospheric formations. This lack of comprehensive tools for comparing model similarities is a problem in many disparate fields that involve simulation tools for complex data. To address this challenge we develop methods to estimate distributional distances based on both nonlinear dimensionality reduction and vector quantization. Our approach automatically learns physically meaningful notions of similarity from low-dimensional latent data representations that the different models produce. This enables an intercomparison of nine GSRMs based on their high-dimensional simulation data (2D vertical velocity snapshots) and reveals that only six are similar in their representation of atmospheric dynamics. Furthermore, we uncover signatures of the convective response to global warming in a fully unsupervised way. Our study provides a path toward evaluating future high-resolution simulation data more objectively.

54 ENVIRONMENTAL SCIENCES↗

Reduced-order modeling of advection-dominated systems with recurrent neural networks and convolutional autoencoders

A common strategy for the dimensionality reduction of nonlinear partial differential equations (PDEs) relies on the use of the proper orthogonal decomposition (POD) to identify a reduced subspace and the Galerkin projection for evolving dynamics in this reduced space. However, advection-dominated PDEs are represented poorly by this methodology since the process of truncation discards important interactions between higher-order modes during time evolution. In this study, we demonstrate that encoding using convolutional autoencoders (CAEs) followed by a reduced-space time evolution by recurrent neural networks overcomes this limitation effectively. We demonstrate that a truncated system of only two latent space dimensions can reproduce a sharp advecting shock profile for the viscous Burgers equation with very low viscosities, and a six-dimensional latent space can recreate the evolution of the inviscid shallow water equations. Additionally, the proposed framework is extended to a parametric reduced-order model by directly embedding parametric information into the latent space to detect trends in system evolution. Furthermore, our results show that these advection-dominated systems are more amenable to low-dimensional encoding and time evolution by a CAE and recurrent neural network combination than the POD-Galerkin technique.

97 MATHEMATICS AND COMPUTING↗

Seven-core fibre Raman laser with intercore coupling

This paper reports results of a study aimed at producing a Raman fibre laser based on a multicore fibre with high-reflectivity fibre Bragg gratings inscribed in its peripheral cores using femtosecond laser pulses. We present spectral and power characteristics of a Raman laser whose output power at a wavelength of 1090 nm is 2.5 W. The laser emission linewidth has been shown to decrease as a result of the reduction in nonlinear effects owing to the larger effective mode area in the multicore fibre in comparison with a standard single-mode fibre Raman laser. (paper)

36 MATERIALS SCIENCE↗

MASTODON: An Open-Source Software for Seismic Analysis and Risk Assessment of Critical Infrastructure

Seismic analysis and risk assessment of safety-critical infrastructure like hospitals, nuclear power plants, dams, and facilities handling radioactive materials involve computationally intensive numerical models and coupled multiphysics scenarios. They are also performed in a strict regulatory environment that requires high software quality assurance standards, and in the case of safety-related nuclear facilities, a conformance to the American Society of Mechanical Engineers Nuclear Quality Assurance (NQA-1) standard. This paper introduces the open-source finite-element software, MASTODON (Multi-hazard Analysis of Stochastic Time-Domain Phenomena), which implements state-of-the-art seismic analysis and risk assessment tools in a quality-controlled environment. MASTODON is built on MOOSE (Multi-physics Object-Oriented Simulation Environment), which is a highly parallelizable, NQA-1 conforming, coupled multiphysics, finite-element framework developed at Idaho National Laboratory. MASTODON is capable of fault rupture and source-to-site wave propagation using the domain reduction method, nonlinear site response, and soil-structure interaction analysis, implicit and explicit time integration, automated stochastic simulations, and seismic probabilistic risk assessment. When coupled with other MOOSE applications, MASTODON can also solve strongly and weakly coupled multiphysics problems. This paper presents a summary of the capabilities of MASTODON and some demonstrative examples.

42 ENGINEERING↗

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗