Search NASA⌕ Search

SEARCH · Search NASA

Results for “gradient methods”

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 559 records · Page 31

Nonlinear dimension reduction for surrogate modeling using gradient information

We introduce a method for the nonlinear dimension reduction of a high-dimensional function $u:{\mathbb{R}}^d\rightarrow{\mathbb{R}}$, $d\gg 1$. Our objective is to identify a nonlinear feature map $g:{\mathbb{R}}^d\rightarrow{\mathbb{R}}^m$, with a prescribed intermediate dimension $m\ll d$, so that $u$ can be well approximated by $f\circ g$ for some profile function $f:{\mathbb{R}}^m\rightarrow{\mathbb{R}}$. We propose to build the feature map by aligning the Jacobian $\nabla g$ with the gradient $\nabla u$, and we theoretically analyze the properties of the resulting $g$. Once $g$ is built, we construct $f$ by solving a gradient-enhanced least squares problem. Our practical algorithm uses a sample $\{{\textbf{x}}^{(i)},u({\textbf{x}}^{(i)}),\nabla u({\textbf{x}}^{(i)})\}_{i=1}^N$ and builds both $g$ and $f$ on adaptive downward-closed polynomial spaces, using cross validation to avoid overfitting. We numerically evaluate the performance of our algorithm across different benchmarks, and explore the impact of the intermediate dimension $m$. We show that building a nonlinear feature map $g$ can permit more accurate approximation of $u$ than a linear $g$, for the same input data set.

97 MATHEMATICS AND COMPUTING↗

Converting 2D Nanofiber Membranes to 3D Hierarchical Assemblies with Structural and Compositional Gradients Regulates Cell Behavior

Abstract New methods are described for converting 2D electrospun nanofiber membranes to 3D hierarchical assemblies with structural and compositional gradients. Pore‐size gradients are generated by tuning the expansion of 2D membranes in different layers with incorporation of various amounts of a surfactant during the gas‐foaming process. The gradient in fiber organizations is formed by expanding 2D nanofiber membranes composed of multiple regions collected by varying rotating speeds of mandrel. A compositional gradient on 3D assemblies consisting of radially aligned nanofibers is prepared by dripping, diffusion, and crosslinking. Bone mesenchymal stem cells (BMSCs) on the 3D nanofiber assemblies with smaller pore size show significantly higher expression of hypoxia‐related markers and enhanced chondrogenic differentiation compared to BMSCs cultured on the assemblies with larger pore size. The basic fibroblast growth factor gradient can accelerate fibroblast migration from the surrounding area to the center in an in vitro wound healing model. Taken together, 3D nanofiber assemblies with gradients in pore sizes, fiber organizations, and contents of signaling molecules can be used to engineer tissue constructs for tissue repair and build biomimetic disease models for studying disease biology and screening drugs, in particular, for interface tissue engineering and modeling.

Chen, Shixuan↗

Stochastic projective splitting

Here, we present a new, stochastic variant of the projective splitting (PS) family of algorithms for inclusion problems involving the sum of any finite number of maximal monotone operators. This new variant uses a stochastic oracle to evaluate one of the operators, which is assumed to be Lipschitz continuous, and (deterministic) resolvents to process the remaining operators. Our proposal is the first version of PS with such stochastic capabilities. We envision the primary application being machine learning (ML) problems, with the method’s stochastic features facilitating “mini-batch” sampling of datasets. Since it uses a monotone operator formulation, the method can handle not only Lipschitz-smooth loss minimization, but also min–max and noncooperative game formulations, with better convergence properties than the gradient descent-ascent methods commonly applied in such settings. The proposed method can handle any number of constraints and nonsmooth regularizers via projection and proximal operators. We prove almost-sure convergence of the iterates to a solution and a convergence rate result for the expected residual, and close with numerical experiments on a distributionally robust sparse logistic regression problem.

97 MATHEMATICS AND COMPUTING↗

Source identification in acoustics and structural mechanics using Sierra/SD.

