Search NASA⌕ Search

SEARCH · Search NASA

Results for “Iterative algorithms”

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 235 records · Page 13

Second-order p-iterative solution of the Lambert/Gauss problem

An algorithm is presented for efficient p-iterative solution of the Lambert/Gauss orbit-determination problem using second-order Newton iteration. The algorithm is based on a universal transformation of Kepler's time-of-flight equation and approximate inverse solutions of this equation for short-way and long-way flight paths. The approximate solutions provide both good starting values for iteration and simplified computation of the second-order term in the iteration formula. Numerical results are presented which indicate that in many cases of practical significance (except those having collinear position vectors) the algorithm produces at least eight significant digits of accuracy with just two or three steps of iteration.

Boltz, F. W.↗

A parallel Jacobson-Oksman optimization algorithm

A gradient-dependent optimization technique which exploits the vector-streaming or parallel-computing capabilities of some modern computers is presented. The algorithm, derived by assuming that the function to be minimized is homogeneous, is a modification of the Jacobson-Oksman serial minimization method. In addition to describing the algorithm, conditions insuring the convergence of the iterates of the algorithm and the results of numerical experiments on a group of sample test functions are presented. The results of these experiments indicate that this algorithm will solve optimization problems in less computing time than conventional serial methods on machines having vector-streaming or parallel-computing capabilities.

Straeter, T. A.↗

Super Resolution of Remote Sensing Images Using Edge-Directed Radial Basis Functions

Edge-Directed Radial Basis Functions (EDRBF) are used to compute super resolution(SR) image from a given set of low resolution (LR) images differing in subpixel shifts. The algorithm is tested on remote sensing images and compared for accuracy with other well-known algorithms such as Iterative Back Projection (IBP), Maximum Likelihood (ML) algorithm, interpolation of scattered points using Nearest Neighbor (NN) and Inversed Distance Weighted (IDW) interpolation, and Radial Basis Functin(RBF) . The accuracy of SR depends on various factors besides the algorithm (i) number of subpixel shifted LR images (ii) accuracy with which the LR shifts are estimated by registration algorithms (iii) and the targeted spatial resolution of SR. In our studies, the accuracy of EDRBF is compared with other algorithms keeping these factors constant. The algorithm has two steps: i) registration of low resolution images and (ii) estimating the pixels in High Resolution (HR) grid using EDRBF. Experiments are conducted by simulating LR images from a input HR image with different sub-pixel shifts. The reconstructed SR image is compared with input HR image to measure the accuracy of the algorithm using sum of squared errors (SSE). The algorithm has outperformed all of the algorithms mentioned above. The algorithm is robust and is not overly sensitive to the registration inaccuracies.

Mareboyana, Manohar M.↗

Eigenvector determination by iterative optical methods

Three power algorithms are considered by which an iterative optical processor can be used to compute the eigenvalues and eigenvectors of a matrix. The algorithms are appropriate for three applications: (1) calculating the largest eigenvalue; (2) calculating the eigenvalues in order of decreasingly dominant eigenvalues; and (3) calculating the eigenvector whose eigenvalue is closest to a given value.

Vijaya Kumar, B. V. K.↗

Tomography by iterative convolution - Empirical study and application to interferometry

An algorithm for computer tomography has been developed that is applicable to reconstruction from data having incomplete projections because an opaque object blocks some of the probing radiation as it passes through the object field. The algorithm is based on iteration between the object domain and the projection (Radon transform) domain. Reconstructions are computed during each iteration by the well-known convolution method. Although it is demonstrated that this algorithm does not converge, an empirically justified criterion for terminating the iteration when the most accurate estimate has been computed is presented. The algorithm has been studied by using it to reconstruct several different object fields with several different opaque regions. It also has been used to reconstruct aerodynamic density fields from interferometric data recorded in wind tunnel tests.

Vest, C. M.↗

An iterative implicit diagonally-dominant factorization algorithm for solving the Navier-Stokes equations

Presented here is an algorithm for solving the multidimensional unsteady Navier-Stokes equations for compressible flows. It is based on a diagonally-dominant approximate factorization procedure. The factorization error and the timewise linearization error associated with this procedure are reduced by performing Newton-type inner iterations at each time step. The inviscid fluxes are evaluated by the fourth-order central differencing scheme amended with a numerical dissipation directly proportional to the entire dissipative part of the truncation error intrinsic to the third order biased upwind scheme. The important features of the proposed solution are elucidated by the numerical results of the convection of a vortex and the backward-facing step flows.

Chen, Shu-Cheng↗

Registering Articulated Objects With Human-in-the-loop Corrections

