Search NASA⌕ Search

SEARCH · Search NASA

Results for “ENFORCEMENT”

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 433 records · Page 24

An error-in-constitutive equations strategy for topology optimization for frequency-domain dynamics

This paper presents a topology optimization formulation for frequency-domain dynamics to reduce solution dependence upon initial guess and considered loading conditions. Due to resonance phenomena in undamped steady-state dynamics, objectives measuring dynamic response possess many local minima that may represent poor solutions to a design problem, an issue exacerbated for design with respect to multiple frequencies. In this work, we propose an extension of the modified error-in-constitutive-equations (MECE) method, used previously in material identification inverse problems, as a new approach for frequency-domain dynamics topology optimization to mitigate these issues. The main idea of the proposed framework is to incorporate an additional penalty-like term in the objective function that measures the discrepancy in the constitutive relations between stresses and strains and between inertial forces and displacements. Then, the design problem is cast within a PDE-constrained optimization formulation in which we seek displacements, stresses, inertial forces, and a density-field solution that minimize our new objective subject to conservation of linear momentum plus some additional constraints. We show that this approach yields superior designs to conventional gradient-based optimization approaches that solely use a functional of displacements as the objective, while strictly enforcing the constitutive equations. The MECE strategy integrates into a density-based topology optimization scheme for void–solid or two-phase material structural design. We highlight the merits of our approach in a variety of scenarios for direct frequency response design, considering multiple frequency load cases and structural objectives.

42 ENGINEERING↗

An asymptotically compatible treatment of traction loading in linearly elastic peridynamic fracture

Meshfree discretizations of state-based peridynamic models are attractive due to their ability to naturally describe fracture of general materials. However, two factors conspire to prevent meshfree discretizations of state-based peridynamics from converging to corresponding local solutions as resolution is increased: quadrature error prevents an accurate prediction of bulk mechanics, and the lack of an explicit boundary representation presents challenges when applying traction loads. Herein, we develop a reformulation of the linear peridynamic solid (LPS) model to address these shortcomings, using improved meshfree quadrature, a reformulation of the nonlocal dilatation, and a consistent handling of the nonlocal traction condition to construct a model with rigorous accuracy guarantees. In particular, these improvements are designed to enforce discrete consistency in the presence of evolving fractures, whose a priori unknown location render consistent treatment difficult. In the absence of fracture, when a corresponding classical continuum mechanics model exists, our improvements provide asymptotically compatible convergence to corresponding local solutions, eliminating surface effects and issues with traction loading which have historically plagued peridynamic discretizations. When fracture occurs, our formulation automatically provides a sharp representation of the fracture surface by breaking bonds, avoiding the loss of mass. We provide rigorous error analysis and demonstrate convergence for a number of benchmarks, including manufactured solutions, free-surface, nonhomogeneous traction loading, and composite material problems. Finally, we validate simulations of brittle fracture against a recent experiment of dynamic crack branching in soda-lime glass, providing evidence that the scheme yields accurate predictions for practical engineering problems.

42 ENGINEERING↗

Isogeometric Bézier dual mortaring: The Kirchhoff–Love shell problem

Here in this paper we develop an isogeometric Bézier dual mortar method for coupling multi-patch Kirchhoff–Love shell structures. The proposed approach weakly enforces the continuity of the solution at patch interfaces through a dual mortar method and can be applied to both conforming and non-conforming discretizations. As the employed dual basis functions have local supports and satisfy the biorthogonality property, the resulting stiffness matrix is sparse. In addition, the coupling accuracy is optimal because the dual basis possesses the polynomial reproduction property. We also formulate the continuity constraints through the Rodrigues’ rotation operator which gives a unified framework for coupling patches that are intersected with G 1 continuity as well as patches that meet at a kink. Several linear and nonlinear examples demonstrated the performance and robustness of the proposed coupling techniques.

42 ENGINEERING↗

Nonlinear convergence in contact mechanics: Immersed boundary finite volume

In this report we present an immersed boundary finite volume (IBM) method for simulating quasistatic contact mechanics of linearly elastic domains at small strains. In IBM, all external boundaries and internal contacts of an object are represented by embedded surfaces inside a Cartesian mesh, which need not conform to the grid lines. The contact constraints consist of the non-penetrability condition and Coulomb’s friction law, which are discretized using special interpolation stencils and enforced via penalty parameters. The resulting nonlinear system depends on displacement unknowns only. To solve it, we use the Newton method but find that it diverges frequently. To understand the divergence pattern, we analyze a simplified 2-cell problem and show that the global convergence of Newton cannot be ensured for any choice of penalty parameters. We thus propose a modified Newton solver, which guarantees convergence for the 2-cell problem and is numerically verified to converge for all the challenging simulations considered herein. While both 1 st - and 2 nd -order variants of IBM, in displacement unknowns, are proposed, the modified Newton solver applies only to the 1 st -order variant.

