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 631 records · Page 35

All sources NASA NTRS DOE OSTI

NASA NTRS1989

Numerical algorithms for steady and unsteady incompressible Navier-Stokes equations

The numerical analysis of the incompressible Navier-Stokes equations are becoming important tools in the understanding of some fluid flow problems which are encountered in research as well as in industry. With the advent of the supercomputers, more realistic problems can be studied with a wider choice of numerical algorithms. An alternative formulation is presented for viscous incompressible flows. The incompressible Navier-Stokes equations are cast in a velocity/vorticity formulation. This formulation consists of solving the Poisson equations for the velocity components and the vorticity transport equation. Two numerical algorithms for the steady two-dimensional laminar flows are presented. The first method is based on the actual partial differential equations. This uses a finite-difference approximation of the governing equations on a staggered grid. The second method uses a finite element discretization with the vorticity transport equation approximated using a Galerkin approximation and the Poisson equations are obtained using a least squares method. The equations are solved efficiently using Newton's method and a banded direct matrix solver (LINPACK). The method is extended to steady three-dimensional laminar flows and applied to a cubic driven cavity using finite difference schemes and a staggered grid arrangement on a Cartesian mesh. The equations are solved iteratively using a plane zebra relaxation scheme. Currently, a two-dimensional, unsteady algorithm is being developed using a generalized coordinate system. The equations are discretized using a finite-volume approach. This work will then be extended to three-dimensional flows.

Hafez, Mohammed↗

NASA NTRS1991

A look-ahead variant of the Lanczos algorithm and its application to the quasi-minimal residual method for non-Hermitian linear systems

The Lanczos algorithm can be used both for eigenvalue problems and to solve linear systems. However, when applied to non-Hermitian matrices, the classical Lanczos algorithm is susceptible to breakdowns and potential instabilities. In addition, the biconjugate gradient (BCG) algorithm, which is the natural generalization of the conjugate gradient algorithm to non-Hermitian linear systems, has a second source of breakdowns, independent of the Lanczos breakdowns. Here, we present two new results. We propose an implementation of a look-ahead variant of the Lanczos algorithm which overcomes the breakdowns by skipping over those steps where a breakdown or a near-breakdown would occur. The new algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products per step as the classical Lanczos algorithm without look-ahead. Based on the proposed look-ahead Lanczos algorithm, we then present a novel BCG-like approach, the quasi-minimal residual (QMR) method, which avoids the second source of breakdowns in the BCG algorithm. We present details of the new method and discuss some of its properties. In particular, we discuss the relationship between QMR and BCG, showing how one can recover the BCG iterates, when they exist, from the QMR iterates. We also present convergence results for QMR, showing the connection between QMR and the generalized minimal residual (GMRES) algorithm, the optimal method in this class of methods. Finally, we give some numerical examples, both for eigenvalue computations and for non-Hermitian linear systems.

Nachtigal, Noel M.↗

NASA NTRS1971

Abstract models for the synthesis of optimization algorithms.

Systematic approach to the problem of synthesis of optimization algorithms. Abstract models for algorithms are developed which guide the inventive process toward ?conceptual' algorithms which may consist of operations that are inadmissible in a practical method. Once the abstract models are established a set of methods for converting ?conceptual' algorithms falling into the class defined by the abstract models into ?implementable' iterative procedures is presented.

Meyer, G. G. L.↗

NASA NTRS1974

Transonic conical flow

The problem of inviscid, steady transonic conical flow, formulated in terms of the small disturbance theory, is studied. The small disturbance equation and similarity rules are presented, and a boundary value problem is formulated for the case of a supersonic freestream Mach number. The equation for the perturbation potential is solved numerically using an elliptic finite difference system. The difference equations are solved with a point relaxation algorithm that is also capable of capturing the shock wave during the iteration procedure by using the boundary conditions at the shock. Numerical calculations, for shock location, pressure distribution and drag coefficient, are presented for a family of nonlifting conical wings. The theory of slender wings is also presented and analytical results for pressure and drag coefficients are obtained.

Agopian, K. G.↗

NASA NTRS1975

Some estimation formulae for continuous time-invariant linear systems

