Search NASA⌕ Search

SEARCH · Search NASA

Results for “Smoothing algorithm”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
NASA NTRS2012

SBUV version 8.6 Retrieval Algorithm: Error Analysis and Validation Technique

SBUV version 8.6 algorithm was used to reprocess data from the Back Scattered Ultra Violet (BUV), the Solar Back Scattered Ultra Violet (SBUV) and a number of SBUV/2 instruments, which 'span a 41-year period from 1970 to 2011 (except a 5-year gap in the 1970s)[see Bhartia et al, 2012]. In the new version Daumont et al. [1992] ozone cross section were used, and new ozone [McPeters et ai, 2007] and cloud climatologies Doiner and Bhartia, 1995] were implemented. The algorithm uses the Optimum Estimation technique [Rodgers, 2000] to retrieve ozone profiles as ozone layer (partial column, DU) on 21 pressure layers. The corresponding total ozone values are calculated by summing ozone columns at individual layers. The algorithm is optimized to accurately retrieve monthly zonal mean (mzm) profiles rather than an individual profile, since it uses monthly zonal mean ozone climatology as the A Priori. Thus, the SBUV version 8.6 ozone dataset is better suited for long-term trend analysis and monitoring ozone changes rather than for studying short-term ozone variability. Here we discuss some characteristics of the SBUV algorithm and sources of error in the SBUV profile and total ozone retrievals. For the first time the Averaging Kernels, smoothing errors and weighting functions (or Jacobians) are included in the SBUV metadata. The Averaging Kernels (AK) represent the sensitivity of the retrieved profile to the true state and contain valuable information about the retrieval algorithm, such as Vertical Resolution, Degrees of Freedom for Signals (DFS) and Retrieval Efficiency [Rodgers, 2000]. Analysis of AK for mzm ozone profiles shows that the total number of DFS for ozone profiles varies from 4.4 to 5.5 out of 6-9 wavelengths used for retrieval. The number of wavelengths in turn depends on solar zenith angles. Between 25 and 0.5 hPa, where SBUV vertical resolution is the highest, DFS for individual layers are about 0.5.

Kramarova, N. A.↗
NASA NTRS1984

Multigrid applications to three-dimensional elliptic coordinate generation

The multigrid algorithm was applied to solve the coupled set of elliptic quasilinear partial differential equations associated with three-dimensional coordinate generation. The results indicate that the multigrid scheme is more than twice as fast as conventional relaxation schemes on moderate-size grids. Convergence factors of order 0.90 per work unit were achieved on 36,000-point grids. The paper covers the form of transformation, develops the set of generation equations, and gives details on the multigrid approach used. Included are a development of the full-approximation storage scheme, details of the smoothing-rate analysis, and a section devoted to rational programming techniques applicable to the multigrid algorithm.

Thames, F. C.↗
DOE OSTI2022

Metrics for Intercomparison of Remapping Algorithms (MIRA) protocol applied to Earth system models

