Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “regularity”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Adversarial classification via distributional robustness with Wasserstein ambiguity

Abstract We study a model for adversarial classification based on distributionally robust chance constraints. We show that under Wasserstein ambiguity, the model aims to minimize the conditional value-at-risk of the distance to misclassification, and we explore links to adversarial classification models proposed earlier and to maximum-margin classifiers. We also provide a reformulation of the distributionally robust model for linear classification, and show it is equivalent to minimizing a regularized ramp loss objective. Numerical experiments show that, despite the nonconvexity of this formulation, standard descent methods appear to converge to the global minimizer for this problem. Inspired by this observation, we show that, for a certain class of distributions, the only stationary point of the regularized ramp loss minimization problem is the global minimizer.

Ho-Nguyen, Nam (ORCID:0000000344647730)↗
DOE OSTI2025

Bulk nanocrystalline Al–Mg–Y alloys with amorphous grain boundary complexions display high strength and compressive plasticity

Although nanocrystalline alloys regularly exhibit high strengths, their use in structural applications often face challenges due to sample size limitations, unstable microstructures, and the limited ability to plastically deform. The incorporation of amorphous grain boundary complexions has been proposed to address these issues, by simultaneously stabilizing nanocrystalline grain structures for scale-up processing and improving alloy toughness. In the present study, the mechanical behavior of bulk nanocrystalline Al–Mg–Y is examined with macroscale compression testing, probing a length scale that is relevant to real-world structural applications. Bulk samples were fabricated via a simple powder metallurgy approach, with different hot-pressing temperatures and durations employed for consolidation in order to investigate microstructural and property evolution. All of the specimens contained primary face-centered cubic Al and secondary Al 4 C 3 and Al 3 Y phases, with the Al 3 Y particles exhibiting two populations of small equiaxed and larger elongated particles. Appreciable plasticity was measured along with high ultimate stresses over 800 MPa due to the presence of amorphous grain boundary complexions. Microstructural characterization of fracture surfaces revealed that the area fraction of dimpled regions increased with longer hot-pressing time. Most importantly, the elongated Al 3 Y particles formed regular cellular patterns with increasing hot-pressing time, delaying shear localization and significantly enhancing plasticity. The hierarchy present in the microstructure of the Al–Mg–Y alloy, from amorphous grain boundary complexions to secondary phases, gives rise to excellent bulk mechanical properties, which are attractive for structural applications.

Bulk nanocrystalline alloy↗
DOE OSTI2024

A $C^1$-Conforming Arbitrary-Order Two-Dimensional Virtual Element Method for the Fourth-Order Phase-Field Equation

We present a two-dimensional conforming virtual element method for the fourth-order phase-field equation. Our proposed numerical approach to the solution of this high-order phase-field (HOPF) equation relies on the design of an arbitrary-order accurate, virtual element space with $C^1$ global regularity. Such regularity is guaranteed by taking the values of the virtual element functions and their full gradient at the mesh vertices as degrees of freedom. Attaining high-order accuracy requires also edge polynomial moments of the trace of the virtual element functions and their normal derivatives. In this work, we detail the scheme construction, and prove its convergence by deriving error estimates in different norms. A set of representative test cases allows us to assess the behavior of the method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Clustering and Cliques in Preferential Attachment Random Graphs with Edge Insertion

In this paper, we investigate the global clustering coefficient (a.k.a transitivity) and clique number of graphs generated by a preferential attachment random graph model with an additional feature of allowing edge connections between existing vertices. Specifically, at each time step t, either a new vertex is added with probability f(t), or an edge is added between two existing vertices with probability 1 – f(t). We establish concentration inequalities for the global clustering and clique number of the resulting graphs under the assumption that f(t) is a regularly varying function at infinity with index of regular variation –$\gamma$, where $\gamma$ $\in$ [0, 1). Finally, we also demonstrate an inverse relation between these two statistics: the clique number is essentially the reciprocal of the global clustering coefficient.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Memory-efficient nonsmooth dynamic optimization using adaptive randomized compression

