SEARCH · Engineering Papers

Results for “Iteration method”

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 703 records · Page 39

All sources NASA NTRS DOE OSTI

NASA NTRS1993

Approximate optimal guidance for the advanced launch system

A real-time guidance scheme for the problem of maximizing the payload into orbit subject to the equations of motion for a rocket over a spherical, non-rotating earth is presented. An approximate optimal launch guidance law is developed based upon an asymptotic expansion of the Hamilton - Jacobi - Bellman or dynamic programming equation. The expansion is performed in terms of a small parameter, which is used to separate the dynamics of the problem into primary and perturbation dynamics. For the zeroth-order problem the small parameter is set to zero and a closed-form solution to the zeroth-order expansion term of Hamilton - Jacobi - Bellman equation is obtained. Higher-order terms of the expansion include the effects of the neglected perturbation dynamics. These higher-order terms are determined from the solution of first-order linear partial differential equations requiring only the evaluation of quadratures. This technique is preferred as a real-time, on-line guidance scheme to alternative numerical iterative optimization schemes because of the unreliable convergence properties of these iterative guidance schemes and because the quadratures needed for the approximate optimal guidance law can be performed rapidly and by parallel processing. Even if the approximate solution is not nearly optimal, when using this technique the zeroth-order solution always provides a path which satisfies the terminal constraints. Results for two-degree-of-freedom simulations are presented for the simplified problem of flight in the equatorial plane and compared to the guidance scheme generated by the shooting method which is an iterative second-order technique.

Feeley, T. S.↗

NASA NTRS1982

Mapping of electrical potential distributions with charged particle beams

Methods for measuring electrostatic potentials on and near dielectric surfaces charged to several kilovolts are studied. Secondary emission from those charged dielectrics is measured. Candidates for potential measurement include the induced charge, from which potential is calculated; the trajectory endpoints of either high or low energy particles traversing the region near the surface; trajectory impact on the surface; and creating ions at points of interest near the surface. Some of the methods require computer simulations and iterative calculation if potential maps are to be generated. Several approaches are described and compared. A method using a half-cylinder as a test chamber and low-energy probing beams is adapted for the measurement of seconary emission.

Robinson, J. W.↗

NASA NTRS1981

Determination of wind tunnel constraint effects by a unified pressure signature method. Part 1: Applications to winged configurations

A new, fast, non-iterative version of the "Wall Pressure Signature Method" is described and used to determine blockage and angle-of-attack wind tunnel corrections for highly-powered jet-flap models. The correction method is complemented by the application of tangential blowing at the tunnel floor to suppress flow breakdown there, using feedback from measured floor pressures. This tangential blowing technique was substantiated by subsequent flow investigations using an LV. The basic tests on an unswept, knee-blown, jet flapped wing were supplemented to include the effects of slat-removal, sweep and the addition of unflapped tips. C sub mu values were varied from 0 to 10 free-air C sub l's in excess of 18 were measured in some cases. Application of the new methods yielded corrected data which agreed with corresponding large tunnel "free air" resuls to within the limits of experimental accuracy in almost all cases. A program listing is provided, with sample cases.

Hackett, J. E.↗

NASA NTRS1987

Solving finite element equations on concurrent computers

This paper discusses the development of a concurrent algorithm for the solution of systems of equations arising in finite element applications. The approach is based on a hybrid of direct elimination method and preconditioned conjugate iteration. Two different preconditioners are used; diagonal scaling and a concurrent implementation of incomplete LU factorization. First, an automatic procedure is used to partition the finite element mesh into sub-structures. The particular mesh partition is chosen to minimize an estimate of the cost for evaluating the solution using this algorithm on a concurrent computer. These procedures are implemented in a finite element program on the JPL/CalTech MARK III hypercube computer. An overview of the structure of this program is presented. The performance of the solution method is demonstrated with the aid of a number of numerical test runs, and its advantages for concurrent implementations are discussed. Efficiency and speed-up factors over sequential machines for the numerical examples are highlighted.

Nour-Omid, B.↗

NASA NTRS1994

Improved image decompression for reduced transform coding artifacts

The perceived quality of images reconstructed from low bit rate compression is severely degraded by the appearance of transform coding artifacts. This paper proposes a method for producing higher quality reconstructed images based on a stochastic model for the image data. Quantization (scalar or vector) partitions the transform coefficient space and maps all points in a partition cell to a representative reconstruction point, usually taken as the centroid of the cell. The proposed image estimation technique selects the reconstruction point within the quantization partition cell which results in a reconstructed image which best fits a non-Gaussian Markov random field (MRF) image model. This approach results in a convex constrained optimization problem which can be solved iteratively. At each iteration, the gradient projection method is used to update the estimate based on the image model. In the transform domain, the resulting coefficient reconstruction points are projected to the particular quantization partition cells defined by the compressed image. Experimental results will be shown for images compressed using scalar quantization of block DCT and using vector quantization of subband wavelet transform. The proposed image decompression provides a reconstructed image with reduced visibility of transform coding artifacts and superior perceived quality.