Abstract. Strongly coupled nonlinear phenomena such as those described by Earth system models (ESMs) are composed of multiple component models with independent mesh topologies and scalable numerical solvers. A common operation in ESMs is to remap or interpolate component solution fields defined on their computational mesh to another mesh with a different combinatorial structure and decomposition, e.g., from the atmosphere to the ocean, during the temporal integration of the coupled system. Several remapping schemes are currently in use or available for ESMs. However, a unified approach to compare the properties of these different schemes has not been attempted previously. We present a rigorous methodology for the evaluation and intercomparison of remapping methods through an independently implemented suite of metrics that measure the ability of a method to adhere to constraints such as grid independence, monotonicity, global conservation, and local extrema or feature preservation. A comprehensive set of numerical evaluations is conducted based on a progression of scalar fields from idealized and smooth to more general climate data with strong discontinuities and strict bounds. We examine four remapping algorithms with distinct design approaches, namely ESMF Regrid (Hill et al., 2004), TempestRemap (Ullrich and Taylor, 2015), generalized moving least squares (GMLS) (Trask and Kuberry, 2020) with post-processing filters, and WLS-ENOR (Li et al., 2020). By repeated iterative application of the high-order remapping methods to the test fields, we verify the accuracy of each scheme in terms of their observed convergence order for smooth data and determine the bounded error propagation using challenging, realistic field data on both uniform and regionally refined mesh cases. In addition to retaining high-order accuracy under idealized conditions, the methods also demonstrate robust remapping performance when dealing with non-smooth data. There is a failure to maintain monotonicity in the traditional L2-minimization approaches used in ESMF and TempestRemap, in contrast to stable recovery through nonlinear filters used in both meshless GMLS and hybrid mesh-based WLS-ENOR schemes. Local feature preservation analysis indicates that high-order methods perform better than low-order dissipative schemes for all test cases. The behavior of these remappers remains consistent when applied on regionally refined meshes, indicating mesh-invariant implementations. The MIRA intercomparison protocol proposed in this paper and the detailed comparison of the four algorithms demonstrate that the new schemes, namely GMLS and WLS-ENOR, are competitive compared to standard conservative minimization methods requiring computation of mesh intersections. The work presented in this paper provides a foundation that can be extended to include complex field definitions, realistic mesh topologies, and spectral element discretizations, thereby allowing for a more complete analysis of production-ready remapping packages.

58 GEOSCIENCES↗
DOE OSTI2025

Fast methods for multisite charge transfer. Processes II. Analytic nuclear gradients and nonadiabatic dynamics for cCASSCF(1,n) and cCASSCF(2n-1,n) wavefunctions

In this work we derive and implement analytic nuclear gradients and derivative couplings for a constrained complete active space self-consistent field with a small active space designed to model electron or hole transfer. Using a Lagrangian formalism, we are able to differentiate both the CASSCF energy and the constraint (which is required for smooth surfaces over a wide range of parameter space), and the resulting efficient algorithm can be immediately applied to nonadiabatic dynamics simulations of charge transfer processes. Here, we run initial surface-hopping simulations of a proton coupled electron transfer event for a phenoxyl–phenol system.

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

Constraining the Multiscale Structure of Geophysical Fields in Machine Learning: The Case of Precipitation

The use of deep-learning algorithms for estimating the value of geophysical variables from remotely sensed information is rapidly expanding. The typical objective function minimized in such algorithms is the mean square error (MSE), which is known to lead to smooth estimates with compressed dynamical range as compared to the true distribution of the variable of interest. Here, we introduce and evaluate alternative objective functions, focusing on the retrieval of precipitation rates from satellite passive microwave radiometric measurements using a deep convolutional neural network. For this testbed application, the results show that explicitly imposing the preservation of the statistical distribution and spatial wavelet power spectrum of the target variable allows to accurately reproduce extreme values and sharp gradients across multiple scales in this study.

58 GEOSCIENCES↗
NASA NTRS1986

Uniformly high order accurate essentially non-oscillatory schemes 3

In this paper (a third in a series) the construction and the analysis of essentially non-oscillatory shock capturing methods for the approximation of hyperbolic conservation laws are presented. Also presented is a hierarchy of high order accurate schemes which generalizes Godunov's scheme and its second order accurate MUSCL extension to arbitrary order of accuracy. The design involves an essentially non-oscillatory piecewise polynomial reconstruction of the solution from its cell averages, time evolution through an approximate solution of the resulting initial value problem, and averaging of this approximate solution over each cell. The reconstruction algorithm is derived from a new interpolation technique that when applied to piecewise smooth data gives high-order accuracy whenever the function is smooth but avoids a Gibbs phenomenon at discontinuities. Unlike standard finite difference methods this procedure uses an adaptive stencil of grid points and consequently the resulting schemes are highly nonlinear.

Harten, A.↗
NASA NTRS1990

Estimation and filtering for high-precision GPS positioning applications

