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 37 records · Page 2

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↗

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↗

Fixed-angle conjectures for the quantum approximate optimization algorithm on regular MaxCut graphs

The quantum approximate optimization algorithm (QAOA) is a near-term combinatorial optimization algorithm suitable for noisy quantum devices. However, little is known about performance guarantees for p > 2. A recent work computing MaxCut performance guarantees for 3-regular graphs conjectures that any d-regular graph evaluated at particular fixed angles has an approximation ratio greater than some worst-case guarantee. In this work, we provide numerical evidence for this fixed angle conjecture for p < 12. We compute and provide these angles via numerical optimization and tensor networks. These fixed angles serve for an optimization-free version of QAOA and have universally good performance on any 3-regular graph. Heuristic evidence is presented for the fixed angle conjecture on graph ensembles, which suggests that these fixed angles are "close" to global optimum. Under the fixed angle conjecture, QAOA has a larger performance guarantee than the Goemans Williamson algorithm on 3-regular graphs for p >= 11.

Wurtz, Jonathan↗

An ℓ 0 ℓ 2 -norm regularized regression model for construction of robust cluster expansions in multicomponent systems

In this work we introduce ℓ 0 ℓ 2 -norm regularization and hierarchy constraints into linear regression for the construction of cluster expansions to describe configurational disorder in materials. The approach is implemented through mixed integer quadratic programming (MIQP). The ℓ 2 -norm regularization is used to suppress intrinsic data noise, while the ℓ 0 -norm is used to penalize the number of nonzero elements in the solution. The hierarchy relation between clusters imposes relevant physics and is naturally included by the MIQP paradigm. As such, sparseness and cluster hierarchy can be well optimized to obtain a robust, converged set of effective cluster interactions with improved physical meaning. We demonstrate the effectiveness of ℓ 0 ℓ 2 -norm regularization in two high-component disordered rocksalt cathode material systems, where we compare the cross-validation, convergence speed, and the reproduction of phase diagrams, voltage profiles, and Li-occupancy energies with those of the conventional ℓ 1 -norm regularized cluster expansion models.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Effects of Jacobian Matrix Regularization on the Detectability of Adversarial Samples

The well-known vulnerability of Deep Neural Networks to adversarial samples has led to a rapid cycle of increasingly sophisticated attack algorithms and proposed defenses. While most contemporary defenses have been shown to be vulnerable to carefully configured attacks, methods based on gradient regularization and out-of-distribution detection have attracted much interest recently by demonstrating higher resilience to a broad range of attack algorithms. However, no study has yet investigated the effect of combining these techniques. In this paper, we consider the effect of Jacobian matrix regularization on the detectability of adversarial samples on the CIFAR-10 image benchmark dataset. We find that regularization has a significant effect on detectability, and in some cases can make an undetectable attack on a baseline model detectable. In addition, we give evidence that regularization may mitigate the known weaknesses of detectors to high-confidence adversarial samples. The defenses we consider here are highly generalizable, and we believe they will be useful for further investigations to transfer machine learning robustness to other data domains.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

LANL Regular Employee Population and Demographics, FY15-21

This document summarizes an effort to compile and analyze the LANL regular employee population’s demographic attributes and trends between FY15-FY21 using MicroStrategy, a web-based data analytics and visualization tool. LANL’s HR Division collected and prepared data for the Weapons Program’s annual reporting activities for the 2017 through 2023 NNSA Stockpile Stewardship and Management Plan (SSMP). Los Alamos workforce data represent the fiscal year-end snapshot of the permanent employee population who are categorized by the Common Occupational Classification System (COCS). This work enables further analyses, including trends for all workforce attributes presented in the SSMPs as well as a definition of a crosswalk between COCS categorization and the internal laboratory job classification hierarchy. Data for other sites and the federal workforce, as shown in the SSMPs, are included and corresponding figures can be visualized within the MicroStrategy tool. A portable, Excel-based version of the tool was developed and shared with the multi-site workforce working group. This summary highlights selected aspects of the LANL regular workforce. The data analyses and visualizations communicate insights within three major themes regarding permanent LANL employees: 1) demographic transformation, 2) attrition, and 3) skills. Regarding demographic transformation, and consistent with the general trend across the enterprise, early career regular employees are the fastest growing group, with growth ranging between 12-34% year-to-year over the seven-year period analyzed. The data also reflect effects of internal and external factors on attrition; the large spike in separations in FY18 aligns with the contract transition from LANS to Triad and the dip in attrition between FY20-FY21 is likely a result of the global pandemic. The population of regular employees in general management, engineer, and operator COCS categories have the fastest growth rates amongst all the occupational categories. The MicroStrategy and Excel tools provide additional details and trends.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Topological Regularization via Persistence-Sensitive Optimization

