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 253 records · Page 14

Making Carbon-Nanotube Arrays Using Block Copolymers: Part 2

Some changes have been incorporated into a proposed method of manufacturing regular arrays of precisely sized, shaped, positioned, and oriented carbon nanotubes. Such arrays could be useful as mechanical resonators for signal filters and oscillators, and as electrophoretic filters for use in biochemical assays. A prior version of the method was described in Block Copolymers as Templates for Arrays of Carbon Nanotubes, (NPO-30240), NASA Tech Briefs, Vol. 27, No. 4 (April 2003), page 56. To recapitulate from that article: As in other previously reported methods, carbon nanotubes would be formed by decomposition of carbon-containing gases over nanometer-sized catalytic metal particles that had been deposited on suitable substrates. Unlike in other previously reported methods, the catalytic metal particles would not be so randomly and densely distributed as to give rise to thick, irregular mats of nanotubes with a variety of lengths, diameters, and orientations. Instead, in order to obtain regular arrays of spaced-apart carbon nanotubes as nearly identical as possible, the catalytic metal particles would be formed in predetermined regular patterns with precise spacings. The regularity of the arrays would be ensured by the use of nanostructured templates made of block copolymers.

Bronikowski, Michael↗

An adaptive and stability-promoting layerwise training approach for sparse deep neural network architecture

This work presents a two-stage adaptive framework for progressively developing deep neural network (DNN) architectures that generalize well for a given training data set. In the first stage, a layerwise training approach is adopted where a new layer is added each time and trained independently by freezing parameters in the previous layers. We impose desirable structures on the DNN by employing manifold regularization, sparsity regularization, and physics-informed terms. We introduce a ε – δ – stability-promoting concept as a desirable property for a learning algorithm and show that employing manifold regularization yields a ε – δ stability-promoting algorithm. Further, we also derive the necessary conditions for the trainability of a newly added layer and investigate the training saturation problem. In the second stage of the algorithm (post-processing), a sequence of shallow networks is employed to extract information from the residual produced in the first stage, thereby improving the prediction accuracy. Numerical investigations on prototype regression and classification problems demonstrate that the proposed approach can outperform fully connected DNNs of the same size. Moreover, by equipping the physics-informed neural network (PINN) with the proposed adaptive architecture strategy to solve partial differential equations, we numerically show that adaptive PINNs not only are superior to standard PINNs but also produce interpretable hidden layers with provable stability. As a result, we also apply our architecture design strategy to solve inverse problems governed by elliptic partial differential equations.

42 ENGINEERING↗

The approximate second order coupled-cluster method based on a size-consistent Brillouin–Wigner partitioning

We present a variant of the approximate second order coupled-cluster method (CC2) with a two-parameter size-consistent Brillouin–Wigner (BW-s) partitioning instead of a Møller–Plesset (MP) partitioning for the unperturbed Hamiltonian, which we refer to as BWs-CC2. The computational complexity of this model scales identically to CC2 with molecular size. Conventional CC2 and its regularized BWs-CC2 variants, as well as conventional MP2 and two of its regularized BW-s2 variants, were assessed on a 535 element database spanning thermochemistry, non-covalent interactions, barrier heights, and isomerization energies. To ensure a well-defined model chemistry, the assessment was performed using internally stable spin-polarized Hartree–Fock (HF) orbitals in the finite aug-cc-pVQZ basis without counterpoise corrections. As a result of using stable orbitals, contrary to conventional wisdom, we find that CC2 substantially outperforms MP2 on molecules with significantly spin contaminated reference orbitals without a significant increase in error on systems with a spin-pure reference, showing the value of its single substitutions. While no single choice of regularization parameters can be optimal for all datasets, we find that BWs-CC2 generally outperforms both CC2 and BW-s2 with a single judicious parameter choice. Additional tests on dipole moments and bond lengths of diatomics provide further support for the utility of this choice. Furthermore, the main outliers and poorest performing cases are associated with large amounts of spin-contamination in the HF reference, which is indicative of systems with either strong correlation or extensive artificial symmetry breaking. Overall, these findings argue that the perception of the quality of the CC2 ground state should be reevaluated and that it can be further improved upon by the soundly based BWs-CC2 variant with the recommended parameter choice.

Correlation energy↗

Improved Guarantees for Optimal Nash Equilibrium Seeking and Bilevel Variational Inequalities

