Engineering Papers⌕ Search

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.

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

At least 865 records · Page 48

Iterative pass optimization of sequence data

The problem of determining the minimum-cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete. This "tree alignment" problem has motivated the considerable effort placed in multiple sequence alignment procedures. Wheeler in 1996 proposed a heuristic method, direct optimization, to calculate cladogram costs without the intervention of multiple sequence alignment. This method, though more efficient in time and more effective in cladogram length than many alignment-based procedures, greedily optimizes nodes based on descendent information only. In their proposal of an exact multiple alignment solution, Sankoff et al. in 1976 described a heuristic procedure--the iterative improvement method--to create alignments at internal nodes by solving a series of median problems. The combination of a three-sequence direct optimization with iterative improvement and a branch-length-based cladogram cost procedure, provides an algorithm that frequently results in superior (i.e., lower) cladogram costs. This iterative pass optimization is both computation and memory intensive, but economies can be made to reduce this burden. An example in arthropod systematics is discussed. c2003 The Willi Hennig Society. Published by Elsevier Science (USA). All rights reserved.

NASA Discipline Evolutionary Biology↗

Numerical solution of transonic full stream function equations in conservation form

The stream function equation in conservation form is solved iteratively based on the artificial compressibility method. The density is not a unique function of the mass flux. In order to avoid the ambiguity near the sonic line, the density is updated in terms of the velocity, which is obtained through a simple integration of a first order equation step by step in the flow field. Iteration algorithms and finite difference approximations are discussed and numerical results of both conservative and nonconservative calculations are presented.

Hafez, M. M.↗

Application of a multi-level grid method to transonic flow calculations

A multi-level grid method has been studied as a possible means of accelerating convergence in relaxation calculations for transonic flows. The method employs a hierarchy of grids, ranging from very coarse (e.g., 8 x 2 mesh cells) to fine (e.g., 128 x 32); the coarser grids are used to diminish the magnitude of the smooth part of the residuals, hopefully with far less total work than would be required with, say, optimal SLOR iterations on the finest grid. The method was applied to the solution of the transonic small-disturbance equation for the velocity potential in the conservation form. Nonlifting transonic flow past a parabolic-arc airfoil is the example studied, with meshes of both constant and variable step size.

South, J. C., Jr.↗

Spectral Spherical Harmonics Discrete Ordinate Method

A new method for modeling the radiative transfer in inhomogeneous three-dimensional media illuminated by a Gaussian beam is described. This approach, called the Spectral Spherical Harmonics Discrete Ordinate Method (SSHDOM), uses the Fourier expansion method to transform the three-dimensional radiative transfer into an one-dimensional equation in the spectral domain, and the Spherical Harmonics Discrete Ordinate Method (SHDOM) for its solution. Specifically, (i) the source function is represented in the spectral domain through a spherical harmonic expansion, (ii) the spectral one-dimensional radiative transfer equation is integrated along discrete ordinates through a spatial grid, and (iii) the solution method is based on the Picard iteration. Both SSHDOM and SHDOM algorithms are implemented in a common computer code.

Gaussian beam↗

Inverse problem in incompressible, irrotational axisymmetric flow

A vortex-sheet method for solving the axisymmetric inverse problem is presented, and an iterative, interactive computer program for computing the body shape starting from an assumed shape is developed. The method eliminates the calculation of the direct problem at every iteration using the given velocity. The singular integral that arises in the problem formulation has been integrated analytically. The efficiency of the vortex-sheet method is demonstrated using three test cases, and the obtained body shapes and the corresponding surface velocity distributions are presented.

Dinavahi, Surya P. G.↗

A three-dimensional boundary-layer method for flow over delta wings with leading-edge separation

A three-dimensional, laminar boundary-layer method is applied to the incompressible flow over a slender delta wing at incidence. The predictor-corrector finite-difference scheme of Matsuno is used to difference the governing equations. The method has the advantages that no iterations are required to advance the solution and the cross-flow derivatives are formed independent of the cross-field direction. The difference scheme is demonstrated to yield accurate numerical results when compared to the exact solution of the three-dimensional boundary-layer equations for parabolic flow over a moving flat plate. The method is applied to delta wings of various sweep angles at angles of attack up to 20 deg., with the inviscid solution determined using a higher-order, three-dimensional panel method.

Woodson, S. H.↗

An Analytical Investigation of Three General Methods of Calculating Chemical-Equilibrium Compositions

The Brinkley, Huff, and White methods for chemical-equilibrium calculations were modified and extended in order to permit an analytical comparison. The extended forms of these methods permit condensed species as reaction products, include temperature as a variable in the iteration, and permit arbitrary estimates for the variables. It is analytically shown that the three extended methods can be placed in a form that is independent of components. In this form the Brinkley iteration is identical computationally to the White method, while the modified Huff method differs only'slightly from these two. The convergence rates of the modified Brinkley and White methods are identical; and, further, all three methods are guaranteed to converge and will ultimately converge quadratically. It is concluded that no one of the three methods offers any significant computational advantages over the other two.

