Search NASA⌕ Search

SEARCH · Search NASA

Results for “Iterative”

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 433 records · Page 24

A Two Colorable Fourth Order Compact Difference Scheme and Parallel Iterative Solution of the 3D Convection Diffusion Equation

A new fourth order compact difference scheme for the three dimensional convection diffusion equation with variable coefficients is presented. The novelty of this new difference scheme is that it Only requires 15 grid points and that it can be decoupled with two colors. The entire computational grid can be updated in two parallel subsweeps with the Gauss-Seidel type iterative method. This is compared with the known 19 point fourth order compact differenCe scheme which requires four colors to decouple the computational grid. Numerical results, with multigrid methods implemented on a shared memory parallel computer, are presented to compare the 15 point and the 19 point fourth order compact schemes.

Zhang, Jun↗

Saturation: An efficient iteration strategy for symbolic state-space generation

This paper presents a novel algorithm for generating state spaces of asynchronous systems using Multi-valued Decision Diagrams. In contrast to related work, the next-state function of a system is not encoded as a single Boolean function, but as cross-products of integer functions. This permits the application of various iteration strategies to build a system's state space. In particular, this paper introduces a new elegant strategy, called saturation, and implements it in the tool SMART. On top of usually performing several orders of magnitude faster than existing BDD-based state-space generators, the algorithm's required peak memory is often close to the nal memory needed for storing the overall state spaces.

Ciardo, Gianfranco↗

The Retrospective Iterated Analysis Scheme for Nonlinear Chaotic Dynamics

Atmospheric data assimilation is the name scientists give to the techniques of blending atmospheric observations with atmospheric model results to obtain an accurate idea of what the atmosphere looks like at any given time. Because two pieces of information are used, observations and model results, the outcomes of data assimilation procedure should be better than what one would get by using one of these two pieces of information alone. There is a number of different mathematical techniques that fall under the data assimilation jargon. In theory most these techniques accomplish about the same thing. In practice, however, slight differences in the approaches amount to faster algorithms in some cases, more economical algorithms in other cases, and even give better overall results in yet some other cases because of practical uncertainties not accounted for by theory. Therefore, the key is to find the most adequate data assimilation procedure for the problem in hand. In our Data Assimilation group we have been doing extensive research to try and find just such data assimilation procedure. One promising possibility is what we call retrospective iterated analysis (RIA) scheme. This procedure has recently been implemented and studied in the context of a very large data assimilation system built to help predict and study weather and climate. Although the results from that study suggest that the RIA scheme produces quite reasonable results, a complete evaluation of the scheme is very difficult due to the complexity of that problem. The present work steps back a little bit and studies the behavior of the RIA scheme in the context of a small problem. The problem is small enough to allow full assessment of the quality of the RIA scheme, but it still has some of the complexity found in nature, namely, its chaotic-type behavior. We find that the RIA performs very well for this small but still complex problem which is a result that seconds the results of our early studies.

Todling, Ricardo↗

Numerical Simulation of Turbulent MHD Flows Using an Iterative PNS Algorithm

A new parabolized Navier-Stokes (PNS) algorithm has been developed to efficiently compute magnetohydrodynamic (MHD) flows in the low magnetic Reynolds number regime. In this regime, the electrical conductivity is low and the induced magnetic field is negligible compared to the applied magnetic field. The MHD effects are modeled by introducing source terms into the PNS equation which can then be solved in a very efficient manner. To account for upstream (elliptic) effects, the flowfields are computed using multiple streamwise sweeps with an iterated PNS algorithm. Turbulence has been included by modifying the Baldwin-Lomax turbulence model to account for MHD effects. The new algorithm has been used to compute both laminar and turbulent, supersonic, MHD flows over flat plates and supersonic viscous flows in a rectangular MHD accelerator. The present results are in excellent agreement with previous complete Navier-Stokes calculations.

Kato, Hiromasa↗

Relative Navigation In Elliptical Orbits Using An Iterative Nonlinear Filter

The two step filter is applied to process intersatellite radar measurements to determine the motion of one satellite relative to another in close elliptical orbits. This filter breaks a nonlinear estimation problem into two state vectors. The 'first step' state is chosen so as to have a linear measurement equation. This is nonlinearly related to the 'second step' state which describes the dynamics. Two different forms are used. In one, the first step state is the second step state vector augmented by the measurement equation. In the other, the first step and second step state vectors are of equal dimension. The two step filter is compared against an iterated extended Kalman filter and a Kalman filter using a change of variables. Analytical differences between the two step estimator and these conventional filters are highlighted. Special concerns for initializing the first step state covariance matrix and handling the possibility of numerically rank deficient covariance matrices are addressed. Numerical simulations are performed which show that the Two Step estimator produces a lower estimation bias under two circumstances; large apriori initial error; and small dimension observation vectors which require a longer arc of measurements to generate observability of the state.

