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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Frequency-multiplexed and pipelined iterative optical systolic array processors

Optical matrix processors using acoustooptic transducers are described, with emphasis on new systolic array architectures using frequency multiplexing in addition to space and time multiplexing. A Kalman filtering application is considered in a case study from which the operations required on such a system can be defined. This also serves as a new and powerful application for iterative optical processors. The importance of pipelining the data flow and the ordering of the operations performed in a specific application of such a system are also noted. Several examples of how to effectively achieve this are included. A new technique for handling bipolar data on such architectures is also described.

Casasent, D.↗
NASA NTRS1984

Adapting iterative algorithms for solving large sparse linear systems for efficient use on the CDC CYBER 205

Adapting and designing mathematical software to achieve optimum performance on the CYBER 205 is discussed. Comments and observations are made in light of recent work done on modifying the ITPACK software package and on writing new software for vector supercomputers. The goal was to develop very efficient vector algorithms and software for solving large sparse linear systems using iterative methods.

Kincaid, D. R.↗
NASA NTRS1984

A model of asynchronous iterative algorithms for solving large, sparse, linear systems

Solving large, sparse, linear systems of equations is one of the fundamental problems in large scale scientific and engineering computation. A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. This model is then analyzed to determine the expected intertask data transfer and task computational complexity as functions of the number of tasks. Based on the analysis, recommendations for task partitioning are made. These recommendations are a function of the sparseness of the linear system, its structure (i.e., randomly sparse or banded), and dimension.

Reed, D. A.↗
NASA NTRS1984

Surface diagnosis of large reflector antennas using microwave holographic metrology - An iterative approach

The radiation pattern of an antenna can be significantly affected by reflector surface errors. A minimization of losses due to surface inaccuracies is, therefore, required. A suitable procedure for the determination of the deviations of the surface from its ideal geometry is based on the microwave holographic technique. In this procedure, the complex pattern of the antenna is measured, and the Fourier transform relationship, existing between the radiation pattern and the function related to the current distribution on the reflector surface, is applied. It is naturally desirable to limit the amount of measured data. The present investigation is concerned with the concept of the Fourier transform relationship between the induced current and the far field. It is demonstrated that the relationship, in general, can be interpreted as a summation of many Fourier transforms. An iterative scheme is employed to continue the far-field pattern outside the measurement window.

Rahmat-Samii, Y.↗
NASA NTRS1984

Augmented weak forms and element-by-element preconditioners: Efficient iterative strategies for structural finite elements. A preliminary study

A weak formulation in structural analysis that provides well conditioned matrices suitable for iterative solutions is presented. A mixed formulation ensures the proper representation of the problem and the constitutive relations are added in a penalized form. The problem is solved by a double conjugate gradient algorithm combined with an element by element approximate factorization procedure. The double conjugate gradient strategy resembles Uzawa's variable-length type algorithms the main difference is the presence of quadratic terms in the mixed variables. In the case of shear deformable beams these terms ensure that the proper finite thickness solution is obtained.

Muller, A.↗
NASA NTRS1984

Parallel, iterative solution of sparse linear systems: Models and architectures

A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. A data transfer model predicting both the probability that data must be transferred between two tasks and the amount of data to be transferred is presented. This model is used to derive an execution time model for predicting parallel execution time and an optimal number of tasks given the dimension and sparsity of the coefficient matrix and the costs of computation, synchronization, and communication. The suitability of different parallel architectures for solving randomly sparse linear systems is discussed. Based on the complexity of task scheduling, one parallel architecture, based on a broadcast bus, is presented and analyzed.

Reed, D. A.↗
NASA NTRS1986

Aircraft Rollout Iterative Energy Simulation

Aircraft Rollout Iterative Energy Simulation (ARIES) program analyzes aircraft-brake performance during rollout. Simulates threedegree-of-freedom rollout after nose-gear touchdown. Amount of brake energy dissipated during aircraft landing determines life expectancy of brake pads. ARIES incorporates brake pressure, actual flight data, crosswinds, and runway characteristics to calculate following: brake energy during rollout for up to four independent brake systems; time profiles of rollout distance, velocity, deceleration, and lateral runway position; and all aerodynamic moments on aircraft. ARIES written in FORTRAN 77 for batch execution.

Kinoshita, L.↗
NASA NTRS1981

Always-Convergent Iterative Noise Removal and Deconvolution for Image Data

Linear filtering techniques currently used for the restoration of noisy, blurred or otherwise degraded image data are discussed and new techniques related to the iterative techniques of Morrison and van Cittert are developed and implemented. Programs written for the implementation are discussed in the appendices. It is shown that the new techniques are convergent for any system response function, and they are applied to the task of restoring a severely blurred image.

Ioup, G. E.↗
NASA NTRS1985

Marching iterative methods for the parabolized and thin layer Navier-Stokes equations