Remotely programming robots to execute tasks often relies on registering objects of interest in the robot’s environment. Frequently, these tasks involve articulating objects such as opening or closing a valve. However, existing human-in-the-loop methods for registering objects do not consider articulations and the corresponding impact to the geometry of the object, which can cause the methods to fail. In this work, we present an approach where the registration system attempts to automatically determine the object model, pose, and articulation for user-selected points using a nonlinear iterative closest point algorithm. When the automated fitting is incorrect, the operator can iteratively intervene with corrections after which the system will refit the object. We present an implementation of our fitting procedure and evaluate it with a user study that shows that it can improve user performance, in measures of time on task and task load, ease of use, and usefulness compared to a manual registration approach. We also present a situated example that demonstrates the integration of our method in an end-to-end system for articulating a remote valve.

teleoperation↗

An approach to probabilistic finite element analysis using a mixed-iterative formulation

An efficient algorithm for computing the response sensitivity of finite element problems based on a mixed-iterative formulation is proposed. This method does not involve explicit differentiation of the tangent stiffness array and can be used with formulations for which a consistent tangent stiffness is not readily available. The method has been successfully applied to probabilistic finite element analysis of problems using the proposed mixed formulation, and this exercise has provided valuable insights regarding the extension of the method to a more general class of problems to include material and geometric nonlinearities.

Dias, J. B.↗

F-8C adaptive control law refinement and software development

An explicit adaptive control algorithm based on maximum likelihood estimation of parameters was designed. To avoid iterative calculations, the algorithm uses parallel channels of Kalman filters operating at fixed locations in parameter space. This algorithm was implemented in NASA/DFRC's Remotely Augmented Vehicle (RAV) facility. Real-time sensor outputs (rate gyro, accelerometer, 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.

Hartmann, G. L.↗

An Integrated Examination of AMSR2 Products over Ocean

Integrated processing and analysis are presented for oceanic retrievals of precipitation, sea ice concentration, columnar water vapor and cloud water, sea surface temperature, and near surface wind from the advanced microwave scanning radiometer-2 (AMSR2) sensor. By developing a common algorithmic framework and permitting iterative interaction between historically separate science algorithms, ambiguous and contradictory retrieval results are minimized. The integration also serves to improve each algorithm individually, decreasing reliance on ancillary datasets. Case studies are presented that exemplify both ongoing challenges for these retrievals and potential research uses of such an integrated satellite product. Two cases are presented each for precipitation at high latitudes and marginal sea ice detection, with analysis supplemented by satellite data from CloudSat profiles and Himawari-8 imagery. Detection and retrieval of snowfall remains a challenge, while light rainfall detection can be aided by a variational algorithm. Sea ice concentrations below 20% cause disagreements, but the algorithms otherwise agree well on the sea ice edge. Potential mitigation strategies for ambiguous areas of light rainfall and marginal sea ice are discussed. The analysis demonstrates potential avenues for future algorithm development, but also some physical limitations of remote sensing with the AMSR2 frequencies.

variational methods↗

Evaluating Combinations of Sentinel-2 Data and Machine-Learning Algorithms for Mangrove Mapping in West Africa

Creating a national baseline for natural resources, such as mangrove forests, and monitoring them regularly often requires a consistent and robust methodology. With freely available satellite data archives and cloud computing resources, it is now more accessible to conduct such large-scale monitoring and assessment. Yet, few studies examine the reproducibility of such mangrove monitoring frameworks, especially in terms of generating consistent spatial extent. Our objective was to evaluate a combination of image processing approaches to classify mangrove forests along the coast of Senegal and The Gambia. We used freely available global satellite data (Sentinel-2), and cloud computing platform (Google Earth Engine) to run two machine learning algorithms, random forest (RF), and classification and regression trees (CART). We calibrated and validated the algorithms using 800 reference points collected using high-resolution images. We further re-ran 10 iterations for each algorithm, utilizing unique subsets of the initial training data. While all iterations resulted in thematic mangrove maps with over 90% accuracy, the mangrove extent ranges between 827-2807 km2 for Senegal and 245-1271 km2 for The Gambia with one outlier for each country. We further report "Places of Agreement" (PoA) to identify areas where all iterations for both methods agree (506.6 km2 and 129.6 km2 for Senegal and The Gambia, respectively), thus have a high confidence in predicting mangrove extent. While we acknowledge the time- and cost-effectiveness of such methods for the landscape managers, we recommend utilizing them with utmost caution, as well as post-classification on-the-ground checks, especially for decision making.

Mondal, Pinki↗

Preliminary software development for optical mirror figure control

