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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 505 records · Page 28

All sources NASA NTRS DOE OSTI

NASA NTRS1990

Comparative study of computational efficiency of two LU schemes for non-equilibrium reacting flows

The systems of equations governing chemically nonequilibrium flows are solved numerically by two lower-upper(LU) algorithms, namely, LU-SSOR (Yoon and Jameson, 1987) and LU-SW (Steger and Warming, 1981). The methods of flux-Jacobian splitting differentiate the two LU algorithms. The LU-SSOR gives a simpler implicit operator with less temporal damping, while the LU-SW converges faster but requires more computation for each iteration. Relative efficiencies and mutual merits of these two LU algorithms are compared. The results show that LU-SW with upwind-differenced right-hand-side gives the best convergence.

Tsai, Y.-L. Peter↗

NASA NTRS1981

Solution of the transonic full potential equation in conservative form using an implicit algorithm

The paper presents numerical solutions of the full potential equation in conservative form. The iteration scheme used is a fully implicit approximate factorization technique and provides a significant improvement in convergence speed relative to standard successive line overrelaxation algorithms. The spatial differencing algorithm is centrally differenced in both subsonic and supersonic regions to maintain stability. This effectively approximates rotated differencing, thereby greatly improving the reliability of the algorithm.

Holst, T.↗

NASA NTRS2001

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↗

NASA NTRS2010

A General Algorithm for Reusing Krylov Subspace Information. I. Unsteady Navier-Stokes

A general algorithm is developed that reuses available information to accelerate the iterative convergence of linear systems with multiple right-hand sides A x = b (sup i), which are commonly encountered in steady or unsteady simulations of nonlinear equations. The algorithm is based on the classical GMRES algorithm with eigenvector enrichment but also includes a Galerkin projection preprocessing step and several novel Krylov subspace reuse strategies. The new approach is applied to a set of test problems, including an unsteady turbulent airfoil, and is shown in some cases to provide significant improvement in computational efficiency relative to baseline approaches.

Carpenter, Mark H.↗

NASA NTRS1991

Development of a pressure based multigrid solution method for complex fluid flows

In order to reduce the computational difficulty associated with a single grid (SG) solution procedure, the multigrid (MG) technique was identified as a useful means for improving the convergence rate of iterative methods. A full MG full approximation storage (FMG/FAS) algorithm is used to solve the incompressible recirculating flow problems in complex geometries. The algorithm is implemented in conjunction with a pressure correction staggered grid type of technique using the curvilinear coordinates. In order to show the performance of the method, two flow configurations, one a square cavity and the other a channel, are used as test problems. Comparisons are made between the iterations, equivalent work units, and CPU time. Besides showing that the MG method can yield substantial speed-up with wide variations in Reynolds number, grid distributions, and geometry, issues such as the convergence characteristics of different grid levels, the choice of convection schemes, and the effectiveness of the basic iteration smoothers are studied. An adaptive grid scheme is also combined with the MG procedure to explore the effects of grid resolution on the MG convergence rate as well as the numerical accuracy.

Shyy, Wei↗

NASA NTRS1981

A procedure for estimating the information content of SBUV ozone profiles

A description is presented of a new procedure for determining ozone mixing ratios in the upper stratosphere from satellite observations of backscattered ultraviolet (SBUV) radiance. The employed approach is based on a SBUV inversion procedure. The inversion algorithm can best be described as a series of sequentially performed operations, taking into account the determination of a first guess profile, the representation of the ozone profile by a polynomial, the extension of the profile outside the measurement region, error assessment, the optimal ozone profile, and the utilization of iteration. It is found that the described ozone profiling algorithm can be implemented with sufficient computational speed to be used operationally for the inversion of SBUV data.

Cunnold, D. M.↗

NASA NTRS1985

Algorithm Solves Constrained and Unconstrained Optimization Problems

