Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Low-dimensional Space”

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.

173 records · Page 10

La 4 Co 4 X ( X = Pb , Bi , Sb ) : A demonstration of antagonistic pairs as a route to quasi-low-dimensional ternary compounds

We outline how pairs of strongly immiscible elements, referred to here as antagonistic pairs, can be used to synthesize ternary compounds with low or quasi-reduced-dimensional motifs intrinsically built into their crystal structures. By identifying third elements that are mutually compatible with a given antagonistic pair, ternary compounds can be formed in which the third element segregates the immiscible atoms into spatially separated substructures. Quasi-low-dimensional structural units, such as sheets, chains, or clusters are a natural consequence of the immiscible atoms seeking to avoid close contact in the solid state. Further, as proof of principle, we present the discovery, crystal growth, and basic physical properties of La 4 ⁢Co 4 ⁢$\mathrm{X}$ (X = Pb, Bi, Sb), a family of intermetallic compounds based on the antagonistic pairs Co-Pb and Co-Bi. La 4 ⁢Co 4 ⁢$\mathrm{X}$ adopts an orthorhombic crystal structure (space group Pbam) containing quasi-two-dimensional Co slabs and La-X polyhedra that stack in an alternating manner along the α axis. Consistent with our proposal, the La atoms separate the Co and X substructures, ensuring there are no direct contacts between the members of the immiscible (antagonistic) pair. Within the Co slabs, the atoms occupy the vertices of corner sharing tetrahedra and triangles, and this bonding motif produces narrow electronic bands near the Fermi level that favor magnetism. The Co is moment bearing in each La 4 ⁢Co 4 $\mathrm{X}$ compound studied, and we show that whereas La 4 ⁢Co 4 ⁢Pb behaves as a three-dimensional antiferromagnet with T N =220K, La 4 ⁢Co 4 ⁢Bi and La 4⁢ Co 4 ⁢Sb have behavior consistent with low-dimensional magnetic coupling and ordering, with T N =153K and 143 K, respectively. In addition to the Pb-, Bi-, and Sb-based La 4 ⁢Co 4 ⁢$\mathrm{X}$ compounds, we also were likely able to produce an analogous La 4 ⁢Co 4 ⁢Sn in polycrystalline form, although we were unable to isolate single crystals. We anticipate that identifying and using mutually compatible third elements together with an antagonistic pair represents a generalizable design principle for discovering new materials and new structure types containing low-dimensional substructures.

36 MATERIALS SCIENCE↗

Data-Driven Compression of Electron-Phonon Interactions

First-principles calculations of electron interactions in materials have seen rapid progress in recent years, with electron-phonon ( e − ph ) interactions being a prime example. However, these techniques use large matrices encoding the interactions on dense momentum grids, which reduces computational efficiency and obscures interpretability. For e − ph interactions, existing interpolation techniques leverage locality in real space, but the high dimensionality of the data remains a bottleneck to balance cost and accuracy. Here we show an efficient way to compress e − ph interactions based on singular value decomposition (SVD), a widely used matrix and image compression technique. Leveraging (un)constrained SVD methods, we accurately predict material properties related to e − ph interactions—including charge mobility, spin relaxation times, band renormalization, and superconducting critical temperature—while using only a small fraction (1%–2%) of the interaction data. These findings unveil the hidden low-dimensional nature of e − ph interactions. Furthermore, they accelerate state-of-the-art first-principles e − ph calculations by about 2 orders of magnitude without sacrificing accuracy. Our Pareto-optimal parametrization of e − ph interactions can be readily generalized to electron-electron and electron-defect interactions, as well as to other couplings, advancing quantitative studies of condensed matter. Published by the American Physical Society 2024

Physics↗

Characterizing skyrmion flow phases with principal component analysis

Principal component analysis (PCA) is a powerful method that can identify patterns in large, complex data sets by constructing low-dimensional order parameters from higher-dimensional feature vectors. There are increasing efforts to use space-and-time-dependent PCA to detect transitions in nonequilibrium systems that are difficult to characterize with equilibrium methods. Here, we demonstrate that feature vectors incorporating the position and velocity information of driven skyrmions moving through random disorder permit PCA to resolve different types of disordered skyrmion motion as a function of driving force and the ratio of the Magnus force to the dissipation. Since the Magnus force creates gyroscopic motion and a finite Hall angle, skyrmions can exhibit a greater range of flow phases than what is observed in overdamped driven systems with quenched disorder. We show that in addition to identifying previously known skyrmion flow phases, PCA detects several additional phases, including different types of channel flow, moving fluids, and partially ordered states. Guided by the PCA analysis, we further characterize the disordered flow phases to elucidate the different microscopic dynamics and show that the changes in the PCA-derived order parameters can be connected to features in bulk transport measures, including the transverse and longitudinal velocity-force curves, differential conductivity, topological defect density, and changes in the skyrmion Hall angle as a function of drive. We discuss how asymmetric feature vectors can be used to improve the resolution of the PCA analysis, and how this technique can be extended to find disordered phases in other nonequilibrium systems with time-dependent dynamics.