Optimization, a key tool in machine learning and statistics, relies on regularization to reduce overfitting. Traditional regularization methods control a norm of the solution to ensure its smoothness. Recently, topological methods have emerged as a way to provide a more precise and expressive control over the solution, relying on persistent homology to quantify and reduce its roughness. All such existing techniques back-propagate gradients through the persistence diagram, which is a summary of the topological features of a function. Their downside is that they provide information only at the critical points of the function. We propose a method that instead builds on persistence-sensitive simplification and translates the required changes to the persistence diagram into changes on large subsets of the domain, including both critical and regular points. This approach enables a faster and more precise topological regularization, the benefits of which we illustrate with experimental evidence.

Nigmetov, Arnur↗

Topological terms with qubit regularization and relativistic quantum circuits

Qubit regularization provides a rich framework to explore quantum field theories. The freedom to choose how the important symmetries of the theory are embedded in the qubit regularization scheme allows us to construct new lattice models with rich phase diagrams. Some of the phases can contain topological terms which lead to critical phases. In this work we introduce and study the SU(3)-F qubit regularization scheme to embed the SO(3) spin-symmetry. We argue that qubit models in this regularization scheme contain several phases including a critical phase which describes the k = 1 Wess-Zumino-Witten (WZW) conformal field theory (CFT) at long distances, and two massive phases one of which is trvially gapped and the other which breaks the lattice translation symmetry. We construct a simple space-time Euclidean lattice model with a single coupling U and study it using the Monte Carlo method. We show the model has a critical phase at small U and a trivially massive phase at large U with a first order transition separating the two. Another feature of our model is that it is symmetric under space-time rotations, which means the temporal and spatial lattice spacing are connected to each other. The unitary time evolution operator obtained by a Wick rotation of the transfer matrix of our model can help us compute the physics of the k = 1 WZW CFT in real time without the need for tuning the temporal lattice spacing to zero. We use this idea to introduce the concept of a relativistic quantum circuit on a discrete space-time lattice.

Bhattacharya, Tanmoy↗

Customizable adaptive regularization techniques for B-spline modeling

B-spline models are a powerful way to represent scientific data sets with a functional approximation. However, these models can suffer from spurious oscillations when the data to be approximated are not uniformly distributed. Model regularization (i.e., smoothing) has traditionally been used to minimize these oscillations; unfortunately, it is sometimes impossible to sufficiently remove unwanted artifacts without smoothing away key features of the data set. In this article, we present a method of model regularization that preserves significant features of a data set while minimizing artificial oscillations. Our method varies the strength of a smoothing parameter throughout the domain automatically, removing artifacts in poorly-constrained regions while leaving other regions unchanged. Further, the proposed method selectively incorporates regularization terms based on first and second derivatives to maintain model accuracy while minimizing numerical artifacts. The behavior of our method is validated on a collection of two- and three-dimensional data sets produced by scientific simulations. In addition, a key tuning parameter is highlighted and the effects of this parameter are presented in detail. This paper is an extension of our previous conference paper at the 2022 International Conference on Computational Science (ICCS) (Lenz et al., 2022).

97 MATHEMATICS AND COMPUTING↗

Emergence of complex-regular eutectic patterns in Al–Ge: Observations from correlative nano-imaging

Eutectic solidification exemplifies nonequilibrium pattern formation, making it a well-studied moving boundary problem. Yet the mechanisms behind the formation of complex-regular microstructures – particularly in highly anisotropic systems with a significant volume fraction of a faceted phase – remain poorly understood. Our understanding of such systems is made complicated by the nonlinear interface kinetics and unique growth dynamics characteristic of faceted phases. To address these challenges, we investigate a model Al–Ge eutectic system, where the faceted Ge phase constitutes a substantial volume fraction (~0.35) and where the two solid phases arrange into so-called “fishbone” or “feather” complex-regular patterns. Using synchrotron-based x-ray nano-imaging and nanotomography with high spatial resolution (22 nm per pixel), we capture in real-time the evolution of the solid–liquid interfaces and the resulting three-dimensional microstructures in this faceted/non-faceted eutectic system. By integrating these observations with electron backscattered diffraction, we elucidate the crystallographic biases on the solidification process and the mechanisms driving the formation of such complex-regular microstructures. These findings inform a new growth model for irregular eutectics in (near-)symmetrical phase diagrams, offering insight on advanced microstructural design and processing strategies. More broadly, we demonstrate how interfacial curvature is generated in irregular eutectic alloys and how it depends on the volume fraction of the faceted phase.