Is quasi-Newton iteration utilizing Broyden/Fletcher/Goldfarb/Shanno update on inverse Hessian matrix. Capable of solving constrained optimization unconstrained optimization and constraints only problems with one to five independent variables from one to five constraint functions and one dependent function optimized.

Denson, M. A.↗

NASA NTRS2020

A Modified Algorithm and Open-Source Computational Package for the Determination of Infrared Optical Constants Relevant to Astrophysics

Infrared (IR) telescopes, such as Spitzer and SOFIA, have revealed a rich variety of chemical species trapped in interstellar ices. The most fundamental parameters to be derived from observed IR spectra are the identity and abundance of each component. Several compounds have been conclusively or tentatively identified, but the band strengths and optical constants needed to derive accurate abundances for many of these are poorly constrained. We have developed a modified approach to the extraction of the real and imaginary parts of the refractive index (optical constants) of a thin film from a single transmission spectrum measured in the IR spectral range. Our algorithm is similar to those implemented by previous authors, with some major changes that yield results for strong absorptions where previous approaches fail: (1) an adaptive k-correction step size, (2) the use of a root-finding algorithm to obtain a more accurate k-correction at each iteration, and (3) a k-correction step that prevents non-physical results such as negative n-values that prevent convergence in the calculation algorithm. The algorithm is presented and described, with examples to show agreement with some existing results and improvements upon others. New optical-constants calculations for CH3OH, CO2, N2O, and CH4 are presented, and potential implications for the modeling of interstellar and planetary ice data from space telescopes are discussed. With the objective of being open-source and transparent, the full source code in the free Python programming language is made available along with the compiled version and the laboratory data used to produce the results shown.

Perry A. Gerakines↗

NASA NTRS1974

An algorithm for a general class of routing problems derived from Huygens' principle

If a set of N points or nodes with a nonnegative cost associated with each ordered pair is known, it is desired to find a path from one given node to another given node which minimizes the cost sum. An algorithm is presented which yields a global minimum solution after at most N - 1 iterations or on a typical large third-generation computer, after 1 hour of computation time for a 10,000-node problem. The rapid-access data storage capacity demanded by the algorithm is approximately 3N words for costs read in from slow-access storage or 2N words for calculable costs. The time-storage requirements of the algorithm known to the authors. When the problem is viewed as a discretized optimal control problem, after N-1 iterations, an optimal control or node transition is established for each of the N nodes or states; thus, the algorithm can be applied to situations were there may be errors in the control that necessitate a closed loop control that necessitate a closed loop control philosophy.

Avis, L. M.↗

NASA NTRS1987

Development of a stereo analysis algorithm for generating topographic maps using interactive techniques of the MPP

A local area matching algorithm was developed on the Massively Parallel Processor (MPP). It is an iterative technique that first matches coarse or low resolution areas and at each iteration performs matches of higher resolution. Results so far show that when good matches are possible in the two images, the MPP algorithm matches corresponding areas as well as a human observer. To aid in developing this algorithm, a control or shell program was developed for the MPP that allows interactive experimentation with various parameters and procedures to be used in the matching process. (This would not be possible without the high speed of the MPP). With the system, optimal techniques can be developed for different types of matching problems.

Strong, James P.↗

NASA NTRS2003

Using a Portfolio of Algorithms for Planning and Scheduling

The Automated Scheduling and Planning Environment (ASPEN) software system, aspects of which have been reported in several previous NASA Tech Briefs articles, includes a subsystem that utilizes a portfolio of heuristic algorithms that work synergistically to solve problems. The nature of the synergy of the specific algorithms is that their likelihoods of success are negatively correlated: that is, when a combination of them is used to solve a problem, the probability that at least one of them will succeed is greater than the sum of probabilities of success of the individual algorithms operating independently of each other. In ASPEN, the portfolio of algorithms is used in a planning process of the iterative repair type, in which conflicts are detected and addressed one at a time until either no conflicts exist or a user-defined time limit has been exceeded. At each choice point (e.g., selection of conflict; selection of method of resolution of conflict; or choice of move, addition, or deletion) ASPEN makes a stochastic choice of a combination of algorithms from the portfolio. This approach makes it possible for the search to escape from looping and from solutions that are locally but not globally optimum.

