Search NASASearch

SEARCH · Search NASA

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 73 records · Page 4

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

An FFT-based micromechanical model for gradient enhanced brittle fracture

Damage models incorporated within FFT-based micromechanical methods have received much attention recently because of the need to better understand and predict brittle and ductile fracture. An important aspect of a damage model is non-local regularization, which removes the mesh dependence of the predictions that otherwise become physically unacceptable upon grid refinement. In this work, the Helmholtz-type equation for non-local gradient regularization of a damage model on a distorted grid is solved using an FFT-based approach. Further, the resulting system of equations is solved using the Jacobi iterative method. The model is applied to simulate brittle fracture of an intermetallic. The influence of the time and space discretization, the length-scale parameter, and intermetallic crystallographic orientation on crack evolution is studied.

36 MATERIALS SCIENCE

PDE-constrained high-order mesh optimization

Here, we present a novel framework for PDE-constrained r-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality metric and a measure of the accuracy of the PDE solution obtained via finite element discretization. The proposed formulation achieves optimized, well-defined high-order meshes by integrating mesh quality control, PDE solution accuracy, and robust gradient regularization. We adopt the Target-Matrix Optimization Paradigm to control geometric properties across the mesh, independent of the PDE of interest. To incorporate the accuracy of the PDE solution, we introduce error measures that control the finite element discretization error. The implicit dependence of these error measures on the mesh nodal positions is accurately captured by adjoint sensitivity analysis. Additionally, a convolution-based gradient regularization strategy is used to ensure stable and effective adaptation of high-order meshes. We demonstrate that the proposed framework can improve mesh quality and reduce the error by up to 10 times for the solution of Poisson and linear elasto-static problems. The approach is general with respect to the dimensionality, the order of the mesh, the types of mesh elements, and can be applied to any PDE that admits well-defined adjoint operators.

Computer science

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

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

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

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

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

Ensemble variational Fokker-Planck methods for data assimilation

Particle flow filters solve Bayesian inference problems by smoothly transforming a set of particles into samples from the posterior distribution. Particles move in state space under the flow of an McKean-Vlasov-Itˆo process. This work introduces the Variational Fokker-Planck (VFP) framework for data assimilation, a general approach that includes previously known particle flow filters as special cases. The McKean-Vlasov-Itˆo process that transforms particles is defined via an optimal drift that depends on the selected diffusion term. It is established that the underlying probability density - sampled by the ensemble of particles - converges to the Bayesian posterior probability density. For a finite number of particles the optimal drift contains a regularization term that nudges particles toward becoming independent random variables. Based on this analysis, we derive computationally-feasible approximate regularization approaches that penalize the mutual information between pairs of particles, and avoid particle collapse. Moreover, the diffusion plays a role akin to a particle rejuvenation approach that aims to alleviate particle collapse. The VFP framework is very flexible. Different assumptions on prior and intermediate probability distributions can be used to implement the optimal drift, and localization and covariance shrinkage can be applied to alleviate the curse of dimensionality. A robust implicit-explicit method is discussed for the efficient integration of stiff McKean- Vlasov-Itˆo processes. Here, the effectiveness of the VFP framework is demonstrated on three progressively more challenging test problems, namely the Lorenz ’63, Lorenz ’96 and the quasi-geostrophic equations.

97 MATHEMATICS AND COMPUTING

Measurement of seasonal variations of the NSLS-II circumference and energy

Routine beam-based characterization of the NSLS-II storage ring indicated probable seasonal variations of the ring circumference and energy. We arranged regular direct measurements of the ring circumference during 2023 and compared the results with the archived data of the magnet and undulator settings. A clear correlation between the ring circumference and energy was observed. These seasonal variations of the ring energy are found to be the main reason for regular lattice corrections required to keep the machine performance stable for user operations. Finally, the measurement techniques and results are discussed in this article.

36 MATERIALS SCIENCE

Data-Driven Kinetic Reaction Networks for Separation Chemistry

Understanding complex, multistep chemical reactions at the molecular level is a major challenge whose solution would greatly benefit the design and optimization of numerous chemical processes. The separation of rare-earth (4f) and actinide (5f) elements is an example where improving our chemical understanding is important for designing and optimizing new chemistries, even with a limited number of observations. Here, in this work, we leverage data-driven artificial intelligence and machine-learning approaches to develop kinetic reaction networks that describe the liquid–liquid extraction mechanism of uranium using N,N-di-2-ethylhexyl-isobutyramide (DEHiBA). Specifically, we compare and contrast the properties of two classes of models: (1) purely data-driven models that are regularized using chemistry-agnostic, L1 regression and (2) chemistry-informed models that are regularized using relative reaction energies provided by quantum mechanical calculations. We observe that purely data-driven models are unbiased, simple, and accurate in their predictions of experimental measurements when provided with sufficient data but are difficult to fully constrain and interpret. In contrast, chemistry-informed models exhibit significantly improved chemical interpretability and consistency, providing a detailed description of the separation process while achieving high accuracy through ensemble averaging. Overall, the dominant species predicted to be extracted into the organic phase is UO 2 (NO 3 ) 2 (DEHiBA) 2 , agreeing with experimental slope analysis, thermodynamic modeling, EXAFS, and crystal structures. This work demonstrates that leveraging the fundamental structure of the problem can lead to efficient learning schemes that provide both accurate predictions and chemical insights at a low computational cost.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

Global climate mode resonance due to rapidly intensifying El Niño-Southern Oscillation

The El Niño-Southern Oscillation (ENSO) influences climate variability globally, encompassing various other modes of variability, and thus represents a key predictable climate signal on seasonal timescales. Yet, its response to greenhouse warming remains uncertain, with models projecting a range of outcomes. Here, we demonstrate that in response to warming, a state-of-the-art high-resolution climate model simulates a rapid transition from a moderate-amplitude irregular regime, as observed in the current climate, to a highly regular oscillation with intensifying amplitude. This behaviour can be attributed to increasing air-sea feedbacks, which approach criticality in the second half of this century, and growing atmospheric noise. As ENSO intensifies in this model, it synchronizes with other prominent climate modes, such as the North Atlantic Oscillation and the Indian Ocean Dipole, thereby imprinting its regular, predictable variability on them. If realized, this global climate mode resonance would have wide-ranging whiplash impacts on regional hydroclimates.

Atmospheric dynamics