Orourke, Thomas P.↗

NASA NTRS1977

Numerical determination of the fundamental eigenvalue for the Laplace operator on a spherical domain

Methods for obtaining approximate solutions for the fundamental eigenvalue of the Laplace-Beltrami operator (i.e., the membrane eignevalue problem for the vibration equation) on the unit spherical surface are developed. Two types of spherical surface domains are considered: the interior of a spherical triangle, and the exterior of a great circle arc extending for less than pi radians (a spherical surface with a slit). In both cases, zero boundary conditions are imposed. In order to solve the resulting second-order elliptic partial differential equations in two independent variables, a finite difference approximation is employed. The fundamental eigenvalue is approximated by iteration utilizing the power method and point successive overrelaxation. Some numerical results are given and compared, in certain special cases, with analytical solutions to the eigenvalue problem. The significance of the numerical eigenvalue results is discussed in terms of the singularities in the solution of three-dimensional boundary-value problems near a polyhedral corner of the domain.

Walden, H.↗

NASA NTRS1972

Computer method for identification of boiler transfer functions

Iterative computer aided procedure was developed which provides for identification of boiler transfer functions using frequency response data. Method uses frequency response data to obtain satisfactory transfer function for both high and low vapor exit quality data.

Miles, J. H.↗

NASA NTRS1986

A terrain-dependent reference atmosphere determination method for available potential energy calculations

An iterative technique that determines the reference atmosphere which incorporates the effects of uneven surface topography is presented. This method has been successfully applied in several available potential energy studies. An alternative method due to Taylor is also evaluated. While Taylor presented excellent continuous formulations of the available potential energy that include topography, his method for determining the reference atmosphere distributions failed to provide the accuracy needed to produce reliable available potential energy estimates. Since topography has a significant influence on the general circulation, it is important to employ techniques that incorporate its effects in the determination of available potential energy.

Koehler, T. L.↗

NASA NTRS1980

A nonlinear, discrete-vortex-perturbation method for unsteady lifting-surface problems with edge separations

The nonlinear-discrete vortex method is coupled with a perturbation method to solve the problem of a rectangular wing with small oscillation about high angles of attack. The solution of the problem is based on decoupling the steady and unsteady effects. The steady part of the problem is a nonlinear one and is solved by the nonlinear-discrete vortex method. The unsteady part of the problem is a linear one and is solved directly without any iteration. So far, the developed method is restricted to flat rectangular surfaces with pitching oscillations. Total and distributed loads of several rectangular wings are presented as numerical results.

Kandil, O. A.↗

NASA NTRS1993

Description and use of LSODE, the Livermore Solver for Ordinary Differential Equations

LSODE, the Livermore Solver for Ordinary Differential Equations, is a package of FORTRAN subroutines designed for the numerical solution of the initial value problem for a system of ordinary differential equations. It is particularly well suited for 'stiff' differential systems, for which the backward differentiation formula method of orders 1 to 5 is provided. The code includes the Adams-Moulton method of orders 1 to 12, so it can be used for nonstiff problems as well. In addition, the user can easily switch methods to increase computational efficiency for problems that change character. For both methods a variety of corrector iteration techniques is included in the code. Also, to minimize computational work, both the step size and method order are varied dynamically. This report presents complete descriptions of the code and integration methods, including their implementation. It also provides a detailed guide to the use of the code, as well as an illustrative example problem.

Radhakrishnan, Krishnan↗

NASA NTRS1992

Parallel computational fluid dynamics - Implementations and results

The present volume on parallel CFD discusses implementations on parallel machines, numerical algorithms for parallel CFD, and performance evaluation and computer science issues. Attention is given to a parallel algorithm for compressible flows through rotor-stator combinations, a massively parallel Euler solver for unstructured grids, a fast scheme to analyze 3D disk airflow on a parallel computer, and a block implicit multigrid solution of the Euler equations. Topics addressed include a 3D ADI algorithm on distributed memory multiprocessors, clustered element-by-element computations for fluid flow, hypercube FFT and the Fourier pseudospectral method, and an investigation of parallel iterative algorithms for CFD. Also discussed are fluid dynamics using interface methods on parallel processors, sorting for particle flow simulation on the connection machine, a large grain mapping method, and efforts toward a Teraflops capability for CFD.

Simon, Horst D.↗

NASA NTRS1999

Investigation of Near Shannon Limit Coding Schemes

Turbo codes can deliver performance that is very close to the Shannon limit. This report investigates algorithms for convolutional turbo codes and block turbo codes. Both coding schemes can achieve performance near Shannon limit. The performance of the schemes is obtained using computer simulations. There are three sections in this report. First section is the introduction. The fundamental knowledge about coding, block coding and convolutional coding is discussed. In the second section, the basic concepts of convolutional turbo codes are introduced and the performance of turbo codes, especially high rate turbo codes, is provided from the simulation results. After introducing all the parameters that help turbo codes achieve such a good performance, it is concluded that output weight distribution should be the main consideration in designing turbo codes. Based on the output weight distribution, the performance bounds for turbo codes are given. Then, the relationships between the output weight distribution and the factors like generator polynomial, interleaver and puncturing pattern are examined. The criterion for the best selection of system components is provided. The puncturing pattern algorithm is discussed in detail. Different puncturing patterns are compared for each high rate. For most of the high rate codes, the puncturing pattern does not show any significant effect on the code performance if pseudo - random interleaver is used in the system. For some special rate codes with poor performance, an alternative puncturing algorithm is designed which restores their performance close to the Shannon limit. Finally, in section three, for iterative decoding of block codes, the method of building trellis for block codes, the structure of the iterative decoding system and the calculation of extrinsic values are discussed.