42 ENGINEERING↗

Modeling wave propagation in elastic solids via high-order accurate implicit-mesh discontinuous Galerkin methods

Here, a high-order accurate implicit-mesh discontinuous Galerkin framework for wave propagation in single-phase and bi-phase solids is presented. The framework belongs to the embedded-boundary techniques and its novelty regards the spatial discretization, which enables boundary and interface conditions to be enforced with high-order accuracy on curved embedded geometries. High-order accuracy is achieved via high-order quadrature rules for implicitly-defined domains and boundaries, whilst a cell-merging strategy addresses the presence of small cut cells. The framework is used to discretize the governing equations of elastodynamics, written using a first-order hyperbolic momentum-strain formulation, and an exact Riemann solver is employed to compute the numerical flux at the interface between dissimilar materials with general anisotropic properties. The space-discretized equations are then advanced in time using explicit high-order Runge–Kutta algorithms. Several two- and three-dimensional numerical tests including dynamic adaptive mesh refinement are presented to demonstrate the high-order accuracy and the capability of the method in the elastodynamic analysis of single- and bi-phases solids containing complex geometries.

42 ENGINEERING↗

Smoothed boundary method for simulating incompressible flow in complex geometries

Simulating flow through porous media with explicit considerations of complex microstructures is very challenging using conventional sharp-interface methods because of the difficulties in generating meshes conformal to complex geometries. In this work, a diffuse interface embedded boundary method known as the Smoothed Boundary Method (SBM) is utilized to facilitate simulations of fluid dynamics involving complex geometries. In diffuse-interface methods, the geometry is described by a domain parameter. The SBM allows the straightforward reformulation of the time-dependent Navier-Stokes equations in terms of this domain parameter, using only algebraic identities. Thus, enforcing the appropriate boundary conditions at the irregular embedded boundary is greatly simplified. Adaptive mesh refinement is used to increase the accuracy of the diffuse interface method by allowing thinner interfacial thickness to be used in the domain parameter. Here, the SBM-formulated Navier-Stokes equations are solved with the Finite Difference Method on refined mesh systems. Sharp-interface Finite Element Method simulations using the commercial software COMSOL on body-conforming meshes are also provided for comparison. Favorable agreement between the two methods is observed. Since it is no longer necessary for the mesh to conform to the complex geometry, the grid system for the SBM simulations can be generated rapidly and without additional manual interventions, making the entire simulation process more expedient.

36 MATERIALS SCIENCE↗

Physics-informed regularization and structure preservation for learning stable reduced models from data with operator inference

Operator inference learns low-dimensional dynamical-system models with polynomial nonlinear terms from trajectories of high-dimensional physical systems (non-intrusive model reduction). Here, this work focuses on the large class of physical systems that can be well described by models with quadratic and cubic nonlinear terms and proposes a regularizer for operator inference that induces a stability bias onto learned models. The proposed regularizer is physics informed in the sense that it penalizes higher-order terms with large norms and so explicitly leverages the polynomial model form that is given by the underlying physics. This means that the proposed approach judiciously learns from data and physical insights combined, rather than from either data or physics alone. Additionally, a formulation of operator inference is proposed that enforces model constraints for preserving structure such as symmetry and definiteness in linear terms. Numerical results demonstrate that models learned with operator inference and the proposed regularizer and structure preservation are accurate and stable even in cases where using no regularization and Tikhonov regularization leads to models that are unstable.

97 MATHEMATICS AND COMPUTING↗

Modular machine learning-based elastoplasticity: Generalization in the context of limited data