Dynamic optimization problems arise in many applications including flow control, full waveform inversion, and medical imaging. These problems are plagued by significant computational challenges. One such challenge — and the focus of this work — is the memory limitation induced by the size of the underlying dynamical system. In particular, the entire dynamic trajectory is required for derivative computation and therefore must be stored or recomputed using, e.g., checkpointing. Although recent work demonstrated the use of adaptive randomized sketching to overcome the memory challenge, that work only applies to smooth unconstrained problems, prohibiting its use for nonsmooth regularized and constrained problems. The inclusion of nonsmooth regularizers and constraints is critical as they often arise in an attempt to preserve certain physical properties or to promote sparsity. To solve these problems, we introduce a trust-region algorithm for minimizing the sum of a smooth nonconvex function and a nonsmooth convex function that leverages randomized sketching to compress the dynamical system trajectories and adaptively adjust the sketch rank to satisfy a gradient inexactness condition. We prove convergence of this algorithm and demonstrate that it achieves substantial memory reduction on three discretized PDE-constrained optimization applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Improved pore network models to simulate single-phase flow in porous media by coupling with lattice Boltzmann method

In this paper, different pore network models to simulate single-phase flow in porous media are built and their accuracy is evaluated. In addition to the conventional pore network model (CPNM) which consists of regular pore bodies and throat bonds, three improved pore network models (IPNMs) are developed allowing to better describing the real pore and throat geometry. The first improved pore network model (IPNM1) replaces the regular throat bond with a throat bond showing the real throat cross section. The second improvement (IPNM2) uses a series of sub-throat bonds with varying cross sections to better describe the real throat geometry, which is firstly proposed in this paper. The third model (IPNM3) extracts the real pore-throat-pore geometry without simplification. The conductance of fluid flow through these more realistic throat bonds is calculated by the lattice Boltzmann method (LBM). The accuracy and computational efficiency of the different pore network models are evaluated taking the LBM simulation over the whole porous medium as reference solution. The global permeability and detailed pressure distributions in the pores for the different pore network models are validated. The results show that the accuracy of the pore network model increases from CPNM to IPNM3, but at the expense of increasing computational cost. This study suggests that IPNM3 can replace a whole-domain LBM simulation with similar accuracy but much lower computational cost. As a first-order approximation the newly proposed IPNM2 is suggested as good compromise between accuracy and computational cost.

42 ENGINEERING↗
DOE OSTI2021

Electromagnetic and gravitational interactions from Lagrangian mechanics

Highlights: • Background Maxwell and Einstein fields are universal features of Lagrangian systems. • The Lagrangian function is promoted to a dynamic field. • The Einstein–Maxwell theory is derived from Lagrangian mechanics. Background fields of electromagnetic and gravitational type emerge in the low kinetic energy limit of any regular Lagrangian system and, in particular, in the corresponding limit of any spacetime theory in which the free motion of test particles is described by an unspecified regular Lagrangian. Electromagnetic and gravitational type interactions are therefore a universal feature of low kinetic energy Lagrangian systems. These background interactions can be consistently turned into dynamic Einstein–Maxwell fields by promoting the Lagrangian function to a dynamic scalar field on the tangent bundle of the configuration space. Accordingly, Einstein–Maxwell theory can be deduced from the assumption that the motion of elementary test particles in spacetime is described by Lagrangian mechanics. For higher kinetic energy-type values, identified with the square of the invariant mass of the particle, the Lagrangian induces higher rank interactions that seem however too weak to have been detected in spacetime physics, but which might prove relevant at the Planck scale.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Optical conductivity of multi-Weyl node semimetals due to electromagnetic and axial pseudogauge fields

