Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Regularization”

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

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↗
DOE OSTI2017

Recovering fine details from under-resolved electron tomography data using higher order total variation ℓ 1 regularization

Over the last decade or so, reconstruction methods using ℓ 1 regularization, often categorized as compressed sensing (CS) algorithms, have significantly improved the capabilities of high fidelity imaging in electron tomography. The most popular ℓ 1 regularization approach within electron tomography has been total variation (TV) regularization. In addition to reducing unwanted noise, TV regularization encourages a piecewise constant solution with sparse boundary regions. In this paper we propose an alternative ℓ 1 regularization approach for electron tomography based on higher order total variation (HOTV). Like TV, the HOTV approach promotes solutions with sparse boundary regions. In smooth regions however, the solution is not limited to piecewise constant behavior. We demonstrate that this allows for more accurate reconstruction of a broader class of images – even those for which TV was designed for – particularly when dealing with pragmatic tomographic sampling patterns and very fine image features. In conclusion, we develop results for an electron tomography data set as well as a phantom example, and we also make comparisons with discrete tomography approaches.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Mechanism-Based Energy Regularization in Computational Modeling of Quasibrittle Fracture

Abstract Quasibrittle materials are featured by a strain-softening constitutive behavior under many loading scenarios, which could eventually lead to localization instability. It has long been known that strain localization would result in spurious mesh sensitivity in finite element (FE) simulations. Previous studies have shown that, for the case of fully localized damage, the mesh sensitivity can be mitigated through energy regularization of the material constitutive law. However, depending on the loading configuration and structural geometry, quasibrittle structures could exhibit a complex damage process, which involves both localized and diffused damage patterns at different stages of loading. This study presents a generalized energy regularization method that considers the spatial and temporal evolution of damage pattern. The method introduces a localization parameter, which describes the local damage pattern. The localization parameter governs the energy regularization of the constitutive model, which captures the transition from diffused to localized damage during the failure process. The method is cast into an isotropic damage model, and is further extended to rate-dependent behavior. The energy regularization scheme is directly incorporated into the kinetics of damage growth. The model is applied to simulate static and dynamic failures of ceramic specimens. It is shown that the present model is able to effectively mitigate the spurious mesh sensitivity in FE simulations of both types of failure. The present analysis demonstrates the essential role of mechanism-based energy regularization of constitutive relation in FE simulations of quasibrittle fracture.

Mechanics↗
DOE OSTI2016

Noise suppression for dual-energy CT via penalized weighted least-square optimization with similarity-based regularization

Purpose: Dual-energy CT (DECT) expands applications of CT imaging in its capability to decompose CT images into material images. However, decomposition via direct matrix inversion leads to large noise amplification and limits quantitative use of DECT. Their group has previously developed a noise suppression algorithm via penalized weighted least-square optimization with edge-preservation regularization (PWLS-EPR). In this paper, the authors improve method performance using the same framework of penalized weighted least-square optimization but with similarity-based regularization (PWLS-SBR), which substantially enhances the quality of decomposed images by retaining a more uniform noise power spectrum (NPS). Methods: The design of PWLS-SBR is based on the fact that averaging pixels of similar materials gives a low-noise image. For each pixel, the authors calculate the similarity to other pixels in its neighborhood by comparing CT values. Using an empirical Gaussian model, the authors assign high/low similarity value to one neighboring pixel if its CT value is close/far to the CT value of the pixel of interest. These similarity values are organized in matrix form, such that multiplication of the similarity matrix to the image vector reduces image noise. The similarity matrices are calculated on both high- and low-energy CT images and averaged. In PWLS-SBR, the authors include a regularization term to minimize the L-2 norm of the difference between the images without and with noise suppression via similarity matrix multiplication. By using all pixel information of the initial CT images rather than just those lying on or near edges, PWLS-SBR is superior to the previously developed PWLS-EPR, as supported by comparison studies on phantoms and a head-and-neck patient. Results: On the line-pair slice of the Catphan{sup ©}600 phantom, PWLS-SBR outperforms PWLS-EPR and retains spatial resolution of 8 lp/cm, comparable to the original CT images, even at 90% reduction in noise standard deviation (STD). Similar performance on spatial resolution is observed on an anthropomorphic head phantom. In addition, results of PWLS-SBR show substantially improved image quality due to preservation of image NPS. On the Catphan{sup ©}600 phantom, NPS using PWLS-SBR has a correlation of 93% with that via direct matrix inversion, while the correlation drops to −52% for PWLS-EPR. Electron density measurement studies indicate high accuracy of PWLS-SBR. On seven different materials, the measured electron densities calculated from the decomposed material images using PWLS-SBR have a root-mean-square error (RMSE) of 1.20%, while the results of PWLS-EPR have a RMSE of 2.21%. In the study on a head-and-neck patient, PWLS-SBR is shown to reduce noise STD by a factor of 3 on material images with image qualities comparable to CT images, whereas fine structures are lost in the PWLS-EPR result. Additionally, PWLS-SBR better preserves low contrast on the tissue image. Conclusions: The authors propose improvements to the regularization term of an optimization framework which performs iterative image-domain decomposition for DECT with noise suppression. The regularization term avoids calculation of image gradient and is based on pixel similarity. The proposed method not only achieves a high decomposition accuracy, but also improves over the previous algorithm on NPS as well as spatial resolution.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2019