We consider a class of hierarchical variational inequality (VI) problems that subsumes VI-constrained optimization and several other problem classes, including the optimal solution selection problem and the optimal Nash equilibrium (NE) seeking problem. Our main contribution is threefold. (i) We consider bilevel VIs with monotone and Lipschitz continuous mappings and devise a single-timescale iteratively regularized extragradient method, named IR-EG 𝚖,𝚖 . We improve the existing iteration complexity results for addressing both bilevel VI and VI-constrained convex optimization problems. (ii) Under the strong monotonicity of the outer-level mapping, we develop a method named IR-EG 𝚜,𝚖 and derive faster guarantees than those in (i). We also study the iteration complexity of this method under a constant regularization parameter. These results appear to be new for both bilevel VIs and VI-constrained optimization. (iii) To our knowledge, complexity guarantees for computing the optimal NE in nonconvex settings do not exist. Motivated by this lacuna, we consider VI-constrained nonconvex optimization problems and devise an inexactly projected gradient method, named IPR-EG, where the projection onto the unknown set of equilibria is performed using IR-EG 𝚜,𝚖 with a prescribed termination criterion and an adaptive regularization parameter. We obtain new complexity guarantees in terms of a residual map and an infeasibility metric for computing a stationary point. Here, we validate the theoretical findings using preliminary numerical experiments for computing the best and the worst NEs.

bilevel optimization↗

Virtual element approximations of the time-fractional nonlinear convection-diffusion equation on polygonal meshes

We extend the Virtual Element Method to a two-dimensional unsteady nonlinear convection-diffusion equation characterized by a fractional-order derivative with respect to the time variable. Our methodology is based on three fundamental technical components: a fractional version of the Grunwald-Letnikov approximation, discrete maximal regularity, and the regularity theory associated with non-linearity. We prove the method's well-posedness, i.e., the approximate solution's existence and uniqueness to the time-fractional convection-diffusion equation with a Lipschitz nonlinear source term. The fully discrete scheme inherently maintains stability and consistency by leveraging the discrete maximal regularity and the energy projection operator. The convergence in the L 2 -norm and H 1 -norm to various mesh configurations is validated by numerical results, underlining the practical effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗

NuGraph2 with context-aware inputs: physics-inspired improvements in semantic segmentation

Graph neural networks have recently shown strong promise for event reconstruction tasks in Liquid Argon Time Projection Chambers, yet their performance remains limited for underrepresented classes of particles, such as Michel electrons. In this work, we investigate physics-informed strategies to improve semantic segmentation within the NuGraph2 architecture. We explore three complementary approaches: (i) enriching the input representation with context-aware features derived from detector geometry and track continuity, (ii) introducing auxiliary decoders to capture class-level correlations, and (iii) incorporating energy-based regularization terms motivated by Michel electron energy distributions. Experiments on MicroBooNE public datasets show that physics-inspired feature augmentation yields the largest gains, particularly boosting Michel electron precision and recall by disentangling overlapping latent space regions. In contrast, auxiliary decoders and energy-regularization terms provided limited improvements, partly due to the hit-level nature of NuGraph2, which lacks explicit particle- or event-level representations. Our findings highlight that embedding physics context directly into node-level inputs is more effective than imposing task-specific auxiliary losses, and suggest that future hierarchical architectures such as NuGraph3, with explicit particle- and event-level reasoning, will provide a more natural setting for advanced decoders and physics-based regularization. The code for this work is publicly available on Github at https://github.com/vitorgrizzi/nugraph_phys/tree/main_phys.

Other Experiments↗

High compressive energy absorption and shape recovery behavior of additively manufactured textile-inspired cylindrical braided metamaterials

Mechanical metamaterials (MMs) are engineered structures with unique mechanical properties that arise from their unique spatial arrangement or lattice-like structure. The most commonly designed MMs such as honeycomb and re-entrant auxetics are prone to failure at the sharp corners and weak joints due to the increased stress concentration under deformation. To mitigate this challenge, braided MM structures involving intertwining threads of nylon—forming curved unit cells—have been studied. These textile-inspired cylindrical braided metamaterials (CBMMs) with contrasting unit cells, namely diamond and regular CBMMs, were fabricated by 3D printing. The layer-by-layer deposited structure built by fused filament fabrication delivered an assembly of overlapped threads that are fused at the contact point. To understand deformation behavior of these MMs, finite element models were developed for various load scenarios including quasi-static compression, cyclic and creep loads at room temperature. Stress distribution, deformation mechanisms, and failure modes were analyzed and validated by experiments to analyze the geometries and associated performance. The diamond CBMMs showed stress softening at 30 % compressive strain, withstanding a load of ∼440 N, whereas the regular CBMMs at 50 % strain experienced ∼250 N. The diamond CBMMs delivered higher creep resistance under sustained load and better energy absorption under cyclic loading than the regular CBMMs. The latter, however, exhibited 94 % shape recovery in contrast to 88 % recovery in former prototype during their first cyclic load. In conclusion, this study helps design mechanical lightweight devices that endure significant sustained load and exhibit enhanced energy absorption and shape recovery characteristics in cyclic loading.

