Search NASA⌕ Search

SEARCH · Search NASA

Results for “Structure preservation”

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

Uncertainty-Aware, Structure-Preserving Machine Learning Approach for Domain Shift Detection From Nonlinear Dynamic Responses of Structural Systems

Complex structural systems deployed for aerospace, civil, or mechanical applications must operate reliably under varying operational conditions. Structural health monitoring (SHM) systems help ensure the reliability of these systems by providing continuous monitoring of the state of the structure. SHM relies on synthesizing measured data with a predictive model to make informed decisions about structural states. However, these models—which may be thought of as a form of a digital twin—need to be updated continuously as structural changes (e.g., due to damage) arise. We propose an uncertainty-aware machine learning model that enforces distance preservation of the original input state space and then encodes a distance-aware mechanism via a Gaussian process (GP) kernel. The proposed approach leverages the spectral-normalized neural GP algorithm to combine the flexibility of neural networks with the advantages of GP, subjected to structure-preserving constraints, to produce an uncertainty-aware model. This model is used to detect domain shift due to structural changes that cannot be observed directly because they may be spatially isolated (e.g., inside a joint or localized damage). This work leverages detection theory to detect domain shift systematically given statistical features of the prediction variance produced by the model. The proposed approach is demonstrated on a nonlinear structure being subjected to damage conditions. In conclusion, it is shown that the proposed approach is able to rely on distances of the transformed input state space to predict increased variance in shifted domains while being robust to normative changes.

Algorithms↗

Preserving Structurally Labile Peptide Nanosheets After Molecular Functionalization of the Self-Assembling Peptides

A significant challenge in creating supramolecular materials is that conjugating molecular functionalities to building blocks often results in dissociation or undesired morphological transformation of their assemblies. Here we present a facile strategy to preserve structurally labile peptide assemblies after molecular modification of the self-assembling peptides. Sheet-forming peptides are designed to afford a staggered alignment with the segments bearing chemical modification sites protruding from the sheet surfaces. The staggered assembly allows for simultaneous separation of attached molecules from each other and from the underlying assembly motifs. Strikingly, using PEGs as the external molecules, PEG 400 - and PEG 700 -peptide conjugates directly self-associate into nanosheets with the PEG chains localized on the sheet surfaces. In contrast, the sheet formation based on in-register lateral packing of peptides does not recur upon the peptide PEGylation. This strategy allows for fabrication of densely modified assemblies with a variety of molecules, as demonstrated using biotin (hydrophobic molecule), c(RGDfK) (cyclic pentapeptide), and nucleic acid aptamer (negatively charged ssDNA). The staggered co-assembly also enables extended tunability of the amount/density of surface molecules, as exemplified by screening ligand-appended assemblies for cell targeting. In conclusion, this study paves the way for functionalization of historically challenging fragile assemblies while maintaining their overall morphology.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

WE-EF-207-07: Dual Energy CT with One Full Scan and a Second Sparse-View Scan Using Structure Preserving Iterative Reconstruction (SPIR)

Purpose: Conventional dual energy CT (DECT) reconstructs CT and basis material images from two full-size projection datasets with different energy spectra. To relax the data requirement, we propose an iterative DECT reconstruction algorithm using one full scan and a second sparse-view scan by utilizing redundant structural information of the same object acquired at two different energies. Methods: We first reconstruct a full-scan CT image using filtered-backprojection (FBP) algorithm. The material similarities of each pixel with other pixels are calculated by an exponential function about pixel value differences. We assume that the material similarities of pixels remains in the second CT scan, although pixel values may vary. An iterative method is designed to reconstruct the second CT image from reduced projections. Under the data fidelity constraint, the algorithm minimizes the L2 norm of the difference between pixel value and its estimation, which is the average of other pixel values weighted by their similarities. The proposed algorithm, referred to as structure preserving iterative reconstruction (SPIR), is evaluated on physical phantoms. Results: On the Catphan600 phantom, SPIR-based DECT method with a second 10-view scan reduces the noise standard deviation of a full-scan FBP CT reconstruction by a factor of 4 with well-maintained spatial resolution, while iterative reconstruction using total-variation regularization (TVR) degrades the spatial resolution at the same noise level. The proposed method achieves less than 1% measurement difference on electron density map compared with the conventional two-full-scan DECT. On an anthropomorphic pediatric phantom, our method successfully reconstructs the complicated vertebra structures and decomposes bone and soft tissue. Conclusion: We develop an effective method to reduce the number of views and therefore data acquisition in DECT. We show that SPIR-based DECT using one full scan and a second 10-view scan can provide high-quality DECT images and accurate electron density maps as conventional two-full-scan DECT.