A Regularized Entropy-Based Moment Method for Kinetic Equations

Here, we present a new entropy-based moment method for the velocity discretization of kinetic equations. This method is based on a regularization of the optimization problem defining the original entropy-based moment method, and this gives the new method the advantage that the moment vectors of the solution do not have to take on realizable values. We show that this equation still retains many of the properties of the original equations, including hyperbolicity, an entropy-dissipation law, and rotational invariance. The cost of the regularization is mismatch between the moment vector of the solution and that of the ansatz returned by the regularized optimization problem. However, we show how to control this error using the parameter defining the regularization. This suggests that with proper choice of the regularization parameter, the new method can be used to generate accurate solutions of the original entropy-based moment method, and we confirm this with numerical simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Qubit Regularization of Quantum Field Theories

To study quantum field theories on a quantum computer, we must begin with Hamiltonians defined on a finite-dimensional Hilbert space and then take appropriate limits. This approach can be seen as a new type of regularization for quantum field theories, which we refer to as qubit regularization. A related finite-dimensional regularization, known as the D-theory approach, was proposed long ago as a general framework for all quantum field theories. In this framework, the dimensionality of the local Hilbert space at each spatial point can increase as needed through an additional flavor index. To reproduce asymptotically free QFTs, most studies assume that qubit-regularized theories require extending the local Hilbert space to infinity. However, contrary to this common belief, recent discoveries in (1+1) dimensions have revealed two examples where asymptotic freedom appears to emerge within a strictly finite-dimensional local Hilbert space through a novel renormalization group (RG) flow. These findings motivate further investigation into whether asymptotically free gauge theories could also emerge within a strictly finite-dimensional local Hilbert space. To support these explorations, we propose an orthonormal basis called the monomer-dimer-tensor-network (MDTN) basis and use it to construct new types of qubit-regularized lattice gauge theories.