The development of highly accurate constitutive models for materials that undergo path-dependent processes continues to be a complex challenge in computational solid mechanics. Challenges arise both in considering the appropriate model assumptions and from the viewpoint of data availability, verification, and validation. Recently, data-driven modeling approaches have been proposed that aim to establish stress-evolution laws that avoid user-chosen functional forms by relying on machine learning representations and algorithms. However, these approaches not only require a significant amount of data but also need data that probes the full stress space with a variety of complex loading paths. Furthermore, they rarely enforce all necessary thermodynamic principles as hard constraints. Hence, they are in particular not suitable for low-data or limited-data regimes, where the first arises from the cost of obtaining the data and the latter from the experimental limitations of obtaining labeled data, which is commonly the case in engineering applications. In this work, we discuss a hybrid framework that can work on a variable amount of data by relying on the modularity of the elastoplasticity formulation where each component of the model can be chosen to be either a classical phenomenological or a data-driven model depending on the amount of available information and the complexity of the response. The method is tested on synthetic uniaxial data coming from simulations as well as cyclic experimental data for structural materials. The discovered material models are found to not only interpolate well but also allow for accurate extrapolation in a thermodynamically consistent manner far outside the domain of the training data. This ability to extrapolate from limited data was the main reason for the early and continued success of phenomenological models and the main shortcoming in machine learning-enabled constitutive modeling approaches. Training aspects and details of the implementation of these models into Finite Element simulations are discussed and analyzed.

42 ENGINEERING↗

On a fully-implicit VMS-stabilized FE formulation for low Mach number compressible resistive MHD with application to MCF

This study presents the development and evaluation of a fully-implicit variational multiscale (VMS) stabilized unstructured finite element (FE) formulation for compressible magnetohydrodynamics (MHD) model, at low Mach number regime. The model describes the dynamics of a compressible conducting fluid in the low Mach number limit in the presence of electromagnetic fields and can be used to study aspects of astrophysical phenomena, important science and technology applications, and basic plasma physics phenomena. The specific applications that motivate this study are macroscopic simulations of the longer time-scale stability and disruptions of magnetic confinement fusion (MCF) devices, specifically the ITER tokamak. The discussion considers the development of the VMS FE representation, the structure of the stabilizing terms that deal with significant convective flows, the stabilization of the nearly incompressible response of the fluid flow, and the stabilization of the constraint that enforces the solenoidal involution on the magnetic field. The nonlinear discretized system is solved with scalable preconditioned Newton–Krylov iterative methods, which employs a multiphysics block preconditioning method based on approximate block factorizations and Schur complements. The study presents an evaluation of the VMS method on a 2D cartesian tearing mode instability, and illustrates the scalability of the solvers on MCF relevant problems. A set of results are also presented for longer time-scale stability and disruptions for the ITER tokamak. These include a vertical displacement event (VDE), and a (1,1) internal kink mode. Here, the formulation is demonstrated to be scalable and also reasonably robust with respect to the Lundquist number scaling.

42 ENGINEERING↗

Stress-hybrid virtual element method on six-noded triangular meshes for compressible and nearly-incompressible linear elasticity

In this paper, we present a first-order Stress-Hybrid Virtual Element Method (SH-VEM) on six-noded triangular meshes for linear plane elasticity. Here, we adopt the Hellinger–Reissner variational principle to construct a weak equilibrium condition and a stress based projection operator. In each element, the stress projection operator is expressed in terms of the nodal displacements, which leads to a displacement based formulation. This stress-hybrid approach assumes a globally continuous displacement field while the stress field is discontinuous across each element. The stress field is initially represented by divergence-free tensor polynomials based on Airy stress functions, but we also present a formulation that uses a penalty term to enforce the element equilibrium conditions, referred to as the Penalty Stress-Hybrid Virtual Element Method (PSH-VEM). Numerical results are presented for PSH-VEM and SH-VEM, and we compare their convergence to the composite triangle FEM and B-bar VEM on benchmark problems in linear elasticity. The SH-VEM converges optimally in the L 2 norm of the displacement, energy seminorm, and the L 2 norm of hydrostatic stress. Furthermore, the results reveal that PSH-VEM converges in most cases at a faster rate than the expected optimal rate, but it requires the selection of a suitably chosen penalty parameter.

42 ENGINEERING↗

Constrained or unconstrained? Neural-network-based equation discovery from data

Throughout many fields, practitioners often rely on differential equations to model systems. Yet, for many applications, the theoretical derivation of such equations and/or the accurate resolution of their solutions may be intractable. Instead, recently developed methods, including those based on parameter estimation, operator subset selection, and neural networks, allow for the data-driven discovery of both ordinary and partial differential equations (PDEs), on a spectrum of interpretability. The success of these strategies is often contingent upon the correct identification of representative equations from noisy observations of state variables and, as importantly and intertwined with that, the mathematical strategies utilized to enforce those equations. Specifically, the latter has been commonly addressed via unconstrained optimization strategies. Representing the PDE as a neural network, we propose to discover the PDE (or the associated operator) by solving a constrained optimization problem and using an intermediate state representation similar to a physics-informed neural network (PINN). The objective function of this constrained optimization problem promotes matching the data, while the constraints require that the discovered PDE is satisfied at a number of spatial collocation points. We present a penalty method and a widely used trust-region barrier method to solve this constrained optimization problem, and we compare these methods on numerical examples. Our results on several example problems demonstrate that the latter constrained method outperforms the penalty method, particularly for higher noise levels or fewer collocation points. This work motivates further exploration into using sophisticated constrained optimization methods in scientific machine learning, as opposed to their commonly used, penalty-method or unconstrained counterparts. For both of these methods, we solve these discovered neural network PDEs with classical methods, such as finite difference methods, as opposed to PINNs-type methods relying on automatic differentiation. Here, we briefly highlight how simultaneously fitting the data while discovering the PDE improves the robustness to noise and other small, yet crucial, implementation details.