60 APPLIED LIFE SCIENCES↗

A self-consistent Hamiltonian model of the ponderomotive force and its structure preserving discretization

In the presence of an inhomogeneous oscillatory electric field, charged particles experience a net force, averaged over the oscillatory timescale, known as the ponderomotive force. We derive a one-dimensional Hamiltonian model which self-consistently couples the electromagnetic field to a plasma which experiences the ponderomotive force. We derive a family of structure preserving discretizations of the model of varying order in space and time using conforming and broken finite element exterior calculus spectral element methods. In all variants of our discretization framework, the method is found to conserve the Casimir invariants of the continuous model to machine precision and the energy to the order of the splitting method used.

Physics↗

A Structure-Preserving Model and Sufficient Condition for Frequency Synchronization of Lossless Droop Inverter-Based AC Networks

This paper presents a new method for analysis of frequency synchronization of lossless power networks whose sources are frequency-droop controlled inverters. Unlike most existing approaches, our method focuses on the interaction between inverters and the network to provide new physical insight into how those interactions create frequency synchronization. We introduce two structure-preserving models of such a network (one bus-oriented and one line-oriented), and show that frequency synchronization corresponds to convergence to an equilibrium of these models. We derive a necessary condition for existence of such equilibria, and determine a simple test for their local stability. Finally, we introduce a sufficient condition for frequency synchronization of such networks, and show that it consists of a set of local criteria which can each be determined from local measurements.

Distributed control↗

Data-driven Whitney forms for structure-preserving control volume analysis

Control volume analysis models physics via the exchange of generalized fluxes between subdomains. Here, we introduce a scientific machine learning framework adopting a partition of unity architecture to identify physically-relevant control volumes, with generalized fluxes between subdomains encoded via Whitney forms. The approach provides a differentiable parameterization of geometry which may be trained in an end-to-end fashion to extract reduced models from full field data while exactly preserving physics. The architecture admits a data-driven finite element exterior calculus allowing discovery of mixed finite element spaces with closed form quadrature rules. An equivalence between Whitney forms and graph networks reveals that the geometric problem of control volume learning is equivalent to an unsupervised graph discovery problem. The framework is developed for manifolds in arbitrary dimension, with examples provided for H(div) problems in $\mathbb{R}$ establishing convergence and structure preservation properties. Finally, we consider a lithium-ion battery problem where we discover a reduced finite element space encoding transport pathways from high-fidelity microstructure resolved simulations. The approach reduces the 5.89M finite element simulation to 136 elements while reproducing pressure to under 0.1% error and preserving conservation.

97 MATHEMATICS AND COMPUTING↗

Structure-preserving neural networks for the regularized entropy-based closure of a linear, kinetic, radiative transport equation

The main challenge of large-scale numerical simulation of radiation transport is the high memory and computation time requirements of discretization methods for kinetic equations. In this work, we derive and investigate a neural network-based approximation to the entropy-based closure method to accurately compute the solution of the multi-dimensional moment system with a low memory footprint and competitive computational time. We extend methods developed for the standard entropy-based closure to the regularized entropy-based closures. The main idea is to interpret structure-preserving neural network approximations of the regularized entropy-based closure as a two-stage approximation to the original entropy-based closure. We conduct a numerical analysis of this approximation and investigate optimal parameter choices. Our numerical experiments demonstrate that the method has a much lower memory footprint than traditional methods with competitive computation times and simulation accuracy. The code and all trained networks are provided on GitHub.

entropy closure↗