Estimation of GPS satellite orbits and other parameters for high-accuracy geodetic and tracking applications is carried out with a multi-satellite batch sequential pseudo-epoch state process noise filter. Both square-root information filtering and UD factorized covariance filtering and smoothing formulations are implemented in the software to enhance numerical stability. The filtering algorithms have been arranged to take advantage of sparse matrices and other characteristics of the GPS measurement scenarios. The filter includes unique error evaluation capabilities to assess effects from mismodeling. Process noise plays a key role in the orbit determination for stochastic behavior of transmitter/receiver clocks, atmospheric-induced delay fluctuations, and unmodeled spacecraft accelerations. Present GPS orbit accuracy is better than 1 m, with ground baselines determined simultaneously to relative accuracy of 1.5 parts in 10 to the 8th over several thousand km distance.

Lichten, Stephen M.↗
NASA NTRS2004

Adjoint Formulation for an Embedded-Boundary Cartesian Method

Many problems in aerodynamic design can be characterized by smooth and convex objective functions. This motivates the use of gradient-based algorithms, particularly for problems with a large number of design variables, to efficiently determine optimal shapes and configurations that maximize aerodynamic performance. Accurate and efficient computation of the gradient, however, remains a challenging task. In optimization problems where the number of design variables dominates the number of objectives and flow- dependent constraints, the cost of gradient computations can be significantly reduced by the use of the adjoint method. The problem of aerodynamic optimization using the adjoint method has been analyzed and validated for both structured and unstructured grids. The method has been applied to design problems governed by the potential, Euler, and Navier-Stokes equations and can be subdivided into the continuous and discrete formulations. Giles and Pierce provide a detailed review of both approaches. Most implementations rely on grid-perturbation or mapping procedures during the gradient computation that explicitly couple changes in the surface shape to the volume grid. The solution of the adjoint equation is usually accomplished using the same scheme that solves the governing flow equations. Examples of such code reuse include multistage Runge-Kutta schemes coupled with multigrid, approximate-factorization, line-implicit Gauss-Seidel, and also preconditioned GMRES. The development of the adjoint method for aerodynamic optimization problems on Cartesian grids has been limited. In contrast to implementations on structured and unstructured grids, Cartesian grid methods decouple the surface discretization from the volume grid. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin e t al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation.

Nemec, Marian↗
NASA NTRS2007

Trigger and Reconstruction Algorithms for the Japanese Experiment Module- Extreme Universe Space Observatory (JEM-EUSO)

The JEM-EUSO collaboration intends to study high energy cosmic ray showers using a large downward looking telescope mounted on the Japanese Experiment Module of the International Space Station. The telescope focal plane is instrumented with approx.300k pixels operating as a digital camera, taking snapshots at approx. 1MHz rate. We report an investigation of the trigger and reconstruction efficiency of various algorithms based on time and spatial analysis of the pixel images. Our goal is to develop trigger and reconstruction algorithms that will allow the instrument to detect energies low enough to connect smoothly to ground-based observations.

Adams, J. H., Jr.↗
DOE OSTI2025

HighDimMixedModels.jl: Robust high-dimensional mixed-effects models across omics data

High-dimensional mixed-effects models are an increasingly important form of regression in which the number of covariates rivals or exceeds the number of samples, which are collected in groups or clusters. The penalized likelihood approach to fitting these models relies on a coordinate descent algorithm that lacks guarantees of convergence to a global optimum. Here, we empirically study the behavior of this algorithm on simulated and real examples of three types of data that are common in modern biology: transcriptome, genome-wide association, and microbiome data. Our simulations provide new insights into the algorithm’s behavior in these settings, and, comparing the performance of two popular penalties, we demonstrate that the smoothly clipped absolute deviation (SCAD) penalty consistently outperforms the least absolute shrinkage and selection operator (LASSO) penalty in terms of both variable selection and estimation accuracy across omics data. To empower researchers in biology and other fields to fit models with the SCAD penalty, we implement the algorithm in a Julia package, HighDimMixedModels.jl .

Gorstein, Evan↗
NASA NTRS1986

An example of scaling MST Doppler spectra using median spectra, spectral smoothing, and velocity tracing

