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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Multigrid solution of the Navier-Stokes equations on triangular meshes

A Navier-Stokes algorithm for use on unstructured triangular meshes is presented. Spatial discretization of the governing equations is achieved using a finite element Galerkin approximation, which can be shown to be equivalent to a finite volume approximation for regular equilateral triangular meshes. Integration steady-state is performed using a multistage time-stepping scheme, and convergence is accelerated by means of implicit residual smoothing and an unstructured multigrid algorithm. Directional scaling of the artificial dissipation and the implicit residual smoothing operator is achieved for unstructured meshes by considering local mesh stretching vectors at each point. The accuracy of the scheme for highly stretched triangular meshes is validated by comparing computed flat-plate laminar boundary layer results with the well known similarity solution, and by comparing laminar airfoil results with those obtained from various well-established structured quadrilateral-mesh codes. The convergence efficiency of the present method is also shown to be competitive with those demonstrated by structured quadrilateral-mesh algorithms.

Mavriplis, Dimitri J.↗
NASA NTRS1990

Multigrid solution of the Navier-Stokes equations on triangular meshes

A Navier-Stokes algorithm for use on unstructured triangular meshes is presented. Spatial discretization of the governing equations is achieved using a finite element Galerkin approximation, which can be shown to be equivalent to a finite volume approximation for regular equilateral triangular meshes. Integration steady-state is performed using a multistage time-stepping scheme, and convergence is accelerated by means of implicit residual smoothing and an unstructured multigrid algorithm. Directional scaling of the artificial dissipation and the implicit residual smoothing operator is achieved for unstructured meshes by considering local mesh stretching vectors at each point. The accuracy of the scheme for highly stretched triangular meshes is validated by comparing computed flat-plate laminar boundary layer results with the well known similarity solution, and by comparing laminar airfoil results with those obtained from various well-established structured quadrilateral-mesh codes. The convergence efficiency of the present method is also shown to be competitive with those demonstrated by structured quadrilateral-mesh algorithms.

Mavriplis, D. J.↗
NASA NTRS1991

Parallel unstructured grid generation

A parallel unstructured grid generation algorithm is presented and implemented on the Hypercube. Different processor hierarchies are discussed, and the appropraite hierarchies for mesh generation and mesh smoothing are selected. A domain-splitting algorithm for unstructured grids which tries to minimize the surface-to-volume ratio of each subdomain is described. This splitting algorithm is employed both for grid generation and grid smoothing. Results obtained on the Hypercube demonstrate the effectiveness of the algorithms developed.

Loehner, Rainald↗
NASA NTRS1991

Efficient control with an order (n) recursive inversion of the Jacobian for an n-link serial manipulator

A method is presented to order (n) recursively invert the Jacobian matrix for a serial n-link manipulator. By realizing that the Jacobian relationship involving accelerations is a special case for the forward dynamics problem, it is possible to obtain the Jacobian inverse by directly applying Rodriguez's (1987) recursive forward dynamics algorithm. In this technique, the n-link robot equation is formulated as a spatially recursive algorithm in the form of a filtering and smoothing problem. To compute the Jacobian inverse via this algorithm, the n-link manipulator is modeled with only a unit end-point mass and zero applied torques.

Meldrum, D. R.↗
NASA NTRS1985

Implicit finite-difference methods for the Euler equations

The present paper is concerned with two-dimensional Euler equations and with schemes which are in use of the time of this writing. Most of the development presented carries over directly to three dimensions. The characteristics of the two-dimensional Euler equations in Cartesian coordinates are considered along with generalized curvilinear coordinate transformations, metric relations, invariants of the transformation, flux Jacobian matrices and eigensystems, numerical algorithms, flux split algorithms, implicit and explicit nonlinear control (smoothing), upwind differencing in supersonic regions, unsteady and steady-state computation, the diagonal form of implicit algorithm, metric differencing and invariants, boundary conditions, geometry and mesh generation, and sample solutions.

Pulliam, T. H.↗
NASA NTRS2012

An Enhanced TIMESAT Algorithm for Estimating Vegetation Phenology Metrics from MODIS Data

An enhanced TIMESAT algorithm was developed for retrieving vegetation phenology metrics from 250 m and 500 m spatial resolution Moderate Resolution Imaging Spectroradiometer (MODIS) vegetation indexes (VI) over North America. MODIS VI data were pre-processed using snow-cover and land surface temperature data, and temporally smoothed with the enhanced TIMESAT algorithm. An objective third derivative test was applied to define key phenology dates and retrieve a set of phenology metrics. This algorithm has been applied to two MODIS VIs: Normalized Difference Vegetation Index (NDVI) and Enhanced Vegetation Index (EVI). In this paper, we describe the algorithm and use EVI as an example to compare three sets of TIMESAT algorithm/MODIS VI combinations: a) original TIMESAT algorithm with original MODIS VI, b) original TIMESAT algorithm with pre-processed MODIS VI, and c) enhanced TIMESAT and pre-processed MODIS VI. All retrievals were compared with ground phenology observations, some made available through the National Phenology Network. Our results show that for MODIS data in middle to high latitude regions, snow and land surface temperature information is critical in retrieving phenology metrics from satellite observations. The results also show that the enhanced TIMESAT algorithm can better accommodate growing season start and end dates that vary significantly from year to year. The TIMESAT algorithm improvements contribute to more spatial coverage and more accurate retrievals of the phenology metrics. Among three sets of TIMESAT/MODIS VI combinations, the start of the growing season metric predicted by the enhanced TIMESAT algorithm using pre-processed MODIS VIs has the best associations with ground observed vegetation greenup dates.

