Data-Driven Compatible Schemes for Structure Preserving Surrogate Models
Explore the source record for details and available documents.
Actor, Jonas↗
SEARCH · Search NASA
Results for “structure preserving model”
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.
Small-Signal Angle Stability-Oriented False Data Injection Cyber-Attacks on Power Systems
The small-signal angle stability (SSAS) of a power system is determined by the property of operation points. The widely applied false data injection (FDI) cyber-attack, however, is able to stealthily mislead the optimal power flow (OPF) and thus compromise operation points, leading to damages to the SSAS margin. Here, to provide insights for cyber defenders, this paper proposes and investigates a stealthy SSAS-oriented FDI cyber-attack focusing on two attacking purposes, i.e., the SSAS margin and operation cost, with higher priority on the former one. First, this paper establishes a novel bi-level model with an implicit SSAS constraint based on a structure preserving model to compromise operation points. Then, for the SSAS interarea mode in a typical two-area system, this paper formulates closed-form expressions of how the SSAS margin and operation cost behave with respect to stealthy injections. By comparison, for the SSAS local mode in general power systems, this paper proposes a moving target cyber-attack-based hierarchical solution algorithm. Simulation results on a two-area system, a Kundur 11 bus system, and a modified IEEE 14 bus system demonstrate the significant damaging effects of the proposed SSAS-oriented FDI cyber-attack and the conflict between the two attacking purposes.
Benders decomposition↗
Canonical and noncanonical Hamiltonian operator inference
Here, a method for the nonintrusive and structure-preserving model reduction of canonical and noncanonical Hamiltonian systems is presented. Based on the idea of operator inference, this technique is provably convergent and reduces to a straightforward linear solve given snapshot data and gray-box knowledge of the system Hamiltonian. Examples involving several hyperbolic partial differential equations show that the proposed method yields reduced models which, in addition to being accurate and stable with respect to the addition of basis modes, preserve conserved quantities well outside the range of their training data.
97 MATHEMATICS AND COMPUTING↗
Invertible Temper Modeling using Normalizing Flows and the Effects of Structure Preserving Loss
Advanced manufacturing research and development is typically small-scale, owing to costly experiments associated with these novel processes. Deep learning techniques could help accelerate this development cycle but frequently struggle in small-data regimes like the advanced manufacturing space. While prior work has applied deep learning to modeling visually plausible advanced manufacturing microstructures, little work has been done on data-driven modeling of how microstructures are affected by heat treatment, or assessing the degree to which synthetic microstructures are able to support existing workflows. We propose to address this gap by using invertible neural networks (normalizing flows) to model the effects of heat treatment, e.g., tempering. The model is developed using scanning electron microscope imagery from samples produced using shear-assisted processing and extrusion (ShAPE) manufacturing. This approach not only produces visually and topologically plausible samples, but also captures information related to a sample’s material properties or experimental process parameters. We also demonstrate that topological data analysis, used in prior work to characterize microstructures, can also be used to stabilize model training, preserve structure, and improve downstream results. We assess directions for future work and identify our approach as an important step towards end-to-end deep learning system for accelerating advanced manufacturing research and development.
Howland, Sylvia↗
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↗
Degree-preserving graph dynamics: a versatile process to construct random networks
Real-world networks evolve over time via the addition or removal of vertices and edges. In current network evolution models, vertex degree varies or grows arbitrarily. A recently introduced degree-preserving network growth (DPG) family of models preserves vertex degree, resulting in structures significantly different from and more diverse than previous models. Despite its degree preserving property, the DPG model is able to replicate the output of several well-known real-world network growth models. Simulations showed that many real-world networks can also be constructed from small seed graphs via the DPG process. Here, we start the development of a rigorous mathematical theory underlying the DPG family of network growth models. We prove that the degree sequence of the output of some of the well-known, real-world network growth models can be reconstructed via the DPG process, using proper parametrization. We also show that the general problem of deciding whether a simple graph can be obtained via the DPG process from a small seed (DPG feasibility) is, however, NP-complete. In conclusion, it is an intriguing open problem to uncover whether there is a structural reason behind the DPG-constructability of real-world networks.
97 MATHEMATICS AND COMPUTING↗
Data-driven reduced-order models for port-Hamiltonian systems with operator inference
Hamiltonian operator inference has been developed in Sharma et al. (2022) to learn structure-preserving reduced-order models (ROMs) for Hamiltonian systems. The method constructs a low-dimensional model using only data and knowledge of the functional form of the Hamiltonian. The resulting ROMs preserve the intrinsic structure of the system, ensuring that the mechanical and physical properties of the system are maintained. In this work, we extend this approach to port-Hamiltonian systems, which generalize Hamiltonian systems by including energy dissipation, external input, and output. Based on snapshots of the system’s state and output, together with the information about the functional form of the Hamiltonian, reduced operators are inferred through optimization and are then used to construct data-driven ROMs. To further alleviate the complexity of evaluating nonlinear terms in the ROMs, a hyper-reduction method via discrete empirical interpolation is applied. Accordingly, we derive error estimates for the ROM approximations of the state and output. Lastly, we demonstrate the structure preservation, as well as the accuracy of the proposed port-Hamiltonian operator inference framework, through numerical experiments on a linear mass–spring-damper problem and a nonlinear Toda lattice problem.
97 MATHEMATICS AND COMPUTING↗
SODAs: sparse optimization for the discovery of differential and algebraic equations
Differential-algebraic equations (DAEs) integrate ordinary differential equations (ODEs) with algebraic constraints, providing a fundamental framework for developing models of dynamical systems characterized by time-scale separation, conservation laws and physical constraints. While sparse optimization has revolutionized model development by allowing data-driven discovery of parsimonious models from a library of possible equations, existing approaches for dynamical systems assume DAEs can be reduced to ODEs by eliminating variables before model discovery. This assumption limits the applicability of such methods for DAE systems with unknown constraints and time scales. We introduce sparse optimization for differential-algebraic systems (SODAs), a data-driven method for the identification of DAEs in their explicit form. By discovering the algebraic and dynamic components sequentially without prior identification of the algebraic variables, this approach leads to a sequence of convex optimization problems. It has the advantage of discovering interpretable models that preserve the structure of the underlying physical system. To this end, SODAs improves since SODAs is singular numerical stability when handling high correlations between library terms, caused by near-perfect algebraic relationships, by iteratively refining the conditioning of the candidate library. We demonstrate the performance of our method on biological, mechanical and electrical systems, showcasing its robustness to noise in both simulated time series and real-time experimental data.
DAE↗
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↗
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↗
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↗
Thermodynamics-informed latent space dynamics identification
This software showcases 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.
Cheung, Siu Wun↗
Constructing Water‐Stable Porous Organic Salts via Suppressed Proton Integration Using Fluorinated Tetrazole Tectons
Porous organic salts (POSs) are an emerging class of materials with ordered ionic architectures, offering excellent proton transfer and water uptake properties. However, conventional POS synthesis via strong acid–base neutralization (e.g., ─SO₃H and ─NH₂) leads to extensive hydrogen bonding with water, compromising stability in aqueous and water-lean environments. Here, we address this challenge by designing POSs with hydrophobic porous channels and minimal hydrogen bonding formation. Our key innovation is the use of fluorinated tetrazole as a weak acid tecton and a tetra-substituted imidazole precursor devoid of active protons as the base. Single-crystal analysis and computational modeling reveal that the structural integrity of the synthesized POSs arises primarily from cation–anion interactions, with water confined as clusters in the pores, independent of hydrogen bonding with the scaffold. Robustness of the POS structure under aqueous and water-lean conditions is confirmed by X-ray and neutron scattering, as well as computational modeling, confirming preserved packing and crystal structures. The stability of POS is further demonstrated in aqueous iodine capture, with imidazolium cations and C–F functionalizations serving as strong adsorption sites. As a result, the approach developed herein further pushes the boundary of POS materials to withstand both aqueous and water-lean conditions.
Fluorinated tecton↗
Symplectic machine learning model for fast simulation of space-charge effects
Symplectic simulation of space-charge effects is crucial for the design and operation of high-intensity particle accelerators. Traditional methods for simulating these effects are often computationally expensive, resulting in significant overhead. In this work, we introduce a generative model based on a U-Net architecture within a generative adversarial network framework to efficiently simulate space-charge effects. The model is trained to predict the transverse multiparticle space-charge Hamiltonian, which can be physically computed using a gridless spectral method. The one-step symplectic transverse transfer map for the particles is then obtained by differentiating the predicted Hamiltonian. Benchmarking results demonstrate that this generative model achieves an order of magnitude higher computational efficiency compared to the spectral method, providing a highly efficient alternative for simulating space-charge effects with a large number of particles. By maintaining symplecticity, the model effectively preserves the phase-space structure and mitigates nonphysical errors in long-term simulations. This model has been integrated into jutrack, a novel autodifferentiable accelerator modeling code developed in the julia programming language.
Beam code development & simulation techniques↗
A thermodynamically consistent discretization of 1D thermal-fluid models using their metriplectic 4-bracket structure
Thermodynamically consistent models in continuum physics, i.e. models which satisfy the first and second laws of thermodynamics, may be expressed using the metriplectic formalism. In this work, we leverage the structures underlying this modeling formalism to preserve thermodynamic consistency in discretizations of a fluid model. The procedure relies (1) on ensuring that the spatial semi-discretization retains certain symmetries and degeneracies of the Poisson and metriplectic 4-brackets, and (2) on the use of an appropriate energy conserving time-stepping method. Here, the minimally simple yet nontrivial example of a one-dimensional thermal-fluid model is treated. It is found that preservation of the requisite symmetries and degeneracies of the 4-bracket is relatively simple to ensure in Galerkin spatial discretizations, suggesting a path forward for thermodynamically consistent discretizations of more complex fluid models using more specialized Galerkin methods.
Hamiltonian structure↗
Basic Research Needs for Inverse Methods for Complex Systems under Uncertainty [Brochure]
The four priority research directions outlined in this brochure represent a cohesive vision for advancing the science of inverse problems for complex systems under uncertainty. Together, they address the critical challenges of: discovering, exploiting, and preserving physical and problem structure; overcoming model limitations; integrating disparate, multimodal, and/or dynamic data; and tailoring the solution of inverse problems to downstream tasks. While each PRD focuses on a distinct aspect of inverse-problem research, their interconnected nature highlights the importance of a holistic approach that leverages progress across all areas to achieve transformative solutions. This agenda calls for research across mathematics, statistics, and computer science disciplines, which are guided and complemented by rapid advances in artificial intelligence, high-performance computing, and experimental facilities, to unlock new capabilities, maximize scientific impact, and meet the growing demands of inverse problems that arise across applications that are critical to DOE's mission.
97 MATHEMATICS AND COMPUTING↗