Here, we compute the optical conductivity of a multi-Weyl semimetal in the presence of electromagnetic and axial fields. In the first part of the paper we use a U(1) gauge field to compute the current of a multi-Weyl semimetal. The current is used in the computation of the optical conductivity within the Kubo-Matsubara formalism. We consider a multi-Weyl semimetal with two nodal points in the z-direction. The multi-Weyl semimetal has a width D in the transverse direction which is smaller than the length L in the longitudinal direction. Due to the width D we replace the model by a sum of transverse modes in 1+1 dimensions. We then regularize the model in 1+1 dimensions. The nodal points are responsible for a constant axial field and a static anomalous Hall effect. In the second part we study the effect of dynamic axial fields. An elastic deformation couples to the two electronic chiralities, and represents the axial pseudogauge field $\vec{a}$ 5 . As a consequence, the system is excited by two kinds of field, the electromagnetic one and the axial srain field. For a Weyl system this is represented by the triangle diagram, which is responsible for the anomalous Hall effect. We can obtain the anomalous Hall effect also by a chiral transformation in 1+1 dimensions using regularization. The chiral transformation modifies the path integration measure and is the source of the induced anomalous Hall effect. The latter is controlled by a combination of strain waves and electromagnetic fields.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

A priori error analysis of high-order LL* (FOSLL*) finite element methods

A number of non-standard finite element methods have been proposed in recent years, each of which derives from a specific class of PDE-constrained norm minimization problems. The most notable examples are LL* methods. In this work, we argue that all high-order methods in this class should be expected to deliver substandard uniform h-refinement convergence rates. In fact, one may not even see rates proportional to the polynomial order p > 1 when the exact solution is a constant function. Here, we show that the convergence rate is limited by the regularity of an extraneous Lagrange multiplier variable which naturally appears via a saddle-point analysis. In turn, limited convergence rates appear because the regularity of this Lagrange multiplier is determined, in part, by the geometry of the domain. Numerical experiments support our conclusions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A subdivision-stabilized B-spline mixed material point method

Subjected to external loadings, polymeric materials, e.g., biological tissues, hydrogels, and elastomers, may undergo extreme, nearly incompressible, (self-)contact deformations. For numerical modeling employing mesh-based techniques such as the finite element method (FEM), these deformations pose significant challenges due to large distortions in the deformed geometry, accuracy issues stemming from volumetric locking effects, and increased computational cost from complex contact searches. As an alternative to mesh-based methods, the material point method (MPM), a continuum-based particle technique, is gaining attention for its ability to handle extreme distortions and capture no-slip contact without added cost. For nearly incompressible material behaviors, while mixed formulations can address locking effects by treating displacements and pressure as independent fields, they can suffer from numerical instabilities close to the incompressibility limit due to the violation of the inf-sup condition, leading to inaccurate nodal pressure solutions. Here we propose an efficient and stable mixed B-spline material point method with highest achievable regularity for quasi-compressible polymeric materials. Using the two-scale relation of B-splines, we introduce a subdivision-stabilization for the two-field mixed MPM and obtain numerically stable, oscillation-free nodal solutions with equal-order interpolations with optimal regularity. Building on the Eulerian-Lagrangian nature of MPM, a previously-converged solution framework is adopted to mitigate issues related to cell-crossing and numerical fracture artifact present in standard MPM. We assess the stability and accuracy of the developed mixed MPM at large deformations for soft materials through the benchmark Cook’s membrane problem. Additionally, we test the robustness of the proposed MPM by modeling several examples, including the compression and indentation of a circular block into a quasi-compressible substrate and the twisting deformation of a rectangular block. The findings demonstrate the MPM’s capabilities for modeling practical soft material applications.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Extreme sparsification of physics-augmented neural networks for interpretable model discovery in mechanics

Data-driven constitutive modeling with neural networks has received increased interest in recent years due to its ability to easily incorporate physical and mechanistic constraints and to overcome the challenging and time-consuming task of formulating phenomenological constitutive laws that can accurately capture the observed material response. However, even though neural network-based constitutive laws have been shown to generalize proficiently, the generated representations are not easily interpretable due to their high number of trainable parameters. Sparse regression approaches exist that allow for obtaining interpretable expressions, but the user is tasked with creating a library of model forms which by construction limits their expressiveness to the functional forms provided in the libraries. Here, in this work, we propose to train regularized physics-augmented neural network-based constitutive models utilizing a smoothed version of $L^0$-regularization. This aims to maintain the trustworthiness inherited by the physical constraints, but also enables interpretability which has not been possible thus far on any type of machine learning-based constitutive model where model forms were not assumed a priori but were actually discovered. During the training process, the network simultaneously fits the training data and penalizes the number of active parameters, while also ensuring constitutive constraints such as thermodynamic consistency. We show that the method can reliably obtain interpretable and trustworthy constitutive models for compressible and incompressible hyperelasticity, yield functions, and hardening models for elastoplasticity, using synthetic and experimental data. This work aims to set a new paradigm for interpretable machine learning models in the broad area of solid mechanics where low and limited data is available along with prior knowledge of physical constraints that the learned maps need to obey. This paradigm can potentially be extended to a broader spectrum of scientific exploration.

