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 109 records · Page 6

A dual potential formulation of the Navier-Stokes equations

A dual potential formulation for numerically solving the Navier-Stokes equations is developed and presented. The velocity field is decomposed using a scalar and vector potential. Vorticity and dilatation are used as the dependent variables in the momentum equations. Test cases in two dimensions verify the capability to solve flows using approximations from potential flow to full Navier-Stokes simulations. A three-dimensional incompressible flow formulation is also described. An interesting feature of this approach to solving the Navier-Stokes equations is the decomposition of the velocity field into a rotational part (vector potential) and an irrotational part (scalar potential). The Helmholtz decomposition theorem allows this splitting of the velocity field. This approach has had only limited use since it increases the number of dependent variables in the solution. However, it has often been used for incompressible flows where the solution scheme is known to be fast and accurate. This research extends the usage of this method to fully compressible Navier-Stokes simulations by using the dilatation variable along with vorticity. A time-accurate, iterative algorithm is used for the uncoupled solution of the governing equations. Several levels of flow approximation are available within the framework of this method. Potential flow, Euler and full Navier-Stokes solutions are possible using the dual potential formulation. Solution efficiency can be enhanced in a straightforward way. For some flows, the vorticity and/or dilatation may be negligible in certain regions (e.g., far from a viscous boundary in an external flow). It is possible to drop the calculation of these variables then and optimize the solution speed. Also, efficient Poisson solvers are available for the potentials. The relative merits of non-primitive variables versus primitive variables for solution of the Navier-Stokes equations are also discussed.

Gegg, S. G.↗

Interferometric tomography of continuous fields with incomplete projections

Interferometric tomography in the presence of an opaque object has been investigated. In principle the developed iterative algorithm does not need to augment the missing information. It is based on the successive reconstruction of the difference field, the difference between the object field to be reconstructed and its estimate, in the defined region only. The application of the algorithm results in stable convergence.

Cha, Soyoung S.↗

A variable-gain output feedback control design approach

A multi-model design technique to find a variable-gain control law defined over the whole operating range is proposed. The design is formulated as an optimal control problem which minimizes a cost function weighing the performance at many operating points. The solution is obtained by embedding into the Multi-Configuration Control (MCC) problem, a multi-model robust control design technique. In contrast to conventional gain scheduling which uses a curve fit of single model designs, the optimal variable-gain control law stabilizes the plant at every operating point included in the design. An iterative algorithm to compute the optimal control gains is presented. The methodology has been successfully applied to reconfigurable aircraft flight control and to nonlinear flight control systems.

Haylo, Nesim↗

Optimal model reduction and frequency-weighted extension

In this paper the quadratically optimal model reduction problem for single-input, single-output systems is considered. The reduced order model is determined by minimizing the integral of the magnitude-squared of the transfer function error. It is shown that the numerator coefficients of the optimal approximant satisfy a weighted least squares problem and, on this basis, a two-step iterative algorithm is developed combining a least squares solver with a gradient minimizer. The existence of globally optimal stable solutions to the optimization problem is established, and convergence of the algorithm to stationary values of the cost function is proved. The formulation is extended to handle the frequency-weighted optimal model reduction problem. Three examples demonstrate the optimization algorithm.

Spanos, J. T.↗

Measurement of a zonal wind profile on Titan by Doppler tracking of the Cassini entry probe

A program, called the Cassini mission, intended to study the Saturn system by utilizing a Saturn orbiter and a probe descending to the surface of Titan, is discussed. Winds are expected to cause perturbations to the probe local horizontal velocity, resulting in an anomalous drift in the probe location and a shift in the frequency of the probe telemetry, due to the Doppler effect. By using an iterative algorithm, in which the time variation of the probe telemetry frequency is monitored throughout the descent, and the probe trajectory is updated to reflect the effect of wind on the probe location, a highly accurate relative wind profile can be recovered. By adding a single wind velocity, measured by independent means, an absolute wind profile can be obtained. However, the accuracy of the zonal winds recovery is limited by errors in trajectory, and frequency.

Atkinson, D. H.↗