Tan, Bin↗
NASA NTRS2009

NO2 Total and Tropospheric Vertical Column Densities from OMI on EOS Aura: Update

The Ozone Monitoring Instrument (OMI), which is on the EOS AURA satellite, retrieves vertical column densities (VCDs) of NO2, along with those of several other trace gases. The relatively high spatial resolution and daily global coverage of the instrument make it particularly well-suited to monitoring tropospheric pollution at scales on the order of 20 km. The OMI NO2 algorithm distinguishes polluted regions from background stratospheric NO2 using a separation algorithm that relies on the smoothly varying stratospheric NO2 and estimations of both stratospheric and tropospheric air mass factors (AMFs). Version 1 of OMI NO2 data has been released for public use. An overview of OMI NO2 data, some recent results and a description of the improvements for version 2 of the algorithm will be presented.

Gleason, J.F.↗
NASA NTRS1989

Multigrid solution of the Navier-Stokes equations on triangular meshes

A new Navier-Stokes algorithm for use on unstructured triangular meshes is presented. Spatial discretization of the governing equations is achieved using a finite-element Galerkin approximation, which can be shown to be equivalent to a finite-volume approximation for regular equilateral triangular meshes. Integration to steady-state is performed using a multistage time-stepping scheme, and convergence is accelerated by means of implicit residual smoothing and an unstructured multigrid algorithm. The convergence efficiency of the present method is shown to be competitive with those demonstrated by structured quadrilateral-mesh algorithms.

Mavriplis, D. J.↗
NASA NTRS1994

An algorithm for solving the system-level problem in multilevel optimization

A multilevel optimization approach which is applicable to nonhierarchic coupled systems is presented. The approach includes a general treatment of design (or behavior) constraints and coupling constraints at the discipline level through the use of norms. Three different types of norms are examined: the max norm, the Kreisselmeier-Steinhauser (KS) norm, and the 1(sub p) norm. The max norm is recommended. The approach is demonstrated on a class of hub frame structures which simulate multidisciplinary systems. The max norm is shown to produce system-level constraint functions which are non-smooth. A cutting-plane algorithm is presented which adequately deals with the resulting corners in the constraint functions. The algorithm is tested on hub frames with increasing number of members (which simulate disciplines), and the results are summarized.

Balling, R. J.↗
NASA NTRS1984

Radar data smoothing filter study

The accuracy of the current Wallops Flight Facility (WFF) data smoothing techniques for a variety of radars and payloads is examined. Alternative data reduction techniques are given and recommendations are made for improving radar data processing at WFF. A data adaptive algorithm, based on Kalman filtering and smoothing techniques, is also developed for estimating payload trajectories above the atmosphere from noisy time varying radar data. This algorithm is tested and verified using radar tracking data from WFF.

White, J. V.↗
NASA NTRS1992

An advancing front Delaunay triangulation algorithm designed for robustness

A new algorithm is described for generating an unstructured mesh about an arbitrary two-dimensional configuration. Mesh points are generated automatically by the algorithm in a manner which ensures a smooth variation of elements, and the resulting triangulation constitutes the Delaunay triangulation of these points. The algorithm combines the mathematical elegance and efficiency of Delaunay triangulation algorithms with the desirable point placement features, boundary integrity, and robustness traditionally associated with advancing-front-type mesh generation strategies. The method offers increased robustness over previous algorithms in that it cannot fail regardless of the initial boundary point distribution and the prescribed cell size distribution throughout the flow-field.

Mavriplis, D. J.↗
NASA NTRS1993

An advancing front Delaunay triangulation algorithm designed for robustness

A new algorithm is described for generating an unstructured mesh about an arbitrary two-dimensional configuration. Mesh points are generated automatically by the algorithm in a manner which ensures a smooth variation of elements, and the resulting triangulation constitutes the Delaunay triangulation of these points. The algorithm combines the mathematical elegance and efficiency of Delaunay triangulation algorithms with the desirable point placement features, boundary integrity, and robustness traditionally associated with advancing-front-type mesh generation strategies. The method offers increased robustness over previous algorithms in that it cannot fail regardless of the initial boundary point distribution and the prescribed cell size distribution throughout the flow-field.

Mavriplis, D. J.↗
NASA NTRS1972

Spline smoothing of histograms by linear programming

An algorithm for an approximating function to the frequency distribution is obtained from a sample of size n. To obtain the approximating function a histogram is made from the data. Next, Euclidean space approximations to the graph of the histogram using central B-splines as basis elements are obtained by linear programming. The approximating function has area one and is nonnegative.

