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 1,603 records · Page 89

All sources NASA NTRS DOE OSTI

NASA NTRS1986

An optimization model for the US Air-Traffic System

A systematic approach for monitoring U.S. air traffic was developed in the context of system-wide planning and control. Towards this end, a network optimization model with nonlinear objectives was chosen as the central element in the planning/control system. The network representation was selected because: (1) it provides a comprehensive structure for depicting essential aspects of the air traffic system, (2) it can be solved efficiently for large scale problems, and (3) the design can be easily communicated to non-technical users through computer graphics. Briefly, the network planning models consider the flow of traffic through a graph as the basic structure. Nodes depict locations and time periods for either individual planes or for aggregated groups of airplanes. Arcs define variables as actual airplanes flying through space or as delays across time periods. As such, a special case of the network can be used to model the so called flow control problem. Due to the large number of interacting variables and the difficulty in subdividing the problem into relatively independent subproblems, an integrated model was designed which will depict the entire high level (above 29000 feet) jet route system for the 48 contiguous states in the U.S. As a first step in demonstrating the concept's feasibility a nonlinear risk/cost model was developed for the Indianapolis Airspace. The nonlinear network program --NLPNETG-- was employed in solving the resulting test cases. This optimization program uses the Truncated-Newton method (quadratic approximation) for determining the search direction at each iteration in the nonlinear algorithm. It was shown that aircraft could be re-routed in an optimal fashion whenever traffic congestion increased beyond an acceptable level, as measured by the nonlinear risk function.

Mulvey, J. M.↗

NASA NTRS1987

Articulated figure positioning by multiple constraints

A problem that arises in positioning an articulated figure is the solution of three-dimensional joint positions (kinematics) when goal positions, rather than joint angles, are given. If more than one such goal is to be achieved, the problem is often solved interactively by positioning or solving one component of the linkage, then adjusting another, then redoing the first, and so on. This iterative process is slow and tedious. The paper presents a method that automatically solves multiple simultaneous joint position goals. The user interface offers a six-degree-of-freedom input device to specify joint angles and goal positions interactively. Examples are used to demonstrate the power and efficiency of this method for key-position animation.

Badler, Norman I.↗

NASA NTRS1988

Newton solution of inviscid and viscous problems

The application of Newton iteration to inviscid and viscous airfoil calculations is examined. Spatial discretization is performed using upwind differences with split fluxes. The system of linear equations which arises as a result of linearization in time is solved directly using either a banded matrix solver or a sparse matrix solver. In the latter case, the solver is used in conjunction with the nested dissection strategy, whose implementation for airfoil calculations is discussed. The boundary conditions are also implemented in a fully implicit manner, thus yielding quadratic convergence. Complexities such as the ordering of cell nodes and the use of a far field vortex to correct freestream for a lifting airfoil are addressed. Various methods to accelerate convergence and improve computational efficiency while using Newton iteration are discussed. Results are presented for inviscid, transonic nonlifting and lifting airfoils and also for laminar viscous cases.

Venkatakrishnan, V.↗

NASA NTRS1989

The nonlinear transfer problem in accreting pulsars - Stimulated scattering effects

The accreting pulsar radiative transfer problem in the presence of nonlinear effects in the radiation field, in particular those introduced by stimulated scattering, is solved. This leads to an extension of the Feautrier method in the strong magnetic case, which is solved by iterations. Relativistic cross sections are introduced and their effect is compared to the nonrelativistic approximation. This affects the cyclotron line shape and energy. It is found that stimulated scattering is important in determining the flux level in the continuum above the effective thermalization frequency and also in determining the cyclotron line flux.

Alexander, S. G.↗

NASA NTRS1990

Calculating The Resistivity Of A Deposited Film

Iterative procedure computes resistivity from measurements by four-probe method. Computer program and technique developed to aid in solution of class of problems in which measurements of electrical resistivity needed for substance deposited on substrate of higher resistivity than deposited layer.

Oberle, Lawrence G.↗