Modelling and computationally efficient time domain linear equalisation of nonlinear bandlimited QPSK satellite channels

The problem of modeling and equalization of a nonlinear satellite channel is considered. The channel is assumed to be bandlimited and exhibits both amplitude and phase nonlinearities. In traditional models, computations are usually performed in the frequency domain and solutions are based on complex numerical techniques. A discrete time model is used to represent the satellite link with both uplink and downlink white Gaussian noise. Under conditions of practical interest, a simple and computationally efficient time-domain design technique for the minimum mean square error linear equalizer is presented. The efficiency of this technique is enhanced by the use of a fast and simple iterative algorithm for the computation of the autocorrelation coefficients of the output of the nonlinear channel. Numerical results on the evaluations of bit error probability and other relevant parameters needed in the design and analysis of a nonlinear bandlimited QPSK system demonstrate the simplicity and computational efficiency of the proposed approach.

Konstantinides, K.↗

Computational methods for structural load and resistance modeling

An automated capability for computing structural reliability considering uncertainties in both load and resistance variables is presented. The computations are carried out using an automated Advanced Mean Value iteration algorithm (AMV +) with performance functions involving load and resistance variables obtained by both explicit and implicit methods. A complete description of the procedures used is given as well as several illustrative examples, verified by Monte Carlo Analysis. In particular, the computational methods described in the paper are shown to be quite accurate and efficient for a material nonlinear structure considering material damage as a function of several primitive random variables. The results show clearly the effectiveness of the algorithms for computing the reliability of large-scale structural systems with a maximum number of resolutions.

Thacker, B. H.↗

A parallel iterative solution method for systems of nonlinear hyperbolic equations

An iterative algorithm suitable for the solution of a system of nonlinear hyperbolic partial differentiation equations in multiple dimensions is discussed. Current numerical methods for systems of nonlinear PDEs have limited parallelism due to strong coupling between the equations. This method decouples the PDEs by linearizing the convention coefficient for a space-time domain. This provides large grain parallelism. The linearization also allows the treatment of some terms in the equations as source terms, providing more freedom to choose from a wider variety of numerical methods. Smaller grain parallelism may be exploited within the solves for each equation. Thus, the method has potential for parallelism at several levels.

Scroggs, Jeffrey S.↗

Goddard high resolution spectrograph science verification and data analysis

The data analysis performed was to support the Orbital Verification (OV) and Science Verification (SV) of the GHRS was in the areas of the Digicon detector's performance and stability, wavelength calibration, and geomagnetic induced image motion. The results of the analyses are briefly described. Detailed results are given in the form of attachments. Specialized software was developed for the analyses. Calibration files were formatted according to the specifications in a Space Telescope Science report. IRAS images were restored of the Large Magellanic Cloud using a blocked iterative algorithm. The algorithm works with the raw data scans without regridding or interpolating the data on an equally spaced image grid.

Source record↗

A method for designing blended wing-body configurations for low wave drag

A procedure for tailoring a blended wing-body configuration to reduce its computed wave drag is described. The method utilizes an iterative algorithm within the framework of first-order linear theory. Four computed examples are included. In each case, the zero-lift wave drag was reduced without an increase in the drag due to lift.

Barger, Raymond L.↗

Iterative computation of the optimal H(infinity) norm by using two-Riccati-equation method

The two-Riccati-equation method solution to a standard H(infinity) control problem can be used to characterize all possible stabilizing optimal or suboptimal H(infinity) controllers if the optimal or suboptimal H(infinity) norm is available in the literature. An iterative algorithm for computing the optimal H(infinity) norm is proposed. The algorithm employs fixed-point, double secant and bisection to guarantee a super linear convergence.

Chang, B. C.↗

Topography estimation with interferometric synthetic aperture radar using fringe detection