Data-driven constitutive models↗
DOE OSTI2024

Surrogate construction via weight parameterization of residual neural networks

Surrogate model development is a critical step for uncertainty quantification or other sample-intensive tasks for complex computational models. Here, in this work, we develop a multi-output surrogate form using a class of neural networks (NNs) that employ shortcut connections, namely Residual NNs (ResNets). ResNets are known to regularize the surrogate learning problem and improve the efficiency and accuracy of the resulting surrogate. Inspired by the continuous, Neural ODE analogy, we augment ResNets with weight parameterization strategy with respect to ResNet depth. Weight-parameterized ResNets regularize the NN surrogate learning problem and allow better generalization with a drastically reduced number of learnable parameters. We demonstrate that weight-parameterized ResNets are more accurate and efficient than conventional feed-forward multi-layer perceptron networks. We also compare various options for parameterization of the weights as functions of ResNet depth. We demonstrate the results on both synthetic examples and a large scale earth system model of interest.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Interpretable and flexible non-intrusive reduced-order models using reproducing kernel Hilbert spaces

This paper develops an interpretable, non-intrusive reduced-order modeling technique using regularized kernel interpolation. Existing non-intrusive approaches approximate the dynamics of a reduced-order model (ROM) by solving a data-driven least-squares regression problem for low-dimensional matrix operators. Our approach instead leverages regularized kernel interpolation, which yields an optimal approximation of the ROM dynamics from a user-defined reproducing kernel Hilbert space. We show that our kernel-based approach can produce interpretable ROMs whose structure mirrors full-order model structure by embedding judiciously chosen feature maps into the kernel. The approach is flexible and allows a combination of informed structure through feature maps and closure terms via more general nonlinear terms in the kernel. We also derive a computable a posteriori error bound that combines standard error estimates for intrusive projection-based ROMs and kernel interpolants. In conclusion, the approach is demonstrated in several numerical experiments that include comparisons to operator inference using both proper orthogonal decomposition and quadratic manifold dimension reduction.

Data-driven model reduction↗
DOE OSTI2020

Front propagation formulation for large eddy simulation of turbulent premixed flames

The front propagation formulation (FPF) for large eddy simulation (LES) of turbulent premixed flames is presented and discussed. The FPF method adopts a regularized Dirac delta function to minimize the spurious propagation of under-resolved filtered flame fronts in LES, while reproducing the reaction characteristics of premixed flame fronts. Here, the extension of the FPF method to LES and the relation to existing sub-filter combustion models are discussed. An algebraic model for the regularized Dirac delta function is presented and validated using direct numerical simulation (DNS) data for statistically planar premixed flames propagating in homogeneous isotropic turbulence. A posteriori validation for a filtered 1-D planar laminar flame is performed to demonstrate the characteristics of FPF in reproducing the propagation speed and the thickness of the under-resolved flame front. LES of a turbulent Bunsen flame is also performed to demonstrate the performance of the proposed method.

42 ENGINEERING↗
DOE OSTI2023

Reducing impacts of artificial ponding in modeling salt marshes using a conductivity-formulated subgrid model