Chandrasekharan, Shailesh [Duke Univ., Durham, NC ↗
DOE OSTI2016

Do Lower Calorie or Lower Fat Foods Have More Sodium Than Their Regular Counterparts?

The objective of this study was to compare the sodium content of a regular food and its lower calorie/fat counterpart. Four food categories, among the top 20 contributing the most sodium to the US diet, met the criteria of having the most matches between regular foods and their lower calorie/fat counterparts. A protocol was used to search websites to create a list of “matches”, a regular and comparable lower calorie/fat food(s) under each brand. Nutrient information was recorded and analyzed for matches. In total, 283 matches were identified across four food categories: savory snacks (N = 44), cheese (N = 105), salad dressings (N = 90), and soups (N = 44). As expected, foods modified from their regular versions had significantly reduced average fat (total fat and saturated fat) and caloric profiles. Mean sodium content among modified salad dressings and cheeses was on average 8%–12% higher, while sodium content did not change with modification of savory snacks. Modified soups had significantly lower mean sodium content than their regular versions (28%–38%). Consumers trying to maintain a healthy diet should consider that sodium content may vary in foods modified to be lower in calories/fat.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

Qubit Regularization and Qubit Embedding Algebras

Qubit regularization is a procedure to regularize the infinite dimensional local Hilbert space of bosonic fields to a finite dimensional one, which is a crucial step when trying to simulate lattice quantum field theories on a quantum computer. When the qubit-regularized lattice quantum fields preserve important symmetries of the original theory, qubit regularization naturally enforces certain algebraic structures on these quantum fields. We introduce the concept of qubit embedding algebras (QEAs) to characterize this algebraic structure associated with a qubit regularization scheme. We show a systematic procedure to derive QEAs for the O(N) lattice spin models and the SU(N) lattice gauge theories. While some of the QEAs we find were discovered earlier in the context of the D-theory approach, our method shows that QEAs are far richer. A more complete understanding of the QEAs could be helpful in recovering the fixed points of the desired quantum field theories.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1986

Regularity estimates up to the boundary for elliptic systems of difference equations

Regularity estimates up to the boundary for solutions of elliptic systems of finite difference equations were proved. The regularity estimates, obtained for boundary fitted coordinate systems on domains with smooth boundary, involve discrete Sobolev norms and are proved using pseudo-difference operators to treat systems with variable coefficients. The elliptic systems of difference equations and the boundary conditions which are considered are very general in form. The regularity of a regular elliptic system of difference equations was proved equivalent to the nonexistence of eigensolutions. The regularity estimates obtained are analogous to those in the theory of elliptic systems of partial differential equations, and to the results of Gustafsson, Kreiss, and Sundstrom (1972) and others for hyperbolic difference equations.

Strikwerda, J. C.↗
NASA NTRS1995

Ca-Rich Carbonate Melts: A Regular-Solution Model, with Applications to Carbonatite Magma + Vapor Equilibria and Carbonate Lavas on Venus

A thermochemical model of the activities of species in carbonate-rich melts would be useful in quantifying chemical equilibria between carbonatite magmas and vapors and in extrapolating liquidus equilibria to unexplored PTX. A regular-solution model of Ca-rich carbonate melts is developed here, using the fact that they are ionic liquids, and can be treated (to a first approximation) as interpenetrating regular solutions of cations and of anions. Thermochemical data on systems of alkali metal cations with carbonate and other anions are drawn from the literature; data on systems with alkaline earth (and other) cations and carbonate (and other) anions are derived here from liquidus phase equilibria. The model is validated in that all available data (at 1 kbar) are consistent with single values for the melting temperature and heat of fusion for calcite, and all liquidi are consistent with the liquids acting as regular solutions. At 1 kbar, the metastable congruent melting temperature of calcite (CaCO3) is inferred to be 1596 K, with (Delta)bar-H(sub fus)(calcite) = 31.5 +/- 1 kJ/mol. Regular solution interaction parameters (W) for Ca(2+) and alkali metal cations are in the range -3 to -12 kJ/sq mol; W for Ca(2+)-Ba(2+) is approximately -11 kJ/sq mol; W for Ca(2+)-Mg(2+) is approximately -40 kJ/sq mol, and W for Ca(2+)-La(3+) is approximately +85 kJ/sq mol. Solutions of carbonate and most anions (including OH(-), F(-), and SO4(2-)) are nearly ideal, with W between 0(ideal) and -2.5 kJ/sq mol. The interaction of carbonate and phosphate ions is strongly nonideal, which is consistent with the suggestion of carbonate-phosphate liquid immiscibility. Interaction of carbonate and sulfide ions is also nonideal and suggestive of carbonate-sulfide liquid immiscibility. Solution of H2O, for all but the most H2O-rich compositions, can be modeled as a disproportionation to hydronium (H3O(+)) and hydroxyl (OH(-)) ions with W for Ca(2+)-H3O(+) (approximately) equals 33 kJ/sq mol. The regular-solution model of carbonate melts can be applied to problems of carbonatite magma + vapor equilibria and of extrapolating liquidus equilibria to unstudied systems. Calculations on one carbonatite (the Husereau dike, Oka complex, Quebec, Canada) show that the anion solution of its magma contained an OH mole fraction of (approximately) 0.07, although the vapor in equilibrium with the magma had P(H2O) = 8.5 x P(CO2). F in carbonatite systems is calculated to be strongly partitioned into the magma (as F(-)) relative to coexisting vapor. In the Husereau carbonatite magma, the anion solution contained an F(-) mole fraction of (approximately) 6 x 10(exp -5).

Treiman, Allan H.↗
NASA NTRS2005

Measuring, Enabling and Comparing Modularity, Regularity and Hierarchy in Evolutionary Design

For computer-automated design systems to scale to complex designs they must be able to produce designs that exhibit the characteristics of modularity, regularity and hierarchy - characteristics that are found both in man-made and natural designs. Here we claim that these characteristics are enabled by implementing the attributes of combination, control-flow and abstraction in the representation. To support this claim we use an evolutionary algorithm to evolve solutions to different sizes of a table design problem using five different representations, each with different combinations of modularity, regularity and hierarchy enabled and show that the best performance happens when all three of these attributes are enabled. We also define metrics for modularity, regularity and hierarchy in design encodings and demonstrate that high fitness values are achieved with high values of modularity, regularity and hierarchy and that there is a positive correlation between increases in fitness and increases in modularity. regularity and hierarchy.

Hornby, Gregory S.↗
NASA NTRS2010

Automated Assume-Guarantee Reasoning for Omega-Regular Systems and Specifications

We develop a learning-based automated Assume-Guarantee (AG) reasoning framework for verifying omega-regular properties of concurrent systems. We study the applicability of non-circular (AGNC) and circular (AG-C) AG proof rules in the context of systems with infinite behaviors. In particular, we show that AG-NC is incomplete when assumptions are restricted to strictly infinite behaviors, while AG-C remains complete. We present a general formalization, called LAG, of the learning based automated AG paradigm. We show how existing approaches for automated AG reasoning are special instances of LAG.We develop two learning algorithms for a class of systems, called infinite regular systems, that combine finite and infinite behaviors. We show that for infinity-regular systems, both AG-NC and AG-C are sound and complete. Finally, we show how to instantiate LAG to do automated AG reasoning for infinite regular, and omega-regular, systems using both AG-NC and AG-C as proof rules

Chaki, Sagar↗
DOE OSTI2017

Regularization of soft-X-ray data in a tokamak application

An image inversion scheme for soft X-ray (SXR) diagnostics at the DIII-D tokamak is developed to obtain the local soft X-ray emission at a poloidal cross-section from the spatially line-integrated image taken by either a set of SXR arrays or a tangential camera. The scheme uses the Tikhonov regularization method since the inversion problem is generally ill-posed. The regularization technique uses the generalized singular value decomposition (GSVD) to determine a solution that depends on a free regularization parameter. The latter has to be chosen carefully, and the so called L -curve method to find the optimum regularization parameter is outlined. A representative test image is used to study the properties of the inversion scheme with respect to inversion accuracy, amount/strength of regularization and image resolution. The SXR arrays thereby represent an under-determined case while the tangential camera is an over-determined case of the linear inversion problem. In conclusion, it is found that the under-determined case suffers from lack of information but can still return a coarse, but fair image, while the camera data can be well inverted with high resolution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Effects of input gradient regularization on neural networks time-series forecasting of thermal power systems

This study proposes using neural networks, specifically gated recurrent unit (GRU), long-short-term memory (LSTM), and transformer networks, to improve control strategies in a 450 MW coal-fired power plant. However, neural networks face issues of becoming overly dependent on just a few variables to make predictions, which negatively impacts control decisions that rely on the model to determine the value of all manipulated variables. The paper introduces regularization techniques, including noise injection and input gradient regularization, during the training phase. Here, the work presents novel contributions in adapting neural networks to control industrial systems and applying regularization techniques from computer vision to industrial process control. Results demonstrate the effectiveness of input gradient regularization in reducing model dependence on subsets of variables, emphasizing the balance between fidelity and controllability. Further exploration is recommended, including the development of recurrent transformers, closed-loop control testing, and a sensitivity analysis on computer models to provide further insight.

20 FOSSIL-FUELED POWER PLANTS↗
DOE OSTI2025

3D mesh regularization within an ALE code using a weighted line sweeping method

The Lagrangian formalism is widely used to simulate hydrodynamic responses in complex engineering applications, particularly those involving strong shock waves. However, as the mesh moves with the fluid, it can become highly distorted, requiring a regularization step. This involves constructing a new grid and remapping conservative quantities onto it to restore mesh quality. This work introduces a regularization method for block-structured meshes within a 3D ALE (Arbitrary Lagrangian-Eulerian) code. The proposed approach prevents mesh tangling while preserving the anisotropic features of the initial Lagrangian mesh. This regularization technique incorporates aspect ratio-based weights to control mesh smoothing. Unlike uniform rezoning techniques, this weighted approach maintains proximity to the Lagrangian mesh while improving mesh quality. Here, the method effectively handles concave geometries by mitigating the grid attraction phenomenon, which typically leads to mesh concentration along concave edges. Numerical experiments demonstrate its efficiency in regularizing severely deformed meshes, and its integration within the ALE framework is validated on challenging hydrodynamic test cases, including the triple point problem.

42 ENGINEERING↗
DOE OSTI2021

Relaxed Multibang Regularization for the Combinatorial Integral Approximation

Multibang regularization and combinatorial integral approximation decompositions are two actively researched techniques for integer optimal control. In this work, we consider a class of polyhedral functions that arise particularly as convex lower envelopes of multibang regularizers and show that they have beneficial properties with respect to regularization of relaxations of integer optimal control problems. We extend the algorithmic framework of the combinatorial integral approximation such that a subsequence of the computed discrete-valued controls converges to the infimum of the regularized integer control problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Discrete Regularization for Calibration of Geologic Facies Against Dynamic Flow Data

Abstract Subsurface flow model calibration involves many more unknowns than measurements, leading to ill‐posed problems with nonunique solutions. To alleviate nonuniqueness, the problem is regularized by constraining the solution space using prior knowledge. In certain sedimentary environments, such as fluvial systems, the contrast in hydraulic properties of different facies types tends to dominate the flow and transport behavior, making the effect of within facies heterogeneity less significant. Hence, flow model calibration in those formations reduces to delineating the spatial structure and connectivity of different lithofacies types and their boundaries. A major difficulty in calibrating such models is honoring the discrete, or piecewise constant, nature of facies distribution. The problem becomes more challenging when complex spatial connectivity patterns with higher‐order statistics are involved. This paper introduces a novel formulation for calibration of complex geologic facies by imposing appropriate constraints to recover plausible solutions that honor the spatial connectivity and discreteness of facies models. To incorporate prior connectivity patterns, plausible geologic features are learned from available training models. This is achieved by learning spatial patterns from training data, e.g., ‐SVD sparse learning or the traditional Principal Component Analysis. Discrete regularization is introduced as a penalty functions to impose solution discreteness while minimizing the mismatch between observed and predicted data. An efficient gradient‐based alternating directions algorithm is combined with variable splitting to minimize the resulting regularized nonlinear least squares objective function. Numerical results show that imposing learned facies connectivity and discreteness as regularization functions leads to geologically consistent solutions that improve facies calibration quality.

Khaninezhad, Mohammad‐Reza↗
DOE OSTI2018

Spatially dependent regularization parameter selection for total generalized variation-based image denoising

We propose a novel image denoising model based on the total generalized variation (TGV) regularization. In the model, a spatially dependent regularization parameter is utilized to adaptively fit the local image features, resulting in further exploitation of the denoising potential of the TGV regularization. The proposed model is formulated under a joint optimization framework, by which the estimations of the restored image and the regularization parameter are achieved simultaneously. Furthermore, the model is general purpose that can handle various types of noise occurring in image processing. An alternating minimization-based numerical scheme is especially developed, which leads to an efficient algorithmic solution to the nonconvex optimization problem. Numerical experiments are reported to illustrate the effectiveness of our model in terms of both peak signal-to-noise ratio and visual perception.

97 MATHEMATICS AND COMPUTING↗