Methods are presented for using Synthetic Aperture Radar (SAR) interferometry data to estimate surface topography. An expression is given to relate the elevation of a ground point to the phase difference of SAR images received from two spatially separated antennas. An iterative algorithm which solves for the position and elevation of each point in the image simultaneously is developed. One of the critical issues that determines the accuracy of the terrain mapping is the phase unwrapping. An approach to the problem by fringe line detection is proposed. The algorithms are tested with two Seasat SAR images of terrain near Yellowstone National Park. The resultant elevation map is compared with a USGS terrain elevation model. The error of the SAR elevation with respect to the digital terrain map is about 8.2 percent of the total terrain variation.

Lin, Qian↗

Reliability enhancement of Navier-Stokes codes through convergence enhancement

Reduction of total computing time required by an iterative algorithm for solving Navier-Stokes equations is an important aspect of making the existing and future analysis codes more cost effective. Several attempts have been made to accelerate the convergence of an explicit Runge-Kutta time-stepping algorithm. These acceleration methods are based on local time stepping, implicit residual smoothing, enthalpy damping, and multigrid techniques. Also, an extrapolation procedure based on the power method and the Minimal Residual Method (MRM) were applied to the Jameson's multigrid algorithm. The MRM uses same values of optimal weights for the corrections to every equation in a system and has not been shown to accelerate the scheme without multigriding. Our Distributed Minimal Residual (DMR) method based on our General Nonlinear Minimal Residual (GNLMR) method allows each component of the solution vector in a system of equations to have its own convergence speed. The DMR method was found capable of reducing the computation time by 10-75 percent depending on the test case and grid used. Recently, we have developed and tested a new method termed Sensitivity Based DMR or SBMR method that is easier to implement in different codes and is even more robust and computationally efficient than our DMR method.

Choi, K.-Y.↗

Multigrid method for integral equations and automatic programs

Several iterative algorithms based on multigrid methods are introduced for solving linear Fredholm integral equations of the second kind. Automatic programs based on these algorithms are introduced using Simpson's rule and the piecewise Gaussian rule for numerical integration.

Lee, Hosae↗

Space transportation vehicle design evaluation using saturated designs

An important objective in the preliminary design and evaluation of space transportation vehicles is to find the best values of design variables that optimize the performance characteristic (e.g. dry weight). For a given configuration, the vehicle performance can be determined by the use of complex sizing and performance evaluation computer programs. These complex computer programs utilize iterative algorithms and they are generally too expensive and/or difficult to use directly in multidisciplinary design optimization. An alternative is to use response surface methodology (RSM) and obtain quadratic polynomial approximations to the functional relationships between performance characteristics and design variables. In RSM, these approximation models are then used to determine optimum design parameter values and for rapid sensitivity studies. Constructing a second-order model requires that 'n' design parameters be studied at least at 3 levels (values) so that the coefficients in the model can be estimated. There, 3(n) factorial experiments (point designs or observations) may be necessary. For small values of 'n' such as two or three, this design works well. However, when a large number of design parameters are under study, the number of design points required for a full-factorial design may become excessive. Fortunately, these quadratic polynomial approximations can be obtained by selecting an efficient design matrix using central composite designs (CCD) from design of experiments theory. Each unique point design from the CCD matrix is then conducted using computerized analysis tools (e.g. POST, CONSIZ, etc.). In the next step, least squares regression analysis is used to calculate the quadratic polynomial coefficients from the data. However, in some multidisciplinary applications involving a large number of design variables and several disciplines, the computerized performance synthesis programs may get too time consuming and expensive to run even with the use of efficient central composite designs. In such cases, it may be preferable to keep the number of design points to an absolute minimum and trade some model accuracy with cost. For this purpose, another class of experimental designs, called saturated D-optimal designs may be utilized for generating a matrix of vehicle designs. A design is called saturated when the number of design points is exactly equal to the number of terms in the model to be fitted. As a result, saturated designs require the absolute minimum number of design points ((n+1)(n+2)/s) to estimate the quadratic polynomial model coefficients. Saturated designs can be generated using the D-optimality criterion. A good saturated design should give rise to least squares estimates with minimum generalized variance.

Unal, Resit↗

Computation of selected eigenvalues of generalized eigenvalue problems