Scalable Preconditioners for Structure Preserving Discretizations of Maxwell Equations in First Order Form

Here, we report multiple physical time-scales can arise in electromagnetic simulations when dissipative effects are introduced through boundary conditions, when currents follow external time-scales, and when material parameters vary spatially. In such scenarios, the time-scales of interest may be much slower than the fastest time-scales supported by the Maxwell equations, therefore making implicit time integration an efficient approach. The use of implicit temporal discretizations results in linear systems in which fast time-scales, which severely constrain the stability of an explicit method, can manifest as so-called stiff modes. This study proposes a new block preconditioner for structure preserving (also termed physics compatible) discretizations of the Maxwell equations in first order form. The intent of the preconditioner is to enable the efficient solution of multiple-time-scale Maxwell type systems. An additional benefit of the developed preconditioner is that it requires only a traditional multigrid method for its subsolves and compares well against alternative approaches that rely on specialized edge-based multigrid routines that may not be readily available. Lastly, results demonstrate parallel scalability at large electromagnetic wave CFL numbers on a variety of test problems.

97 MATHEMATICS AND COMPUTING↗

Advanced fuel fusion, phase space engineering, and structure-preserving geometric algorithms

Non-thermal advanced fuel fusion trades the requirement of a large amount of recirculating tritium in the system for that of large recirculating power. Phase space engineering technologies utilizing externally injected electromagnetic fields can be applied to meet the challenge of maintaining non-thermal particle distributions at a reasonable cost. The physical processes of the phase space engineering are studied from a theoretical and algorithmic perspective. It is emphasized that the operational space of phase space engineering is limited by the underpinning symplectic dynamics of charged particles. The phase space incompressibility according to the Liouville theorem is just one of many constraints, and Gromov's non-squeezing theorem determines the minimum footprint of the charged particles on every conjugate phase space plane. In this sense and level of sophistication, the mathematical abstraction of phase space engineering is symplectic topology. To simulate the processes of phase space engineering, such as the Maxwell demon and electromagnetic energy extraction, and to accurately calculate the minimum footprints of charged particles, recently developed structure-preserving geometric algorithms can be used. The family of algorithms conserves exactly, on discretized spacetime, symplecticity and thus incompressibility, non-squeezability, and symplectic capacities. The algorithms apply to the dynamics of charged particles under the influence of external electromagnetic fields as well as the charged particle–electromagnetic field system governed by the Vlasov–Maxwell equations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

Structure preserving transport stabilized compatible finite element methods for magnetohydrodynamics

Here, we present compatible finite element space discretizations for the ideal compressible magnetohydrodynamic equations. The magnetic field is considered both in div- and curl-conforming spaces, leading to a strongly or weakly preserved zero-divergence condition, respectively. The equations are discretized in space such that transfers between the kinetic, internal, and magnetic energies are consistent, leading to a preserved total energy. We also discuss further adjustments to the discretization required to additionally achieve magnetic helicity preservation. Finally, we describe new transport stabilization methods for the magnetic field equation which maintain the zero-divergence and energy conservation properties, including one method which also preserves magnetic helicity. The methods' preservation and improved stability properties are confirmed numerically using a steady state and a magnetic dynamo test case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data-driven, structure-preserving approximations to entropy-based moment closures for kinetic equations

In this study, we present a data-driven approach for approximating entropy-based closures of moment systems from kinetic equations. The proposed closure learns the entropy function by fitting the map between the moments and the entropy of the moment system, and thus does not depend on the spacetime discretization of the moment system or specific problem configurations such as initial and boundary conditions. With convex and C 2 approximations, this data-driven closure inherits several structural properties from entropy-based closures, such as entropy dissipation, hyperbolicity, and H-Theorem. We construct convex approximations to the Maxwell–Boltzmann entropy using convex splines and neural networks, test them on the plane source benchmark problem for linear transport in slab geometry, and compare the results to the standard, entropy-based systems which solve a convex optimization problem to find the closure. Numerical results indicate that these data-driven closures provide accurate solutions in much less computation time than that required by the optimization routine.

97 MATHEMATICS AND COMPUTING↗