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 343 records · Page 19

Radiation pattern synthesis of planar antennas using the iterative sampling method

A synthesis method is presented for determining an excitation of an arbitrary (but fixed) planar source configuration. The desired radiation pattern is specified over all or part of the visible region. It may have multiple and/or shaped main beams with low sidelobes. The iterative sampling method is used to find an excitation of the source which yields a radiation pattern that approximates the desired pattern to within a specified tolerance. In this paper the method is used to calculate excitations for line sources, linear arrays (equally and unequally spaced), rectangular apertures, rectangular arrays (arbitrary spacing grid), and circular apertures. Examples using these sources to form patterns with shaped main beams, multiple main beams, shaped sidelobe levels, and combinations thereof are given.

Stutzman, W. L.↗

Accelerated iterative calculation of transonic nacelle flowfields

A method is presented for the calculation of inviscid, supercritical flowfields about axisymmetric inlet cowls. A finite-difference calculation is performed in a simple, rectangular domain obtained from the nacelle geometry by a nearly-conformal mapping procedure. Type-dependent finite-differences are constructed using a coordinate-independent, 'rotated' differencing scheme. Methods of accelerating convergence of the iterative solution are demonstrated including a hybrid fast-Poisson-solver/relaxation scheme and an extrapolated relaxation procedure. Calculated pressure distributions are compared with experimental data for a variety of Mach numbers and mass-flow ratios, and show generally good agreement.

Caughey, D. A.↗

Second-order non-iterative ADI solution of non-linear partial differential equations

A new method for the solution of non-linear partial differential equations by an ADI procedure is described. Although the method is second order accurate in time, it does not require either iterations or predictor corrector methods to overcome the nonlinearity of the equations. Thus the computational effort required for the solution of the non-linear problem becomes similar to that required for the linear case. The method is applied to a two-dimensional 'extended Burgers equation'. Linear stability is studied, and some numerical solutions obtained. The improved accuracy obtained by the 2nd order truncation error is clearly manifested.

Wolfshtein, M.↗

An iterative algorithm for objective wind field analysis

Three different algorithms for objective wind field analysis were tested on the same set of initial conditions: Dickerson-Sasaki's 'strong constraint' algorithm, a fixed-vorticity algorithm, and a newly proposed fixed-station-velocity algorithm. The three methods are compared with respect to the degree of minimization of wind divergence and the accuracy of wind data at a measured station. The first two techniques, though they reduce wind divergence, produce wind vectors substantially different from the observed values. The proposed iterative scheme is similar to Endlich's (1967) procedure for treating a macroscale wind field, and minimizes divergence while retaining the observed wind vectors.

Liu, C. Y.↗

Iterative design of one- and two-dimensional FIR digital filters

The paper describes a new iterative technique for designing FIR (finite duration impulse response) digital filters using a frequency weighted least squares approximation. The technique is as easy to implement (via FFT) and as effective in two dimensions as in one dimension, and there are virtually no limitations on the class of filter frequency spectra approximated. An adaptive adjustment of the frequency weight to achieve other types of design approximation such as Chebyshev type design is discussed.

Suk, M.↗

An iterative procedure for obtaining maximum-likelihood estimates of the parameters for a mixture of normal distributions

This paper addresses the problem of obtaining numerically maximum-likelihood estimates of the parameters for a mixture of normal distributions. In recent literature, a certain successive-approximations procedure, based on the likelihood equations, was shown empirically to be effective in numerically approximating such maximum-likelihood estimates; however, the reliability of this procedure was not established theoretically. Here, we introduce a general iterative procedure, of the generalized steepest-ascent (deflected-gradient) type, which is just the procedure known in the literature when the step-size is taken to be 1. We show that, with probability 1 as the sample size grows large, this procedure converges locally to the strongly consistent maximum-likelihood estimate whenever the step-size lies between 0 and 2. We also show that the step-size which yields optimal local convergence rates for large samples is determined in a sense by the 'separation' of the component normal densities and is bounded below by a number between 1 and 2.

Peters, B. C., Jr.↗

An iterative algorithm for decoding block codes transmitted over a memoryless channel

An algorithm was developed which optimally decodes a block code for minimum probability of symbol error in an iterative manner. The initial estimate is made by looking at each bit independently and is improved by considering bits related to it through the parity check equations. The dependent bits are considered in order of interesting probability of error. Since the computation proceeds in a systematic way with the bits having the greatest effect being used first, the algorithm approaches the optimum estimate after only a fraction of the parity check equations were used.

Greenberger, H. J.↗

The CLASSY clustering algorithm: Description, evaluation, and comparison with the iterative self-organizing clustering system (ISOCLS)

A clustering method, CLASSY, was developed, which alternates maximum likelihood iteration with a procedure for splitting, combining, and eliminating the resulting statistics. The method maximizes the fit of a mixture of normal distributions to the observed first through fourth central moments of the data and produces an estimate of the proportions, means, and covariances in this mixture. The mathematical model which is the basic for CLASSY and the actual operation of the algorithm is described. Data comparing the performances of CLASSY and ISOCLS on simulated and actual LACIE data are presented.

Lennington, R. K.↗

A new boundary-layer inviscid iteration technique for separated flow