Downstream marching iterative schemes for the solution of the Parabolized or Thin Layer (PNS or TL) Navier-Stokes equations are described. Modifications of the primitive equation global relaxation sweep procedure result in efficient second-order marching schemes. These schemes take full account of the reduced order of the approximate equations as they behave like the SLOR for a single elliptic equation. The improved smoothing properties permit the introduction of Multi-Grid acceleration. The proposed algorithm is essentially Reynolds number independent and therefore can be applied to the solution of the subsonic Euler equations. The convergence rates are similar to those obtained by the Multi-Grid solution of a single elliptic equation; the storage is also comparable as only the pressure has to be stored on all levels. Extensions to three-dimensional and compressible subsonic flows are discussed. Numerical results are presented.

Israeli, M.↗
NASA NTRS1986

Iterative adaption of the bidimensional wall of the French T2 wind tunnel around a C5 axisymmetrical model: Infinite variation of the Mach number at zero incidence and a test at increased incidence

The top and bottom two-dimensional walls of the T2 wind tunnel are adapted through an iterative process. The adaptation calculation takes into account the flow three-dimensionally. This method makes it possible to start with any shape of walls. The tests were performed with a C5 axisymmetric model at ambient temperature. Comparisons are made with the results of a true three-dimensional adaptation.

Archambaud, J. P.↗
NASA NTRS1984

Iterative and function-continuation Fourier deconvolution methods for enhancing mass spectrometer resolution

Mass spectrometer data in the form of ion current versus mass-to-charge ratio often include overlapping mass peaks, especially in low- and medium-resolution instruments. Numerical deconvolution of such data effectively enhances the resolution by decreasing the overlap of mass peaks. In this paper two approaches to deconvolution are presented: a function-domain iterative technique and a Fourier transform method which uses transform-domain function-continuation. Both techniques include data smoothing to reduce the sensitivity of the deconvolution to noise. The efficacy of these methods is demonstrated through application to representative mass spectrometer data and the deconvolved results are discussed and compared to data obtained from a spectrometer with sufficient resolution to achieve separation of the mass peaks studied. A case for which the deconvolution is seriously affected by Gibbs oscillations is analyzed.

Ioup, J. W.↗
NASA NTRS1985

Parallel, iterative solution of sparse linear systems - Models and architectures

Solving large, sparse, linear systems of equations is a fundamental problem in large scale scientific and engineering computation. A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. A data transfer model predicting both the probability that data must be transferred between two tasks and the amount of data to be transferred is presented. This model is used to derive an execution time model for predicting parallel execution time and an optimal number of tasks given the dimension and sparsity of the coefficient matrix and the costs of computation, synchronization, and communication. The suitability of different parallel architectures for solving randomly sparse linear systems is discussed. Based on the complexity of task scheduling, one parallel architecture, based on a broadcast bus, is presented and analyzed.

Reed, D. A.↗
NASA NTRS1985

Marching iterative methods for the Parabolized and Thin Layer Navier-Stokes equations

Downstream marching iterative schemes for the solution of the Parabolized or Thin Layer (PNS or TL) Navier-Stokes equations are described. Modifications of the primitive equation global relaxation sweep procedure result in efficient second-order marching schemes. These schemes take full account of the reduced order of the approximate equations as they behave like the SLOR for a single elliptic equation. The improved smoothing properties permit the introduction of Multi-Grid acceleration. The proposed algorithm is essentially Reynolds number independent and therefore can be applied to the solution of the subsonic Euler equations. The convergence rates are similar to those obtained by the Multi-Grid solution of a single elliptic equation; the storage is also comparable as only the pressure has to be stored on all levels. Extensions to three-dimensional and compressible subsonic flows are discussed. Numerical results are presented.

Israeli, M.↗
NASA NTRS1986

Fourier analysis of the SOR iteration

The SOR iteration for solving linear systems of equations depends upon an overrelaxation factor omega. It is shown that for the standard model problem of Poisson's equation on a rectangle, the optimal omega and corresponding convergence rate can be rigorously obtained by Fourier analysis. The trick is to tilt the space-time grid so that the SOR stencil becomes symmetrical. The tilted grid also gives insight into the relation between convergence rates of several variants.

Leveque, R. J.↗
NASA NTRS1986

Analysis of the SOR iteration for the 9-point Laplacian

The SOR iteration for solving linear systems of equations depends upon an overrelaxation factor omega. A theory for determining omega was given by Young (1950) for consistently ordered matrices. Here the optimal omega is determined for the 9-point stencil for the model problem of Laplace's equation on a square. Several orderings of the equations are considered, including the natural rowwise and multicolor orderings, all of which lead to non-consistently ordered matrices, and two equivalence classes of orderings are found with different convergence behavior and optimal omega's. The results for the natural rowwise ordering are compared to those of Garabedian (1956) and it is explained why both results are, in a sense, correct, even though they differ. Also analyzed is a pseudo SOR method for the model problem and it is shown that it is not as effective as the SOR methods. Finally, the point SOR methods are compared to known results for line SOR methods for this problem.

Loyce M. Adams↗
NASA NTRS1986

Iterative methods for elliptic finite element equations on general meshes

Iterative methods for arbitrary mesh discretizations of elliptic partial differential equations are surveyed. The methods discussed are preconditioned conjugate gradients, algebraic multigrid, deflated conjugate gradients, an element-by-element techniques, and domain decomposition. Computational results are included.

Nicolaides, R. A.↗