Search NASA⌕ Search

SEARCH · Search NASA

Results for “mathematical 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 433 records · Page 24

Adversarial uncertainty quantification in physics-informed neural networks

Here, we introduce a deep learning framework for quantifying and propagating uncertainty in systems governed by non-linear differential equations using physics-informed neural networks. Specifically, we employ latent variable models to construct probabilistic representations for the system states, and put forth an adversarial inference procedure for training them on data, while constraining their predictions to satisfy given physical laws expressed by partial differential equations. Such physics-informed constraints provide a regularization mechanism for effectively training deep generative models as surrogates of physical systems in which the cost of data acquisition is high, and training data-sets are typically small. This provides a flexible framework for characterizing uncertainty in the outputs of physical systems due to randomness in their inputs or noise in their observations that entirely bypasses the need for repeatedly sampling expensive experiments or numerical simulators. Moreover, we demonstrate the effectiveness of our approach through a series of examples involving uncertainty propagation in non-linear conservation laws, and the discovery of constitutive laws for flow through porous media directly from noisy data.

97 MATHEMATICS AND COMPUTING↗

Evaluating the 3D PBL scheme for wind energy applications in the complex terrain of Altamont Pass, CA

In this study, the 3D PBL scheme, developed and tested during previous WETO projects, was used to simulate daily speedup flows in the Altamont Pass Wind Resource Area of California. These flows were observed as part of the WFIP2 companion experiment HilFlowS, which examined potential power output from taller turbines in the Altamont region. The regularity of the observed speedup events during the summer months, combined with the importance of terrain-induced wind acceleration, makes them a useful case study for evaluating mesoscale forecast models, which often underperform in regions of complex terrain. Compared to a traditional one-dimensional PBL scheme, the 3D PBL scheme shows evidence of improved wind speed predictions, including an ability to capture atypical wind speed profiles and reduce model overestimates of wind speed across the turbine rotor region. Such improvements will be necessary for wind farm siting and power forecasting, especially as taller turbines are deployed in complex terrain.

17 WIND ENERGY↗

Intercomparison of Thermal Regime Algorithms in 1-D Lake Models

Lakes are an important component of the global weather and climate system, but the modeling of their thermal regimes has shown large uncertainties due to the highly diverse lake properties and model configurations. Here we evaluate the algorithms of four key lake thermal processes including turbulent heat fluxes, wind-driven mixing, light extinction, and snow density, using a highly diverse lake dataset provided by the Inter-sectoral Impact Model Intercomparison Project (ISIMIP) 2a lake sector. Algorithm codes are configured and run separately within the same parent model to rule out any interference from factors apart from the algorithms examined. Evaluations are based on both simulation accuracy and recalibration complexity for application to global lakes. For turbulent heat fluxes, the non-Monin-Obukhov similarity (MOS) based, more simplified algorithms perform better in predicting lake epilimnion temperatures and achieve high convergence in the values of the calibrated parameters. For wind-driven mixing, a two-algorithm strategy considering lake shape and season is suggested with the regular mixing algorithm used for spring and earlier summer and the mixing-enhanced algorithm for summer steady stratification and fall overturn periods. There are no evident differences in the simulated thermocline depths using different light extinction algorithms or the observation. Finally, for lake ice phenology, a constant snow density at around 110 kg m-3 is found to be sufficient for most northern lakes while the Arctic lakes require a higher value. Our study provides highly practical guides for improving 1-D lake models and feasible parameterization strategies to better simulate global lake thermal regimes.

58 GEOSCIENCES↗

ZEEMAN DOPPLER MAPS: ALWAYS UNIQUE, NEVER SPURIOUS?

Numerical models of atomic diffusion in magnetic atmospheres of ApBp stars predict abundance structures that differ from the empirical maps derived with (Zeeman) Doppler mapping (ZDM). An in-depth analysis of this apparent disagreement investigates the detectability by means of ZDM of a variety of abundance structures, including (warped) rings predicted by theory, but also complex spot-like structures. Even when spectra of high signal-to-noise ratio are available, it can prove difficult or altogether impossible to correctly recover shapes, positions, and abundances of a mere handful of spots, notwithstanding the use of all four Stokes parameters and an exactly known field geometry; the recovery of (warped) rings can be equally challenging. Inversions of complex abundance maps that are based on just one or two spectral lines usually permit multiple solutions. It turns out that it can by no means be guaranteed that any of the regularization functions in general use for ZDM (maximum entropy or Tikhonov) will lead to a true abundance map instead of some spurious one. Attention is drawn to the need for a study that would elucidate the relation between the stratified, field-dependent abundance structures predicted by diffusion theory on the one hand, and empirical maps obtained by means of “canonical” ZDM, i.e., with mean atmospheres and unstratified abundances, on the other hand. Finally, we point out difficulties arising from the three-dimensional nature of the atomic diffusion process in magnetic ApBp star atmospheres.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

