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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 253 records · Page 14

All sources NASA NTRS DOE OSTI

NASA NTRS1994

Cold dark matter. 1: The formation of dark halos

We use numerical simulations of critically closed cold dark matter (CDM) models to study the effects of numerical resolution on observable quantities. We study simulations with up to 256(exp 3) particles using the particle-mesh (PM) method and with up to 144(exp 3) particles using the adaptive particle-particle-mesh (P3M) method. Comparisons of galaxy halo distributions are made among the various simulations. We also compare distributions with observations, and we explore methods for identifying halos, including a new algorithm that finds all particles within closed contours of the smoothed density field surrounding a peak. The simulated halos show more substructure than predicted by the Press-Schechter theory. We are able to rule out all omega = 1 CDM models for linear amplitude sigma(sub 8) greater than or approximately = 0.5 because the simulations produce too many massive halos compared with the observations. The simulations also produce too many low-mass halos. The distribution of halos characterized by their circular velocities for the P3M simulations is in reasonable agreement with the observations for 150 km/s less than or = V(sub circ) less than or = 350 km/s.

Gelb, James M.↗

NASA NTRS1994

Control of mechanical systems with rolling constraints: Application to dynamic control of mobile robots

There are many examples of mechanical systems that require rolling contacts between two or more rigid bodies. Rolling contacts engender nonholonomic constraints in an otherwise holonomic system. In this article, we develop a unified approach to the control of mechanical systems subject to both holonomic and nonholonomic constraints. We first present a state space realization of a constrained system. We then discuss the input-output linearization and zero dynamics of the system. This approach is applied to the dynamic control of mobile robots. Two types of control algorithms for mobile robots are investigated: trajectory tracking and path following. In each case, a smooth nonlinear feedback is obtained to achieve asymptotic input-output stability and Lagrange stability of the overall system. Simulation results are presented to demonstrate the effectiveness of the control algorithms and to compare the performane of trajectory-tracking and path-following algorithms.

Sarkar, Nilanjan↗

NASA NTRS1995

Rapid Numerical Simulation of Viscous Axisymmetric Flow Fields

A two-dimensional Navier-Stokes code has been developed for rapid numerical simulation of axisymmetric flow fields, including flow fields with an azimuthal velocity component. The azimuthal-invariant Navier-Stokes equations in a cylindrical coordinate system are mapped to a general body-fitted coordinate system, with the streamwise viscous terms then neglected by applying the thin-layer approximation. Turbulence effects are modeled using an algebraic model, typically the Baldwin-Lomax turbulence model, although a modified Cebeci-Smith model can also be used. The equations are discretized using central finite differences and solved using a multistage Runge-Kutta algorithm with a spatially varying time step and implicit residual smoothing. Results are presented for calculations of supersonic flow over a waisted body-of-revolution, transonic flow through a normal shock wave in a straight circular duct of constant cross sectional area, swirling supersonic (inviscid) flow through a strong shock in a straight radial duct, and swirling subsonic flow in an annular-to-circular diffuser duct. Comparisons between computed and experimental results are in fair to good agreement, demonstrating that the viscous code can be a useful tool for practical engineering design and analysis work.

Tweedt, Daniel L.↗

NASA NTRS2002

The Estimation Theory Framework of Data Assimilation

Lecture 1. The Estimation Theory Framework of Data Assimilation: 1. The basic framework: dynamical and observation models; 2. Assumptions and approximations; 3. The filtering, smoothing, and prediction problems; 4. Discrete Kalman filter and smoother algorithms; and 5. Example: A retrospective data assimilation system

Cohn, S.↗

NASA NTRS2011

Technique for Calculating Solution Derivatives With Respect to Geometry Parameters in a CFD Code

