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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

Multigrid Approach to Incompressible Viscous Cavity Flows

Two-dimensional incompressible viscous driven-cavity flows are computed for Reynolds numbers on the range 100-20,000 using a loosely coupled, implicit, second-order centrally-different scheme. Mesh sequencing and three-level V-cycle multigrid error smoothing are incorporated into the symmetric Gauss-Seidel time-integration algorithm. Parametrics on the numerical parameters are performed, achieving reductions in solution times by more than 60 percent with the full multigrid approach. Details of the circulation patterns are investigated in cavities of 2-to-1, 1-to-1, and 1-to-2 depth to width ratios.

Wood, William A.↗
NASA NTRS1995

Multiresolution Representation Using Biorthogonal Multiwavelets

We generalize Harten's multiresolution representation to biorthogonal multiwavelets. Several variants are considered. For example, a given array of discrete point values is transformed to point values and derivatives or point 'values and cell averages'. Compact Hermite interpolation is used in the decomposition and reconstruction algorithm. The resulting basis functions that are symmetric or skewsymmetric, compact, and smooth with optimal order accuracy. Harten's approach has several advantages: the multiresolution scheme is inherently discrete, non-periodic boundary conditions are easy to implement, and the representation can be extended to unstructured grids in bounded domains. We demonstrate the compression features of the new mutliwavelets by application to variable scale piecewise smooth functions with jump discontinuities typical of numerical solutions of nonlinear hyperbolic conservation laws.

Warming, Robert F.↗
NASA NTRS2017

JIGSAW-GEO (1.0): Locally Orthogonal Staggered Unstructured Grid Generation for General Circulation Modelling on the Sphere

An algorithm for the generation of non-uniform, locally orthogonal staggered unstructured spheroidal grids is described. This technique is designed to generate very high-quality staggered VoronoiDelaunay meshes appropriate for general circulation modelling on the sphere, including applications to atmospheric simulation, ocean-modelling and numerical weather prediction. Using a recently developed Frontal-Delaunay refinement technique, a method for the construction of high-quality unstructured spheroidal Delaunay triangulations is introduced. A locally orthogonal polygonal grid, derived from the associated Voronoi diagram, is computed as the staggered dual. It is shown that use of the Frontal-Delaunay refinement technique allows for the generation of very high-quality unstructured triangulations, satisfying a priori bounds on element size and shape. Grid quality is further improved through the application of hill-climbing-type optimisation techniques. Overall, the algorithm is shown to produce grids with very high element quality and smooth grading characteristics, while imposing relatively low computational expense. A selection of uniform and non-uniform spheroidal grids appropriate for high-resolution, multi-scale general circulation modelling are presented. These grids are shown to satisfy the geometric constraints associated with contemporary unstructured C-grid-type finite-volume models, including the Model for Prediction Across Scales (MPAS-O). The use of user-defined mesh-spacing functions to generate smoothly graded, non-uniform grids for multi-resolution-type studies is discussed in detail.

geophysical fluid dynamics↗
NASA NTRSDate not supplied

A New Eclipse Algorithm for use in Spacecraft Trajectory Optimization

This paper presents a new eclipse algorithm, which determines if a spacecraft is in sunlight or shadow, that is simple to define, fast to compute, smooth and continuous in all regions external to the eclipsing body, and suitable for use in a spacecraft trajectory optimization problem. Details of the design evolution are presented, including the specifics of the algorithm's implementation in the trajectory design of NASA's Artemis I mission to a lunar DRO. Some alternate uses and discussion of future work is also presented.

Orion↗
NASA NTRS2006

Impact of Surface Roughness on AMSR-E Sea Ice Products

This paper examines the sensitivity of Advanced Microwave Scanning Radiometer (AMSR-E) brightness temperatures (Tbs) to surface roughness by a using radiative transfer model to simulate AMSR-E Tbs as a function of incidence angle at which the surface is viewed. The simulated Tbs are then used to examine the influence that surface roughness has on two operational sea ice algorithms, namely: 1) the National Aeronautics and Space Administration Team (NT) algorithm and 2) the enhanced NT algorithm, as well as the impact of roughness on the AMSR-E snow depth algorithm. Surface snow and ice data collected during the AMSR-Ice03 field campaign held in March 2003 near Barrow, AK, were used to force the radiative transfer model, and resultant modeled Tbs are compared with airborne passive microwave observations from the Polarimetric Scanning Radiometer. Results indicate that passive microwave Tbs are very sensitive even to small variations in incidence angle, which can cause either an over or underestimation of the true amount of sea ice in the pixel area viewed. For example, this paper showed that if the sea ice areas modeled in this paper mere assumed to be completely smooth, sea ice concentrations were underestimated by nearly 14% using the NT sea ice algorithm and by 7% using the enhanced NT algorithm. A comparison of polarization ratios (PRs) at 10.7,18.7, and 37 GHz indicates that each channel responds to different degrees of surface roughness and suggests that the PR at 10.7 GHz can be useful for identifying locations of heavily ridged or rubbled ice. Using the PR at 10.7 GHz to derive an "effective" viewing angle, which is used as a proxy for surface roughness, resulted in more accurate retrievals of sea ice concentration for both algorithms. The AMSR-E snow depth algorithm was found to be extremely sensitive to instrument calibration and sensor viewing angle, and it is concluded that more work is needed to investigate the sensitivity of the gradient ratio at 37 and 18.7 GHz to these factors to improve snow depth retrievals from spaceborne passive microwave sensors.

Stroeve, Julienne C.↗
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.↗
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.↗
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.↗
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↗
NASA NTRS1976

Optimal K/S impulsive transfer

The necessary equations in K/S variables (E-formulation) are developed for an optimal N-impulse solution of the time-open and rendezvous problems. The equations are particularly simple when only two impulses are assumed. The developed algorithm is extremely fast and reliable because the equations that must be solved are smooth, well-behaved (almost sinusoidal) functions. Numerical results for a two-impulse time-open and rendezvous problem are presented.

Jezewski, D. J.↗