The Arnoldi (1951) and Lanczos (1950) iterative algorithms are used to obtain a few selected eigenvalues of the generalized eigenvalue problem A(x) = lambdaB(x), where A and B are n x n nonsymmetric banded complex matrices. A shift-and-invert strategy is used to increase the rate of convergence toward the desired eigenvalues, and the two approaches are evaluated in view of their performance in a model problem concerning the linear stability of compressible boundary layers. A general scheme for computing the eigenvalues that lie within a 'box' in the complex plane is presented.

Nayar, Narinder↗

Surface matching for correlation of virtual models: Theory and application

Virtual reality can enable a robot user to off line generate and test in a virtual environment a sequence of operations to be executed by the robot in an assembly cell. Virtual models of objects are to be correlated to the real entities they represent by means of a suitable transformation. A solution to the correlation problem, which is basically a problem of 3-dimensional adjusting, has been found exploiting the surface matching theory. An iterative algorithm has been developed, which matches the geometric surface representing the shape of the virtual model of an object, with a set of points measured on the surface in the real world. A peculiar feature of the algorithm is to work also if there is no one-to-one correspondence between the measured points and those representing the surface model. Furthermore the problem of avoiding convergence to local minima is solved, by defining a starting point of states ensuring convergence to the global minimum. The developed algorithm has been tested by simulation. Finally, this paper proposes a specific application, i.e., correlating a robot cell, equipped for biomedical use with its virtual representation.

Caracciolo, Roberto↗

Monitoring Mars with the Hubble Space Telescope: 1990-1991 observations

Images of Mars obtained using the Planetary Camera on the Hubble Space Telescope during 1990 and 1991 are described and analyzed. Multispectral images of Mars record the martian season between L(sub s) = 348 deg and 60 deg corresponding to late winter and spring in the northern hemisphere. The wavelengths of these observations varied between 230 nm in the ultraviolet and 890 nm in the near infrared. We use these images to discuss atmospheric and polar phenomena, to constrain the aerosols and ozone in the martian atmosphere, and to compare surface albedo features within this data set as well as with previous observations. Two methods are used to constrain the opacity of the martian atmosphere: comparisons of ultraviolet images with atmospheric scattering models and examination of contrast changes of surface features observed at visible wavelengths. Our observations are consistent with a Mars which was quite different from the planet when it was viewed by Viking; we estimate an upper limit of 0.1 for equatorial dust opacity near vernal equinox, compared to values of 0.4 to 0.5 measured in Chryse by Viking Lander 1. Later, at L(sub s) = 60 deg, and upper limit of 0.2 was found for dust in the southern hemisphere. Except for suggestions of local dust activity near the north polar cap in late spring, there was no visual evidence of dust storms on the planet. The Hartley band of ozone is within the F230W filter bandpass, and the 230W/336W ratio is therefore sensitive to ozone. High latitude ozone is observed at a concentration similar to that observed by Mariner 9; a seasonal dependence in ozone concentration was observed with concentration decreasing at northern arctic latitudes and increasing at southern midlatitudes as L(sub s) increases from 350 deg to 60 deg. Despite the difference in dust loading, the behavior of condensate clouds and the recession of the north polar cap are consistent with those observed during Viking years. Late winter images of the north polar region reveal an active north polar hood with a maximum (UV) opacity of about 0.25 near 50 deg latitude; the hood seems to have an annular form, with the central, polar regions having smaller opacity. Clouds observed in the northern hemisphere to the south of the hood boundary are suggestive of fronts similar to those observed during the Mariner 9 mission. A diurnal variation in the hood clouds which is (anti) correlated with the amount of water vapor in the atmosphere is noted. Images were deconvolved using the Richardson-Lucy iterative algorithm to remove the defocussing effects of the spherical aberration of the HST primary. Even when Mars subtended less than 5 arcsec, in May 1991, the images were scientifically useful and comparable to photographic images obtained at opposition. Although the data are subject to the solar pointing constraint for HST, the relatively slow movement of the allowed observation window, which is more than one half martian year, with respect to the martian seasons will permit us to address the question of major variations in the martian atmosphere.

James, Philip B.↗