36 MATERIALS SCIENCE↗

Learning Canonical Embeddings for Unsupervised Shape Correspondence With Locally Linear Transformations

We present a new approach to unsupervised shape correspondence learning between pairs of point clouds. We make the first attempt to adapt the classical locally linear embedding algorithm (LLE)-originally designed for nonlinear dimensionality reduction-for shape correspondence. The key idea is to find dense correspondences between shapes by first obtaining high-dimensional neighborhood-preserving embeddings of low-dimensional point clouds and subsequently aligning the source and target embeddings using locally linear transformations. We demonstrate that learning the embedding using a new LLE-inspired point cloud reconstruction objective results in accurate shape correspondences. More specifically, the approach comprises an end-to-end learnable framework of extracting high-dimensional neighborhood-preserving embeddings, estimating locally linear transformations in the embedding space, and reconstructing shapes via divergence measure-based alignment of probability density functions built over reconstructed and target shapes. Our approach enforces embeddings of shapes in correspondence to lie in the same universal/canonical embedding space, which eventually helps regularize the learning process and leads to a simple nearest neighbors approach between shape embeddings for finding reliable correspondences. Comprehensive experiments show that the new method makes noticeable improvements over state-of-the-art approaches on standard shape correspondence benchmark datasets covering both human and nonhuman shapes.

deformation↗

Data-Driven Closures and Assimilation for Stiff Multiscale Random Dynamics

Here, we introduce a data-driven and physics-informed framework for propagating uncertainty in stiff, multiscale random ordinary differential equations (RODEs) driven by correlated (colored) noise. Unlike systems subjected to Gaussian white noise, a deterministic equation for the joint probability density function (PDF) of RODE state variables does not exist in closed form. Moreover, such an equation would require as many phase-space variables as there are states in the RODE system. To alleviate this curse of dimensionality, we instead derive exact, albeit unclosed, reduced-order PDF (RoPDF) equations for low-dimensional observables/quantities of interest. The unclosed terms take the form of state-dependent conditional expectations, which are directly estimated from data at sparse observation times. However, for systems exhibiting stiff, multiscale dynamics, data sparsity introduces regression discrepancies that compound during RoPDF evolution. This is overcome by introducing a kinetic-like defect term to the RoPDF equation, which is learned by assimilating in sparse, low-fidelity RoPDF estimates. Two assimilation methods are considered, namely nudging and deep neural networks, which are successfully tested against Monte Carlo simulations.

97 MATHEMATICS AND COMPUTING↗

Scalable Bayesian Physics-Informed Kolmogorov-Arnold Networks

Uncertainty quantification (UQ) plays a pivotal role in scientific machine learning, especially when surrogate models are used to approximate complex systems. Although multilayer perceptions (MLPs) are commonly employed as surrogates, they often suffer from overfitting due to their large number of parameters. Kolmogorov-Arnold networks (KANs) offer an alternative solution with fewer parameters. However, gradient-based inference methods, such as Hamiltonian Monte Carlo (HMC), may result in computational inefficiency when applied to KANs, especially for large-scale datasets, due to the high cost of back-propagation. To address these challenges, we propose a novel approach, combining the dropout Tikhonov ensemble Kalman inversion (DTEKI) with Chebyshev KANs. This gradient-free method effectively mitigates overfitting and enhances numerical stability. In addition, we incorporate the active subspace method to reduce the parameter-space dimensionality, allowing us to improve the accuracy of predictions and obtain more reliable uncertainty estimates. Extensive experiments demonstrate the efficacy of our approach in various test cases, including scenarios with large datasets and high noise levels. Our results show that the new method achieves comparable or better accuracy, much higher efficiency as well as stability compared to HMC, in addition to scalability. Moreover, by leveraging the low-dimensional parameter subspace, our method preserves prediction accuracy while substantially reducing further the computational cost.

97 MATHEMATICS AND COMPUTING↗

Manifold Learning-Based Polynomial Chaos Expansions for High-Dimensional Surrogate Models