The maintenance of accurate primary mirror figure in the face of environmental disturbances is the key to the achievement of diffraction-limited performance in a large space telescope. In order to develop the concepts of optical mirror figure control, an experimental program was initiated. A major component in this experiment will be an XDS Sigma 5.7 digital computer which will realize the control algorithm. A software package is described which realizes linear optimal, simplified linear, and iterative optimal control algorithms. The software, in addition, provides for interactive communication between the operator and the computer, and interaction between the computer and the experimental hardware elements. A brief description of a small hybrid computer system is also presented.

Mackinnon, D.↗

A quasi-Newton versus a homotopy method for nonlinear structural analysis

The globally convergent quasi-Newton minimization algorithm and the homotopy algorithms are discussed in detail and their effectiveness in solving certain classes of highly nonlinear problems of structural analysis is demonstrated. The application of the double dogleg strategy controls the directions and step-lengths of the quasi-Newtonian algorithm and overcomes the problem of nonpositive definite Hessians being produced during the iteration process. The algorithms are applied to a centrally loaded clamped beam, the snap-through of a shallow arch, and a shallow reticulated dome.

Kamat, M. P.↗

Parallel solution of finite element equations

The paper examines several parallel processing solution algorithms for finite element equations arising in linear equilibrium problems. Two basic groups of algorithms, direct and iterative, are investigated with respect to a number of parallel computer architectures and associated selection criteria. The direct algorithms include: LR-Gauss, Crout, Cholesky, Cyclic Reduction and WZ-factorization. The iterative methods examined are: Accelerated Gauss-Seidel, Surrogate Stiffness, Jacobi, Series Expansion, and Energy Monte Carlo. For real-time applications, where the object is to minimize the execution time, Cyclic Reduction appears to be best suited. This assumes a computer with an unlimited number of parallel processors. However, for computers with a limited number of parallel processors that must be used efficiently, both Gauss factorization and Jacobi-like iterative methods rank favorably.

Salama, M.↗

Computation of three-dimensional viscous flows using a space-marching method

A space-marching method, developed to compute three-dimensional flows for internal geometries, has been utilized to predict viscous flows through a curved duct and over a swept wing. The Navier-Stokes equations have been posed as an initial value problem by neglecting the streamwise viscous diffusion terms and by treating the pressure gradient as a known source term. The resulting equations have been solved by a non-iterative (single pass) algorithm at each streamwise step. The results are compared with earlier computations (based on iterative methods) and the experimental data. The agreement between the present predictions, the experimental data, and the earlier predictions is good for the cases computed. The computation time is only a fraction of the iterative methods.

Murthy, K. N. S.↗

High Resolution Image Reconstruction from Projection of Low Resolution Images DIffering in Subpixel Shifts

In this paper, we demonstrate a simple algorithm that projects low resolution (LR) images differing in subpixel shifts on a high resolution (HR) also called super resolution (SR) grid. The algorithm is very effective in accuracy as well as time efficiency. A number of spatial interpolation techniques using nearest neighbor, inverse-distance weighted averages, Radial Basis Functions (RBF) etc. used in projection yield comparable results. For best accuracy of reconstructing SR image by a factor of two requires four LR images differing in four independent subpixel shifts. The algorithm has two steps: i) registration of low resolution images and (ii) shifting the low resolution images to align with reference image and projecting them on high resolution grid based on the shifts of each low resolution image using different interpolation techniques. Experiments are conducted by simulating low resolution images by subpixel shifts and subsampling of original high resolution image and the reconstructing the high resolution images from the simulated low resolution images. The results of accuracy of reconstruction are compared by using mean squared error measure between original high resolution image and reconstructed image. The algorithm was tested on remote sensing images and found to outperform previously proposed techniques such as Iterative Back Projection algorithm (IBP), Maximum Likelihood (ML), and Maximum a posterior (MAP) algorithms. The algorithm is robust and is not overly sensitive to the registration inaccuracies.

A multigrid algorithm for steady transonic potential flows around aerofoils using Newton iteration

The application of multigrid relaxation to transonic potential flow calculation was investigated. Conservative potential flows around aerofoils were taken as test problems. The solution algorithm was based on Newton iteration. It was found that the iteration to the circulation has to be kept outside the multigrid algorithm. To obtain meaningful norms of residuals, difference formulas with asymptotic scaling were introduced. Nonlinear instability problems were solved by upwind differencing using mass flux vector splitting instead of artificial viscosity or artificial density. It is suggested that the algorithms efficiency be increased by improving the iteration on the shock positions even though this is a highly nonlinear process.

Boestoel, J. W.↗