Creep↗

A robust spectral element implementation of the $k - τ$ RANS model in Nek5000/NekRS

The $k - ω$ Reynolds Averaged Navier Stokes (RANS) model is one of the industry standard approaches for modeling of turbulent flows. It performs better than the $k - ϵ$ model for low Reynolds number flows and is also more suitable for boundary layers with adverse pressure gradients. Major drawback of the model, however, is that the asymptotic value of $ω$ at the walls is singular, necessitating the use of a contrived “sufficiently” large value for $ω$ as the boundary condition for its transport equation. Here, this invariably leads to the solution being sensitive to near wall grid spacing. While an acceptable solution for low order (finite volume) methods, the excessive near wall gradients lead to persistent numerical stability issues in high order codes. To alleviate the problem, specifically in the context of the high order spectral element code Nek5000, a regularized $k - ω$ approach was formulated in our prior work (Tomboulides et al., 2018). The formulation, however, relies on the use of wall distance and its gradients for modeling the closure terms and can pose problems for simulations in complex geometries. This work presents a novel implementation of the $k - τ$ RANS model in Nek5000, where $τ = 1/ω$, eliminating the need for regularization, owing to the asymptotically bounded behavior of the source terms in the $τ$ transport equation, and also eliminating dependence on wall distance. Robustness and stability of the $k - τ$ model is ensured through implicit treatment of the source terms and their careful numerical implementation and demonstrated through several cases aimed at verification and validation. Studies include both canonical and engineering relevant problems, viz., turbulent channel flow, pipe flow, backward facing step, flow over NACA 0012 airfoil and flow in a T-junction. Results from the $k - τ$ model are shown to be consistent with regularized $k - ω$ model and also with the $k - ω$ SST model in OpenFOAM (for select studies). Comparison with experimental data is also shown, where available, to bolster validation efforts for the $k - τ$ model implementation through prediction of key turbulent quantities of interest.

Nek5000↗

An extension of the localized artificial diffusivity method for immiscible and high density ratio flows

The localized artificial diffusivity (LAD) method is widely regarded as the preferred multi-material regularization scheme for the compact finite difference method, because it is conservative, easy to implement, and generally robust for a wide range of multi-material problems. However, traditional LAD methods face significant challenges when applied to flows with large density ratios and when maintaining thermodynamic equilibrium across material interfaces. These limitations arise from the formulation of the artificial diffusivity flux and the reliance on enthalpy diffusion for interface regularization. Additionally, traditional LAD methods struggle to ensure stability under large density ratio conditions, fail to maintain a finite interface thickness, and are therefore unsuitable for modeling immiscible interfaces. Here, in this work, we discuss the origins of these issues in traditional LAD methods and propose modifications which enable the simulation of large density ratio and immiscible flows. The proposed method targets the artificial diffusion fluxes at gradients and ringing in the volume fraction, rather than the mass fraction in traditional methods, to consistently regularize large density ratio interfaces. Furthermore, the proposed method introduces an artificial bulk density diffusion term to enforce equilibrium conditions across interfaces. To address the challenge of modeling immiscible flows, a conservative diffuse interface term is incorporated into the formulation to ensure a finite interface thickness. Specific consideration is taken in the design of the method to ensure that these crucial properties are maintained for N -material flows. The effectiveness of the proposed method is demonstrated through a series of canonical test cases, and its accuracy is validated by comparison with experimental data on micro-bubble collapse in water. These results highlight the method’s robustness and its ability to overcome the limitations of traditional LAD approaches.

Artificial diffusivity↗

Space‐Time Causal Discovery in Earth System Science: A Local Stencil Learning Approach