In this report we derive both time and frequency-domain methods for inverse identification of sources in elastodynamics and acoustics. The inverse/design problem is cast in a PDE-constrained optimization framework with efficient computation of gradients using the adjoint method. The implementation of source inversion in Sierra/SD is described, and results from both time and frequency domain source inversion are compared to actual experimental data for a weapon store used in captive carry on a military aircraft. The inverse methodology is advantageous in that it provides a method for creating ground based acoustic and vibration tests that can reduce the actual number of flight tests, and thus, saving costs and time for the program.

Walsh, Timothy Francis↗

WE-FG-207B-03: Multi-Energy CT Reconstruction with Spatial Spectral Nonlocal Means Regularization

Purpose: Multi-energy computed tomography (MECT) is an emerging application in medical imaging due to its ability of material differentiation and potential for molecular imaging. In MECT, image correlations at different spatial and channels exist. It is desirable to incorporate these correlations in reconstruction to improve image quality. For this purpose, this study proposes a MECT reconstruction technique that employes spatial spectral non-local means (ssNLM) regularization. Methods: We consider a kVp-switching scanning method in which source energy is rapidly switched during data acquisition. For each energy channel, this yields projection data acquired at a number of angles, whereas projection angles among channels are different. We formulate the reconstruction task as an optimziation problem. A least square term enfores data fidelity. A ssNLM term is used as regularization to encourage similarities among image patches at different spatial locations and channels. When comparing image patches at different channels, intensity difference were corrected by a transformation estimated via histogram equalization during the reconstruction process. Results: We tested our method in a simulation study with a NCAT phantom and an experimental study with a Gammex phantom. For comparison purpose, we also performed reconstructions using conjugate-gradient least square (CGLS) method and conventional NLM method that only considers spatial correlation in an image. ssNLM is able to better suppress streak artifacts. The streaks are along different projection directions in images at different channels. ssNLM discourages this dissimilarity and hence removes them. True image structures are preserved in this process. Measurements in regions of interests yield 1.1 to 3.2 and 1.5 to 1.8 times higher contrast to noise ratio than the NLM approach. Improvements over CGLS is even more profound due to lack of regularization in the CGLS method and hence amplified noise. Conclusion: The proposed ssNLM method for kVp-switching MECT reconstruction can achieve high quality MECT images.

60 APPLIED LIFE SCIENCES↗

The COMET method in 3-D hexagonal geometry

The hybrid stochastic-deterministic coarse mesh radiation transport (COMET) method developed at Georgia Tech now solves reactor core problems in 3-D hexagonal geometry. In this paper, the method is used to solve three preliminary test problems designed to challenge the method with steep flux gradients, high leakage, and strong asymmetry and heterogeneity in the core. The test problems are composed of blocks taken from a high temperature test reactor benchmark problem. As the method is still in development, these problems and their results are strictly preliminary. Results are compared to whole core Monte Carlo reference solutions in order to verify the method. Relative errors are on the order of 50 pcm in core eigenvalue, and mean relative error in pin fission density calculations is less than 1% in these difficult test cores. The method requires the one-time pre-computation of a response expansion coefficient library, which may be compiled in a comparable amount of time to a single whole core Monte Carlo calculation. After the library has been computed, COMET may solve any number of core configurations on the order of an hour, representing a significant gain in efficiency over other methods for whole core transport calculations. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Hybrid pathwise sensitivity methods for discrete stochastic models of chemical reaction systems

Stochastic models are often used to help understand the behavior of intracellular biochemical processes. The most common such models are continuous time Markov chains (CTMCs). Parametric sensitivities, which are derivatives of expectations of model output quantities with respect to model parameters, are useful in this setting for a variety of applications. In this paper, we introduce a class of hybrid pathwise differentiation methods for the numerical estimation of parametric sensitivities. The new hybrid methods combine elements from the three main classes of procedures for sensitivity estimation and have a number of desirable qualities. First, the new methods are unbiased for a broad class of problems. Second, the methods are applicable to nearly any physically relevant biochemical CTMC model. Third, and as we demonstrate on several numerical examples, the new methods are quite efficient, particularly if one wishes to estimate the full gradient of parametric sensitivities. The methods are rather intuitive and utilize the multilevel Monte Carlo philosophy of splitting an expectation into separate parts and handling each in an efficient manner.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimization of viral resuspension methods for carbon-rich soils along a permafrost thaw gradient

