Search NASA⌕ Search

SEARCH · Search NASA

Results for “Smoothing 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 451 records · Page 25

Hybrid Surface Mesh Adaptation for Climate Modeling

Solution-driven mesh adaptation is becoming quite popular for spatial error control in the numerical simulation of complex computational physics applications, such as climate modeling. Typically, spatial adaptation is achieved by element subdivision (h adaptation) with a primary goal of resolving the local length scales of interest. A second, less-popular method of spatial adaptivity is called “mesh motion” (r adaptation); the smooth repositioning of mesh node points aimed at resizing existing elements to capture the local length scales. This paper proposes an adaptation method based on a combination of both element subdivision and node point repositioning (rh adaptation). By combining these two methods using the notion of a mobility function, the proposed approach seeks to increase the flexibility and extensibility of mesh motion algorithms while providing a somewhat smoother transition between refined regions than is produced by element subdivision alone. Further, in an attempt to support the requirements of a very general class of climate simulation applications, the proposed method is designed to accommodate unstructured, polygonal mesh topologies in addition to the most popular mesh types.

99 GENERAL AND MISCELLANEOUS↗

Sparse tensor spherical harmonics approximation in radiative transfer

The stationary monochromatic radiative transfer equation is a partial differential transport equation stated on a five-dimensional phase space. To obtain a well-posed problem, boundary conditions have to be prescribed on the inflow part of the domain boundary. We solve the equation with a multi-level Galerkin FEM in physical space and a spectral discretization with harmonics in solid angle and show that the benefits of the concept of sparse tensor products, known from the context of sparse grids, can also be leveraged in combination with a spectral discretization. Our method allows us to include high spectral orders without incurring the 'curse of dimension' of a five-dimensional computational domain. Neglecting boundary conditions, we find analytically that for smooth solutions, the convergence rate of the full tensor product method is retained in our method up to a logarithmic factor, while the number of degrees of freedom grows essentially only as fast as for the purely spatial problem. For the case with boundary conditions, we propose a splitting of the physical function space and a conforming tensorization. Numerical experiments in two physical and one angular dimension show evidence for the theoretical convergence rates to hold in the latter case as well.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Testing Different Methods for Estimating Uncertainties on Rietveld Refined Parameters Using SrRietveld

The advent of fast computing allows more computationally expensive, though possibly more accurate, approaches for estimating uncertainties on Rietveld refined parameters. Here we compare three such methods, using two different refinement programs, FullProf and GSAS. This is facilitated by the use of a new Rietveld refinement package, SrRietveld, that provides Python wrappers for FullProf and GSAS. The refined values on the parameters from two different refinement engines match each other very well. The uncertainty estimates determined using the different methods are also consistent, though FullProf and GSAS estimate the parameter uncertainties slightly differently from each other, which is discussed. More importantly, we find that the refined results are very sensitive to the statistical weights used in the least squares equation. Different weights, for example from uncertain or incorrectly propagated random errors on the data, lead to significantly different refined values. This means that uncertainty estimates on refined parameters should be increased when the random errors on the data are not well known, as for example in many cases where area detectors are used, and care should be taken to propagate errors correctly in any data preprocessing such as normalization by a smoothed spectrum. The computationally expensive bootstrap error estimation methods are facilitated by the use of SrRietveld, but are not required in most cases though may be useful in some cases, for example if the random errors on the data are not well known.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Colloidal nanocrystals and method of making

A tight confinement nanocrystal comprises a homogeneous center region having a first composition and a smoothly varying region having a second composition wherein a confining potential barrier monotonically increases and then monotonically decreases as the smoothly varying region extends from the surface of the homogeneous center region to an outer surface of the nanocrystal. A method of producing the nanocrystal comprises forming a first solution by combining a solvent and at most two nanocrystal precursors; heating the first solution to a nucleation temperature; adding to the first solution, a second solution having a solvent, at least one additional and different precursor to form the homogeneous center region and at most an initial portion of the smoothly varying region; and lowering the solution temperature to a growth temperature to complete growth of the smoothly varying region.