36 MATERIALS SCIENCE↗

Attaining regularization length insensitivity in phase-field models of ductile failure

In this work, a cohesive phase-field model of ductile fracture in a finite-deformation setting is presented. The model is based on a free-energy function in which both elastic and plastic work contributions are coupled to damage. Using a strictly variational framework, the field evolution equations, damage kinetics, and flow rule are jointly derived from a scalar least-action principle. Particular emphasis is placed on the use of a rational function for the stress degradation that maintains a fixed effective strength with decreasing regularization length. The model is employed to examine crack growth in pure mode-I problems through the generation of crack growth resistance (J-R) curves. In contrast to alternative models, the current formulation gives rise to J-R curves that are insensitive to the regularization length. Numerical evidence suggests convergence of local fields with respect to diminishing regularization length as well.

42 ENGINEERING↗

Assessing the effect of regularization on the molecular properties predicted by SCAN and self-interaction corrected SCAN meta-GGA

Recent regularization of the SCAN meta-GGA functional (rSCAN) has simplified the numerical complexities of the SCAN functional, alleviating SCAN's stringent demand on the numerical integration grids to some extent. The regularization of rSCAN, however, results in the breaking of some constraints such as the uniform electron gas limit, the slowly varying density limit, and coordinate scaling of the iso-orbital indicator. Here, we assess the effects of regularization on the electronic, structural, vibrational, and magnetic properties of molecules by comparing the SCAN and rSCAN predictions. The properties studied include atomic energies, atomization energies, ionization potentials, electron affinities, barrier heights, infrared intensities, dissociation and reaction energies, spin moments of molecular magnets, and isomer ordering of water clusters. Our results show that rSCAN requires less dense numerical grids and gives very similar results to those of SCAN for all properties examined with the exception of atomization energies, which are worsened in rSCAN. We also examine the performance of self-interaction-corrected (SIC) rSCAN with respect to SIC-SCAN using the Perdew–Zunger (PZ) SIC method. The PZSIC method uses orbital densities to compute one-electron self-interaction errors and places an even more stringent demand on numerical grids. Our results show that SIC-rSCAN gives marginally better performance than SIC-SCAN for almost all properties studied in this work with numerical grids that are on average half or less as dense as that needed for SIC-SCAN.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Construction of meta-GGA functionals through restoration of exact constraint adherence to regularized SCAN functionals

The strongly constrained and appropriately normed (SCAN) meta-GGA exchange–correlation functional is constructed as a chemical environment-determined interpolation between two separate energy densities: one describes single-orbital electron densities accurately and another describes slowly varying densities accurately. To conserve constraints known for the exact exchange–correlation functional, the derivatives of this interpolation vanish in the slowly varying limit. While theoretically convenient, this choice introduces numerical challenges that degrade the functional’s efficiency. We have recently reported a modification to the SCAN meta-GGA, termed restored-regularized-SCAN (r 2 SCAN) , that introduces two regularizations into SCAN, which improve its numerical performance at the expense of not recovering the fourth order term of the slowly varying density gradient expansion for exchange. Here, we show the derivation of a progression of density functional approximations [regularized SCAN (rSCAN), r++SCAN, r 2 SCAN, and r 4 SCAN] with increasing adherence to exact conditions while maintaining a smooth interpolation. The greater smoothness of r 2 SCAN seems to lead to better general accuracy than the additional exact constraint of SCAN or r 4 SCAN does.

, correlation energy↗

Regularization scheme dependence of the counterterms in the galaxy bias expansion

In this paper we explore how different regularization prescriptions affect the counterterms in the renormalization of the galaxy bias expansion. We work in the context of primordial local non-Gaussianity including non-linear gravitational evolution. We carry out the one-loop renormalization of the field $δ$$^{ρ}_{2}$ (i.e. the square of the matter overdensity field) up to third order in gravitational evolution. Three regularization schemes are considered and their impact on the values of the counterterms is studied. We explicitly verify that the coefficients of the non-boost invariant operators are regularization scheme independent.

79 ASTRONOMY AND ASTROPHYSICS↗

Light nuclei with semilocal momentum-space regularized chiral interactions up to third order

In this work, we present a systematic investigation of few-nucleon systems and light nuclei using the current Low Energy Nuclear Physics International Collaboration interactions comprising semilocal momentum-space regularized two- and three-nucleon forces up to third chiral order (N 2 LO). Following our earlier study utilizing the coordinate-space regularized interactions, the two low-energy constants entering the three-body force are determined from the triton binding energy and the differential cross-section minimum in elastic nucleon-deuteron scattering. Predictions are made for selected observables in elastic nucleon-deuteron scattering and in the deuteron breakup reactions, for properties of the A = 3 and A = 4 nuclei, and for spectra of p-shell nuclei up to A = 16. A comprehensive error analysis is performed including an estimation of correlated truncation uncertainties for nuclear spectra. The obtained predictions are generally found to agree with experimental data within errors. Similarly to the coordinate-space regularized chiral interactions at the same order, a systematic overbinding of heavier nuclei is observed, which sets in for A~10 and increases with A.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