Permafrost stores approximately 50% of global soil carbon (C) in a frozen form; it is thawing rapidly under climate change, and little is known about viral communities in these soils or their roles in C cycling. In permafrost soils, microorganisms contribute significantly to C cycling, and characterizing them has recently been shown to improve prediction of ecosystem function. In other ecosystems, viruses have broad ecosystem and community impacts ranging from host cell mortality and organic matter cycling to horizontal gene transfer and reprogramming of core microbial metabolisms. Here we developed an optimized protocol to extract viruses from three types of high organic-matter peatland soils across a permafrost thaw gradient (palsa, moss-dominated bog, and sedge-dominated fen). Three separate experiments were used to evaluate the impact of chemical buffers, physical dispersion, storage conditions, and concentration and purification methods on viral yields. The most successful protocol, amended potassium citrate buffer with bead-beating or vortexing and BSA, yielded on average as much as 2-fold more virus-like particles (VLPs) g –1 of soil than other methods tested. All method combinations yielded VLPs g –1 of soil on the 10 8 order of magnitude across all three soil types. The different storage and concentration methods did not yield significantly more VLPs g –1 of soil among the soil types. In conclusion, this research provides much-needed guidelines for resuspending viruses from soils, specifically carbon-rich soils, paving the way for incorporating viruses into soil ecology studies.

54 ENVIRONMENTAL SCIENCES↗

Exact and inexact subsampled Newton methods for optimization

Abstract The paper studies the solution of stochastic optimization problems in which approximations to the gradient and Hessian are obtained through subsampling. We first consider Newton-like methods that employ these approximations and discuss how to coordinate the accuracy in the gradient and Hessian to yield a superlinear rate of convergence in expectation. The second part of the paper analyzes an inexact Newton method that solves linear systems approximately using the conjugate gradient (CG) method, and that samples the Hessian and not the gradient (the gradient is assumed to be exact). We provide a complexity analysis for this method based on the properties of the CG iteration and the quality of the Hessian approximation, and compare it with a method that employs a stochastic gradient iteration instead of the CG method. We report preliminary numerical results that illustrate the performance of inexact subsampled Newton methods on machine learning applications based on logistic regression.

Mathematics↗

Bayesian sequential optimal experimental design for nonlinear models using policy gradient reinforcement learning

We present a mathematical framework and computational methods for optimally designing a finite sequence of experiments. This sequential optimal experimental design (sOED) problem is formulated as a finite-horizon partially observable Markov decision process (POMDP) under a Bayesian setting and with information-theoretic utilities. The formulation is general and may accommodate continuous random variables, non-Gaussian posteriors, and nonlinear forward models. The sOED design policy incorporates elements of feedback and lookahead simultaneously, and we show it to generalize the commonly-used batch and greedy design strategies. We solve for the sOED policy using the policy gradient (PG) method from reinforcement learning, and provide a derivation for the PG expression in the sOED context. Adopting an actor-critic approach, the policy and value functions are parameterized using deep neural networks and improved via PG estimates produced from simulated episodes of designs and observations. The new PG-sOED algorithm is first validated on a linear-Gaussian benchmark, and then compared against other design baselines on a sensor movement problem for contaminant source inversion in a convection-diffusion field. As a result, we provide explanation for the policy behaviors using knowledge of the underlying physical process.

97 MATHEMATICS AND COMPUTING↗

A micromorphically regularized Cam-clay model for capturing size-dependent anisotropy of geomaterials