NASA NTRS1989

A new uniformly valid asymptotic integration algorithm for elasto-plastic-creep and unified viscoplastic theories including continuum damage

A new scheme to integrate a system of stiff differential equations for both the elasto-plastic creep and the unified viscoplastic theories is presented. The method has high stability, allows large time increments, and is implicit and iterative. It is suitable for use with continuum damage theories. The scheme was incorporated into MARC, a commercial finite element code through a user subroutine called HYPELA. Results from numerical problems under complex loading histories are presented for both small and large scale analysis. To demonstrate the scheme's accuracy and efficiency, comparisons to a self-adaptive forward Euler method are made.

Chulya, A.↗

NASA NTRS1989

Mesh refinement in finite element analysis by minimization of the stiffness matrix trace

Most finite element packages provide means to generate meshes automatically. However, the user is usually confronted with the problem of not knowing whether the mesh generated is appropriate for the problem at hand. Since the accuracy of the finite element results is mesh dependent, mesh selection forms a very important step in the analysis. Indeed, in accurate analyses, meshes need to be refined or rezoned until the solution converges to a value so that the error is below a predetermined tolerance. A-posteriori methods use error indicators, developed by using the theory of interpolation and approximation theory, for mesh refinements. Some use other criterions, such as strain energy density variation and stress contours for example, to obtain near optimal meshes. Although these methods are adaptive, they are expensive. Alternatively, a priori methods, until now available, use geometrical parameters, for example, element aspect ratio. Therefore, they are not adaptive by nature. An adaptive a-priori method is developed. The criterion is that the minimization of the trace of the stiffness matrix with respect to the nodal coordinates, leads to a minimization of the potential energy, and as a consequence provide a good starting mesh. In a few examples the method is shown to provide the optimal mesh. The method is also shown to be relatively simple and amenable to development of computer algorithms. When the procedure is used in conjunction with a-posteriori methods of grid refinement, it is shown that fewer refinement iterations and fewer degrees of freedom are required for convergence as opposed to when the procedure is not used. The mesh obtained is shown to have uniform distribution of stiffness among the nodes and elements which, as a consequence, leads to uniform error distribution. Thus the mesh obtained meets the optimality criterion of uniform error distribution.

Kittur, Madan G.↗

NASA NTRS1989

Kinetic theory model for the flow of a simple gas from a two-dimensional nozzle

A system of nonlinear integral equations equivalent to the Krook kinetic equation for the steady state is the mathematical basis used to develop a computer code to model the flowfields for low-thrust two-dimensional nozzles. The method of characteristics was used to solve numerically by an iteration process the approximated Boltzmann equation for the number density, temperature, and velocity profiles of a simple gas as it exhausts into a vacuum. Results predict backscatter and show the effect of the inside wall boundary layer on the flowfields external to the nozzle.

Riley, B. R.↗

NASA NTRS1991

An implicit three-dimensional Navier-Stokes solver for compressible flow

A three-dimensional numerical method based on the lower-upper symmetric-Gauss-Seidel implicit scheme in conjunction with the flux-limited dissipation model is developed for solving the compressible Navier-Stokes equations. A new computer code which is based on this method requires only 9 microsec per grid-point per iteration on a single processor of a Cray YMP computer and executes at the sustained rate of 170 MFLOPS. A reduction of 4 orders of magnitude in the residual for a high Reynolds number flow using 230 K grid points is obtained in 24 minutes. The computational results compare well with available experimental data.

Yoon, Seokkwan↗

NASA NTRS1991

A new uniformly valid asymptotic integration algorithm for elasto-plastic creep and unified viscoplastic theories including continuum damage

Chulya, Abhisak↗

NASA NTRS1991

Intelligent perturbation algorithms for space scheduling optimization