On the analytical properties of the magneto-conductivity in the case of presence of stable open electron trajectories on a complex Fermi surface

We consider the electric conductivity in normal metals in presence of a strong magnetic field. It is assumed here that the Fermi surface of a metal has rather complicated form such that different types of quasiclassical electron trajectories can appear on the Fermi level for different directions of B. The effects we consider are connected with the existence of regular (stable) open electron trajectories which arise in general on complicated Fermi surfaces. The trajectories of this type have a nice geometric description and represent quasiperiodic lines with a fixed mean direction in the p-space. Being stable geometric objects, the trajectories of this kind exist for some open regions in the space of directions of B, which can be represented by “Stability Zones” on the unit sphere S{sup 2}. The main goal of the paper is to give a description of the analytical behavior of conductivity in the Stability Zones, which demonstrates in general rather nontrivial properties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A high-order, localized-artificial-diffusivity method for Eulerian simulation of multi-material elastic-plastic deformation with strain hardening

A high-order method for Eulerian simulation of material undergoing large elastic–plastic deformation is developed. Thermodynamically consistent hyperelastic constitutive relations are assumed, facilitating the treatment of solids, liquids, and gases in a unified manner. Here, the method enables the simulation of multi-material interactions using a diffuse interface approach. Numerical capturing of material interfaces, shock waves, contact surfaces, and elastic-plastic strain discontinuities using high-order compact-difference schemes is assisted by Localized Artificial Diffusivity (LAD). In the new setting involving elastic–plastic deformation, the previously established terms for the artificial properties are verified to effectively regularize normal shocks. Additional LAD terms are introduced to the elastic and plastic kinematic equations to regularize shear shocks and other strain discontinuities, improving solution stability. Other important features of the method that improve robustness include the numerical treatment of compatibility terms in the kinematic equations, and the treatment of rotation. Particular emphasis is focused toward new advancements of the methods for plastic-deformation integration and the associated strain hardening of the material, including rate-dependent plasticity. The method is demonstrated on a variety of test problems, including 1-D impacts, a variant of the Shu-Osher problem, a Taylor impact, and a Richtmyer-Meshkov instability between two elastic–plastic solids with strain hardening.

42 ENGINEERING↗

A{sub 1}-Regularity and Boundedness of Riesz Transforms in Banach Lattices of Measurable Functions

Let X be a Banach lattice of measurable functions on ℝ{sup n} × Ω having the Fatou property. We show that the boundedness of all Riesz transforms R{sub j} in X is equivalent to the boundedness of the Hardy–Littlewood maximal operator M in both X and X′, and thus to the boundedness of all Calderón–Zygmund operators in X. We also prove a result for the case of operators between lattices: If Y ⊃ X is a Banach lattice with the Fatou property such that the maximal operator is bounded in Y ′, then the boundedness of all Riesz transforms from X to Y is equivalent to the boundedness of the maximal operator from X to Y , and thus to the boundedness of all Calderón–Zygmund operators from X to Y .

97 MATHEMATICS AND COMPUTING↗

A Trajectory-Driven Algorithm for Differentiating SRB Measures on Unstable Manifolds

Sinai-Ruelle-Bowen (SRB) measures are limiting stationary distributions describing the statistical behavior of chaotic dynamical systems. Directional derivatives of SRB measure densities conditioned on unstable manifolds are critical in the sensitivity analysis of hyperbolic chaos. These derivatives, known as the SRB density gradients, are by-products of the regularization of Lebesgue integrals appearing in the original linear response expression. In this paper, we propose a novel trajectory- driven algorithm for computing the SRB density gradient defined for systems with high-dimensional unstable manifolds. We apply the concept of measure preservation together with the chain rule on smooth manifolds. Due to the recursive one-step nature of our derivations, the proposed procedure is memory-efficient and can be naturally integrated with existing Monte Carlo schemes widely used in computational chaotic dynamics. Here, we numerically show the exponential convergence of our scheme, analyze the computational cost, and present its use in the context of Monte Carlo integration.

97 MATHEMATICS AND COMPUTING↗

Multiscale Neural Networks for Approximating Green’s Functions