Here we introduce a regularized anisotropic modified Cam-clay (MCC) model which captures the size-dependent anisotropic elastoplastic responses for clay, mudstone, shales, and sedimentary rock. By homogenizing the multiscale anisotropic effects induced by clay particle aggregate, clusters, peds, micro-fabric, and mineral contact across length scales, we introduce two distinctive anisotropic mechanisms for the MCC model at the material point and mesoscale levels. We first employ a mapping that links the anisotropic stress state to a fictitious isotropic principal stress-space to introduce anisotropy at the material point scale. Then, the mesoscale anisotropy is introduced via an anisotropic regularization mechanism. This anisotropic regularization mechanism is triggered by introducing gradient-dependence of the internal variables through a penalty method such that the resultant gradient-enhanced plastic flow may exhibit anisotropic responses non-coaxial to the stress gradient of the yield function. The influence of the size-dependent anisotropy on the formation of the shear band and the macroscopic responses of the effective media are analyzed in 2D and 3D numerical examples.

42 ENGINEERING↗

Delegated Regressor, A Robust Approach for Automated Anomaly Detection in the Soil Radon Time Series Data

We propose a new method based on the idea of delegating regressors for predicting the soil radon gas concentration (SRGC) and anomalies in radon or any other time series data. The proposed method is compared to different traditional boosting e.g., Extreme Gradient Boosting (EGB) and simple regression methods e.g., support vector regressors with linear kernel and radial kernel in terms of accurate predictions. R language has been used for the statistical analysis of radon time series (RTS) data. The results obtained show that the proposed methodology predicts SRGC more accurately when compared to different traditional boosting and regression methods. The best correlation is found between the actual and predicted radon concentration for window size of 2 i.e., two days before and after the start of seismic activities. RTS data was collected from 05 February 2017 to 16 February 2018, including 7 seismic events recorded during the study period. Findings of study show that the proposed methodology predicts the SRGC with more precision, for all the window sizes, by overlapping predicted with the actual radon time series concentrations.

54 ENVIRONMENTAL SCIENCES↗

Healing Gradient Degradation in Nb3Sn SRF Cavities Using a Recoating Method

Despite having advantageous superconducting properties, Nb3Sn superconducting radiofrequency (SRF) cavities still have practical challenges compared to Nb SRF cavities due to the brittle nature of Nb3Sn. Performance degradation can occur when a Nb3Sn SRF cavity experiences mechanical stresses such as during handling and tuning of the cavity. In this study, we present a potential treatment for SRF cavities that have experienced stress induced performance degradation that involves a recoating procedure. The degraded cavity is coated with a small amount of Sn using a single step vapor-diffusion methodology. Using this approach we can recover a significant portion of the lost performance of a Nb3Sn SRF cavity.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Dependence of nuclear quadrupole resonance transitions on the electric field gradient asymmetry parameter for nuclides with half-integer spins

Allowed transition energies and eigenstate expansions have been calculated and tabulated in numerical form as functions of the electric field gradient asymmetry parameter for the zero field Hamiltonian of quadrupolar nuclides with I=3/2,5/2,7/2, and 9/2. These results are essential to interpret nuclear quadrupole resonance (NQR) spectra and extract accurate values of the electric field gradient tensors. Applications of NQR methods to studies of electronic structure in heavy element systems are proposed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Novel pore size-controlled, susceptibility matched, 3D-printed MRI phantoms