Zeleznik, Frank J.↗

An investigation of geometry and noise corrections to San Marco-C neutral atmospheric composition experiment data

The problem of the calculation of ambient densities from San Marco-C neutral atmospheric composition experiment data is considered. A brief description is given of the data measurement method, followed by a description of both the theoretical and experimental data curves. Geometry, electrometer distortions, and noise effects are then studied in terms of their effects on the ideal data form. From these considerations two data reduction methods are evolved. The first is an iterative integration technique that exploits the symmetry of the experimental data about the minimum angle of attack. For the analysis of geometry effects, a second method using interval averaging was developed and studied.

Curtis, S. A.↗

Stability sensitivity analysis for the aeroelastic optimization of a helicopter rotor

A sensitivity study of blade stability in forward flight for a hingeless rotor with respect to structural design variables is carried out using a direct analytical method. Structural design variables include nonstructural mass distribution (spanwise and chordwise), chordwise offset of center of gravity, and blade bending stiffnesses (flap, lag and torsion). The formulation for blade steady response is based on a finite element method in space and time. The vehicle trim and blade steady response are calculated iteratively as one coupled solution using a modified Newton method. Eigenvalues corresponding to different blade modes are calculated using Floquet transition matrix theory. The formulation for derivatives of the eigenvalues with respect to design variables is implemented using a direct analytical approach (chain rule differentiation), and constitutes an integral part of the regular stability analysis. The stability sensitivity derivatives were obtained at a fraction of computation time compared to the frequently adopted finite difference method. A parametric study showed that nonstructural mass and chordwise cg offset of outboarad elements, and lag bending stiffness of inboard elements, have powerful influence on blade stability.

Lim, Joon W.↗

Comparing direct and iterative equation solvers in a large structural analysis software system

Two direct Choleski equation solvers and two iterative preconditioned conjugate gradient (PCG) equation solvers used in a large structural analysis software system are described. The two direct solvers are implementations of the Choleski method for variable-band matrix storage and sparse matrix storage. The two iterative PCG solvers include the Jacobi conjugate gradient method and an incomplete Choleski conjugate gradient method. The performance of the direct and iterative solvers is compared by solving several representative structural analysis problems. Some key factors affecting the performance of the iterative solvers relative to the direct solvers are identified.

Poole, E. L.↗

Development of a Ground Test and Analysis Protocol for NASA's NextSTEP Phase 2 Habitation Concepts

The NASA Next Space Technologies for Exploration Partnerships (NextSTEP) program is a public-private partnership model that seeks commercial development of deep space exploration capabilities to support human spaceflight missions around and beyond cislunar space. NASA first issued the Phase 1 NextSTEP Broad Agency Announcement to U.S. industries in 2014, which called for innovative cislunar habitation concepts that leveraged commercialization plans for low-Earth orbit. These habitats will be part of the Deep Space Gateway (DSG), the cislunar space station planned by NASA for construction in the 2020s. In 2016, Phase 2 of the NextSTEP program selected five commercial partners to develop ground prototypes. A team of NASA research engineers and subject matter experts (SMEs) have been tasked with developing the ground-test protocol that will serve as the primary means by which these Phase 2 prototypes will be evaluated. Since 2008, this core test team has successfully conducted multiple spaceflight analog mission evaluations utilizing a consistent set of operational tools, methods, and metrics to enable the iterative development, testing, analysis, and validation of evolving exploration architectures, operations concepts, and vehicle designs. The purpose of implementing a similar evaluation process for the Phase 2 Habitation Concepts is to consistently evaluate different commercial partner ground prototypes to provide data-driven, actionable recommendations for Phase 3. This paper describes the process by which the ground test protocol was developed and the objectives, methods, and metrics by which the NextSTEP Phase 2 Habitation Concepts will be rigorously and systematically evaluated. The protocol has been developed using both a top-down and bottom-up approach. Top-down development began with the Human Exploration and Operations Mission Directorate (HEOMD) exploration objectives and ISS Exploration Capability Study Team (IECST) candidate flight objectives. Strategic questions and associated rationales, derived from these candidate architectural objectives, provide the framework by which the ground-test protocol will address the DSG stack elements and configurations, systems and subsystems, and habitation, science, and EVA functions. From these strategic questions, high-level functional requirements for the DSG were drafted and associated ground-test objectives and analysis protocols were established. Bottom-up development incorporated objectives from NASA SMEs in autonomy, avionics and software, communication, environmental control and life support systems, exercise, extravehicular activity, exploration medical operations, guidance navigation and control, human factors and behavioral performance, human factors and habitability, logistics, Mission Control Center operations, power, radiation, robotics, safety and mission assurance, science, simulation, structures, thermal, trash management, and vehicle health. Top-down and bottom-up objectives were integrated to form overall functional requirements - ground-test objectives and analysis mapping. From this mapping, ground-test objectives were organized into those that will be evaluated through inspection, demonstration, analysis, subsystem standalone testing, and human-in-the-loop (HITL) testing. For the HITL tests, mission-like timelines, procedures, and flight rules have been developed to directly meet ground test objectives and evaluate specific functional requirements. Data collected from these assessments will be analyzed to determine the acceptability of habitation element configurations and the combinations of capabilities that will result in the best habitation platform to be recommended by the test team for Phase 3.