36 MATERIALS SCIENCE↗

Multimodal Bayesian registration of noisy functions using Hamiltonian Monte Carlo

Functional data registration is a necessary processing step for many applications. The observed data can be inherently noisy, often due to measurement error or natural process uncertainty; which most functional alignment methods cannot handle. A pair of functions can also have multiple optimal alignment solutions, which is not addressed in current literature. In this paper, a flexible Bayesian approach to functional alignment is presented, which appropriately accounts for noise in the data without any pre-smoothing required. Additionally, by running parallel MCMC chains, the method can account for multiple optimal alignments via the multi-modal posterior distribution of the warping functions. To most efficiently sample the warping functions, the approach relies on a modification of the standard Hamiltonian Monte Carlo to be well-defined on the infinite-dimensional Hilbert space. In this work, this flexible Bayesian alignment method is applied to both simulated data and real data sets to show its efficiency in handling noisy functions and successfully accounting for multiple optimal alignments in the posterior; characterizing the uncertainty surrounding the warping functions.

97 MATHEMATICS AND COMPUTING↗

Spanning the Gap From Bulk to Bin: A Novel Spectral Microphysics Method

Microphysics methods for climate models and numerical weather prediction typically track one, two, or three moments of a droplet size distribution for various categories of liquid, ice, and aerosol. Such methods rely on conversion parameters between these categories, which introduces uncertainty into predictions. While higher-fidelity options such as bin and Lagrangian schemes exist, they require too many degrees of freedom for climate modeling applications and introduce numerical challenges. Here we introduce a flexible spectral microphysics method based on collocation of basis functions. This method generalizes to a linear bulk scheme when using few basis functions and to a smoothed bin scheme with more degrees of freedom. Tested in an idealized box setting, the method improves spectral accuracy for droplet collision-coalescence and may eliminate the need for precipitation autoconversion rates required by bulk methods; furthermore, it generalizes well to multimodal distributions with less complexity than a bin method. The potential to extend this collocation representation to multiple hydrometeor classes suggests a path forward to unify liquid, ice, and aerosol microphysics in a single, flexible, computational framework for climate modeling.

54 ENVIRONMENTAL SCIENCES↗

A Smoothed Augmented Lagrangian Framework for Convex Optimization with Nonsmooth Constraints

Augmented Lagrangian (AL) methods have proven remarkably useful in solving optimization problems with complicated constraints. The last decade has seen the development of overall complexity guarantees for inexact AL variants. Yet, a crucial gap persists in addressing nonsmooth convex constraints. To this end, we present a smoothed augmented Lagrangian (AL) framework where nonsmooth terms are progressively smoothed with a smoothing parameter $\eta _k$ . The resulting AL subproblems are $\eta _k$ -smooth, allowing for leveraging accelerated schemes. By a careful selection of the inexactness level $\epsilon _k$ (for inexact subproblem resolution), the penalty parameter $\rho _k$ , and smoothing parameter $\eta _k$ at epoch k, we derive rate and complexity guarantees of $\tilde{\mathcal {O}}(1/{\varepsilon }^{3/2})$ and $\tilde{\mathcal {O}}(1/{\varepsilon })$ in convex and strongly convex regimes for computing an ${\varepsilon }$ -optimal solution, when $\rho _k$ increases at a geometric rate, a significant improvement over the best available guarantees for AL schemes for convex programs with nonsmooth constraints. Analogous guarantees are developed for settings with $\rho _k = \rho$ as well as $\eta _k = \eta$ . Preliminary numerics on a fused Lasso problem display promise.

augmented Lagrangian↗

Accelerated basis adaptation in homogeneous chaos spaces

