Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative 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.

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

At least 469 records · Page 26

A method for the dynamic and thermal stress analysis of space shuttle surface insulation

The thermal protection system of the space shuttle consists of thousands of separate insulation tiles bonded to the orbiter's surface through a soft strain-isolation layer. The individual tiles are relatively thick and possess nonuniform properties. Therefore, each is idealized by finite-element assemblages containing up to 2500 degrees of freedom. Since the tiles affixed to a given structural panel will, in general, interact with one another, application of the standard direct-stiffness method would require equation systems involving excessive numbers of unknowns. This paper presents a method which overcomes this problem through an efficient iterative procedure which requires treatment of only a single tile at any given time. Results of associated static, dynamic, and thermal stress analyses and sufficient conditions for convergence of the iterative solution method are given.

Ojalvo, I. U.↗

PIAS: A program for an iterative aeroelastic solution

A Program for an Iterative Aeroelastic Solution (PIAS) is discussed. This will be a modular computer program that combines the use of a finite-element structural analysis code with any linear or nonlinear aerodynamic code. At this point in time, PIAS has been designed but the software has not been written. The idea for this development originated with P. J. (Bud) Bobbitt of the NASA Langley Research Center. There was initial interest in an aeroelastic solution for a separation-induced leading-edge vortex. Some examples of the flow patterns for a low aspect ratio wing are shown. The Leading-Edge Vortex Program, which calculates pressure distributions including the effects of a separation-induced leading-edge vortex, uses an iterative solution method. This led to the concept of an iteration cycle on configuration shape external to the aerodynamic code.

Manro, M. E.↗

MSFC Advanced Concepts Office and the Iterative Launch Vehicle Concept Method

This slide presentation reviews the work of the Advanced Concepts Office (ACO) at Marshall Space Flight Center (MSFC) with particular emphasis on the method used to model launch vehicles using INTegrated ROcket Sizing (INTROS), a modeling system that assists in establishing the launch concept design, and stage sizing, and facilitates the integration of exterior analytic efforts, vehicle architecture studies, and technology and system trades and parameter sensitivities.

Creech, Dennis↗

Representation-Independent Iteration of Sparse Data Arrays

An approach is defined that describes a method of iterating over massively large arrays containing sparse data using an approach that is implementation independent of how the contents of the sparse arrays are laid out in memory. What is unique and important here is the decoupling of the iteration over the sparse set of array elements from how they are internally represented in memory. This enables this approach to be backward compatible with existing schemes for representing sparse arrays as well as new approaches. What is novel here is a new approach for efficiently iterating over sparse arrays that is independent of the underlying memory layout representation of the array. A functional interface is defined for implementing sparse arrays in any modern programming language with a particular focus for the Chapel programming language. Examples are provided that show the translation of a loop that computes a matrix vector product into this representation for both the distributed and not-distributed cases. This work is directly applicable to NASA and its High Productivity Computing Systems (HPCS) program that JPL and our current program are engaged in. The goal of this program is to create powerful, scalable, and economically viable high-powered computer systems suitable for use in national security and industry by 2010. This is important to NASA for its computationally intensive requirements for analyzing and understanding the volumes of science data from our returned missions.

James, Mark↗

Assessment of the Impact of Realistic Sensor Physics and the Integration of Ex-Core Sensors on Reactor Power Synthesis