Intelligent perturbation algorithms for space scheduling optimization are presented in the form of the viewgraphs. The following subject areas are covered: optimization of planning, scheduling, and manifesting; searching a discrete configuration space; heuristic algorithms used for optimization; use of heuristic methods on a sample scheduling problem; intelligent perturbation algorithms are iterative refinement techniques; properties of a good iterative search operator; dispatching examples of intelligent perturbation algorithm and perturbation operator attributes; scheduling implementations using intelligent perturbation algorithms; major advances in scheduling capabilities; the prototype ISF (industrial Space Facility) experiment scheduler; optimized schedule (max revenue); multi-variable optimization; Space Station design reference mission scheduling; ISF-TDRSS command scheduling demonstration; and example task - communications check.

Kurtzman, Clifford R.↗

NASA NTRS1992

A computational algorithm for crack determination: The multiple crack case

An algorithm for recovering a collection of linear cracks in a homogeneous electrical conductor from boundary measurements of voltages induced by specified current fluxes is developed. The technique is a variation of Newton's method and is based on taking weighted averages of the boundary data. The method also adaptively changes the applied current flux at each iteration to maintain maximum sensitivity to the estimated locations of the cracks.

Bryan, Kurt↗

NASA NTRS1991

Kinetic theory model for the flow of a simple gas from a three-dimensional axisymmetric nozzle

A system of nonlinear integral equations equivalent to the Krook kinetic equations for the steady state is the mathematical basis used to develop a computer code to model the flowfields for low-thrust three-dimensional axisymmetric nozzles. The method of characteristics is used to solve numerically by an iteration process the approximated Boltzmann equation for the number density, temperature, and velocity profiles of a simple gas as it expands into a vacuum. Results predict backscatter and show the effect of the nozzle wall boundary layer on the external flowfields.

Riley, B. R.↗

NASA NTRS1993

Model reduction in integrated controls-structures design

It is the objective of this paper to present a model reduction technique developed for the integrated controls-structures design of flexible structures. Integrated controls-structures design problems are typically posed as nonlinear mathematical programming problems, where the design variables consist of both structural and control parameters. In the solution process, both structural and control design variables are constantly changing; therefore, the dynamic characteristics of the structure are also changing. This presents a problem in obtaining a reduced-order model for active control design and analysis which will be valid for all design points within the design space. In other words, the frequency and number of the significant modes of the structure (modes that should be included) may vary considerably throughout the design process. This is also true as the locations and/or masses of the sensors and actuators change. Moreover, since the number of design evaluations in the integrated design process could easily run into thousands, any feasible order-reduction method should not require model reduction analysis at every design iteration. In this paper a novel and efficient technique for model reduction in the integrated controls-structures design process, which addresses these issues, is presented.

Maghami, Peiman G.↗

NASA NTRS1997

Improved Boundary Conditions for Cell-centered Difference Schemes

Cell-centered finite-volume (CCFV) schemes have certain attractive properties for the solution of the equations governing compressible fluid flow. Among others, they provide a natural vehicle for specifying flux conditions at the boundaries of the physical domain. Unfortunately, they lead to slow convergence for numerical programs utilizing them. In this report a method for investigating and improving the convergence of CCFV schemes is presented, which focuses on the effect of the numerical boundary conditions. The key to the method is the computation of the spectral radius of the iteration matrix of the entire demoralized system of equations, not just of the interior point scheme or the boundary conditions.

VanderWijngaart, Rob F.↗

NASA NTRS2005

Numerical Evaluation of P-Multigrid Method for the Solution of Discontinuous Galerkin Discretizations of Diffusive Equations

This paper describes numerical experiments with P-multigrid to corroborate analysis, validate the present implementation, and to examine issues that arise in the implementations of the various combinations of relaxation schemes, discretizations and P-multigrid methods. The two approaches to implement P-multigrid presented here are equivalent for most high-order discretization methods such as spectral element, SUPG, and discontinuous Galerkin applied to advection; however it is discovered that the approach that mimics the common geometric multigrid implementation is less robust, and frequently unstable when applied to discontinuous Galerkin discretizations of di usion. Gauss-Seidel relaxation converges 40% faster than block Jacobi, as predicted by analysis; however, the implementation of Gauss-Seidel is considerably more expensive that one would expect because gradients in most neighboring elements must be updated. A compromise quasi Gauss-Seidel relaxation method that evaluates the gradient in each element twice per iteration converges at rates similar to those predicted for true Gauss-Seidel.