Neural networks (NNs) have been widely used to solve partial differential equations (PDEs) in the applications of physics, biology, and engineering. One effective approach for solving PDEs with a fixed differential operator is learning Green’s functions. However, Green’s functions are notoriously difficult to learn due to their poor regularity, which typically requires larger NNs and longer training times. In this work, we address these challenges by leveraging multiscale NNs to learn Green’s functions. Through theoretical analysis using multiscale Barron space methods and experimental validation, we show that the multiscale approach significantly reduces the necessary NN size and accelerates training.

97 MATHEMATICS AND COMPUTING↗

Moment representation in the lattice Boltzmann method on massively parallel hardware

The widely-used lattice Boltzmann method (LBM) for computational fluid dynamics is highly scalable, but also significantly memory bandwidth-bound on current architectures. This paper presents a new regularized LBM implementation that reduces the memory footprint by only storing macroscopic, moment-based data. We show that the amount of data that must be stored in memory during a simulation is reduced by up to 47%. We also present a technique for cache-aware data re-utilization and show that optimizing cache utilization to limit data motion results in a similar improvement in time to solution. These new algorithms are implemented in the hemodynamics solver HARVEY and demonstrated using both idealized and realistic biological geometries. We develop a performance model for the moment representation algorithm and evaluate the performance on Summit.

Vardhan, Madhurima↗

Unconditionally stable, second-order schemes for gradient-regularized, non-convex, finite-strain elasticity modeling martensitic phase transformations

In the setting of continuum elasticity martensitic phase transformations are characterized by a non-convex free energy density function that possesses multiple wells in strain space and includes higher-order gradient terms for regularization. Metastable martensitic microstructures, defined as solutions that are local minimizers of the total free energy, are of interest and are obtained as steady state solutions to the resulting transient formulation of Toupin’s gradient elasticity at finite strain. This type of problem poses several numerical challenges including stiffness, the need for fine discretization to resolve microstructures, and following solution branches. Accurate time-integration schemes are essential to obtain meaningful solutions at reasonable computational cost. Here in this work we introduce two classes of unconditionally stable second-order time-integration schemes for gradient elasticity, each having relative advantages over the other. Numerical examples are shown highlighting these features.

42 ENGINEERING↗

A high order characteristic discontinuous Galerkin scheme for advection on unstructured meshes

A new characteristic discontinuous Galerkin (CDG) advection scheme is presented. In contrast to standard discontinuous Galerkin schemes, the test functions themselves follow characteristics in order to ensure conservation and the edges of each element are also traced backwards along characteristics in order to create a swept region , which is integrated in order to determine the mass flux across the edge. Both the accuracy and performance of the scheme are greatly improved by the use of large Courant–Friedrichs–Lewy numbers for a shear flow test case and the scheme is shown to scale sublinearly with the number of tracers being advected, outperforming a standard flux corrected transport scheme for 10 or more tracers with a linear basis. Moreover the CDG scheme may be run to arbitrarily high order spatial accuracy and on unstructured grids, and is shown to give the correct order of error convergence for piecewise linear and quadratic bases on regular quadrilateral and hexahedral planar grids. Using a modal Taylor series basis, the scheme may be made monotone while preserving conservation with the use of a standard slope limiter, although this reduces the formal accuracy of the scheme to first order. The second order scheme is roughly as accurate as the incremental remap scheme with nonlocal gradient reconstruction at half the horizontal resolution. Furthermore, the scheme is being developed for implementation within the Model for Prediction Across Scales (MPAS) Ocean model, an unstructured grid finite volume ocean model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On Nonuniqueness of Solutions of Hamilton–Jacobi–Bellman Equations

An example of a nonunique solution of the Cauchy problem of Hamilton–Jacobi–Bellman (HJB) equation with surprisingly regular Hamiltonian is presented. The Hamiltonian H(t, x, p) is locally Lipschitz continuous with respect to all variables, convex in p and with linear growth with respect to p and x. The HJB equation possesses two distinct lower semicontinuous solutions with the same final conditions; moreover, one of them is the value function of the corresponding Bolza problem. The definition of lower semicontinuous solution was proposed by Frankowska (SIAM J. Control Optim. 31:257–272, 1993) and Barron and Jensen (Commun. Partial Differ. Equ. 15(12):1713–1742, 1990). Using the example an analysis and comparison of assumptions in some uniqueness results in HJB equations is provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A new accelerated algorithm for ill-conditioned ridge regression problems