Causal discovery tools enable scientists to infer meaningful relationships from observational data, spurring advances in fields as diverse as biology, economics, and climate science. Despite these successes, the application of causal discovery to space-time systems remains immensely challenging due to the high-dimensional nature of the data. For example, in climate sciences, modern observational temperature records over the past few decades regularly measure thousands of locations around the globe. To address these challenges, we introduce Causal Space-Time Stencil Learning (CaStLe), a novel meta-algorithm for discovering causal structures in complex space-time systems. CaStLe leverages regularities in local space-time dependencies to learn governing global dynamics. This local perspective eliminates spurious confounding and drastically reduces sample complexity, making space-time causal discovery practical and effective. For causal discovery, CaStLe flexibly accepts any appropriately adapted time series causal discovery algorithm to recover local causal structures. These advances enable causal discovery of geophysical phenomena that were previously unapproachable, including non-periodic, transient phenomena such as volcanic eruption plumes. Regularities in local space-time dependencies are transformed into informative spatial replicates, which actually improve CaStLe's performance when applied to ever-larger spatial grids. We successfully apply CaStLe to discover the atmospheric dynamics governing the climate response to the 1991 Mount Pinatubo volcanic eruption. We provide validation experiments to demonstrate the effectiveness of CaStLe over existing causal-discovery frameworks on a range of geophysics-inspired benchmarks while identifying the method's limitations and domains where its assumptions may not hold.