We report the design concept and fabrication of MRI phantoms, containing blocks of aligned microcapillaires that can be stacked into larger arrays to construct diameter distribution phantoms or fractured, to create a “powder-averaged” emulsion of randomly oriented blocks for vetting or calibrating advanced MRI methods, that is, diffusion tensor imaging, AxCaliber MRI, MAP-MRI, and multiple pulsed field gradient or double diffusion-encoded microstructure imaging methods. The goal was to create a susceptibility-matched microscopically anisotropic but macroscopically isotropic phantom with a ground truth diameter that could be used to vet advanced diffusion methods for diameter determination in fibrous tissues. Two-photon polymerization, a novel three-dimensional printing method is used to fabricate blocks of capillaries. Double diffusion encoding methods were employed and analyzed to estimate the expected MRI diameter. Susceptibility-matched microcapillary blocks or modules that can be assembled into large-scale MRI phantoms have been fabricated and measured using advanced diffusion methods, resulting in microscopic anisotropy and random orientation. This phantom can vet and calibrate various advanced MRI methods and multiple pulsed field gradient or diffusion-encoded microstructure imaging methods. We demonstrated that two double diffusion encoding methods underestimated the ground truth diameter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exploiting graphical processing units to enable quantum chemistry calculation of large solvated molecules with conductor-like polarizable continuum models

The conductor–like polarizable continuum model (C–PCM) with switching/Gaussian smooth discretization is a widely used implicit solvation model in quantum chemistry. We have previously implemented C–PCM solvation for Hartree–Fock (HF) and density functional theory (DFT) on graphical processing units (GPUs), enabling the quantum mechanical treatment of large solvated biomolecules. Here, we first propose a GPU–based algorithm for the PCM conjugate gradient linear solver that greatly improves the performance for very large molecules. The overhead for PCM–related evaluations now consumes less than 15% of the total runtime for DFT calculations on large molecules. Second, we demonstrate that our algorithms tailored for ground state C–PCM are transferable to excited state properties. Using a single GPU, our method evaluates the analytic gradient of the linear response PCM time–dependent density functional theory energy up to 80× faster than a conventional central processing unit (CPU)–based implementation. In addition, our C–PCM algorithms are transferable to other methods that require electrostatic potential (ESP) evaluations. For example, we achieve speed–ups of up to 130× for restricted ESP–based atomic charge evaluations, when compared to CPU–based codes. As a result, we also summarize and compare the different PCM cavity discretization schemes used in some popular quantum chemistry packages as a reference for both users and developers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fabricating functionally graded films with designed gradient profiles using pulsed laser deposition

A novel picosecond-laser pulsed laser deposition method has been developed for fabricating functionally graded films with pre-designed gradient profiles. Theoretically, the developed method is capable of precisely fabricating films with any thicknesses and any gradient profiles by controlling the laser beam powers for the two different targets based on the film composition profiles. As an implementation example, we have successfully constructed functionally graded diamond-like carbon films with six different gradient profiles: linear, quadratic, cubic, square root, cubic root, and sinusoidal. Energy dispersive X-ray spectroscopy is employed for investigating the chemical composition along the thickness of the film, and the deposition profile and thickness errors are found to be less than 3% and 1.04%, respectively. To the best of the authors' knowledge, this is the first method for fabricating films with designed gradient profiles and has huge potential in many areas of coatings and films, including multifunctional optical films. We believe that this method is not only limited to the example considered in this study, but also can be applied to all material combinations as long as they can be deposited using the pulsed laser deposition technique.

36 MATERIALS SCIENCE↗

A high-order staggered meshless method for elliptic problems

Here, we present a new meshless method for scalar diffusion equations, which is motivated by their compatible discretizations on primal-dual grids. Unlike the latter though, our approach is truly meshless because it only requires the graph of nearby neighbor connectivity of the discretization points. This graph defines a local primal-dual grid complex with a virtual dual grid, in the sense that specification of the dual metric attributes is implicit in the method's construction. Our method combines a topological gradient operator on the local primal grid with a generalized moving least squares approximation of the divergence on the local dual grid. We show that the resulting approximation of the div-grad operator maintains polynomial reproduction to arbitrary orders and yields a meshless method, which attains $O(h^{m})$ convergence in both $L^2$- and $H^1$-norms, similar to mixed finite element methods. We demonstrate this convergence on curvilinear domains using manufactured solutions in two and three dimensions. Application of the new method to problems with discontinuous coefficients reveals solutions that are qualitatively similar to those of compatible mesh-based discretizations.

97 MATHEMATICS AND COMPUTING↗