A solution has been developed to the challenges of computation of derivatives with respect to geometry, which is not straightforward because these are not typically direct inputs to the computational fluid dynamics (CFD) solver. To overcome these issues, a procedure has been devised that can be used without having access to the mesh generator, while still being applicable to all types of meshes. The basic approach is inspired by the mesh motion algorithms used to deform the interior mesh nodes in a smooth manner when the surface nodes, for example, are in a fluid structure interaction problem. The general idea is to model the mesh edges and nodes as constituting a spring-mass system. Changes to boundary node locations are propagated to interior nodes by allowing them to assume their new equilibrium positions, for instance, one where the forces on each node are in balance. The main advantage of the technique is that it is independent of the volumetric mesh generator, and can be applied to structured, unstructured, single- and multi-block meshes. It essentially reduces the problem down to defining the surface mesh node derivatives with respect to the geometry parameters of interest. For analytical geometries, this is quite straightforward. In the more general case, one would need to be able to interrogate the underlying parametric CAD (computer aided design) model and to evaluate the derivatives either analytically, or by a finite difference technique. Because the technique is based on a partial differential equation (PDE), it is applicable not only to forward mode problems (where derivatives of all the output quantities are computed with respect to a single input), but it could also be extended to the adjoint problem, either by using an analytical adjoint of the PDE or a discrete analog.

Mathur, Sanjay↗

NASA NTRS1986

The expanded LaGrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrainted optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗

NASA NTRS1988

The expanded Lagrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrained optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗

NASA NTRS1992

Two Algorithms For Hypersonic Computations

Two new algorithms developed containing several desirable features for computation of viscous, hypersonic flows about three-dimensional geometries. Employ upwind-differencing methods, having unsurpassed abiltiy to capture flow-field discontinuities without need for any user-specified smoothing terms. Particularly important in hypersonic computations where many complicated wave structures exist. Both algorithms based on finite-volume formulation to ensure schemes, including boundary conditions, fully conservative.

Molvik, G. A.↗

NASA NTRS1992

An efficient and robust algorithm for time dependent viscous incompressible Navier-Stokes equations

A recently developed finite difference algorithm is presented for steady incompressible Navier-Stokes calculations. The algorithm is extremely robust with respect to Reynolds number, and has been used to directly compute incompressible flows with smoothly resolved streamfunction, kinetic energy and vorticity contours for Reynolds numbers as high as Re = 100,000 without requiring any subscale modelling. The algorithm is second order accurate in both time and space, with Crank-Nicolson differencing for the diffusion terms, with a lagged second order Adams-Basforth differencing for the convection terms, and with central differencing for all space derivatives. The algorithm is extremely efficient with respect to both computing time and physical memory. Solutions are shown for cavity and channel flows at various Reynolds numbers.

Goodrich, John W.↗

NASA NTRS2013

Building a 2.5D Digital Elevation Model from 2D Imagery

When projecting imagery into a georeferenced coordinate frame, one needs to have some model of the geographical region that is being projected to. This model can sometimes be a simple geometrical curve, such as an ellipse or even a plane. However, to obtain accurate projections, one needs to have a more sophisticated model that encodes the undulations in the terrain including things like mountains, valleys, and even manmade structures. The product that is often used for this purpose is a Digital Elevation Model (DEM). The technology presented here generates a high-quality DEM from a collection of 2D images taken from multiple viewpoints, plus pose data for each of the images and a camera model for the sensor. The technology assumes that the images are all of the same region of the environment. The pose data for each image is used as an initial estimate of the geometric relationship between the images, but the pose data is often noisy and not of sufficient quality to build a high-quality DEM. Therefore, the source imagery is passed through a feature-tracking algorithm and multi-plane-homography algorithm, which refine the geometric transforms between images. The images and their refined poses are then passed to a stereo algorithm, which generates dense 3D data for each image in the sequence. The 3D data from each image is then placed into a consistent coordinate frame and passed to a routine that divides the coordinate frame into a number of cells. The 3D points that fall into each cell are collected, and basic statistics are applied to determine the elevation of that cell. The result of this step is a DEM that is in an arbitrary coordinate frame. This DEM is then filtered and smoothed in order to remove small artifacts. The final step in the algorithm is to take the initial DEM and rotate and translate it to be in the world coordinate frame [such as UTM (Universal Transverse Mercator), MGRS (Military Grid Reference System), or geodetic] such that it can be saved in a standard DEM format and used for projection.