Although automatic, computer scaling methods appeared at the start of the MST (mesosphere stratosphere troposphere) radar technique, there is a continuing need for scaling algorithms that perform editing functions and increase the sensitivity of radar by post processing. The scaling method presented is an adaptation of the method of scaling MST Doppler spectra presented by Rastogi (1984). A brief overview of this method is as follows: a median spectrum is calculated from several sequential spectra; the median noise value is subtracted from this derived spectrum; the median spectrum is smoothed; the detection/nondetection decision is made by comparing the smoothed spectrum to the variance of the smoothed noise; and if a signal is detected, then the half-power points of the smoothed echo spectrum are used to place limits on the evaluation of the first two moments of the unsmoothed median spectrum. In all of the above steps, the algorithm is guided by tracing the expected velocity range upward from the lowest range as far as possible. The method is discussed in more detail.

Green, J. L.↗
NASA NTRS1988

Automatic line generalization using zero-crossings

The problem of automating the process of line generalization has been very difficult. It has not been solved yet despite the concerted effort of many private firms as well as government agencies. There does not exist an algorithm which can automatically perform this process when there is a drastic change in scale between the original and generalized maps. In this paper, an algorithm which is successful in automatically generalizing lines from any large scale to any small scale is presented. The algorthm achieves different levels of smoothing the line while preserving the overall shape of the line. The results are compared with those obtained by manual methods. It was found that the results obtained by the algorithm are very close to those obtained by cartographers using manual methods.

Thapa, K.↗
NASA NTRS1973

A method for digital image registration using a mathematical programming technique

A new algorithm based on a nonlinear programming technique to correct the geometrical distortions of one digital image with respect to another is discussed. This algorithm promises to be superior to existing ones in that it is capable of treating localized differential scaling, translational and rotational errors over the whole image plane. A series of piece-wise 'rubber-sheet' approximations are used, constrained in such a manner that a smooth approximation over the entire image can be obtained. The theoretical derivation is included. The result of using the algorithm to register four channel S065 Apollo IX digitized photography over Imperial Valley, California, is discussed in detail.

Yao, S. S.↗
DOE OSTI2022

Red Dragon: a redshift-evolving Gaussian mixture model for galaxies

ABSTRACT Precision-era optical cluster cosmology calls for a precise definition of the red sequence (RS), consistent across redshift. To this end, we present the Red Dragon algorithm: an error-corrected multivariate Gaussian mixture model (GMM). Simultaneous use of multiple colours and smooth evolution of GMM parameters result in a continuous RS and blue cloud (BC) characterization across redshift, avoiding the discontinuities of red fraction inherent in swapping RS selection colours. Based on a mid-redshift spectroscopic sample of SDSS galaxies, an RS defined by Red Dragon selects quiescent galaxies (low specific star formation rate) with a balanced accuracy of over $90{{\ \rm per\ cent}}$. This approach to galaxy population assignment gives more natural separations between RS and BC galaxies than hard cuts in colour–magnitude or colour–colour spaces. The Red Dragon algorithm is publicly available at bitbucket.org/wkblack/red-dragon-gamma/.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1981

General relaxation schemes in multigrid algorithms for higher order singularity methods

Relaxation schemes based on approximate and incomplete factorization technique (AF) are described. The AF schemes allow construction of a fast multigrid method for solving integral equations of the second and first kind. The smoothing factors for integral equations of the first kind, and comparison with similar results from the second kind of equations are a novel item. Application of the MD algorithm shows convergence to the level of truncation error of a second order accurate panel method.

Oskam, B.↗
NASA NTRSDate not supplied

Development of the GeoNEX Level 2G Products: Exploiting the Diurnal Variability of TOA Reflectance in Atmospheric Correction