Polynomial chaos expansions (PCE) provide an efficient approach to uncertainty quantification (UQ) and have been adapted to diverse applications across the spectrum of science and engineering. For situations involving large stochastic parameterizations, the curse of dimensionality renders PCE-based methods computationally prohibitive. A basis adaptation approach for PCE was proposed by Tipireddy and Ghanem (2014) which transforms the input random variables through an isometry such that sufficient probabilistic characterization of specific quantities of interest (QoI) is concentrated in an algebraic manifold embedded in the linear span of the dominant transformed variables. While quite versatile, that original version of the PCE basis adaptation exhibited slow convergence for a number of problems of practical significance. In the present paper, we propose two novel methods to accelerate the convergence of the original basis adaptation approach, thus expanding its reach while also providing insight into its performance. In the first method, information gained from a pilot PCE representation is used to correct the mean and Gaussian coefficients in the adapted space. By taking advantages of probabilistic information in higher dimensional adaptation gleaned from an initial adaptation, the second method updates the rotation matrix used to identify the dominant transformed variables. In this manner, the new rotation matrix concentrates even more probabilistic information in its first few dimensions. These two method can be combined to achieve even better performance, the combined method is referred to as sequentially optimized adaptation method. Here, the methods are demonstrated on an analytical test function and a model of a space structure with several sub-components and a non-smooth quantity of interest representing the maximum acceleration over time. Both methods achieve accelerated convergence of the basis adaptation approach with negligible additional costs.

Accelerated convergence↗

Accurate gradient approximation for complex interface problems in 3D by an improved coupling interface method

Most elliptic interface solvers become complicated for complex interface problems at those “exceptional points” where there are not enough neighboring interior points for high order interpolation. Such complication increases especially in three dimensions. Usually, the solvers are thus reduced to low order accuracy. In this paper, we classify these exceptional points and propose two recipes to maintain order of accuracy there, aiming at improving the previous coupling interface method [26]. Yet the idea is also applicable to other interface solvers. The main idea is to have at least first order approximations for second order derivatives at those exceptional points. Recipe 1 is to use the finite difference approximation for the second order derivatives at a nearby interior grid point, whenever this is possible. Recipe 2 is to flip domain signatures and introduce a ghost state so that a second-order method can be applied. This ghost state is a smooth extension of the solution at the exceptional point from the other side of the interface. The original state is recovered by a post-processing using nearby states and jump conditions. The choice of recipes is determined by a classification scheme of the exceptional points. The method renders the solution and its gradient uniformly second-order accurate in the entire computed domain. Numerical examples are provided to illustrate the second order accuracy of the presently proposed method in approximating the gradients of the original states for some complex interfaces which we had tested previous in two and three dimensions, and a real molecule ( (1D63)) which is double-helix shape and composed of hundreds of atoms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hybrid PN-SN Calculations with SAAF for the Multiscale Transport Capability in Rattlesnake

Two interface conditions, the Lagrange multiplier method and the upwinding method, for hybrid \pn-\sn calculations is proposed for the self-adjoint angular flux (SAAF) formulation of the transport equation using the continuous finite element method (FEM) for spatial discretization. These interface conditions are implemented in Rattlesnake, the radiation transport application built on MOOSE, for the on-going multiscale transport simulation effort at INL. For smoothing the solution at the interface for the Lagrange multiplier method, a method based on \sn Lagrange interpolation on the sphere is proposed. Numerical results indicate that the interface conditions give the expected convergence.

97 MATHEMATICS AND COMPUTING↗

A Reconstructed Discontinuous Galerkin Method for the Compressible Navier-Stokes Equations on Arbitrary Grids