RegularizedOptimization.jl: A Julia framework for regularized and nonsmooth optimization

RegularizedOptimization.jl is a Julia package that implements families of quadratic regularization and trust-region methods for solving the nonsmooth optimization problem $^{\textrm{minimize}}_{𝑥∈ℝ^𝑛}$ 𝑓(𝑥) + ℎ(𝑥) subject to 𝑐(𝑥) = 0, (1) where 𝑓 ∶ ℝ 𝑛 → ℝ and 𝑐 ∶ ℝ 𝑛 → ℝ 𝑚 are continuously differentiable, and ℎ ∶ ℝ 𝑛 → ℝ∪{+∞} is lower semi-continuous. The nonsmooth objective ℎ can be a regularizer, such as a sparsity inducing penalty, model simple constraints, such as 𝑥 belonging to a simple convex set, or can be a combination of both. All 𝑓, ℎ, and 𝑐 can be nonconvex. RegularizedOptimization.jl provides a modular and extensible framework for solving (1), and developing novel solvers. Currently, the following solvers are implemented: • Trust-region solvers TR and TRDH (Aravkin et al., 2022; Leconte & Orban, 2025) • Quadratic regularization solvers R2, R2DH and R2N (Aravkin et al., 2022; Diouane, Habiboullah, et al., 2024) • Levenberg-Marquardt solvers LM and LMTR (Aravkin et al., 2024) used when 𝑓 is a least-squares residual. • Augmented Lagrangian solver AL (De Marchi et al., 2023). All solvers rely on first derivatives of 𝑓 and 𝑐, and optionally on their second derivatives in the form of Hessian-vector products. If second derivatives are not available, quasi-Newton approximations can be used. In addition, the proximal mapping of the nonsmooth part ℎ, or adequate models thereof, must be evaluated. At each iteration, a step is computed by solving a subproblem of the form (1) inexactly, in which 𝑓, ℎ, and 𝑐 are replaced with appropriate models around the current iterate. The solvers R2, R2DH, and TRDH are particularly well suited to solve the subproblems, though they are general enough to solve (1). All solvers are allocation-free, so re-solves incur no additional allocations. To illustrate our claim of extensibility, a first version of the AL solver was implemented by an external contributor. Furthermore, a nonsmooth penalty approach, described in Diouane, Gollier, et al. (2024), is currently being developed, that relies on the library to efficiently solve the subproblems.

Gollier, Maxence [Polytechnique Montréal, QC (Cana↗

On the connection between least squares, regularization, and classical shadows

Classical shadows (CS) offer a resource-efficient means to estimate quantum observables, circumventing the need for exhaustive state tomography. Here, we clarify and explore the connection between CS techniques and least squares (LS) and regularized least squares (RLS) methods commonly used in machine learning and data analysis. By formal identification of LS and RLS ``shadows'' completely analogous to those in CS---namely, point estimators calculated from the empirical frequencies of single measurements---we show that both RLS and CS can be viewed as regularizers for the underdetermined regime, replacing the pseudoinverse with invertible alternatives. Through numerical simulations, we evaluate RLS and CS from three distinct angles: the tradeoff in bias and variance, mismatch between the expected and actual measurement distributions, and the interplay between the number of measurements and number of shots per measurement. Compared to CS, RLS attains lower variance at the expense of bias, is robust to distribution mismatch, and is more sensitive to the number of shots for a fixed number of state copies---differences that can be understood from the distinct approaches taken to regularization. Conceptually, our integration of LS, RLS, and CS under a unifying ``shadow'' umbrella aids in advancing the overall picture of CS techniques, while practically our results highlight the tradeoffs intrinsic to these measurement approaches, illuminating the circumstances under which either RLS or CS would be preferred, such as unverified randomness for the former or unbiased estimation for the latter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Ultrasound waveform tomography with spatial and edge regularization

Synthetic-aperture ultrasound tomography systems and methods using scanning arrays and algorithms configured to simultaneously acquire ultrasound transmission and reflection data, and process the data for improved ultrasound tomography imaging, wherein the tomography imaging comprises total-variation regularization, or a modified total variation regularization, particularly with edge-guided or spatially variant regularization.

Huang, Lianjie↗