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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Conservation laws in discrete geometry

The small length scales of the dissipative processes of physical viscosity and heat conduction are typically not resolved in the numerical simulation of high Reynolds number flows in the discrete geometry of computational grids. Historically, the simulations of flows with shocks and/or turbulence have relied on solving the Euler equations with dissipative regularization. In this paper, we begin by reviewing the regularization strategies used in shock wave calculations in both a Lagrangian and an Eulerian framework. We exhibit the essential similarities with Large Eddy Simulation models of turbulence, namely that almost all of these depend on the square of the size of the computational cell. In our principal result, we justify that dependence by deriving the evolution equations for a finite-sized volume of fluid. Those evolution equations, termed finite scale Navier-Stokes (FSNS), contain dissipative terms similar to the artificial viscosity first proposed by von Neumann and Richtmyer. Here, we describe the properties of FSNS, provide a physical interpretation of the dissipative terms and show the connection to recent concepts in fluid dynamics, including inviscid dissipation and bi-velocity hydrodynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Existence and Regularity Results for the Inviscid Primitive Equations with Lateral Periodicity

The article is devoted to prove the existence and regularity of the solutions of the 3D inviscid Linearized Primitive Equations (LPEs) in a channel with lateral periodicity. This was assumed in a previous work (Hamouda et al. in Discret Contin Dyn Syst Ser S 6(2):401–422, 2013) which is concerned with the boundary layers generated by the corresponding viscous problem. Although the equations under investigation here are of hyperbolic type, the standard methods do not apply because of the specificity of the hyperbolic system. A set of non-local boundary conditions for the inviscid LPEs has to be imposed at the lateral boundary of the channel making thus the system well-posed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

TTHRESH: Tensor Compression for Multidimensional Visual Data

Memory and network bandwidth are decisive bottlenecks when handling high-resolution multidimensional data sets in visualization applications, and they increasingly demand suitable data compression strategies. In this paper, we introduce a novel lossy compression algorithm for multidimensional data over regular grids. It leverages the higher-order singular value decomposition (HOSVD), a generalization of the SVD to three dimensions and higher, together with bit-plane, run-length and arithmetic coding to compress the HOSVD transform coefficients. Our scheme degrades the data particularly smoothly and achieves lower mean squared error than other state-of-the-art algorithms at low-to-medium bit rates, as it is required in data archiving and management for visualization purposes. Further advantages of the proposed algorithm include very fine bit rate selection granularity and the ability to manipulate data at very small cost in the compression domain, for example to reconstruct filtered and/or subsampled versions of all (or selected parts) of the data set.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Running Primal-Dual Gradient Method for Time-Varying Nonconvex Problems

This paper focuses on a time-varying constrained nonconvex optimization problem, and considers the synthesis and analysis of online regularized primal-dual gradient methods to track a Karush-Kuhn-Tucker (KKT) trajectory. The proposed regularized primal-dual gradient method is implemented in a running fashion, in the sense that the underlying optimization problem changes during the execution of the algorithms. In order to study its performance, we first derive its continuous-time limit as a system of differential inclusions. We then study sufficient conditions for tracking a KKT trajectory, and also derive asymptotic bounds for the tracking error (as a function of the time-variability of a KKT trajectory). Further, we provide a set of sufficient conditions for the KKT trajectories not to bifurcate or merge, and also investigate the optimal choice of the parameters of the algorithm. Illustrative numerical results for a time-varying nonconvex problem are provided.

differential inclusion↗
DOE OSTI2023

A scalable transformer model for real-time decision making in neutron scattering experiments

The U.S. Department of Energy's (DOE's) neutron research facilities at Oak Ridge National Laboratory (ORNL), including the High Flux Isotope Reactor (HFIR) and the Spallation Neutron Source (SNS), are a state-of-the-art neutron scattering facility that allows researchers to study the structure and dynamics of materials at the atomic scale. At the SNS, neutrons are measured using the time-of-flight (TOF) technique as they move through a neutron beamline to interact with a sample. Large volumes of neutron scattering data are collected and recorded in neutron event mode. Optimal productivity of the TOF instrument is limited due to the lack of real-time data analysis tools. The large amount of data generated by the experiments can be challenging to process and analyze in real time, particularly for experiments that require rapid feedback and adjustment of experimental parameters. The regular computer/workstation cannot keep up with the experiment speed to provide real-time feedback to adjust experimental parameters, so connecting the supercomputers available to the neutron facility is necessary to achieve real-time data analysis and experiment steering. To address this challenge, we exploit the Frontier supercomputer at Oak Ridge Leadership Computing Facility (OLCF) to train a scalable temporal fusion transformer model for real-time decision making of TOF neutron scattering experimentation. Here, in this paper, we present the results using Frontier to provide the processing power needed to rapidly process and analyze large volumes of single-crystal diffraction data collected at TOPAZ, a neutron time-of-flight Laue single-crystal diffractometer at the SNS.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Improving Limited Angle CT Reconstruction with a Robust GAN Prior