Kwatra, S. C.↗

NASA NTRS1984

Fourier-Legendre spectral methods for incompressible channel flow

An iterative collocation technique is described for modeling implicit viscosity in three-dimensional incompressible wall bounded shear flow. The viscosity can vary temporally and in the vertical direction. Channel flow is modeled with a Fourier-Legendre approximation and the mean streamwise advection is treated implicitly. Explicit terms are handled with an Adams-Bashforth method to increase the allowable time-step for calculation of the implicit terms. The algorithm is applied to low amplitude unstable waves in a plane Poiseuille flow at an Re of 7500. Comparisons are made between results using the Legendre method and with Chebyshev polynomials. Comparable accuracy is obtained for the perturbation kinetic energy predicted using both discretizations.

Zang, T. A.↗

NASA NTRS2021

Patched Local Lunar Gravity Solutions using GRAIL Data

We present a method to determine local gravity fields for the Moon using Gravity Recovery and Interior Laboratory (GRAIL) data. We express gravity as gridded gravity anomalies on a sphere, and we estimate adjustments to a background global start model expressed in spherical harmonics. We processed GRAIL Ka-band range-rate data with a short-arc approach, using only data over the area of interest. We determine our gravity solutions using neighbor smoothing constraints. We divided the entire Moon into twelve regions and two polar caps, with a resolution of 0.15˚ x 0.15˚ (which is equivalent to degree and order 1199 in spherical harmonics), and determined the optimal smoothing parameter for each area by comparing localized correlations between gravity and topography for each solution set. Our selected areas share nodes with surrounding areas and they are overlapping. To mitigate boundary effects, we patch the solutions together by symmetrically omitting the boundary parts of overlapping solutions. Our new solution has been iterated, and it has improved correlations with topography when compared to a fully iterated global model. Our method requires fewer resources, and can easily handle regionally varying resolution or constraints. The smooth model describes small-scale features clearly, and can be used in local studies of the structure of the lunar crust.

Sander Goossens↗

NASA NTRS1992

Interferometric reconstruction of three-dimensional high-speed aerodynamic flows

Holographic interferometry can be a very useful diagnostic tool in high-speed aerodynamic testing. During this summer research period, various possible approaches for accurately reconstructing three-dimensional flows from limited data were examined. The approach based on the combination of the following three techniques appears to be promising: (1) Continuous Local Basis Function Method - this computational tomographic method has a power to accurately reconstruct continuous regions and is appropriate from well-conditioned to moderately limited data; (2) Variable Basis Method - this computational tomographic method provides accuracy near discontinuities, i.e., shock regions, and is appropriate from moderately-limited to severely-limited data; and (3) Complementary Field Method - this is a general iterative reconstructor that can be coupled with any computational tomographic techniques. Mathematically, it can be shown that this method can provide better accuracy than the direct reconstruction as in a conventional approach. Our numerical simulation of experiments demonstrated improved reconstruction results even when these techniques were individually tested.

Cha, Soyoung Stephen↗

NASA NTRS1990

Concurrent Finite-Element Analysis On Hypercube Computers

Improved approach to execution of finite-element codes on hypercube and similar concurrent data processors increases efficiency of computation for many different types of problems. Based on flexible general model of computation on, and communication among, large-node parallel processors. Hybrid combining direct methods within subdomains and preconditioned-conjugate-gradient (PCG) iteration on remaining boundary system to obtain method of solution both robust and efficient. Preserves general structure and function of conventional sequential finite-element-method software. Generalized to both distributed- and shared-memory multicomputers, eliminating degree of machine specificity restricting general usefulness.

Lyzenga, G. A.↗

NASA NTRS2001

Improving turbo-like codes using iterative decoder analysis

The density evolution method is used to analyze the performance and optimize the structure of parallel and serial turbo codes, and generalized serial concatenations of mixtures of different outer and inner codes. Design examples are given for mixture codes.

turbo codes iterative decoding↗

NASA NTRS2001

Method for beam hardening correction in quantitative computed X-ray tomography

Each voxel is assumed to contain exactly two distinct materials, with the volume fraction of each material being iteratively calculated. According to the method, the spectrum of the X-ray beam must be known, and the attenuation spectra of the materials in the object must be known, and be monotonically decreasing with increasing X-ray photon energy. Then, a volume fraction is estimated for the voxel, and the spectrum is iteratively calculated.

Yan, Chye Hwang↗