In this brief paper we examine a Riccati equation decomposition due to Reid and Lainiotis and apply the result to the continuous time-invariant linear filtering problem. Exploitation of the time-invariant structure leads to integration-free covariance recursions which are of use in covariance analyses and in filter implementations. A super-linearly convergent iterative solution to the algebraic Riccati equation (ARE) is developed. The resulting algorithm, arranged in a square-root form, is thought to be numerically stable and competitive with other ARE solution methods. Certain covariance relations that are relevant to the fixed-point and fixed-lag smoothing problems are also discussed.

Bierman, G. J.↗

NASA NTRS1978

Finite element concepts in computational aerodynamics

Finite element theory was employed to establish an implicit numerical solution algorithm for the time averaged unsteady Navier-Stokes equations. Both the multidimensional and a time-split form of the algorithm were considered, the latter of particular interest for problem specification on a regular mesh. A Newton matrix iteration procedure is outlined for solving the resultant nonlinear algebraic equation systems. Multidimensional discretization procedures are discussed with emphasis on automated generation of specific nonuniform solution grids and accounting of curved surfaces. The time-split algorithm was evaluated with regards to accuracy and convergence properties for hyperbolic equations on rectangular coordinates. An overall assessment of the viability of the finite element concept for computational aerodynamics is made.

Baker, A. J.↗

NASA NTRS1985

Finite element simulation of temperature dependent free surface flows

The method of Engelman and Sani (1984) for a finite-element simulation of incompressible surface flows with a free and/or moving fluid interface, such as encountered in crystal growth and coating and polymer technology, is extended to temperature-dependent flows, including the effect of temperature-dependent surface tension. The basic algorithm of Saito and Scriven (1981) and Ruschak (1980) has been generalized and implemented in a robust and versatile finite-element code that can be employed with relative ease for the simulation of free-surface problems in complex geometries. As a result, the costly dependence on the Newton-Raphson algorithm has been eliminated by replacing it with a quasi-Newton iterative method, which nearly retains the superior convergence properties of the Newton-Raphson method.

Engelman, M. S.↗

NASA NTRS1987

Parallel processing in finite element structural analysis

A brief review is made of the fundamental concepts and basic issues of parallel processing. Discussion focuses on parallel numerical algorithms, performance evaluation of machines and algorithms, and parallelism in finite element computations. A computational strategy is proposed for maximizing the degree of parallelism at different levels of the finite element analysis process including: 1) formulation level (through the use of mixed finite element models); 2) analysis level (through additive decomposition of the different arrays in the governing equations into the contributions to a symmetrized response plus correction terms); 3) numerical algorithm level (through the use of operator splitting techniques and application of iterative processes); and 4) implementation level (through the effective combination of vectorization, multitasking and microtasking, whenever available).

Noor, Ahmed K.↗

NASA NTRS1988

A Strassen-Newton algorithm for high-speed parallelizable matrix inversion

Techniques are described for computing matrix inverses by algorithms that are highly suited to massively parallel computation. The techniques are based on an algorithm suggested by Strassen (1969). Variations of this scheme use matrix Newton iterations and other methods to improve the numerical stability while at the same time preserving a very high level of parallelism. One-processor Cray-2 implementations of these schemes range from one that is up to 55 percent faster than a conventional library routine to one that is slower than a library routine but achieves excellent numerical stability. The problem of computing the solution to a single set of linear equations is discussed, and it is shown that this problem can also be solved efficiently using these techniques.

Bailey, David H.↗

NASA NTRS1991

Conjugate Gradient Algorithms For Manipulator Simulation

Report discusses applicability of conjugate-gradient algorithms to computation of forward dynamics of robotic manipulators. Rapid computation of forward dynamics essential to teleoperation and other advanced robotic applications. Part of continuing effort to find algorithms meeting requirements for increased computational efficiency and speed. Method used for iterative solution of systems of linear equations.

Fijany, Amir↗

NASA NTRS1990

Global convergence of inexact Newton methods for transonic flow

