Search NASA⌕ Search

SEARCH · Search NASA

Results for “Adaptive 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 19 records

An adaptive algorithm for motion compensated color image coding

This paper presents an adaptive algorithm for motion compensated color image coding. The algorithm can be used for video teleconferencing or broadcast signals. Activity segmentation is used to reduce the bit rate and a variable stage search is conducted to save computations. The adaptive algorithm is compared with the nonadaptive algorithm and it is shown that with approximately 60 percent savings in computing the motion vector and 33 percent additional compression, the performance of the adaptive algorithm is similar to the nonadaptive algorithm. The adaptive algorithm results also show improvement of up to 1 bit/pel over interframe DPCM coding with nonuniform quantization. The test pictures used for this study were recorded directly from broadcast video in color.

Kwatra, Subhash C.↗

Flight data processing with the F-8 adaptive algorithm

An explicit adaptive control algorithm based on maximum likelihood estimation of parameters has been designed for NASA's DFBW F-8 aircraft. To avoid iterative calculations, the algorithm uses parallel channels of Kalman filters operating at fixed locations in parameter space. This algorithm has been implemented in NASA/DFRC's Remotely Augmented Vehicle (RAV) facility. Real-time sensor outputs (rate gyro, accelerometer and surface position) are telemetered to a ground computer which sends new gain values to an on-board system. Ground test data and flight records were used to establish design values of noise statistics and to verify the ground-based adaptive software. The software and its performance evaluation based on flight data are described

Hartmann, G.↗

Improvements to the LAURA Mesh Adaptation Algorithm

This paper describes recent improvements to the LAURA code that removes the requirementof unbroken body-normal lines when using the automated mesh adaptation algorithm inLAURA responsible for mesh alignment with shock and adjusting near-wall mesh spacing. Fornon-simple geometry, restricting block topologies such that blocks span the domain from thesurface wall boundaries to domain inflow boundary can be difficult or impossible. Removing thisrequirement enables novel block topologies that simplify the meshing workflow for LAURA users.The new adaptation algorithm implementation in LAURA is described and several examples ofthe adaptation are presented to demonstrate the efficacy of the adaptation algorithm.

LAURA↗

Improvements to the LAURA Mesh Adaptation Algorithm

This paper describes recent improvements to the LAURA code that removes the requirementof unbroken body-normal lines when using the automated mesh adaptation algorithm inLAURA responsible for mesh alignment with shock and adjusting near-wall mesh spacing. Fornon-simple geometry, restricting block topologies such that blocks span the domain from thesurface wall boundaries to domain inflow boundary can be difficult or impossible. Removing thisrequirement enables novel block topologies that simplify the meshing workflow for LAURA users.The new adaptation algorithm implementation in LAURA is described and several examples ofthe adaptation are presented to demonstrate the efficacy of the adaptation algorithm.

LAURA↗

Weighted adaptive algorithms for estimation of Gaussian distribution parameters

Two weighted adaptive algorithms are proposed for updating the estimates of the mean vector and the covariance matrix, respectively, in a multispectral pattern recognition system. To achieve computational efficiency, the auxiliary matrices have been utilized in the algorithm for covariance matrix updating. Enhancements in the performance accuracy of a multispectral processing system and extensions of the Gaussian maximum likelihood classification capabilities to larger scale surveys are the motivations in developing the algorithms presented herein.

Chang, C. Y.↗

Spatio-temporal adaptation algorithm for two-dimensional reacting flows

A spatio-temporal adaptive algorithm for solving the unsteady Euler equations with chemical source terms is presented. Quadrilateral cells are used in two spatial dimensions which allow for embedded meshes tracking moving flow features with spatially varying time-steps which are multiples of global minimum time-steps. Blast wave interactions corresponding to a perfect gas (frozen) and a Lighthill dissociating gas (nonequilibrium) are considered for circular arc cascade and 90 degree bend duct geometries.

Pervaiz, Mehtab M.↗

An implicit adaptation algorithm for a linear model reference control system

This paper presents a stable implicit adaptation algorithm for model reference control. The constraints for stability are found using Lyapunov's second method and do not depend on perfect model following between the system and the reference model. Methods are proposed for satisfying these constraints without estimating the parameters on which the constraints depend.

Mabius, L.↗

Analysis of adaptive algorithms for an integrated communication network

Techniques were examined that trade communication bandwidth for decreased transmission delays. When the network is lightly used, these schemes attempt to use additional network resources to decrease communication delays. As the network utilization rises, the schemes degrade gracefully, still providing service but with minimal use of the network. Because the schemes use a combination of circuit and packet switching, they should respond to variations in the types and amounts of network traffic. Also, a combination of circuit and packet switching to support the widely varying traffic demands imposed on an integrated network was investigated. The packet switched component is best suited to bursty traffic where some delays in delivery are acceptable. The circuit switched component is reserved for traffic that must meet real time constraints. Selected packet routing algorithms that might be used in an integrated network were simulated. An integrated traffic places widely varying workload demands on a network. Adaptive algorithms were identified, ones that respond to both the transient and evolutionary changes that arise in integrated networks. A new algorithm was developed, hybrid weighted routing, that adapts to workload changes.

Reed, Daniel A.↗