A reconstruction-based discontinuous Galerkin (RDG) method is presented for the solution of the compressible Navier–Stokes equations on arbitrary grids. The RDG method, originally developed for the compressible Euler equations, is extended to discretize viscous and heat fluxes in the Navier–Stokes equations using a so-called inter-cell reconstruction, where a smooth solution is locally reconstructed using a least-squares method from the underlying discontinuous DG solution. Similar to the recovery-based DG (rDG) methods, this reconstructed DG method eliminates the introduction of ad hoc penalty or coupling terms commonly found in traditional DG methods. Unlike rDG methods, this RDG method does not need to judiciously choose a proper form of a recovered polynomial, thus is simple, flexible, and robust, and can be used on arbitrary grids. The developed RDG method is used to compute a variety of flow problems on arbitrary meshes to demonstrate its accuracy, efficiency, robustness, and versatility. The numerical results indicate that this RDG method is able to deliver the same accuracy as the well-known Bassi–Rebay II scheme, at a half of its computing costs for the discretization of the viscous fluxes in the Navier–Stokes equations, clearly demonstrating its superior performance over the existing DG methods for solving the compressible Navier–Stokes equations.

97 MATHEMATICS AND COMPUTING↗

A frozen Gaussian approximation-based multi-level particle swarm optimization for seismic inversion

In this paper, we propose a frozen Gaussian approximation (FGA)-based multi-level particle swarm optimization (MLPSO) method for seismic inversion of high-frequency wave data. The method addresses two challenges in it: First, the optimization problem is highly non-convex, which makes hard for gradient-based methods to reach global minima. This is tackled by MLPSO which can escape from undesired local minima. Second, the character of high-frequency of seismic waves requires a large number of grid points in direct computational methods, and thus renders an extremely high computational demand on the simulation of each sample in MLPSO. We overcome this difficulty by three steps: First, we use FGA to compute high-frequency wave propagation based on asymptotic analysis on phase plane; Then we design a constrained full waveform inversion problem to prevent the optimization search getting into regions of velocity where FGA is not accurate; Last, we solve the constrained optimization problem by MLPSO that employs FGA solvers with different fidelity. The performance of the proposed method is demonstrated by a two-dimensional full-waveform inversion example of the smoothed Marmousi model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A simple atomic force microscopy calibration method for direct measurement of surface energy on nanostructured surfaces covered with molecularly thin liquid films

A simple calibration method is described for the determination of surface energy by atomic force microscopy (AFM) pull-off force measurements on nanostructured surfaces covered with molecularly thin liquid films. The method is based on correlating pull-off forces measured in arbitrary units on a nanostructured surface with pull-off forces measured on macroscopically smooth dip-coated gauge surfaces with known surface energy. The method avoids the need for complex calibration of the AFM cantilever stiffness and the determination of the radius of curvature of the AFM tip. Both of the latter measurements are associated with indirect and less accurate measurements of surface energy based on various contact mechanics adhesion models.

36 MATERIALS SCIENCE↗

A Reconstructed Discontinuous Galerkin Method for the Compressible Flows on Unstructured Tetrahedral Grids

A reconstruction-based discontinuous Galerkin (RDG) method is presented for the solution of the compressible Navier-Stokes equations on unstructured tetrahedral grids. The RDG method, originally developed for the compressible Euler equations, is extended to discretize viscous and heat fluxes in the Navier-Stokes equations using a so-called inter-cell reconstruction, where a smooth solution is locally reconstructed using a least-squares method from the underlying discontinuous DG solution. Similar to the recovery-based DG (rDG) methods, this reconstructed DG method eliminates the introduction of ad hoc penalty or coupling terms commonly found in traditional DG methods. Unlike rDG methods, this RDG method does not need to judiciously choose a proper form of a recovered polynomial, thus is simple, flexible, and robust, and can be used on unstructured grids. The preliminary results indicate that this RDG method is stable on unstructured tetrahedral grids, and provides a viable and attractive alternative for the discretization of the viscous and heat fluxes in the Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗

A Reconstructed Discontinuous Galerkin Method for the Compressible Navier-Stokes Equations on Arbitrary Grids