In this work we introduce a manifold learning-based method for uncertainty quantification (UQ) in systems describing complex spatiotemporal processes. Our first objective is to identify the embedding of a set of high-dimensional data representing quantities of interest of the computational or analytical model. For this purpose, we employ Grassmannian diffusion maps, a two-step nonlinear dimension reduction technique which allows us to reduce the dimensionality of the data and identify meaningful geometric descriptions in a parsimonious and inexpensive manner. Polynomial chaos expansion is then used to construct a mapping between the stochastic input parameters and the diffusion coordinates of the reduced space. An adaptive clustering technique is proposed to identify an optimal number of clusters of points in the latent space. The similarity of points allows us to construct a number of geometric harmonic emulators which are finally utilized as a set of inexpensive pretrained models to perform an inverse map of realizations of latent features to the ambient space and thus perform accurate out-of-sample predictions. Thus, the proposed method acts as an encoder-decoder system which is able to automatically handle very high-dimensional data while simultaneously operating successfully in the small-data regime. The method is demonstrated on two benchmark problems and on a system of advection-diffusion-reaction equations which model a first-order chemical reaction between two species. In all test cases, the proposed method is able to achieve highly accurate approximations which ultimately lead to the significant acceleration of UQ tasks.

42 ENGINEERING↗

Uncertainty Quantification and Sensitivity Analysis of Low-Dimensional Manifold via Co-Kurtosis PCA in Combustion Modeling

For multi-scale multi-physics applications e.g., the turbulent combustion code Pele, robust and accurate dimensionality reduction is crucial to solving problems at exascale and beyond. A recently developed technique, Co-Kurtosis based Principal Component Analysis (CoK-PCA) which leverages principal vectors of co-kurtosis, is a promising alternative to traditional PCA for complex chemical systems. To improve the effectiveness of this approach, we employ Artificial Neural Networks for reconstructing thermo-chemical scalars, species production rates, and overall heat release rates corresponding to the full state space. Our focus is on bolstering confidence in this deep learning based non-linear reconstruction through Uncertainty Quantification (UQ) and Sensitivity Analysis (SA). UQ involves quantifying uncertainties in inputs and outputs, while SA identifies influential inputs. One of the noteworthy challenges is the computational expense inherent in both endeavors. To address this, we employ the Monte Carlo methods to effectively quantify and propagate uncertainties in our reduced spaces while managing computational demands. Our research carries profound implications not only for the realm of combustion modeling but also for a broader audience in UQ. By showcasing the reliability and robustness of CoK-PCA in dimensionality reduction and deep learning predictions, we empower researchers and decision-makers to navigate complex combustion systems with greater confidence.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Indications of low dimensionality in magnetospheric dynamics

Using three separate but related approaches, the question of whether the dynamic response of the magnetosphere to the solar wind input may be described by a low-order system of equations is examined. First, it is determined that the dimension of the subset (the attractor) in the high-dimensional magnetospheric phase space associated with the westward auroral electrojet (AL) index for some of the data sets compiled by Bargatze et al. (1985) is 4.0 + or - 0.2, seemingly independent of activity level. Second, direct modeling of the magnetosphere, considering the bulk properties of the tail plasma, leads to a system of equations that is similar to those previously reported as a dripping faucet model; here, the focus is specifically on the prediction of a natural frequency in this model. Finally, a peak is identified with the predicted frequency in power spectra of AL computed for intervals with both low and high activity. Peaks at other frequencies also appear in the spectra, and such resonances would be expected for a chaotic nonlinear oscillator. Combining these approaches it is concluded that at least some aspects of magnetospheric dynamics may be meaningfully modeled by low-dimensional sets of equations.

Roberts, D. A.↗

Two Reduced Resolution Filter Approaches to Data Assimilation

In this paper we evaluate the performance of two reduced resolution filter approaches to data assimilation. The main distinction between these approaches is in the manner they propagate error covariances. Both account for error covariances in a space with dimension m smaller than the model's state vector dimension n. In the first approach the m dimensional error covariance matrix is interpolated to the n-dimensional space and propagated with the n-dimensional dynamics. In the second approach the low-dimensional error covariance matrix is propagated by a dynamical operator generated in the m-dimensional space. Our experiments indicate that the first approach provides a more reliable simplified scheme for error covariance propagation than the second approach.

Todling, Ricardo↗

Resolving the fine structure in the energy landscapes of repeat proteins

Ankyrin (ANK) repeat proteins are coded by tandem occurrences of patterns with around 33 amino acids. They often mediate protein–protein interactions in a diversity of biological systems. These proteins have an elongated non-globular shape and often display complex folding mechanisms. This work investigates the energy landscape of representative proteins of this class made up of 3, 4 and 6 ANK repeats using the energy-landscape visualisation method (ELViM). By combining biased and unbiased coarse-grained molecular dynamics AWSEM simulations that sample conformations along the folding trajectories with the ELViM structure-based phase space, one finds a three-dimensional representation of the globally funnelled energy surface. In this representation, it is possible to delineate distinct folding pathways. We show that ELViMs can project, in a natural way, the intricacies of the highly dimensional energy landscapes encoded by the highly symmetric ankyrin repeat proteins into useful low-dimensional representations. These projections can discriminate between multiplicities of specific parallel folding mechanisms that otherwise can be hidden in oversimplified depictions.

Murilo N. Sanches↗