Garrison, James L.↗

Iterative Magnetometer Calibration

This paper presents an iterative method for three-axis magnetometer (TAM) calibration that makes use of three existing utilities recently incorporated into the attitude ground support system used at NASA's Goddard Space Flight Center. The method combines attitude-independent and attitude-dependent calibration algorithms with a new spinning spacecraft Kalman filter to solve for biases, scale factors, nonorthogonal corrections to the alignment, and the orthogonal sensor alignment. The method is particularly well-suited to spin-stabilized spacecraft, but may also be useful for three-axis stabilized missions given sufficient data to provide observability.

Sedlak, Joseph↗

Modeling defect trends for iterative development

The Employment of Defects (EoD) approach to measuring and analyzing defects seeks to identify and capture trends and phenomena that are critical to managing software quality in the iterative software development lifecycle at JPL.

modeling defects metrics↗

Estimated spectrum adaptive postfilter and the iterative prepost filtering algirighms

The invention presents The Estimated Spectrum Adaptive Postfilter (ESAP) and the Iterative Prepost Filter (IPF) algorithms. These algorithms model a number of image-adaptive post-filtering and pre-post filtering methods. They are designed to minimize Discrete Cosine Transform (DCT) blocking distortion caused when images are highly compressed with the Joint Photographic Expert Group (JPEG) standard. The ESAP and the IPF techniques of the present invention minimize the mean square error (MSE) to improve the objective and subjective quality of low-bit-rate JPEG gray-scale images while simultaneously enhancing perceptual visual quality with respect to baseline JPEG images.

Linares, Irving↗

An EOF Iteration Approach for Obtaining Homogeneous Radiative Fluxes from Satellites Observations

Conventional observations of climate parameters are sparse in space and/or in time and the representativeness of such information needs to be optimized. Observations from satellites provide improved spatial coverage than point observations however they pose new challenges for obtaining homogeneous coverage. Surface radiative fluxes, the forcing functions of the hydrologic cycle and biogeophysical processes, are now becoming available from global scale satellite observations. They are derived from independent satellite platforms and sensors that differ in temporal and spatial resolution and in the size of the footprint from which information is derived. Data gaps, degraded spatial resolution near boundaries of geostationary satellites, and different viewing geometries in areas of satellite overlap, could result in biased estimates of radiative fluxes. In this study, discussed will be issues related to the sources of inhomogeneity in surface radiative fluxes as derived from satellites; development of an approach to obtain homogeneous data sets; and application of the methodology to the widely used International Satellite Cloud Climatology Project (ISCCP) data that currently serve as a source of information for deriving estimates of surface and top of the atmosphere radiative fluxes. Introduced is an Empirical Orthogonal Function (EOF) iteration scheme for homogenizing the fluxes. The scheme is evaluated in several ways including comparison of the inferred radiative fluxes against ground observations, both before and after the EOF approach is applied. On the average, the latter reduces the rms error by about 2-3 W/m2.

Zhang, Banglin↗

Iterative Demodulation and Decoding of Non-Square QAM

It has been shown that a non-square (NS) 2(sup 2n+1)-ary (where n is a positive integer) quadrature amplitude modulation [(NS)2(sup 2n+1)-QAM] has inherent memory that can be exploited to obtain coding gains. Moreover, it should not be necessary to build new hardware to realize these gains. The present scheme is a product of theoretical calculations directed toward reducing the computational complexity of decoding coded 2(sup 2n+1)-QAM. In the general case of 2(sup 2n+1)-QAM, the signal constellation is not square and it is impossible to have independent in-phase (I) and quadrature-phase (Q) mapping and demapping. However, independent I and Q mapping and demapping are desirable for reducing the complexity of computing the log likelihood ratio (LLR) between a bit and a received symbol (such computations are essential operations in iterative decoding). This is because in modulation schemes that include independent I and Q mapping and demapping, each bit of a signal point is involved in only one-dimensional mapping and demapping. As a result, the computation of the LLR is equivalent to that of a one-dimensional pulse amplitude modulation (PAM) system. Therefore, it is desirable to find a signal constellation that enables independent I and Q mapping and demapping for 2(sup 2n+1)-QAM.

Li, Lifang↗

Iterative Transform Phase Diversity: An Image-Based Object and Wavefront Recovery