Temporal and spatial adaptive algorithm for reacting flows

A numerical integration scheme for quasi-one-dimensional unsteady flows with finite-rate chemistry is developed and demonstrated. The governing Euler and species-conservation equations are derived; the integration method and the spatial and temporal grid embedding techniques are explained; and results for sample problems involving stream-tube flow with one dissociating gas, shock-tube flow with one dissociating gas, and diverging-channel flow with multiple reactions are presented in extensive graphs and briefly characterized. Accuracy comparable to that of globally fine grid solutions is obtained with significant savings in CPU time.

Pervaiz, Mehtab M.↗

Improved LMS algorithm for adaptive beamforming

Two adaptive algorithms which make use of all the available samples to estimate the required gradient are proposed and studied. The first algorithm is referred to as the recursive LMS (least mean squares) and is applicable to a general array. The second algorithm is referred to as the improved LMS algorithm and exploits the Toeplitz structure of the ACM (array correlation matrix); it can be used only for an equispaced linear array.

Godara, Lal C.↗

Sea Ice Thickness, Freeboard, and Snow Depth products from Operation IceBridge Airborne Data

The study of sea ice using airborne remote sensing platforms provides unique capabilities to measure a wide variety of sea ice properties. These measurements are useful for a variety of topics including model evaluation and improvement, assessment of satellite retrievals, and incorporation into climate data records for analysis of interannual variability and long-term trends in sea ice properties. In this paper we describe methods for the retrieval of sea ice thickness, freeboard, and snow depth using data from a multisensor suite of instruments on NASA's Operation IceBridge airborne campaign. We assess the consistency of the results through comparison with independent data sets that demonstrate that the IceBridge products are capable of providing a reliable record of snow depth and sea ice thickness. We explore the impact of inter-campaign instrument changes and associated algorithm adaptations as well as the applicability of the adapted algorithms to the ongoing IceBridge mission. The uncertainties associated with the retrieval methods are determined and placed in the context of their impact on the retrieved sea ice thickness. Lastly, we present results for the 2009 and 2010 IceBridge campaigns, which are currently available in product form via the National Snow and Ice Data Center

sea ice thickness↗

Space marching calculations about hypersonic configurations using a solution-adaptive mesh algorithm

A solution-adaptive marching algorithm is developed and applied to a three-dimensional parabolized Navier-Stokes equation solver. The resulting algorithm obtains accurate solutions by using a spatial-marching/adaptive grid procedure. The adaptation step redistributes grid points line by line in both crossflow directions, with grid point motion controlled by forces analogous to tensional and torsional spring forces with the tensional force proportional to the error measure or weighting functions. The solution-adaptive marching procedure is applied to the hypersonic flow about two generic aircraft configurations. The first of these is an all-body-type geometry with elliptical cross sections and is studied at angles of attack of 0.5, and 15 deg. The second geometry is a generic blended-wing-body design. Results are presented that demonstrate the improvements in flowfield resolution obtainable with the solution-adaptive marching procedure over conventional fixed grid techniques. Computed pitot pressure profiles obtained using the solution-adaptive algorithm show improved agreement with experimental data compared to predictions obtained using a fixed grid.

Harvey, Albert D.↗

A vectorized, finite-volume, adaptive grid algorithm applied to planetary entry problems

An adaptive grid, finite-volume method has been applied to problems in planetary entry for computing complete flowfields. The adaption algorithm is implicit in nature and is keyed to resolve user specified gradients. The finite-volume algorithm is explicit, utilizing a maximum time step advancement at each grid point to accelerate convergence to the steady state. The present version of the code is for the laminar flow of a perfect gas. The role of the adaption algorithm in resolving various features of blunt body/wake flow for planetary entry conditions is emphasized.

Gnoffo, P. A.↗

A three-dimensional dynamic solution-adaptive mesh algorithm

A solution-adaptive grid algorithm has been developed for use in two and three dimensions. The algorithm uses a transformation from the cartesian coordinate system to a general coordinate space, which will be defined as a parallelepiped. A weighting function for adaption of the grid is developed that will allow adaption to the gradients of any combination of dependent variables in the flow. The adaption is carried out in the parametric space and a simple inverse mapping to return the new parametric space to the physical space is derived. The concept used to relocate the grid-points in the parametric space is based on the center of mass of distributed weights. Solution-adaptive results are presented for various laminar flows in two dimensions and for mathematical weighting functions in three dimensions.

Benson, Rusty A.↗

Temporal-adaptive Euler/Navier-Stokes algorithm for unsteady aerodynamic analysis of airfoils using unstructured dynamic meshes

A temporal adaptive algorithm for the time-integration of the two-dimensional Euler or Navier-Stokes equations is presented. The flow solver involves an upwind flux-split spatial discretization for the convective terms and central differencing for the shear-stress and heat flux terms on an unstructured mesh of triangles. The temporal adaptive algorithm is a time-accurate integration procedure which allows flows with high spatial and temporal gradients to be computed efficiently by advancing each grid cell near its maximum allowable time step. Results indicate that an appreciable computational savings can be achieved for both inviscid and viscous unsteady airfoil problems using unstructured meshes without degrading spatial or temporal accuracy.

Kleb, William L.↗