Data-driven discovery↗

Nonexistence of integrable nonlinear magnetic fields with invariants quadratic in momenta

Nonlinear, completely integrable Hamiltonian systems that serve as blueprints for novel particle accelerators at the intensity frontier are promising avenues for research, as Fermilab’s Integrable Optics Test Accelerator (IOTA) example clearly illustrates. Here, we show that only very limited generalizations are possible when no approximations in the underlying Hamiltonian or Maxwell equations are allowed, as was the case for IOTA. Specifically, no such systems exist with invariants quadratic in the momenta, precluding straightforward generalization of the Courant-Snyder theory of linear integrable systems in beam physics. We also conjecture that no such systems exist with invariants of higher degree in the momenta. This leaves solenoidal magnetic fields, including their nonlinear fringe fields, as the only completely integrable static magnetic fields, albeit with invariants that are linear in the momenta. The difficulties come from enforcing Maxwell equations; without constraints, we show that there are many solutions. In particular, we discover a previously unknown large family of integrable Hamiltonians.

97 MATHEMATICS AND COMPUTING↗

A combined ensemble-volume average homogenization method for lattice structures with defects under dynamic and static loading

In the study of lattices structures, both experiments and numerical simulations are often conducted with small samples. Using combined ensemble and volume averaging, this work introduces a method to extract a macroscopic constitutive response of a lattice material from numerical simulations performed in periodic domains. The domain size needed to obtain statistically accurate results is investigated. Similar to molecular dynamics, the concept of the virial stress is introduced after homogenized equations are derived using the ensemble averaging method. Under static conditions, the virial stress is shown to agree with the volume averaged solid stress. Using the homogenization method, constitutive relations for this stress can be obtained from systems with uniform strains. Application of such obtained constitutive relations to more general cases results in an error proportional to the square of the ratio between the lattice length scale and the macroscopic length scale. Taking advantage of this property, numerical simulations are performed in systems with a uniform gradient of the average velocity. The volume average method is then used to accelerate convergence when studying lattices with defects. To avoid the artificial numerical time scale from the size of a representative volume element divided by the wave speed, a numerical scheme is developed to enforce a spatially uniform velocity gradient within the computational domain while allowing fluctuations of the velocity or displacement to develop naturally. To account for probability distribution of lattice defects, the stress is calculated as the ensemble-volume averaged value. For dynamic systems, energy dissipation properties are also studied.

36 MATERIALS SCIENCE↗

Deep operator network surrogate for phase-field modeling of metal grain growth during solidification

A deep operator network (DeepONet) has been constructed that generates accurate representations of phase-field model simulations for evolving two dimensional metal grain morphology growing from melt. These representations serve as lower resolution, computationally efficient stand-ins for quick parameter space exploration of solutions to the the Allen-Cahn equations that dictate the phase-field model simulations. The experimental target for the phase-field model is a uranium casting system cooling a 434 g uranium charge from a maximum temperature of 1400° C at an average rate of 30° C / min , traversing the crystallographic phases of the pure metal. Experimental parameters inform the phase-field model, whose higher resolution computational model solutions are used to train the DeepONet in a given parameter space with the aim of developing a faster, more efficient method for predicting the solidifying metal's microstructure at different potential experimental values. The final DeepONet generates high accuracy, lower resolution predictions with cumulative relative approximation error over all timesteps of less than 0.5%, while ensuring solutions remain within physically feasible ranges. Further, these relative error values are comparable with other state-of-the-art DeepONet models for microstructure evolution, while significantly reducing the amount of training data required. Training a convolutional neural network simultaneously with the DeepONet, enforcing realistic values at the complex metal grain boundaries, and mathematically encoding boundary conditions into the structure of the DeepONet improved prediction accuracy and computational efficiency over a standard DeepONet model.

36 MATERIALS SCIENCE↗