Padgett, Curtis W.↗

NASA NTRS1986

Intelligent information extraction from reflectance spectra Absorption band positions

A multiple high-order derivative analysis algorithm has been developed which can automatically extract absorption band positions from low-quality reflectance spectra with little degredation of accuracy. Overlapping bands with comparable widths and intensities can be resolved whose centers are as close as 0.3-0.5 W, with safer resolution limits of 0.6-1.0 W band center separations suggested for overlapping bands that are dissimilar. The segment length for smoothing is continually adjusted to about 0.5 W to minimize signal distortion, and a spectral pattern recognition algorithm predicts the signal spectrum and calculates approximate W across the spectrum using its second derivative. A single-pass cubic spline is applied to the smoothed data, and a sliding segment sixth-order polynomial is fit to the spectrum, with the length of the segment being continuously locally adjusted to 1.0 W across the spectrum. Good reliability and consistency of the algorithm is demonstrated with application to laboratory and earth-based telescope spectra.

Huguenin, R. L.↗

DOE OSTI2022

S-PLUS DR1 galaxy clusters and groups catalogue using PzWav

ABSTRACT We present a catalogue of 4499 groups and clusters of galaxies from the first data release of the multi-filter (5 broad, 7 narrow) Southern Photometric Local Universe Survey (S-PLUS). These groups and clusters are distributed over 273 deg2 in the Stripe 82 region. They are found using the PzWav algorithm, which identifies peaks in galaxy density maps that have been smoothed by a cluster scale difference-of-Gaussians kernel to isolate clusters and groups. Using a simulation-based mock catalogue, we estimate the purity and completeness of cluster detections: at S/N > 3.3, we define a catalogue that is 80 per cent pure and complete in the redshift range 0.1 < z < 0.4, for clusters with M200 > 1014 M⊙. We also assessed the accuracy of the catalogue in terms of central positions and redshifts, finding scatter of σR = 12 kpc and σz = 8.8 × 10−3, respectively. Moreover, less than 1 per cent of the sample suffers from fragmentation or overmerging. The S-PLUS cluster catalogue recovers ∼80 per cent of all known X-ray and Sunyaev-Zel’dovich selected clusters in this field. This fraction is very close to the estimated completeness, thus validating the mock data analysis and paving an efficient way to find new groups and clusters of galaxies using data from the ongoing S-PLUS project. When complete, S-PLUS will have surveyed 9300 deg2 of the sky, representing the widest uninterrupted areas with narrow-through-broad multi-band photometry for cluster follow-up studies.

Astronomy & Astrophysics↗

NASA NTRS1988

Numerical analysis of three-dimensional viscous internal flows

A 3-D Navier-Stokes code has been developed for analysis of turbomachinery blade rows and other internal flows. The Navier-Stokes equations are written in a Cartesian coordinate system rotating about the x-axis, and then mapped to a general body-fitted coordinate system. Streamwise viscous terms are neglected using the thin-layer assumption, and turbulence effects are modeled using the Baldwin-Lomax turbulence model. The equations are discretized using finite differences on stacked C-type grids and are solved using a multistage Runge-Kutta algorithm with a spatially-varying time step and implicit residual smoothing. Calculations have been made of a horseshoe vortex formed in front of a flat plate with a round leading edge standing in a turbulent endwall boundary layer. Comparisons are made with experimental data taken by Eckerle and Langston for a circular cylinder under similar conditions. Computer and measured results are compared in terms of endwall flow visualization pictures and total pressure loss contours and vector plots on the symmetry plane. Calculated details of the primary vortex show excellent agreement with the experimental data. The calculations also show a small secondary vortex not seen experimentally.