Nichol, J. Jake [Univ. of New Mexico, Albuquerque,↗

Bond-centric modular design of protein assemblies

Directional interactions that generate regular coordination geometries are a powerful means of guiding molecular and colloidal self-assembly, but implementing such high-level interactions with proteins remains challenging due to their complex shapes and intricate interface properties. Here we describe a modular approach to protein nanomaterial design inspired by the rich chemical diversity that can be generated from the small number of atomic valencies. We design protein building blocks using deep learning-based generative tools, incorporating regular coordination geometries and tailorable bonding interactions that enable the assembly of diverse closed and open architectures guided by simple geometric principles. Experimental characterization confirms the successful formation of more than 20 multicomponent polyhedral protein cages, two-dimensional arrays and three-dimensional protein lattices, with a high (10%–50%) success rate and electron microscopy data closely matching the corresponding design models. Due to modularity, individual building blocks can assemble with different partners to generate distinct regular assemblies, resulting in an economy of parts and enabling the construction of reconfigurable networks for designer nanomaterials.

Biomaterials – proteins↗

On finite-dimensional smoothed-particle Hamiltonian reductions of the Vlasov equation

The inclusion of spatial smoothing in finite-dimensional particle-based Hamiltonian reductions of the Vlasov equation and related models is considered. Here, this work investigates the underlying Hamiltonian structure of such smoothed particle-based methods for Hamiltonian systems and the small-scale regularization such methods implicitly make in approximating the continuum theory. In the context of the Vlasov–Poisson equation and other mean-field Lie–Poisson systems, of which Vlasov–Poisson is a special case, smoothing amounts to a convolutive regularization of the Hamiltonian. This regularization may be interpreted as a change of the inner product structure used to identify the dual space in the Lie–Poisson Hamiltonian formulation. In particular, the shape function used for spatial smoothing may be identified as the kernel function of a reproducing kernel Hilbert space whose inner product is used to define the Lie–Poisson Hamiltonian structure. It is likewise possible to introduce smoothing in the Vlasov–Maxwell system, but in this case the Poisson bracket must be modified rather than the Hamiltonian. The smoothing applied to the Vlasov–Maxwell system is incorporated by inserting smoothing in the map from canonical to kinematic coordinates. In the filtered system, the Lorentz force law and the current, the two terms coupling the Vlasov equation with Maxwell’s equations, are spatially smoothed.

Hamiltonian mechanics↗

A Variational Autoencoder Model Toward Molecular Structure Representation Learning of Fuels

Here, in this work, a Variational Autoencoder (VAE)-based data-driven modeling framework is developed with the overarching goal of enabling fuel design. The VAE model is trained on a large dataset with several chemical species to learn a compressed latent space molecular representation. Chemical structure in the form of Simplified Molecular Input Line Entry System (SMILES) string is fed as input, encoded into the VAE latent space, and decoded back to the SMILES string using Long Short-Term Memory (LSTM) networks. Complexities of the VAE training loss function are thoroughly examined by varying the weightage (beta (𝜷) parameter) of the latent space regularization term, thereby assessing the balance between reconstruction accuracy and validity, and focusing on both accurate molecular structure reconstruction and latent space consistency. Two different strategies for 𝜷 variation are evaluated: linear annealing and cyclic annealing. In addition, the impact of total correlation adjustment and hierarchical priors is also studied with regard to the balance between reconstruction fidelity and latent space regularization, and potential issues such as posterior collapse, over-regularization, and poor disentanglement of latent variables. Overall, the best performance of the model is achieved with hierarchical priors and incrementally increasing 𝜷 from 0 to a threshold value of 0.25 over 75 epochs. The generative VAE model can be readily coupled with Quantitative Structure–Property Relationship (QSPR) analysis to develop an integrated end-to-end framework for fuel-property prediction and molecular design of novel promising fuels.

fuel design↗

Bias Correcting NOAA's High-Resolution Rapid Refresh (HRRR) Wind Resource Data for Grid Integration Applications [Slides]

Many weather years of high-quality wind data are widely accepted in the grid integration community to be important for studying wind energy technical potential, energy system operations, and grid resilience. NREL makes high-quality wind and solar resource data available. NREL's Grid-Atmosphere workshop (March 2024) identified NREL National Solar Radiation Database as widely used in grid integration modeling, but there is less agreement on commonly used wind datasets. One important factor identified by ESIG's 2023 report 'Weather Dataset Needs for Planning and Analyzing Modern Power Systems' for gold standard wind data is regular updates. To address the need for regular updates, NREL's team can now process all currently available and regularly updated High-Resolution Rapid Refresh (HRRR) outputs. HRRR is an hourly-updated operational forecast product produced by the National Oceanic and Atmospheric Administration (NOAA) (Dowell et al., 2022). One barrier to NREL using HRRR is systematic bias and consistency with NREL's existing wind datasets (e.g. WIND Toolkit, 'WTK') across weather years. To address this barrier, we show that the HRRR can be interpolated and bias-corrected to be consistent with NRE's existing datasets. We call the new dataset BC-HRRR (bias-corrected HRRR). As with historical datasets like the WTK, BC-HRRR is intended for use in grid integration modeling (e.g., capacity expansion, production cost, and resource adequacy modeling). BC-HRRR's (2015-present) consistency with WTK (2007-2013) allows NREL to extend internal grid integration tooling with 15+ weather years of wind data with low-overhead extensibility to future years as they are made available by NOAA. The rest of this slide deck documents the BC-HRRR processing methods, validation, and its implications for intended use.

17 WIND ENERGY↗

Applications of the Kustaanheimo-Stieffel transformation of the perturbed two-body problem

The Newtonian differential equations of motion for the two-body problem can be transformed into four linear harmonic-oscillator equations by simultaneously applying the regularization step dt/ds = r and the Kustaanheimo-Stieffel (KS) transformation. The regularization step changes the independent variable from time to a new variable s, and the KS transformation transforms the position and velocity vectors from Cartesian space into a four-dimensional space. A derivation of a uniform, regular solution for the perturbed two-body problem in the four-dimensional space is presented. The variation-of-parameters technique is used to develop expressions for the derivatives of ten elements (which are constants in the unperturbed motion) for the general case that includes both perturbations which can arise from a potential and perturbations which cannot be derived from a potential. This ten-element solution has mixed secular terms that degrade the long-term accuracy during numerical integration. Therefore, to eliminate these terms, the solution is modified by introducing two additional elements.

Bond, V. R.↗

Processing eutectics in space

The examination of the Ni-Mo-Al system is discussed. Experiments were performed to examine the role of thermal gradient magnitude at the solidifying interface on the geometrical regularity of the microstructure. The difficulty in measuring the thermal gradient in the melt using superheat temperatures as high as 1800 C resulted in the examination of three liquid temperature gradient ranges. Examination of the microstructure from directionally solidified ingots using transverse sections indicated that the highest gradient runs produced microstructure of no greater regularity than runs made at lower gradients. For the Ni-Al-Mo monovariant eutectic system, the magnitude of the thermal gradient at the solidifying interface is not a controlling parameter with respect to the geometrical regularity of the microstructure, provided it is sufficient to satisfy the gradient/rate ratio needed to produce a planar interface growth.

Douglas, F. C.↗

Markov information sources

A regular Markov source is defined as the output of a deterministic, but noisy, channel driven by the state sequence of a regular finite-state Markov chain. The rate of such a source is the per letter uncertainty of its digits. The well-known result that the rate of a unifilar regular Markov source is easily calculable is demonstrated, where unifilarity means that the present state of the Markov chain and the next output of the deterministic channel uniquely determine the next state. At present, there is no known method to calculate the rate of a nonunifilar source. Two tentative approaches to this unsolved problem are given, namely source identical twins and the master-slave source, which appear to shed some light on the question of rate calculation for a nonunifilar source.

Massey, J. L.↗