Atkins, H. L.↗

NASA NTRS2008

Design of a Mach-3 Nozzle for TBCC Testing in the NASA LaRC 8-ft High Temperature Tunnel

A new nozzle is being constructed for the NASA Langley Research Center 8-Foot High Temperature Tunnel. The axisymmetric nozzle was designed with a Mach-3 exit flow for testing Turbine-Based Combined-Cycle engines at a Mach number in the vicinity of the transition from turbojet to ramjet operation. The nozzle contour was designed using the NASA Langley IMOCND computer program which solves the potential equation using the classical method of characteristics. To include viscous effects, the design procedure iterated the MOC contour generation with CFD Navier-Stokes calculations, adjusting MOC input parameters until target nozzle-exit conditions were achieved in the Navier-Stokes calculations. The design process was complicated by a requirement to use the final 29.5 inches of an existing 54.5-inch exit-diameter Mach-5 nozzle contour. This was accomplished by generating a Mach-3 contour that matched the radius of the Mach-5 contour at the match point and using a 3rd order polynomial to create a smooth transition between the two contours. During the final evaluation of the design it was realized that the throat diameter is more than half that of the upstream mixing chamber. This led to the concern that large vortical structures generated in the mixer would persist downstream, affecting nozzle-exit flow. This concern was addressed by analyzing the results of three-dimensional, viscous, numerical simulations of the entire flowfield, from the exit of the facility combustor to the nozzle exit. An analysis of the solution indicated that large scale structures do not pass through the throat and that both the total temperature and species (CO2) are well mixed in the mixer, providing uniform flow to the nozzle and subsequently the test cabin.

Gaffney, Richard L., Jr.↗

NASA NTRS2009

Joint Carrier-Phase Synchronization and LDPC Decoding

A method has been proposed to increase the degree of synchronization of a radio receiver with the phase of a suppressed carrier signal modulated with a binary- phase-shift-keying (BPSK) or quaternary- phase-shift-keying (QPSK) signal representing a low-density parity-check (LDPC) code. This method is an extended version of the method described in Using LDPC Code Constraints to Aid Recovery of Symbol Timing (NPO-43112), NASA Tech Briefs, Vol. 32, No. 10 (October 2008), page 54. Both methods and the receiver architectures in which they would be implemented belong to a class of timing- recovery methods and corresponding receiver architectures characterized as pilotless in that they do not require transmission and reception of pilot signals. The proposed method calls for the use of what is known in the art as soft decision feedback to remove the modulation from a replica of the incoming signal prior to feeding this replica to a phase-locked loop (PLL) or other carrier-tracking stage in the receiver. Soft decision feedback refers to suitably processed versions of intermediate results of iterative computations involved in the LDPC decoding process. Unlike a related prior method in which hard decision feedback (the final sequence of decoded symbols) is used to remove the modulation, the proposed method does not require estimation of the decoder error probability. In a basic digital implementation of the proposed method, the incoming signal (having carrier phase theta theta (sub c) plus noise would first be converted to inphase (I) and quadrature (Q) baseband signals by mixing it with I and Q signals at the carrier frequency [wc/(2 pi)] generated by a local oscillator. The resulting demodulated signals would be processed through one-symbol-period integrate and- dump filters, the outputs of which would be sampled and held, then multiplied by a soft-decision version of the baseband modulated signal. The resulting I and Q products consist of terms proportional to the cosine and sine of the carrier phase cc as well as correlated noise components. These products would be fed as inputs to a digital PLL that would include a number-controlled oscillator (NCO), which provides an estimate of the carrier phase, theta(sub c).

Simon, Marvin↗