In the work documented in this report, a weighting function–based core power synthesis method was applied to multiple Monte Carlo N-Particle (MCNP) reactor models, which are informed based on simulated self-powered neutron detector (SPND) responses. The weighting function method used has been coined the point-based iterative (PBI) method. The goal of this application is to assess the impact of considering realistic sensor physics in the generation of the simulated SPND outputs as well as to consider how the synthesis is impacted based on the inclusion of ex-core detectors in the model. The NuScale small modular reactor (SMR) and Westinghouse AP1000 pressurized water reactor (PWR) are the models that served as the testbeds for the assessment of realistic sensor physics; this was achieved by using Geant4 SPND models in comparison with analytical models, such that the effect of electron transport in realistic SPND geometries in the Geant4 model can be understood in terms of synthesis error and convergence time. The comparison was considered for fuel burnup–induced perturbations, for a range of sensor string densities and synthesized power distribution axial fidelities. The Texas A&M Testing, Research, Isotopes, General Atomics Reactor (TAMU TRIGA) reactor MCNP model was used to assess the impact of ex-core sensors; this was done by performing synthesis with and without the ex-core detectors and by quantifying the synthesis error and number of iterations associated with Gaussian-type perturbations in many locations in the core. The TAMU TRIGA model was particularly pertinent for this study because of the interest in future experimental tests with SPNDs in this reactor, as well as the ease of modifying the MCNP model to include ex-core detectors with heterogeneously described response functions. Results from the comparison between the Geant4 and analytical SPND models indicate that similar average and maximum synthesis errors were obtained for burnup-induced perturbations in both the NuScale SMR and the AP1000. This was true for a range of sensor string densities and axial fidelities. However, there were marked differences between both the Geant4 and analytically informed models in terms of the iterations required to converge on the synthesized power distribution. Namely, the Geant4-informed models tended to lead to fewer iterations, except for a few sensor–core configurations that had particularly numerous iterations. Results from the ex-core sensor assessment with the TAMU TRIGA model indicate that the inclusion of ex-core sensors drastically reduces the synthesis error of Gaussian-type perturbations close to the edge of the core, and it slightly reduces synthesis errors for perturbations closer to the center of the core. This was achieved with a minimal increase in computational cost—that is, the number of iterations required for convergence. The errors were identified to be in the same location as the perturbation in the core, indicating that the methodology remains robust for unperturbed regions of the core. A secondary result from this study with the TAMU TRIGA was yielded by analysis of the neutron flux levels in the in-core and ex-core sensor locations of the core; these flux levels indicate that SPNDs could be used as both in-core and ex-core sensors, so long as the emitter material is sensitive to thermal neutrons. The results from these studies provide a quantitative understanding of the importance of considering realistic sensor physics and including ex-core sensors to perform accurate and timely power distribution synthesis of a reactor core.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A minimal residual method for transonic potential flows

For transonic flow calculations, a combination of the successive line over-relaxation (SLOR) and the preconditioned conjugate gradient (CG) method has been suggested by Wong and Hafez (1981). This paper studies the method of minimal residual (MR) which avoids a combined iteration. This method is closely related to the CG method, may be regarded as a first-order gradient method, and is applicable to symmetric and nonsymmetric matrices. The problem is formulated as a nonlinear mixed elliptic-hyperbolic partial differential equation which includes an artificial viscosity and a switching function which is zero in subsonic regions and nonzero in supersonic regions. Alternatives to the SLOR method which provide faster convergence rates are introduced. The preconditioned MR algorithm is developed, and transonic potential flows around NACA 0012 airfoil are calculated for different Mach numbers and angles of attack. Preliminary results are presented, demonstrating that the MR algorithm requires no parameter estimation and rapidly converges for subsonic flows.

Wong, Y. S.↗

A Method for the Constrained Design of Natural Laminar Flow Airfoils

A fully automated iterative design method has been developed by which an airfoil with a substantial amount of natural laminar flow can be designed, while maintaining other aerodynamic and geometric constraints. Drag reductions have been realized using the design method over a range of Mach numbers, Reynolds numbers and airfoil thicknesses. The thrusts of the method are its ability to calculate a target N-Factor distribution that forces the flow to undergo transition at the desired location; the target-pressure-N-Factor relationship that is used to reduce the N-Factors in order to prolong transition; and its ability to design airfoils to meet lift, pitching moment, thickness and leading-edge radius constraints while also being able to meet the natural laminar flow constraint. The method uses several existing CFD codes and can design a new airfoil in only a few days using a Silicon Graphics IRIS workstation.

Green, Bradford E.↗

Thermal and Mechanical Buckling Analysis of Hypersonic Aircraft Hat-Stiffened Panels With Varying Face Sheet Geometry and Fiber Orientation