In this work, we study the primal and dual formulations of the regularized least squares problem, in special norm L{sub 2}, named ridge regression. We state the Gradient method for the corresponding primal-dual problem through a fixed point approach. For this formulation, we present an original convergence analysis involving the spectral radius of a suitable iteration matrix. The main contribution of this work is to accelerate the studied method by means of a memory-like strategy. Some connections with the spectral properties of the associated iteration matrices were established to prove the convergence of the accelerated method. Preliminary experiments showed the good performance of the proposed algorithm when applied to solve ill-conditioned problems, providing better results than the conjugate gradient method for this class of problems.

97 MATHEMATICS AND COMPUTING↗

A Decomposition-Based Learn-To-Optimize Approach with Feasibility Layer Assistance for Sub-Hourly Unit Commitment

Sub-hourly unit commitment (UC) with 15-min intervals is gaining significant attention as a way to respond rapidly to the fluctuations in electricity supply and demand introduced by renewable resources. However, the increased temporal resolution and complex inter-temporal dependencies pose substantial computational challenges for traditional optimization methods. To this end, this paper explores a decomposition-based learn-to-optimize approach. Building on recent advances in machine learning, our method revisits the long- overlooked Lagrangian relaxation framework, which is a classical decomposition technique that enables tractable subproblem solving. These smaller subproblems are inherently well-suited for machine learning, as their reduced dimensionality and structural regularity allow predictive models to efficiently learn and generalize solution patterns. We thus propose a generic predictive model, which embeds Gated Recurrent Units (GRUs) and Attention in the encoder-decoder structure, and integrate a rule-based feasibility layer to capture temporal dependencies, reduce training effort, and improve feasibility w.r.t. unit-level constraints. Our method has been validated on the IEEE 118-bus system, demonstrating promising performance in solving sub-hourly UC problems efficiently and feasibly.

97 MATHEMATICS AND COMPUTING↗

Gradient-based Optimization for Regression in the Functional Tensor-Train Format

We consider the task of low-multilinear-rank functional regression, i.e., learning a low-rank parametric representation of functions from scattered real-valued data. Our first contribution is the development and analysis of gradient-based optimization procedures, including stochastic gradient descent and quasi-Newton methods, for learning the parameters of a functional tensor-train (FT) that yields improved accuracy over standard alternating least squares methods. The functional tensor-train uses the tensor-train (TT) representation of low-rank arrays as an ansatz for a class of low-multilinear-rank functions. The FT is represented by a set of matrix-valued functions that contain a set of univariate functions, and the regression task is to learn the parameters of these univariate functions. Our second contribution demonstrates that using nonlinearly parameterized univariate functions, e.g., symmetric kernels with moving centers, within each core can outperform the standard approach of using a linear expansion of basis functions. Our final contributions are new rank adaptation and group-sparsity regularization procedures to minimize overfitting. We use several benchmark problems to demonstrate at least an order of magnitude lower accuracy with gradient-based optimization methods than ALS in the low-sample number regime. We also demonstrate an order of magnitude reduction in accuracy on a test problem resulting from nonlinear parameterizations over linear parameterizations. Finally we compare regression performance with 22 other nonparametric and parametric regression methods on 10 real-world data sets. We achieve top-five accuracy for seven of the data sets and best accuracy for two of the data sets. These rankings are the best amongst parametric models and competetive with the best non-parametric methods.

97 MATHEMATICS AND COMPUTING↗

Analysis of Neural Networks as Random Dynamical Systems

In this report we present our findings and outcomes of the NNRDS (analysis of Neural Networks as Random Dynamical Systems) project. The work is largely motivated by the analogy of a large class of neural networks (NNs) with a discretized ordinary differential equation (ODE) schemes. Namely, residual NNs, or ResNets, can be viewed as a discretization of neural ODEs (NODEs) where the NN depth plays the role of the time evolution. We employ several legacy tools from ODE theory, such as stiffness, nonlocality, autonomicity, to enable regularization of ResNets thus improving their generalization capabilities. Furthermore, armed with NN analysis tools borrowed from the ODE theory, we are able to efficiently augment NN predictions with uncertainty overcoming wellknown dimensionality challenges and adding a degree of trust towards NN predictions. Finally, we have developed a Python library QUiNN (Quantification of Uncertainties in Neural Networks) that incorporates improved-architecture ResNets, besides classical feed-forward NNs, and contains wrappers to PyTorch NN models enabling several major classes of uncertainty quantification methods for NNs. Besides synthetic problems, we demonstrate the methods on datasets from climate modeling and materials science.

97 MATHEMATICS AND COMPUTING↗