Sherwood, Robert↗

NASA NTRS1998

Nested Quantum Search and NP-Complete Problem

A quantum algorithm is known that solves an unstructured search problem in a number of iterations of order square-root of d, where d is the dimension of the search space, whereas any classical algorithm scales as O(d).

NP-complete problems quantum search algorithm tree↗

NASA NTRS1993

Using parallel banded linear system solvers in generalized eigenvalue problems

Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speed-up is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented.

Zhang, Hong↗

NASA NTRS1994

Using parallel banded linear system solvers in generalized eigenvalue problems

Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speedup is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented.

DISTRIBUTED MEMORY MULTIPROCES↗

NASA NTRS1990

An improved fully stressed design algorithm for plate/shell structures

The stress-ratio algorithm associated with fully stressed design philosophy has been used as a convenient tool to achieve minimum weight design of strength-limited structures. The algorithm is effective and converges quickly for many cases. However, it presents extremely slow oscillatory iteration histories for plate-thickness design problems that involve transverse bending loads. Modification of the basic algorithm presented in this paper provides an effective remedy to this problem when both membrane and bending loads are present. The modified resizing algorithm requires numerical solutions of a fourth-order algebraic equation. No additional data, beyond the ordinary static analysis results, are required.

Miura, H.↗

NASA NTRS1996

Guidance of Nonlinear Systems

The paper describes a method for guiding a dynamic system through a given set of points. The paradigm is a fully automatic aircraft subject to air traffic control (ATC). The ATC provides a sequence of way points through which the aircraft trajectory must pass. The way points typically specify time, position, and velocity. The guidance problem is to synthesize a system state trajectory which satisfies both the ATC and aircraft constraints. Complications arise because the controlled process is multi-dimensional, multi-axis, nonlinear, highly coupled, and the state space is not flat. In addition, there is a multitude of possible operating modes, which may number in the hundreds. Each such mode defines a distinct state space model of the process by specifying the state space coordination, the partition of the controls into active controls and configuration controls, and the output map. Furthermore, mode transitions must be smooth. The guidance algorithm is based on the inversion of the pure feedback approximations, which is followed by iterative corrections for the effects of zero dynamics. The paper describes the structure and modules of the algorithm, and the performance is illustrated by several example aircraft maneuvers.

Meyer, George↗

NASA NTRS1997

Guidance of Nonlinear Systems

The paper describes a method for guiding a dynamic system through a given set of points. The paradigm is a fully automatic aircraft subject to air traffic control (ATC). The ATC provides a sequence of way points through which the aircraft trajectory must pass. The way points typically specify time, position, and velocity. The guidance problem is to synthesize a system state trajectory which satisfies both the ATC and aircraft constraints. Complications arise because the controlled process is multi-dimensional, multi-axis, nonlinear, highly coupled, and the state space is not flat. In addition, there is a multitude of possible operating modes, which may number in the hundreds. Each such mode defines a distinct state space model of the process by specifying the state space coordinatization, the partition of the controls into active controls and configuration controls, and the output map. Furthermore, mode transitions must be smooth. The guidance algorithm is based on the inversion of the pure feedback approximations, which is followed by iterative corrections for the effects of zero dynamics. The paper describes the structure and modules of the algorithm, and the performance is illustrated by several example aircraft maneuvers.

Meyer, George↗

NASA NTRS1976

Advances in the application of fast semidirect computational methods in transonic flow

The paper uses finite-difference algorithms called 'fast direct elliptic solvers' within an iteration scheme for the rapid solution of the equations of inviscid transonic aerodynamics. The methods are called 'direct' (or semidirect) because the entire computational field is solved at once rather than in successive traverses over the field. These semidirect iterative methods have been limited here to the investigation of two-dimensional steady inviscid flow over airfoils in subsonic free stream.

Martin, E. D.↗