Gernhardt, Michael L.↗

Bi-Level Integrated System Synthesis (BLISS)

BLISS is a method for optimization of engineering systems by decomposition. It separates the system level optimization, having a relatively small number of design variables, from the potentially numerous subsystem optimizations that may each have a large number of local design variables. The subsystem optimizations are autonomous and may be conducted concurrently. Subsystem and system optimizations alternate, linked by sensitivity data, producing a design improvement in each iteration. Starting from a best guess initial design, the method improves that design in iterative cycles, each cycle comprised of two steps. In step one, the system level variables are frozen and the improvement is achieved by separate, concurrent, and autonomous optimizations in the local variable subdomains. In step two, further improvement is sought in the space of the system level variables. Optimum sensitivity data link the second step to the first. The method prototype was implemented using MATLAB and iSIGHT programming software and tested on a simplified, conceptual level supersonic business jet design, and a detailed design of an electronic device. Satisfactory convergence and favorable agreement with the benchmark results were observed. Modularity of the method is intended to fit the human organization and map well on the computing technology of concurrent processing.

Sobieszczanski-Sobieski, Jaroslaw↗

Transonic airfoil design using Cartesian coordinates

A numerical technique for designing transonic airfoils having a prescribed pressure distribution (the inverse problem) is presented. The method employs the basic features of Jameson's iterative solution for the full potential equation, except that inverse boundary conditions and Cartesian coordinates are used. The method is a direct-inverse approach that controls trailing-edge closure. Examples show the application of the method to design aft-cambered and other airfoils specifically for transonic flight.

Carlson, L. A.↗

Real-Time Optimization for use in a Control Allocation System to Recover from Pilot Induced Oscillations

Integration of the Control Allocation technique to recover from Pilot Induced Oscillations (CAPIO) System into the control system of a Short Takeoff and Landing Mobility Concept Vehicle simulation presents a challenge because the CAPIO formulation requires that constrained optimization problems be solved at the controller operating frequency. We present a solution that utilizes a modified version of the well-known L-BFGS-B solver. Despite the iterative nature of the solver, the method is seen to converge in real time with sufficient reliability to support three weeks of piloted runs at the NASA Ames Vertical Motion Simulator (VMS) facility. The results of the optimization are seen to be excellent in the vast majority of real-time frames. Deficiencies in the quality of the results in some frames are shown to be improvable with simple termination criteria adjustments, though more real-time optimization iterations would be required.

optimal control↗

Bi-Level Integrated System Synthesis (BLISS)

BLISS is a method for optimization of engineering systems by decomposition. It separates the system level optimization, having a relatively small number of design variables, from the potentially numerous sub-system optimizations that may each have a large number of local design variables. The subsystem optimizations are autonomous and may be conducted concurrently. Subsystem and system optimizations alternate, linked by sensitivity data, producing a design improvement in each iteration. Starting from a best guess initial design, the method improves that design in iterative cycles, each cycle comprised of two steps. In step one, the system level variables are frozen and the improvement is achieved by separate, concurrent, and autonomous optimizations in the local variable subdomains. In step two, further improvement is sought in the space of the system level variables. Optimum sensitivity data link the second step to the first. The method prototype was implemented using MATLAB and iSIGHT programming software and tested on a simplified, conceptual level supersonic business jet design, and a detailed design of an electronic device.

Sobieszczanski-Sobieski, Jaroslaw↗

Iterative Nonlinear Tikhonov Algorithm with Constraints for Electromagnetic Tomography

Low frequency electromagnetic tomography such as the capacitance tomography (ECT) has been proposed for monitoring and mass-gauging of gas-liquid two-phase system under microgravity condition in NASA's future long-term space missions. Due to the ill-posed inverse problem of ECT, images reconstructed using conventional linear algorithms often suffer from limitations such as low resolution and blurred edges. Hence, new efficient high resolution nonlinear imaging algorithms are needed for accurate two-phase imaging. The proposed Iterative Nonlinear Tikhonov Regularized Algorithm with Constraints (INTAC) is based on an efficient finite element method (FEM) forward model of quasi-static electromagnetic problem. It iteratively minimizes the discrepancy between FEM simulated and actual measured capacitances by adjusting the reconstructed image using the Tikhonov regularized method. More importantly, it enforces the known permittivity of two phases to the unknown pixels which exceed the reasonable range of permittivity in each iteration. This strategy does not only stabilize the converging process, but also produces sharper images. Simulations show that resolution improvement of over 2 times can be achieved by INTAC with respect to conventional approaches. Strategies to further improve spatial imaging resolution are suggested, as well as techniques to accelerate nonlinear forward model and thus increase the temporal resolution.

Xu, Feng↗