Mechanical and thermal buckling behavior of monolithic and metal-matrix composite hat-stiffened panels were investigated. The panels have three types of face-sheet geometry: Flat face sheet, microdented face sheet, and microbulged face sheet. The metal-matrix composite panels have three types of face-sheet layups, each of which is combined with various types of hat composite layups. Finite-element method was used in the eigenvalue extractions for both mechanical and thermal buckling. The thermal buckling analysis required both eigenvalue and material property iterations. Graphical methods of the dual iterations are shown. The mechanical and thermal buckling strengths of the hat-stiffened panels with different face-sheet geometry are compared. It was found that by just microdenting or microbulging of the face sheet, the axial, shear, and thermal buckling strengths of both types of hat-stiffened panels could be enhanced considerably. This effect is more conspicuous for the monolithic panels. For the metal-matrix composite panels, the effect of fiber orientations on the panel buckling strengths was investigated in great detail, and various composite layup combinations offering, high panel buckling strengths are presented. The axial buckling strength of the metal-matrix panel was sensitive to the change of hat fiber orientation. However, the lateral, shear, and thermal buckling strengths were insensitive to the change of hat fiber orientation.

Ko, William L.↗

A geometric theory for the QR, LU and power iterations.

Consideration of the task of computing the invariant subspaces of a given matrix. For this purpose the LU, QR, treppen and bi-iterations have been presented, used, and studied more or less independently of the old-fashioned power method. Each of these methods generates implicitly a sequence of subspaces which determines the convergence properties of the method. The iterations differ in the way in which a basis is constructed to represent each subspace. This aspect largely determines the usefulness of the method. It is shown that the first four iterations produce exactly the same sequence of subspaces as do direct and inverse iteration started from appropriate subspaces. Their convergence properties are therefore the same, and a complete geometric convergence theory is presented in terms of the power method. It is shown that Hessenberg matrices are associated with ideal starting spaces.

Parlett, B. N.↗

Numerical Study of Multigrid Methods with Various Smoothers for the Elliptical Grid Generation Equations

A robust solver for the elliptic grid generation equations is sought via a numerical study. The system of PDEs is discretized with finite differences, and multigrid methods are applied to the resulting nonlinear algebraic equations. Multigrid iterations are compared with respect to the robustness and efficiency. Different smoothers are tried to improve the convergence of iterations. The methods are applied to four 2D grid generation problems over a wide range of grid distortions. The results of the study help to select smoothing schemes and the overall multigrid procedures for elliptic grid generation.

Golik, W. L.↗

Iterative-Transform Phase Retrieval Using Adaptive Diversity

A phase-diverse iterative-transform phase-retrieval algorithm enables high spatial-frequency, high-dynamic-range, image-based wavefront sensing. [The terms phase-diverse, phase retrieval, image-based, and wavefront sensing are defined in the first of the two immediately preceding articles, Broadband Phase Retrieval for Image-Based Wavefront Sensing (GSC-14899-1).] As described below, no prior phase-retrieval algorithm has offered both high dynamic range and the capability to recover high spatial-frequency components. Each of the previously developed image-based phase-retrieval techniques can be classified into one of two categories: iterative transform or parametric. Among the modifications of the original iterative-transform approach has been the introduction of a defocus diversity function (also defined in the cited companion article). Modifications of the original parametric approach have included minimizing alternative objective functions as well as implementing a variety of nonlinear optimization methods. The iterative-transform approach offers the advantage of ability to recover low, middle, and high spatial frequencies, but has disadvantage of having a limited dynamic range to one wavelength or less. In contrast, parametric phase retrieval offers the advantage of high dynamic range, but is poorly suited for recovering higher spatial frequency aberrations. The present phase-diverse iterative transform phase-retrieval algorithm offers both the high-spatial-frequency capability of the iterative-transform approach and the high dynamic range of parametric phase-recovery techniques. In implementation, this is a focus-diverse iterative-transform phaseretrieval algorithm that incorporates an adaptive diversity function, which makes it possible to avoid phase unwrapping while preserving high-spatial-frequency recovery. The algorithm includes an inner and an outer loop (see figure). An initial estimate of phase is used to start the algorithm on the inner loop, wherein multiple intensity images are processed, each using a different defocus value. The processing is done by an iterative-transform method, yielding individual phase estimates corresponding to each image of the defocus-diversity data set. These individual phase estimates are combined in a weighted average to form a new phase estimate, which serves as the initial phase estimate for either the next iteration of the iterative-transform method or, if the maximum number of iterations has been reached, for the next several steps, which constitute the outerloop portion of the algorithm. The details of the next several steps must be omitted here for the sake of brevity. The overall effect of these steps is to adaptively update the diversity defocus values according to recovery of global defocus in the phase estimate. Aberration recovery varies with differing amounts as the amount of diversity defocus is updated in each image; thus, feedback is incorporated into the recovery process. This process is iterated until the global defocus error is driven to zero during the recovery process. The amplitude of aberration may far exceed one wavelength after completion of the inner-loop portion of the algorithm, and the classical iterative transform method does not, by itself, enable recovery of multi-wavelength aberrations. Hence, in the absence of a means of off-loading the multi-wavelength portion of the aberration, the algorithm would produce a wrapped phase map. However, a special aberration-fitting procedure can be applied to the wrapped phase data to transfer at least some portion of the multi-wavelength aberration to the diversity function, wherein the data are treated as known phase values. In this way, a multiwavelength aberration can be recovered incrementally by successively applying the aberration-fitting procedure to intermediate wrapped phase maps. During recovery, as more of the aberration is transferred to the diversity function following successive iterations around the ter loop, the estimated phase ceases to wrap in places where the aberration values become incorporated as part of the diversity function. As a result, as the aberration content is transferred to the diversity function, the phase estimate resembles that of a reference flat.