Limited angle CT reconstruction is an under-determined linear inverse problem that requires appropriate regularization techniques to be solved. In this work we study how pre-trained generative adversarial networks (GANs) can be used to clean noisy, highly artifact laden reconstructions from conventional techniques, by effectively projecting onto the inferred image manifold. In particular, we use a robust version of the popularly used GAN prior for inverse problems, based on a recent technique called corruption mimicking, that significantly improves the reconstruction quality. The proposed approach operates in the image space directly, as a result of which it does not need to be trained or require access to the measurement model, is scanner agnostic, and can work over a wide range of sensing scenarios.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

Code Coverage Status of ARC Code-DIF3D

The Argonne Reactor Code (ARC) software system supports users in their fast reactor design goals by providing neutronic, thermal-hydraulic, and structural analysis capabilities. DIF3D plays a pivotal role in the ARC system as the primary homogenized assembly neutronic calculation methodology for fast reactor problems. Over its 40 years history, ARC software usage with DIF3D has been applied to numerous fast and thermal spectrum reactor analysis projects with good to excellent comparison against experiments. With continued improvement of computation resources, many of the geometry modeling capabilities in DIF3D that were primarily used in low order schemes are not really needed anymore. Today, the diffusion and transport capabilities of DIF3D-VARIANT are primarily used in the reactor design process with some scattered usage of DIF3D-FD and DIF3D-Nodal. In recent work, the DIF3D software verification was completed for DIF3D-FD and DIF3D-VARIANT on the geometry options used in the Versatile Test Reactor project. While we can be confident that these capabilities of DIF3D are well used and thus trusted, it does not demonstrate that all possible input options of DIF3D are actually working, but just those that were tested as part of VTR are and that they are correct. Thus, the purpose of the present work is to identify a set of test problems for DIF3D and assess the code coverage of DIF3D for those test problems. The goal is to document what parts of the existing DIF3D code are touched by the set of test problems and which are not. Because the verification work done on DIF3D-VARIANT and DIF3D-FD was focused on the most common uses of DIF3D for fast reactor analysis, the code coverage assessment of those capabilities is the highest priority. This will ensure that nothing is being missed by the existing verification test problems that DIF3D relies upon. The DIF3D-Nodal capability will also be inspected for code coverage as part of this work to further ensure that regular regression testing of DIF3D will trap any likely errors the end user might experience with the DIF3D software. The code coverage analysis of DIF3D was performed with the Code Coverage Tool of the Intel Fortran compiler which requires modifications to the compilation of DIF3D. The detailed coverage tables are given for each submodule of DIF3D separately, and for the submodules which are primarily developed for DIF3D, most of the source files could be at least partially touched. Most of the uncovered parts/files could be easily ignored, because they are either for error message and debugging output or obviously not needed by DIF3D. Out of the entire source codes of DIF3D, only a few uncovered modules deserve further investigation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2019

Robot Adaptation to Unstructured Terrains by Joint Representation and Apprenticeship Learning

When a mobile robot is deployed in a field environment, e.g., during a disaster response application, the capability of adapting its navigational behaviors to unstructured terrains is essential for effective and safe robot navigation. In this paper, we introduce a novel joint terrain representation and apprenticeship learning approach to implement robot adaptation to unstructured terrains. Different from conventional learning-based adaptation techniques, our approach provides a unified problem formulation that integrates representation and apprenticeship learning under a unified regularized optimization framework, instead of treating them as separate and independent procedures. Our approach also has the capability to automatically identify discriminative feature modalities, which can improve the robustness of robot adaptation. In addition, we implement a new optimization algorithm to solve the formulated problem, which provides a theoretical guarantee to converge to the global optimal solution. In the experiments, we extensively evaluate the proposed approach in real-world scenarios, in which a mobile robot navigates on familiar and unfamiliar unstructured terrains. Experimental results have shown that the proposed approach is able to transfer human expertise to robots with small errors, achieve superior performance compared with previous and baseline methods, and provide intuitive insights on the importance of terrain feature modalities.