In computational fluid dynamics, nonlinear differential equations are essential to represent important effects such as shock waves in transonic flow. Discretized versions of these nonlinear equations are solved using iterative methods. In this paper an inexact Newton method using the GMRES algorithm of Saad and Schultz is examined in the context of the full potential equation of aerodynamics. In this setting, reliable and efficient convergence of Newton methods is difficult to achieve. A poor initial solution guess often leads to divergence or very slow convergence. This paper examines several possible solutions to these problems, including a standard local damping strategy for Newton's method and two continuation methods, one of which utilizes interpolation from a coarse grid solution to obtain the initial guess on a finer grid. It is shown that the continuation methods can be used to augment the local damping strategy to achieve convergence for difficult transonic flow problems. These include simple wings with shock waves as well as problems involving engine power effects. These latter cases are modeled using the assumption that each exhaust plume is isentropic but has a different total pressure and/or temperature than the freestream.

Young, David P.↗

NASA NTRS1991

Intelligent perturbation algorithms to space scheduling optimization

The limited availability and high cost of crew time and scarce resources make optimization of space operations critical. Advances in computer technology coupled with new iterative search techniques permit the near optimization of complex scheduling problems that were previously considered computationally intractable. Described here is a class of search techniques called Intelligent Perturbation Algorithms. Several scheduling systems which use these algorithms to optimize the scheduling of space crew, payload, and resource operations are also discussed.

Kurtzman, Clifford R.↗

NASA NTRS1993

Robust controllers for the Middeck Active Control Experiment using Popov controller synthesis

Recent work in robust control with real parameter uncertainties has focused on absolute stability and its connections to real mu theory. In particular, the research has investigated the Popov stability criterion and its associated Lur'e-Postnikov Liapunov functions. State space representations of this Popov stability analysis tests are included in an H2 design formulation to provide a powerful technique for robust controller synthesis. This synthesis approach uses a state space optimization procedure to design controllers that minimize an overbound of an H2 cost functional and satisfy stability analysis tests based on the Popov multiplier. The controller and stability multiplier coefficients are optimized simultaneously, which avoids the iteration and curve-fitting procedures required by the D-K algorithm of mu synthesis. While previous work has demonstrated this synthesis approach on benchmark control problems, the purpose of this paper is to use Popov controller synthesis to design robust compensators for the Middeck Active Control Experiment (MACE).

How, Jonathan P.↗

NASA NTRS2011

Application of Commercial Non-Dispersive Infrared Spectroscopy Sensors for Sub-Ambient Carbon Dioxide Detection

Monitoring carbon dioxide (CO2) concentration within a spacecraft or spacesuit is critically important to ensuring the safety of the crew. Carbon dioxide uniquely absorbs light at wavelengths of 3.95 micrometers and 4.26 micrometers. As a result, non-dispersive infrared (NDIR) spectroscopy can be employed as a reliable and inexpensive method for the quantification of CO2 within the atmosphere. A multitude of commercial-off-the-shelf (COTS) NDIR sensors exist for CO2 quantification. The COTS sensors provide reasonable accuracy so long as the measurements are attained under conditions close to the calibration conditions of the sensor (typically 21.1 C and 1 atm). However, as pressure deviates from atmospheric to the pressures associated with a spacecraft (8.0-10.2 PSIA) or spacesuit (4.1-8.0 PSIA), the error in the measurement grows increasingly large. In addition to pressure and temperature dependencies, the infrared transmissivity through a volume of gas also depends on the composition of the gas. As the composition is not known a priori, accurate sub-ambient detection must rely on iterative sensor compensation techniques. This manuscript describes the development of recursive compensation algorithms for sub-ambient detection of CO2 with COTS NDIR sensors. In addition, the basis of the exponential loss in accuracy is developed theoretically considering thermal, Doppler, and Lorentz broadening effects which arise as a result of the temperature, pressure, and composition of the gas mixture under analysis. As a result, this manuscript provides an approach to employing COTS sensors at sub-ambient conditions and may also lend insight into designing future NDIR sensors for aerospace application.

Swickrath, Michael J.↗

NASA NTRS2012

Application of Commercial Non-Dispersive Infrared Spectroscopy Sensors for Sub-Ambient Carbon Dioxide Detection