Chima, Rodrick V.↗

NASA NTRS1988

Numerical analysis of three-dimensional viscous internal flows

Chima, Rodrick V.↗

NASA NTRS1989

The 4D-TECS integration for NASA TSRV airplane

The integration of the Total Energy Control System (TECS) concept with 4D navigation is described. This integration was made to increase the operational capacity of modern aircraft and encourage incorporation of this increased capability with the evolving National Airspace System (NAS). Described herein is: 4D smoothing, the basic concepts of TECS, the spoiler integration concept, an algorithm for nulling out time error, speed and altitude profile modes, manual spoiler implementation, 4D logic, and the results of linear and nonlinear analysis.

Kaminer, I.↗

NASA NTRS1990

A circular median filter approach for resolving directional ambiguities in wind fields retrieved from spaceborne scatterometer data

The retrieval algorithm for spaceborne scatterometry proposed by Schultz (1985) is extended. A circular median filter (CMF) method is presented, which operates on wind directions independently of wind speed, removing any implicit wind speed dependence. A cell weighting scheme is included in the algorithm, permitting greater weights to be assigned to more reliable data. The mathematical properties of the ambiguous solutions to the wind retrieval problem are reviewed. The CMF algorithm is tested on twelve simulated data sets. The effects of spatially correlated likelihood assignment errors on the performance of the CMF algorithm are examined. Also, consideration is given to a wind field smoothing technique that uses a CMF.

Schultz, Howard↗

NASA NTRS1991

Description of real-time Ada software implementation of a power system monitor for the Space Station Freedom PMAD DC testbed

The Ada language software development to perform the electrical system monitoring functions for the NASA Lewis Research Center's Power Management and Distribution (PMAD) DC testbed is described. The results of the effort to implement this monitor are presented. The PMAD DC testbed is a reduced-scale prototype of the electrical power system to be used in the Space Station Freedom. The power is controlled by smart switches known as power control components (or switchgear). The power control components are currently coordinated by five Compaq 382/20e computers connected through an 802.4 local area network. One of these computers is designated as the control node with the other four acting as subsidiary controllers. The subsidiary controllers are connected to the power control components with a Mil-Std-1553 network. An operator interface is supplied by adding a sixth computer. The power system monitor algorithm is comprised of several functions including: periodic data acquisition, data smoothing, system performance analysis, and status reporting. Data is collected from the switchgear sensors every 100 milliseconds, then passed through a 2 Hz digital filter. System performance analysis includes power interruption and overcurrent detection. The reporting mechanism notifies an operator of any abnormalities in the system. Once per second, the system monitor provides data to the control node for further processing, such as state estimation. The system monitor required a hardware time interrupt to activate the data acquisition function. The execution time of the code was optimized using an assembly language routine. The routine allows direct vectoring of the processor to Ada language procedures that perform periodic control activities. A summary of the advantages and side effects of this technique are discussed.

Ludwig, Kimberly↗

NASA NTRS1991

Image gathering and digital restoration for fidelity and visual quality

The fidelity and resolution of the traditional Wiener restorations given in the prevalent digital processing literature can be significantly improved when the transformations between the continuous and discrete representations in image gathering and display are accounted for. However, the visual quality of these improved restorations also is more sensitive to the defects caused by aliasing artifacts, colored noise, and ringing near sharp edges. In this paper, these visual defects are characterized, and methods for suppressing them are presented. It is demonstrated how the visual quality of fidelity-maximized images can be improved when (1) the image-gathering system is specifically designed to enhance the performance of the image-restoration algorithm, and (2) the Wiener filter is combined with interactive Gaussian smoothing, synthetic high edge enhancement, and nonlinear tone-scale transformation. The nonlinear transformation is used primarily to enhance the spatial details that are often obscurred when the normally wide dynamic range of natural radiance fields is compressed into the relatively narrow dynamic range of film and other displays.

Huck, Friedrich O.↗