Bennett, J. O.↗
NASA NTRS2013

Discrete Surface Evolution and Mesh Deformation for Aircraft Icing Applications

Robust, automated mesh generation for problems with deforming geometries, such as ice accreting on aerodynamic surfaces, remains a challenging problem. Here we describe a technique to deform a discrete surface as it evolves due to the accretion of ice. The surface evolution algorithm is based on a smoothed, face-offsetting approach. We also describe a fast algebraic technique to propagate the computed surface deformations into the surrounding volume mesh while maintaining geometric mesh quality. Preliminary results presented here demonstrate the ecacy of the approach for a sphere with a prescribed accretion rate, a rime ice accretion, and a more complex glaze ice accretion.

ice accretion↗
NASA NTRS1991

The Marshall Engineering Thermosphere model atmosphere Statistical Analysis Mode (MET-SAM)

The minimum, mean, and maximum exospheric temperature on the globe were calculated for every three hour period from 1947 through 1989 using the algorithms in the Marshall Engineering Thermosphere (MET) model and the appropriate solar activity input parameters. Cumulative percent frequency (CPF) distributions were then calculated for each of these temperatures at five levels of solar activity as defined by the 13-month smoothed values of the 10.7-cm solar radio noise flux. Next, the 50, 95, 97.7, and 100 percentile temperature values in each of these five levels of solar activity were curve fit as a function of the 13-month smoothed 10.7-cm flux. The resulting algorithms are used to compute the exospheric temperature in the MET model instead of the technique developed by Jacchia in his 1970 model. These temperatures are then used to enter tables to determine the total mass density and/or the atomic oxygen number density for application to engineering problems. Users can specify the risk level they are willing to accept in the results of analyses that require neutral atmosphere parameters inputs. The model eliminates the guess work in how to combine the solar activity input parameters to insure that the results provide answers at the proper risk levels.

Smith, Robert E.↗
NASA NTRS2003

Rough-Wall Channel Analysis Using Suboptimal Control Theory

The original aim of this work was to shed some light on the physics of turbulence over rough walls using large-eddy simulations and the suboptimal-control wall boundary conditions introduced by Nicoud et al. It was hoped that, if that algorithm was used to fit the mean velocity profile of the simulations to that of a rough-walled channel, instead of to a smooth one, the wall stresses introduced by the control algorithm would give some indication of what aspects of rough walls are most responsible for the modification of the flow in real turbulence. It was similarly expected that the structure of the resulting velocity fluctuations would share some of the characteristics of rough-walled flows, thus again suggesting what is intrinsic and what is accidental in the effect of geometric wall roughness. A secondary goal was to study the effect of 'unphysical' boundary conditions on the outside flow by observing how a relatively major change of the target velocity profile, and therefore presumably of the applied wall stresses, modifies properties such as the dominant length scales of the velocity fluctuations away from the wall. As will be seen below, this secondary goal grew more important during the course of the study, which was carried out during a short summer visit of the first two authors to the CTR. It became clear that there are open questions about the way in which the control algorithm models the boundary conditions, even for smooth walls, and that these questions make the physical interpretation of the results difficult. Considerable more work in that area seems to be needed before even relatively advanced large-eddy simulations, such as these, can be used to draw conclusions about the physics of wall-bounded turbulent flows. The numerical method is the same as in Nicoud et al. The modifications introduced in the original code are briefly described in section 2, but the original paper should be consulted for a full description of the algorithm. The results are presented in section 3 and summarized in section 4. The elementary properties of turbulence over rough walls which are used in the text have been taken from recent reviews such as Raupach et al. or Jimenez.

Flores, O.↗
NASA NTRS2012

Using Information From Prior Satellite Scans to Improve Cloud Detection Near the Day-Night Terminator

With geostationary satellite data it is possible to have a continuous record of diurnal cycles of cloud properties for a large portion of the globe. Daytime cloud property retrieval algorithms are typically superior to nighttime algorithms because daytime methods utilize measurements of reflected solar radiation. However, reflected solar radiation is difficult to accurately model for high solar zenith angles where the amount of incident radiation is small. Clear and cloudy scenes can exhibit very small differences in reflected radiation and threshold-based cloud detection methods have more difficulty setting the proper thresholds for accurate cloud detection. Because top-of-atmosphere radiances are typically more accurately modeled outside the terminator region, information from previous scans can help guide cloud detection near the terminator. This paper presents an algorithm that uses cloud fraction and clear and cloudy infrared brightness temperatures from previous satellite scan times to improve the performance of a threshold-based cloud mask near the terminator. Comparisons of daytime, nighttime, and terminator cloud fraction derived from Geostationary Operational Environmental Satellite (GOES) radiance measurements show that the algorithm greatly reduces the number of false cloud detections and smoothes the transition from the daytime to the nighttime clod detection algorithm. Comparisons with the Geoscience Laser Altimeter System (GLAS) data show that using this algorithm decreases the number of false detections by approximately 20 percentage points.

Yost, Christopher R.↗