Monitoring carbon dioxide (CO2) concentration within a spacecraft or spacesuit is critically important to ensuring the safety of the crew. Carbon dioxide uniquely absorbs light at wavelengths of 3.95 micrometers and 4.26 micrometers. As a result, non-dispersive infrared (NDIR) spectroscopy can be employed as a reliable and inexpensive method for the quantification of CO2 within the atmosphere. A multitude of commercial off-the-shelf (COTS) NDIR sensors exist for CO2 quantification. The COTS sensors provide reasonable accuracy as long as the measurements are attained under conditions close to the calibration conditions of the sensor (typically 21.1 C (70.0 F) and 1 atmosphere). However, as pressure deviates from atmospheric to the pressures associated with a spacecraft (8.0{10.2 pounds per square inch absolute (psia)) or spacesuit (4.1{8.0 psia), the error in the measurement grows increasingly large. In addition to pressure and temperature dependencies, the infrared transmissivity through a volume of gas also depends on the composition of the gas. As the composition is not known a priori, accurate sub-ambient detection must rely on iterative sensor compensation techniques. This manuscript describes the development of recursive compensation algorithms for sub-ambient detection of CO2 with COTS NDIR sensors. In addition, the source of the exponential loss in accuracy is developed theoretically. The basis of the loss can be explained through thermal, Doppler, and Lorentz broadening effects that arise as a result of the temperature, pressure, and composition of the gas mixture under analysis. This manuscript provides an approach to employing COTS sensors at sub-ambient conditions and may also lend insight into designing future NDIR sensors for aerospace application.

Swickrath, Michael J.↗

NASA NTRS2012

Improved Hierarchical Optimization-Based Classification of Hyperspectral Images Using Shape Analysis

A new spectral-spatial method for classification of hyperspectral images is proposed. The HSegClas method is based on the integration of probabilistic classification and shape analysis within the hierarchical step-wise optimization algorithm. First, probabilistic support vector machines classification is applied. Then, at each iteration two neighboring regions with the smallest Dissimilarity Criterion (DC) are merged, and classification probabilities are recomputed. The important contribution of this work consists in estimating a DC between regions as a function of statistical, classification and geometrical (area and rectangularity) features. Experimental results are presented on a 102-band ROSIS image of the Center of Pavia, Italy. The developed approach yields more accurate classification results when compared to previously proposed methods.

Classification↗

NASA NTRS2019

Electromagnetic Scattering by Discrete Random Media. IV: Coherent Backscattering

The problem of backscattering of light by a discrete random medium illuminated by an obliquely incident plane electromagnetic wave is considered.The analysis is performed in a linear-polarization basis and includes a complete derivation of the cross reflection matrix for a layer with densely and sparsely distributed particles, the design of an approximate method for computing the ladder and cross reflection matrices in the case of a semi-infinite medium with a sparse distribution of particles, the derivation of the relations between the elements of the ladder and cross reflection matrices in the exact backscattering direction for dense and sparse media, and the development of practical algorithms for solving the underlying integral equations by the method of Picard iterations and the discrete ordinate method. Simulation results for particles with large size parameters are also presented.

Adrian Doicu↗

NASA NTRS1993

Fast structural design and analysis via hybrid domain decomposition on massively parallel processors

A hybrid domain decomposition framework for static, transient and eigen finite element analyses of structural mechanics problems is presented. Its basic ingredients include physical substructuring and /or automatic mesh partitioning, mapping algorithms, 'gluing' approximations for fast design modifications and evaluations, and fast direct and preconditioned iterative solvers for local and interface subproblems. The overall methodology is illustrated with the structural design of a solar viewing payload that is scheduled to fly in March 1993. This payload has been entirely designed and validated by a group of undergraduate students at the University of Colorado using the proposed hybrid domain decomposition approach on a massively parallel processor. Performance results are reported on the CRAY Y-MP/8 and the iPSC-860/64 Touchstone systems, which represent both extreme parallel architectures. The hybrid domain decomposition methodology is shown to outperform leading solution algorithms and to exhibit an excellent parallel scalability.

Farhat, Charbel↗