A reconstruction-based discontinuous Galerkin (RDG) method is presented for the solution of the compressible Navier-Stokes equations on arbitrary grids. The RDG method, originally developed for the compressible Euler equations, is extended to discretize viscous and heat fluxes in the Navier-Stokes equations using a so-called inter-cell reconstruction, where a smooth solution is locally reconstructed using a least-squares method from the underlying discontinuous DG solution. Similar to the recovery-based DG (rDG) methods, this reconstructed DG method eliminates the introduction of ad hoc penalty or coupling terms commonly found in traditional DG methods. Unlike rDG methods, this RDG method does not need to judiciously choose a proper form of a recovered polynomial, thus is simple, flexible, and robust, and can be used on arbitrary grids. The developed RDG method is used to compute a variety of flow problems on arbitrary meshes to demonstrate its accuracy, efficiency, robustness, and versatility. The numerical results indicate that this RDG method is able to deliver the same accuracy as the well-known Bassi-Rebay II scheme, at a half of its computing costs for the discretization of the viscous fluxes in the Navier-Stokes equations, clearly demonstrating its superior performance over the existing DG methods for solving the compressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗

Near atomically smooth alkali antimonide photocathode thin films

Nano-roughness is one of the major factors degrading the emittance of electron beams that can be generated by high efficiency photocathodes, such as the thermally reacted alkali antimonide thin films. In this paper, we demonstrate a co-deposition based method for producing alkali antimonide cathodes that produce near atomic smoothness with high reproducibility. Here, we calculate the effect of the surface roughness on the emittance and show that such smooth cathode surfaces are essential for operation of alkali antimonide cathodes in high field, low emittance radio frequency electron guns and to obtain ultracold electrons for ultrafast electron diffraction applications.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Tuning the Interpolation Basis in a Multigrid Decomposition for Local Error Control

In the compression of scientific data, error-controlled compressors enable to considerably decrease the size of the dataset while maintaining adequate levels of accuracy. In this paper, we note that multi-level refactoring scheme such as MGARD i) rely on an approximation of the data based on the interpolation of coefficients, ii) estimate the resulting error with global metrics on the dataset. To improve on these two aspects, we propose a method that aims to divide the original dataset into blocks based on their smoothness and refactors each block separately with the most relevant interpolation order. We show the relevance of such a method on tailored datasets and the benefits and challenges when applying it to large scientific data.

Vidal, Nicolas [ORNL]↗

A NEW METHOD FOR EXTRACTING SPIN-DEPENDENT NEUTRON STRUCTURE FUNCTIONS FROM NUCLEAR DATA

High-energy electrons are currently the best probes of the internal structure of nucleons (protons and neutrons). By collecting data on electrons scattering off light nuclei, such as deuterium and helium, one can extract structure functions (SFs), which encode information about the quarks that make up the nucleon. Spin-dependent SFs, which depend on the relative polarization of the electron beam and the target nucleus, encode quark spins. Proton SFs can be measured directly from electron-proton scattering, but those of the neutron must be extracted from proton data and deuterium or helium-3 data because free neutron targets do not exist. At present, there is no reliable method for accurately determining spin-dependent neutron SFs in the low-momentum-transfer regime, where nucleon resonances are prominent and the functions are not smooth. The focus of this study was to develop a new method for extracting spin-dependent neutron SFs from nuclear data. An approximate convolution formula for nuclear SFs reduces the problem to an integral equation, for which a recursive solution method was designed. The method was then applied to recent data from proton and deuterium scattering experiments to perform a preliminary extraction of spin-dependent neutron SFs in the resonance region. The extraction method was found to reliably converge for arbitrary test functions, and the validity of the extraction from data was verifi ed using a Bjorken integral, which relates integrals of SFs to a known quantity. This new information on neutron structure could be used to assess quark-hadron duality for the neutron, which requires detailed knowledge of SFs in all kinematic regimes.

Kahn, Y F↗