The landforms of salt marsh systems are rather complex, with meandering channel networks cutting through low-lying, extensive marsh platforms. Some small-scale topographic details are critical to flooding and draining processes but cannot be reflected in the Digital Elevation Model (DEM) due to limited measurement resolution and vegetation bias. Numerical models need a grid with high enough resolution to capture the small-scale connectivity to correctly model the small-scale flow processes, making the model computationally unaffordable. Here, in this study, we derived a subgrid model, which couples two flow components, one is the regular subgrid model for simulating the subgrid-resolved flows, and the other is a conductivity-formulated porous flow model for modeling small-scale gut flows unresolved at the subgrid level. The model validation was performed using an idealized case with a narrow slot that was unresolved in the coupled flow model. Model results were compared with a slot-resolved regular subgrid model where only surface flows are solved and suggested that, with a proper model parameterization, the coupled flow model is capable of reproducing flooding and draining processes similar to the slot-resolved subgrid model of surface flow. The model was applied to simulating flooding and draining processes in a meso-tidal salt marsh. The model results demonstrate that the coupled subgrid model can be used to reduce the impacts of artificial ponding that usually occur in numerical simulations of salt marshes with numerous narrow gullies and creeks.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

A multiscale recurrent neural network model for predicting energy production from geothermal reservoirs

Optimization of energy production from geothermal reservoirs requires reliable prediction of energy production performance under alternative operation and development scenarios. Traditionally, reservoir simulation models are used for the evaluation and screening of alternative production and development plans. However, simulation models require extensive data collection and modeling efforts and are time-consuming to build, run, and update. Data-driven predictive models, on the other hand, can serve as efficient prediction tools that can be used for decision support and management of daily operations and surveillance activities. Data-driven models become particularly attractive when a reservoir simulation model for a field does not exist and/or is difficult to build. Machine learning (ML)-based data-driven models that have recently become popular in several fields exploit statistical patterns and relations in training data to generate predictions. As such, they tend to perform better in interpolation problems (that is, prediction within the training data range) than when they are used to extrapolate beyond the training data. Production data from geothermal reservoirs tend to exhibit short-term variabilities as well as long-term trends, such as monotonically declining production temperatures. Capturing both short-term features and long-term trends with ML-based models is not trivial. We evaluate the use of recurrent neural networks (RNN) for the prediction of energy production from geothermal reservoirs. RNN is a class of ML architectures that are used to represent and predict sequential/dynamic data. Thus, it can be challenging to apply RNN to problems where long-term trends must be captured and extrapolation beyond the training data range is needed. We introduce the multiscale RNN architecture to extend the application of RNN to detect and predict both short-term variabilities and long-term trends in geothermal data. The developed architecture consists of a long-term component to only capture low-frequency data patterns, and a short-term component to detect features with higher frequency and more nonlinearity. The final prediction is obtained by combining the long-term and short-term predictions. Both synthetic and field data are used to evaluate the presented multiscale RNN model. The prediction performance of the multiscale RNN is compared against those obtained from the regular RNN and the autoregressive (AR) model. The results suggest that the multiscale architecture improves the long-term prediction performance of the regular RNN and enhances its robustness against noise.

15 GEOTHERMAL ENERGY↗
DOE OSTI2022

A correction procedure for self-induced velocity of a finite-sized particle in two-way coupled Euler–Lagrange simulations

The importance of incorporating a correction to undo the self-induced perturbation velocity of a particle, when its size becomes comparable to the Eulerian grid, in a two-way coupled Euler–Lagrange (EL) simulation is now well appreciated. The present work improves upon the prior correction procedures in a few important ways. First, the past correction procedures have been scalar-based with the assumption that the quasi-steady force is the source of self-induced velocity perturbation. Here we generalize to a vector correction procedure and thereby the directions of feedback force and relative velocity can be different. This allows the correction procedure to be used even in the presence of added-mass, history, and lift forces. Second, the effect of a nearby wall has been systematically included in the correction procedure. The correction procedure depends on fundamental Oseen solutions of streamwise and transverse regularized feedback forces. We present a Fourier transform-based analytical approach to obtaining these regularized Oseen solutions. We also present a step-by-step numerical procedure for obtaining the Oseen solutions in any EL code. With the analytical or numerical Oseen functions, the correction procedure can be easily implemented in any EL code. Iterations are required in solving the implicit correction equations and it is demonstrated that the correction procedure converges rapidly within three or four iterations. In conclusion, a simple empirical approach is also presented to account for unsteady effects in the correction procedure.

97 MATHEMATICS AND COMPUTING↗