A new viscous-inviscid iteration procedure is presented which is applicable to separated flows. The new procedure is simple, converges rapidly, and does not require numerical smoothing, at least in the cases computed thus far. Calculations are presented for both incompressible and compressible separated flow in the juncture region between an axisymmetric body and sting. The viscous computation is obtained with a recently developed inverse boundary-layer procedure which is no more complicated than a standard direct finite-difference boundary-layer technique. The inviscid computation is made with an axisymmetric transonic code called RAXBOD, in which surface injection is used to represent the viscous effects.

Carter, J. E.↗

Modified Iterative Extended Hueckel. 2: Application to the interaction of Na(+), Na(+)(aq.), Mg(+)-2(aq.) with adenine and thymine

Modified Iterative Extended Hueckel, which includes explicit effective internuclear and electronic interactions, is applied to the study of the energetics of Na(+),Mg(+), Na(+) (aqueous), and Mg(+2) (aqueous) ions approaching various possible binding sites on adenine and thymine. Results for the adenine + ion and thymine + ion are in good qualitative agreement with ab initio work on analogous systems. Energy differences between competing sites are in excellent agreement. Hydration appears to be a critical factor in determining favorable binding sites. That the adenine Nl and N3 sites cannot displace a water molecule from the hydrated cation indicates that they are not favorable binding sites in aqueous media. Of those sites investigated, 04 was the most favorable binding site on the thymine for the bare Na(+). However, the 02 site was the most favorable binding site for either hydrated cation.

Aronowitz, S.↗

Behavior of molecules on interstellar grains - Application of the Langevin equation and iterative extended Hueckel

The Langevin equation was used to explore an adsorbate desorption mechanism. Calculations were performed using iterative extended Hueckel on a silica model site with various small adsorbates, e.g., H, CH, OH, NO, CO. It was found that barriers to free traversal from one site to another are substantial (about 3-10 eV). A bootstrap desorption mechanism for some molecules in the process of forming at a site also became apparent from the calculations. The desorption mechanisms appear to be somewhat balanced by a counterforce - the attraction of sites for the newly desorbed molecule. The order of attraction to a silica grain site for the diatomic molecules considered was OH greater than CH greater than CO greater than NO, when these entities were sufficiently distant. The nature of the silica grain and that of the 'cold' desorption mechanism, when considered together, suggest that the abundance of very small grains might be less common than anticipated.

Aronowitz, S.↗

Iterative optical vector-matrix processors (survey of selected achievable operations)

An iterative optical vector-matrix multiplier with a microprocessor-controlled feedback loop capable of performing a wealth of diverse operations was described. A survey and description of many of its operations demonstrates the versatility and flexibility of this class of optical processor and its use in diverse applications. General operations described include: linear difference and differential equations, linear algebraic equations, matrix equations, matrix inversion, nonlinear matrix equations, deconvolution and eigenvalue and eigenvector computations. Engineering applications being addressed for these different operations and for the IOP are: adaptive phased-array radar, time-dependent system modeling, deconvolution and optimal control.

Casasent, D.↗

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.↗

Comparison of starting values for iterative solutions to a universal Kepler's equation

General starting values for the iterative numerical solution of a universal Kepler's equation for position in a conic orbit at a specified time are investigated. Three starting values based on recent refinements of previously obtained bounds on the solution are derived and tested numerically. Of these, a simple starting value based on a cubic approximation to Kepler's equation provides the most rapid convergence using both first and second order Newton algorithms. The performance of the starting values are compared with similar studies which used the restricted case of elliptical orbits with the initial epoch at periapse.

Bergam, M. J.↗

An iterative radiative transfer code for ocean-atmosphere systems

The details of an iterative radiative transfer code for computing the intensity and degree of polarization of diffuse radiation in models of the ocean-atmosphere system are described. The present code neglects the upwelling radiation from below the ocean surface and as such can be applied to the part of the spectrum where the absorption by water is strong. To establish the reliability of the numerical scheme and the computer code, the results are compared with those of Fraser and Walker (1968), Dave (1972), and Mullamaa (1964); they are found to be in excellent agreement. The computations also show that both the intensity and the degree of polarization of the upwelling diffuse radiation at the top of the atmosphere vary significantly when the rough ocean at the base of the atmosphere is replaced by a Lambertian surface that reflects the same energy as the rough ocean.

Ahmad, Z.↗

Iterative algorithms for large sparse linear systems on parallel computers

Algorithms for assembling in parallel the sparse system of linear equations that result from finite difference or finite element discretizations of elliptic partial differential equations, such as those that arise in structural engineering are developed. Parallel linear stationary iterative algorithms and parallel preconditioned conjugate gradient algorithms are developed for solving these systems. In addition, a model for comparing parallel algorithms on array architectures is developed and results of this model for the algorithms are given.

Adams, L. M.↗

Iterative spectral methods and spectral solutions to compressible flows

A spectral multigrid scheme is described which can solve pseudospectral discretizations of self-adjoint elliptic problems in O(N log N) operations. An iterative technique for efficiently implementing semi-implicit time-stepping for pseudospectral discretizations of Navier-Stokes equations is discussed. This approach can handle variable coefficient terms in an effective manner. Pseudospectral solutions of compressible flow problems are presented. These include one dimensional problems and two dimensional Euler solutions. Results are given both for shock-capturing approaches and for shock-fitting ones.

Hussaini, M. Y.↗