Dean, Bruce H.↗

Encoders for block-circulant LDPC codes

In this paper, we present two encoding methods for block-circulant LDPC codes. The first is an iterative encoding method based on the erasure decoding algorithm, and the computations required are well organized due to the block-circulant structure of the parity check matrix. The second method uses block-circulant generator matrices, and the encoders are very similar to those for recursive convolutional codes. Some encoders of the second type have been implemented in a small Field Programmable Gate Array (FPGA) and operate at 100 Msymbols/second.

encoders↗

Improved Multi-Partition Method for Line-Based Iteration Schemes

Regular 3-dimensional multi-partitioning has been shown to be an efficient domain decomposition method for the parallelization of ADI-type algorithms on MIMD architectures. This paper discusses further improvements that can be made to the scheme that increase the granularity and reduce the communication density. These improvements, which are illustrated by simulation and parallel benchmark results, make multi-partitioning the method of choice on systems with relatively poor communication capabilities, such as networks of workstations, or on massively parallel machines with very fast processors, such as the IBM SP2.

Smith, Merritt H.↗

The preprocessed doacross loop

Dependencies between loop iterations cannot always be characterized during program compilation. Doacross loops typically make use of a-priori knowledge of inter-iteration dependencies to carry out required synchronizations. A type of doacross loop is proposed that allows the scheduling of iterations of a loop among processors without advance knowledge of inter-iteration dependencies. The method proposed for loop iterations requires that parallelizable preprocessing and postprocessing steps be carried out during program execution.

Saltz, Joel H.↗

Helicopter trim analysis by shooting and finite element methods with optimally damped Newton iterations

Helicopter trim settings of periodic initial state and control inputs are investigated for convergence of Newton iteration in computing the settings sequentially and in parallel. The trim analysis uses a shooting method and a weak version of two temporal finite element methods with displacement formulation and with mixed formulation of displacements and momenta. These three methods broadly represent two main approaches of trim analysis: adaptation of initial-value and finite element boundary-value codes to periodic boundary conditions, particularly for unstable and marginally stable systems. In each method, both the sequential and in-parallel schemes are used, and the resulting nonlinear algebraic equations are solved by damped Newton iteration with an optimally selected damping parameter. The impact of damped Newton iteration, including earlier-observed divergence problems in trim analysis, is demonstrated by the maximum condition number of the Jacobian matrices of the iterative scheme and by virtual elimination of divergence. The advantages of the in-parallel scheme over the conventional sequential scheme are also demonstrated.

Achar, N. S.↗