Bayesian prior construction for uncertainty quantification in first-principles statistical mechanics

First-principles statistical mechanics enables the prediction of thermodynamic and kinetic properties of materials, but is computationally expensive. Many approaches require surrogate models to calculate energies within Monte Carlo or molecular dynamics simulations. Inexpensive surrogates such as cluster expansions enable otherwise intractable calculations by interpolating data from higher accuracy methods, such as Density Functional Theory (DFT). Surrogate models introduce uncertainty into downstream calculations, in addition to any uncertainty inherent to DFT calculations. Bayesian frameworks address this by quantifying uncertainty and incorporating expert knowledge through priors. However, constructing effective priors remains challenging. This work introduces and describes practical strategies for building Bayesian cluster expansions, focusing on basis truncation, hyperparameter selection, and ground state replication. We analyze multiple basis truncation schemes, compare cross-validation to the evidence-approximation for hyperparameter optimization, and provide methods to find and enforce ground-state-preserving models through priors. Additionally, we compare the uncertainties between different approximations to DFT (LDA, PBE, SCAN) against the uncertainty introduced with the use of cluster expansion surrogate models. These approaches are demonstrated on the BCC Li x Mg 1-x and Li x Al 1-x alloys, which are both of interest for solid-state Li batteries. Our results provide guidelines for constructing and utilizing Bayesian cluster expansions, thereby improving the transparency of materials modeling. Furthermore, the approaches and insights developed in this work can be transferred to a wide range of cluster expansion surrogate models, including the atomic cluster expansion and related machine-learned interatomic potential architectures.

Alloy theory↗

A scalable stochastic programming approach for the design of flexible systems

We study the problem of designing systems in order to minimize cost while meeting a given flexibility target. Flexibility is attained by enforcing a joint chance constraint, which ensures that the system will exhibit feasible operation with a given target probability level. Unfortunately, joint chance constraints are complicated mathematical objects that often need to be reformulated using mixed-integer programming (MIP) techniques. In this work, we cast the design problem as a conflict resolution problem that seeks to minimize cost while maximizing flexibility. We propose a purely continuous relaxation of this problem that provides a significantly more scalable approach relative to MIP methods and show that the formulation delivers solutions that closely approximate the Pareto set of the original joint chance-constrained problem.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Phenomena-based graph representations and applications to chemical process simulation

Rapid and robust simulation of chemical processes is critical to conduct process design, optimization, techno-economic analysis, and sustainability analysis. Yet, efficiently solving simulation models remains a challenge due to the highly coupled and nonlinear nature of the underlying algebraic equations that capture the physical phenomena taking place in the process (e.g., material and energy conservation, phase equilibrium, reactions). In this work, we show that graph-theoretic representations of the physical phenomena within unit operations can help navigate and decompose equations to systematically identify alternative approaches for fast and robust numerical solutions. Specifically, we present a graph-theoretic abstraction that captures the connectivity between the model variables/equations and use this abstraction to group variables/equations into fundamental phenomena. We show that phenomena-based decomposition of the underlying equations can help decouple nonlinearities and enforce material/energy conservation at the process level to accelerate convergence. The proposed decomposition approach differs from the more traditional sequential modular simulation approach, in which equations are grouped and decomposed by unit operations. We implemented the phenomena-based decomposition in BioSTEAM—an open-source process simulation platform in Python—and demonstrated that this approach can converge a variety of separation process models. Compared to sequential modular simulation, the phenomena-based approach can converge idealized systems faster, but it can be slower for (or even fail to converge) highly coupled and nonideal process systems.

Convergence↗

High-order, stable, and conservative boundary schemes for central and compact finite differences

Stable and conservative numerical boundary schemes are constructed such that they do not diminish the overall accuracy of the method for interior schemes of orders 4, 6, and 8 using both explicit (central) and compact finite differences. Previous attempts to develop stable numerical boundary schemes for non-linear problems have resulted in schemes which significantly reduced the global accuracy and/or required some form of artificial dissipation. Thus, the schemes developed in this paper are the first to not require this tradeoff, while also ensuring discrete conservation and allowing for direct boundary condition enforcement. After outlining a general procedure for the construction of conservative boundary schemes of any order, a simple, yet novel, optimization strategy which focuses directly on the compressible Euler equations is presented. Furthermore, the result of this non-linear optimization process is a set of high-order, stable, and conservative numerical boundary schemes which demonstrate excellent stability and convergence properties on an array of linear and non-linear hyperbolic problems.

97 MATHEMATICS AND COMPUTING↗