This study develops a new atmospheric correction algorithm to generate the Level 2G products, in particular the gap-filled Surface Reflectance at 10-minute time steps, for the Geostationary-NASA Earth Exchange (GeoNEX) project. The algorithm is based on the MODIS MAIAC (Multi-Angle Implementation of Atmospheric Correction) framework but with significant modifications to exploit angular/temporal information from the diurnal variability of the GeoNEX L1G TOA (Top-of-Atmosphere) reflectance. The algorithm starts by evaluating the roughness/smoothness of the diurnal time series of the TOA reflectance. Because rapid changes in TOA reflectance are generally caused by passing clouds or shadows, rough segments of the time series are automatically filtered out while the smooth segments are further tested for brightness and temperature to identify clear-sky and snow-free observations. Next the algorithm runs the MAIAC RTM (Radiative Transfer Model) to retrieve the Ross-Thick-Li-Sparse (RTLS) BRDF model parameters and the daily-mean atmospheric optical depth (AOD) that allow the RTM to optimally simulate the observed diurnal variability of clear-sky TOA reflectance. Once the initial RTLS parameters are retrieved after the algorithm’s burn-in period, they are used as the prior information to predict the AOD level for the next days, while the subsequent clear-sky observations are used to make necessary adjustments to the RTLS parameters in an continuous fashion. This “prediction-analysis” cycle is then iterated to process the full time series of the L1G data, skipping only total-cloudy days or when surface snow is detected. We tested the algorithm over a list of selected AERONET sites. The retrieved results (the daily mean AOD and the RTLS parameters) reasonably agree with the ground-based measurements. Importantly, the results indicate that the diurnal cycles of surface reflectance are continuous functions of the illumination-view geometry. Thus we can use the retrieved RTLS model to accurately fill in data gaps on partial cloudy days. Also, our algorithm is totally independent from the traditional approaches based on the use of spectral band ratios between the shortwave infrared (e.g., 2.2µm) and the visible (e.g., 0.47µm and 0.64µm) bands. Our results thus demonstrate that the high-frequent diurnal geostationary observations contain unique information that helps us improve atmospheric correction of remote sensing data.

GeoNEX↗
DOE OSTI2023

A sharp interface Lagrangian-Eulerian method for flexible-body fluid-structure interaction

This paper introduces a sharp-interface approach to simulating fluid-structure interaction (FSI) involving flexible bodies described by general nonlinear material models and across a broad range of mass density ratios. This new flexible-body immersed Lagrangian-Eulerian (ILE) scheme extends our prior work on integrating partitioned and immersed approaches to rigid-body FSI. Our numerical approach incorporates the geometrical and domain solution flexibility of the immersed boundary (IB) method with an accuracy comparable to body-fitted approaches that sharply resolve flows and stresses up to the fluid-structure interface. Unlike many IB methods, our ILE formulation uses distinct momentum equations for the fluid and solid subregions with a Dirichlet-Neumann coupling strategy that connects fluid and solid subproblems through simple interface conditions. As in earlier work, we use approximate Lagrange multiplier forces to treat the kinematic interface conditions along the fluid-structure interface. This penalty approach simplifies the linear solvers needed by our formulation by introducing two representations of the fluid-structure interface, one that moves with the fluid and another that moves with the structure, that are connected by stiff springs. This approach also enables the use of multi-rate time stepping, which allows us to use different time step sizes for the fluid and structure subproblems. Our fluid solver relies on an immersed interface method (IIM) for discrete surfaces to impose stress jump conditions along complex interfaces while enabling the use of fast structured-grid solvers for the incompressible Navier-Stokes equations. The dynamics of the volumetric structural mesh are determined using a standard finite element approach to large-deformation nonlinear elasticity via a nearly incompressible solid mechanics formulation. This formulation also readily accommodates compressible structures with a constant total volume, and it can handle fully compressible solid structures for cases in which at least part of the solid boundary does not contact the incompressible fluid. Selected grid convergence studies demonstrate second-order convergence in volume conservation and in the pointwise discrepancies between corresponding positions of the two interface representations as well as between first and second-order convergence in the structural displacements. The time stepping scheme is also demonstrated to yield second-order convergence. To assess and validate the robustness and accuracy of the new algorithm, comparisons are made with computational and experimental FSI benchmarks. Test cases include both smooth and sharp geometries in various flow conditions. Furthermore, we also demonstrate the capabilities of this methodology by applying it to model the transport and capture of a geometrically realistic, deformable blood clot in an inferior vena cava filter.

97 MATHEMATICS AND COMPUTING↗