42 ENGINEERING↗
DOE OSTI2016

Global bifurcations in fractional-order chaotic systems with an extended generalized cell mapping method

Global bifurcations include sudden changes in chaotic sets due to crises. There are three types of crises defined by Grebogi et al. [Physica D 7, 181 (1983)]: boundary crisis, interior crisis, and metamorphosis. In this paper, by means of the extended generalized cell mapping (EGCM), boundary and interior crises of a fractional-order Duffing system are studied as one of the system parameters or the fractional derivative order is varied. It is found that a crisis can be generally defined as a collision between a chaotic basic set and a basic set, either periodic or chaotic, to cause a sudden discontinuous change in chaotic sets. Here chaotic sets involve three different kinds: a chaotic attractor, a chaotic saddle on a fractal basin boundary, and a chaotic saddle in the interior of a basin and disjoint from the attractor. A boundary crisis results from the collision of a periodic (or chaotic) attractor with a chaotic (or regular) saddle in the fractal (or smooth) boundary. In such a case, the attractor, together with its basin of attraction, is suddenly destroyed as the control parameter passes through a critical value, leaving behind a chaotic saddle in the place of the original attractor and saddle after the crisis. An interior crisis happens when an unstable chaotic set in the basin of attraction collides with a periodic attractor, which causes the appearance of a new chaotic attractor, while the original attractor and the unstable chaotic set are converted to the part of the chaotic attractor after the crisis. These results further demonstrate that the EGCM is a powerful tool to reveal the mechanism of crises in fractional-order systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Provable Convergence of Plug-and-Play Priors With MMSE Denoisers

Plug-and-play priors (PnP) is a methodology for regularized image reconstruction that specifies the prior through an image denoiser. While PnP algorithms are well understood for denoisers performing maximum a posteriori probability (MAP) estimation, they have not been analyzed for the minimum mean squared error (MMSE) denoisers. Here we address this gap by establishing the first theoretical convergence result for the iterative shrinkage/thresholding algorithm (ISTA) variant of PnP for MMSE denoisers. We show that the iterates produced by PnP-ISTA with an MMSE denoiser converge to a stationary point of some global cost function. We validate our analysis on sparse signal recovery in compressive sensing by comparing two types of denoisers, namely the exact MMSE denoiser and the approximate MMSE denoiser obtained by training a deep neural net.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The National Solar Radiation Database Final Report: Fiscal Years 2022-2024

The National Solar Radiation Database (NSRDB) is the leading public source of high-resolution solar resource data in the United States, with more than 400,000 users annually. This database represents the state of the art in the satellite-based estimation of solar resource information and uses a unique physics-based modeling approach that enables improvements in accuracy with the deployment of the next-generation geostationary satellites. Making the highest-quality, state-of-the-art, regularly updated datasets available on a timely basis for users reduces costs of solar deployment by providing accurate information for siting studies and system output prediction and thereby reduces project financing costs and risks.

14 SOLAR ENERGY↗
DOE OSTI2020

Rapid data-driven model reduction of nonlinear dynamical systems including chemical reaction networks using ℓ 1 -regularization

We develop a new data-driven paradigm for efficient model reduction of a broad class of nonlinear dynamical systems. Our model reduction method directly enables the interpretation of key components of the dynamical system, unlike traditional projection-based model reduction methods that focus on reducing computational complexity more than interpretability. Our method is not application specific and is simple to implement on nonlinear dynamical systems arising from a variety of different fields. It requires minimal parameterization using a single parameter to trade-off between model complexity and estimation error. We use a data-driven paradigm to formulate model reduction as an efficient convex optimization problem that scales polynomially in the original size of the complex system, enabling systems with as many as thousands of components to be reduced in a matter of minutes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

MAD: Self-Supervised Masked Anomaly Detection Task for Multivariate Time Series