The Iterative Transform Phase Diversity algorithm is designed to solve the problem of recovering the wavefront in the exit pupil of an optical system and the object being imaged. This algorithm builds upon the robust convergence capability of Variable Sampling Mapping (VSM), in combination with the known success of various deconvolution algorithms. VSM is an alternative method for enforcing the amplitude constraints of a Misell-Gerchberg-Saxton (MGS) algorithm. When provided the object and additional optical parameters, VSM can accurately recover the exit pupil wavefront. By combining VSM and deconvolution, one is able to simultaneously recover the wavefront and the object.

Smith, Jeffrey↗

Planning as an Iterative Process

Activity planning for missions such as the Mars Exploration Rover mission presents many technical challenges, including oversubscription, consideration of time, concurrency, resources, preferences, and uncertainty. These challenges have all been addressed by the research community to varying degrees, but significant technical hurdles still remain. In addition, the integration of these capabilities into a single planning engine remains largely unaddressed. However, I argue that there is a deeper set of issues that needs to be considered namely the integration of planning into an iterative process that begins before the goals, objectives, and preferences are fully defined. This introduces a number of technical challenges for planning, including the ability to more naturally specify and utilize constraints on the planning process, the ability to generate multiple qualitatively different plans, and the ability to provide deep explanation of plans.

Smith, David E.↗

An Iterated Global Mascon Solution with Focus on Land Ice Mass Evolution

Land ice mass evolution is determined from a new GRACE global mascon solution. The solution is estimated directly from the reduction of the inter-satellite K-band range rate observations taking into account the full noise covariance, and formally iterating the solution. The new solution increases signal recovery while reducing the GRACE KBRR observation residuals. The mascons are estimated with 10-day and 1-arc-degree equal area sampling, applying anisotropic constraints for enhanced temporal and spatial resolution of the recovered land ice signal. The details of the solution are presented including error and resolution analysis. An Ensemble Empirical Mode Decomposition (EEMD) adaptive filter is applied to the mascon solution time series to compute timing of balance seasons and annual mass balances. The details and causes of the spatial and temporal variability of the land ice regions studied are discussed.

Luthcke, S. B.↗

Discrete fourier transform (DFT) analysis for applications using iterative transform methods

According to various embodiments, a method is provided for determining aberration data for an optical system. The method comprises collecting a data signal, and generating a pre-transformation algorithm. The data is pre-transformed by multiplying the data with the pre-transformation algorithm. A discrete Fourier transform of the pre-transformed data is performed in an iterative loop. The method further comprises back-transforming the data to generate aberration data.

Dean, Bruce H.↗

Adaptable Iterative and Recursive Kalman Filter Schemes

Nonlinear filters are often very computationally expensive and usually not suitable for real-time applications. Real-time navigation algorithms are typically based on linear estimators, such as the extended Kalman filter (EKF) and, to a much lesser extent, the unscented Kalman filter. The Iterated Kalman filter (IKF) and the Recursive Update Filter (RUF) are two algorithms that reduce the consequences of the linearization assumption of the EKF by performing N updates for each new measurement, where N is the number of recursions, a tuning parameter. This paper introduces an adaptable RUF algorithm to calculate N on the go, a similar technique can be used for the IKF as well.

Zanetti, Renato↗

Antarctica, Greenland and Gulf of Alaska Land-ice Evolution from an Iterated GRACE Global Mascon Solution

We have determined the ice mass evolution of the Antarctica and Greenland ice sheets (AIS and GIS) and Gulf of Alaska (GOA) glaciers from a new GRACE global solution of equal-area surface mass concentration parcels (mascons) in equivalent height of water. The mascons were estimated directly from the reduction of the inter-satellite K-band range-rate (KBRR) observations, taking into account the full noise covariance, and formally iterating the solution. The new solution increases signal recovery while reducing the GRACE KBRR observation residuals. The mascons were estimated with 10 day and 1 arc degree equal-area sampling, applying anisotropic constraints. An ensemble empirical mode decomposition adaptive filter was applied to the mascon time series to compute annual mass balances. The details and causes of the spatial and temporal variability of the land-ice regions studied are discussed. The estimated mass trend over the total GIS, AIS and GOA glaciers for the time period 1 December 2003 to 1 December 2010 is -380 plus or minus 31 Gt a(exp -1), equivalent to -1.05 plus or minus 0.09 mma(exp -1) sea-level rise. Over the same time period we estimate the mass acceleration to be -41 plus or minus 27 Gt a(exp -2), equivalent to a 0.11 plus or minus 0.08 mm a(exp -2) rate of change in sea level. The trends and accelerations are dependent on significant seasonal and annual balance anomalies.

MASCON↗