In this paper, we introduce Masked Anomaly Detection (MAD), a general self-supervised learning task for multivariate time series anomaly detection. With the increasing availability of sensor data from industrial systems, being able to detecting anomalies from streams of multivariate time series data is of significant importance. Given the scarcity of anomalies in real-world applications, the majority of literature has been focusing on modeling normality. The learned normal representations can empower anomaly detection as the model has learned to capture certain key underlying data regularities. A typical formulation is to learn a predictive model, i.e., use a window of time series data to predict future data values. In this paper, we propose an alternative self-supervised learning task. By randomly masking a portion of the inputs and training a model to estimate them using the remaining ones, MAD is an improvement over the traditional left-to-right next step prediction (NSP) task. Our experimental results demonstrate that MAD can achieve better anomaly detection rates over traditional NSP approaches when using exactly the same neural network (NN) base models, and can be modified to run as fast as NSP models during test time on the same hardware, thus making it an ideal upgrade for many existing NSP-based NN anomaly detection models.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Scalable Representation Learning for Long-Term Augmented Reality-Based Information Delivery in Collaborative Human-Robot Perception

Augmented reality (AR)-based information delivery has been attracting an increasing attention in the past few years to improve com- munication in human-robot teaming. In the long-term use of AR systems for collaborative human-robot perception, one of the biggest challenges is to perform place and scene matching under long-term environmental changes, such as dramatic variations in lighting, weather and vegetation across di erent times of the day, months, and seasons. To address this challenge, we introduce a novel representation learning approach that learns a scalable long-term representation model that can be used for place and scene matching in various long-term conditions. Our approach is formulated as a regularized optimization problem, which selects the most representative scene templates in di erent scenarios to construct a scalable representation of the same place that can exhibit signi cant long-term environment changes. Our approach adaptively learns to select a small subset of the templates to construct the representation model, based on a user-de ned representativeness threshold, which makes the learned model highly scalable to the long-term variations in real-world applications. To solve the formulated optimization problem, a new algo- rithmic solver is designed, which is theoretically guaranteed to converge to the global optima. Experiments are conducted using two large-scale benchmark datasets, which have demonstrated the superior performance of our approach for long-term place and scene matching.

42 ENGINEERING↗
DOE OSTI2017

Equivariant Verlinde Formula from Fivebranes and Vortices

We study complex Chern–Simons theory on a Seifert manifold M 3 by embedding it into string theory. We show that complex Chern–Simons theory on M 3 is equivalent to a topologically twisted supersymmetric theory and its partition function can be naturally regularized by turning on a mass parameter. We find that the dimensional reduction of this theory to 2d gives the low energy dynamics of vortices in fourdimensional gauge theory, the fact apparently overlooked in the vortex literature. We also generalize the relations between (1) the Verlinde algebra, (2) quantum cohomology of the Grassmannian, (3) Chern–Simons theory on Σ × S 1 and (4) index of a spin c Dirac operator on the moduli space of flat connections to a new set of relations between (1) the “equivariant Verlinde algebra” for a complex group, (2) the equivariant quantum K-theory of the vortex moduli space, (3) complex Chern–Simons theory on Σ × S 1 and (4) the equivariant index of a spinc Dirac operator on the moduli space of Higgs bundles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Toplogical optimization of structures using Fourier representations

The minimization of compliance subject to a mass constraint is the topology optimization design problem of interest. The goal is to determine the optimal configuration of material within an allowed volume. Our approach builds upon the well-known density method in which the decision variable is the material density in every cell in a mesh. In it’s most basic form the density method consists of three steps: 1) the problem is convexified by replacing the integer material indicator function with a volume fraction, 2) the problem is regularized by filtering the volume fraction field to impose a minimum length scale; 3) the filtered volume fraction is penalized to steer the material distribution toward binary designs. The filtering step is used to yield a mesh-independent solution and to eliminate checkerboard instabilities. In image processing terms this is a low-pass filter, and a consequence is that the decision variables are not independent and a change of basis could significantly reduce the dimension of the nonlinear programming problem. Based on this observation, we represent the volume fraction field with a truncated Fourier representation. Furthermore, this imposes a minimal length scale on the problem, eliminates checkerboard instabilities, and also reduces the number of decision variables by over 100 × (two dimensions) or 1000 × (three dimensions).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

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↗