Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iterative limiters”

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 163 records · Page 9

A nonlinear relaxation/quasi-Newton algorithm for the compressible Navier-Stokes equations

A highly efficient implicit method for the computation of steady, two-dimensional compressible Navier-Stokes flowfields is presented. The discretization of the governing equations is hybrid in nature, with flux-vector splitting utilized in the streamwise direction and central differences with flux-limited artificial dissipation used for the transverse fluxes. Line Jacobi relaxation is used to provide a suitable initial guess for a new nonlinear iteration strategy based on line Gauss-Seidel sweeps. The applicability of quasi-Newton methods as convergence accelerators for this and other line relaxation algorithms is discussed, and efficient implementations of such techniques are presented. Convergence histories and comparisons with experimental data are presented for supersonic flow over a flat plate and for several high-speed compression corner interactions. Results indicate a marked improvement in computational efficiency over more conventional upwind relaxation strategies, particularly for flowfields containing large pockets of streamwise subsonic flow.

Edwards, Jack R.↗

Concept for the subresolution measurement of earthquake strain fields using SPOT panchromatic imagery

The use of satellite-derived imagery for measuring subresolution horizontal terrain displacments associated with present-day earthquakes is discussed with reference to data from the French SPOT satellite whose sensor array provides 10-m panchromatic imagery. The measured terrain displacements can be up to several meters, but usually no more than 6-8 m even for major earthquakes. The general approach is to spatially match the after image to the before image at each point on a half-kilometer grid by iteratively interpolating one and testing its correlation with the other. The discussion covers the basic algorithm, results of initial tests, error types and limitations, and future work.

Crippen, Robert E.↗

High-Performance, Low-Complexity Codes Researched for Communication Channels

NASA Lewis Research Center s Communications Technology Division has an ongoing program in the development of efficient channel coding schemes for satellite communications applications. Through a university grant, as a part of this research, the University of Toledo is investigating the performance of turbocodes, which use parallel concatenation of non-systematic convolutional encoders with an interleaver. The error correcting capacity of these codes is close to the Shannon limit. The research emphasis is on the development of low-complexity, but higher rate (greater than one half), turbocodes and on the iterative decoding of block codes.

Kwatra, Subhash C.↗

On a numerical solution of the supersonic panel flutter eigenproblem

An automated digital computer procedure is presented in this paper which enables efficient solution of the eigenvalue problem associated with the supersonic panel flutter phenomena. The step-by-step incremental solution procedure is based on an inverse iteration technique which effectively utilizes solution results from the previous step in determining such results during the current solution step. Also, the computations are limited to the determination of a few specific roots only, which are expected to contain the flutter mode, and this is achieved at each step without having to compute any other root. The structural discretization achieved by the finite-element method yields highly banded stiffness, mass, and aerodynamic matrices; the aerodynamic matrix evaluated by the linearized piston theory is real but unsymmetric in nature. The solution algorithm presented in this paper fully exploits the banded form of the associated matrices, and the resulting computer program written in FORTRAN V for the JPL UNIVAC 1108 computer proves to be most efficient and economical when compared to existing procedures of such analysis. Numerical results are presented for a two-dimensional panel flutter problem.

Gupta, K. K.↗

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.↗

Method and apparatus for determining and utilizing a time-expanded decision network

A method, apparatus and computer program for determining and utilizing a time-expanded decision network is presented. A set of potential system configurations is defined. Next, switching costs are quantified to create a "static network" that captures the difficulty of switching among these configurations. A time-expanded decision network is provided by expanding the static network in time, including chance and decision nodes. Minimum cost paths through the network are evaluated under plausible operating scenarios. The set of initial design configurations are iteratively modified to exploit high-leverage switches and the process is repeated to convergence. Time-expanded decision networks are applicable, but not limited to, the design of systems, products, services and contracts.

Silver, Matthew↗

Feasibility Analysis of Unmanned Aerial Vehicle Based on Tensegrity Structure

For future unmanned aerial vehicles to be ubiquitous, they need to be safe to other aircraft and people on the ground even in the event of unintended collisions. Unfortunately, this is difficult for current rigid designs as a crash of all but the smallest aircraft will have a significant impact on its target. As an alternative, this pa-per explores using a soft tensegrity structure (interconnected cables and rods) as a lightweight, robust chassis for a UAS and analyze its ability to achieve stable, controllable flight and mitigate damage during a collision. Tensegrity structures are three dimensional geometric constructions which are able to undergo severe deformations without permanent damage, and can immediately return to their original shape. Experiments and analysis are performed using a simple physics simulation environment, allowing for rapid design iteration and thorough exploration of system behavior. We test multiple configurations of the vehicle to understand impacts of changing various physical characteristics, and take limitations such as modern propeller thrust coefficients and motor speeds into account to ensure our results are inline with those of a real world vehicle. We ultimately find that such a vehicle has considerable real world potential, and that a physical prototype could theoretically be constructed and flown with current technology.

Bjorn Johnson↗

Closed-ecology life support systems /CELSS/ for long-duration, manned missions

Studies were conducted to scope the principal areas of technology that can contribute to the development of closed-ecology life support systems (CELSS). Such systems may be required for future space activities, such as space stations, manufacturing facilities, or colonies. A major feature of CELSS is the regeneration of food from carbon in waste materials. Several processes, using biological and/or physico-chemical components, have been postulated for closing the recycle loop. At the present time, limits of available technical information preclude the specification of an optimum scheme. Nevertheless, the most significant technical requirements can be determined by way of an iterative procedure of formulating, evaluating and comparing various closed-system scenario. The functions features and applications of this systems engineering procedure are discussed.

Modell, M.↗

Algorithm For Solution Of Navier-Stokes Equations

Advantages of two previous algorithms combined. Steady-state Navier-Stokes equations put in implicit finite-difference form solved by approximate Newton iteration. LU-SSOR scheme is new relaxation method combining advantages of LU factorization with Gauss-Seidel relaxation. Vectorizable LU-SSOR scheme, based on central differences, requires scalar diagonal inversions. Application of scheme to approximate Newton iteration of Navier-Stokes equations yields set of equations requiring no implicit smoothing on left side. Only adaptive, total-variation-diminishing, flux-limited dissipation terms added to right side. Algorithm used to predict laminar, turbulent, and hypersonic flows.

Yoon, Seokkwan↗

Development of kinematic equations and determination of workspace of a 6 DOF end-effector with closed-kinematic chain mechanism

This report presents results from the research grant entitled Active Control of Robot Manipulators, funded by the Goddard Space Flight Center, under Grant NAG5-780, for the period July 1, 1988 to January 1, 1989. An analysis is presented of a 6 degree-of-freedom robot end-effector built to study telerobotic assembly of NASA hardware in space. Since the end-effector is required to perform high precision motion in a limited workspace, closed-kinematic mechanisms are chosen for its design. A closed-form solution is obtained for the inverse kinematic problem and an iterative procedure employing Newton-Raphson method is proposed to solve the forward kinematic problem. A study of the end-effector workspace results in a general procedure for the workspace determination based on link constraints. Computer simulation results are presented.

Nguyen, Charles C.↗

A method for the retrieval of atomic oxygen density and temperature profiles from ground-based measurements of the O(+)(2D-2P) 7320 A twilight airglow

This paper describes a technique for extracting thermospheric profiles of the atomic-oxygen density and temperature, using ground-based measurements of the O(+)(2D-2P) doublet at 7320 and 7330 A in the twilight airglow. In this method, a local photochemical model is used to calculate the 7320-A intensity; the method also utilizes an iterative inversion procedure based on the Levenberg-Marquardt method described by Press et al. (1986). The results demonstrate that, if the measurements are only limited by errors due to Poisson noise, the altitude profiles of neutral temperature and atomic oxygen concentration can be determined accurately using currently available spectrometers.

Fennelly, J. A.↗

First MEM task IRMEO in IRAF

The first task for image restoration using the Maximum Entropy Method (MEM) in IRAF, called IRMEO, is described. The underlining algorithm is the approximate Newton method for optimization. The basic input images and parameters for deconvolution are described in some detail. Results of preliminary tests, including the number of iterations, required CPU time on a variety of computers, and deconvolved images are reported and compared with those from other deconvolution methods. The merits and limitations of this task are pointed out. The possible development of better MEM tasks on the basis of IRMEO is also discussed.

Wu, Nailong↗

Using a Portfolio of Algorithms for Planning and Scheduling

The Automated Scheduling and Planning Environment (ASPEN) software system, aspects of which have been reported in several previous NASA Tech Briefs articles, includes a subsystem that utilizes a portfolio of heuristic algorithms that work synergistically to solve problems. The nature of the synergy of the specific algorithms is that their likelihoods of success are negatively correlated: that is, when a combination of them is used to solve a problem, the probability that at least one of them will succeed is greater than the sum of probabilities of success of the individual algorithms operating independently of each other. In ASPEN, the portfolio of algorithms is used in a planning process of the iterative repair type, in which conflicts are detected and addressed one at a time until either no conflicts exist or a user-defined time limit has been exceeded. At each choice point (e.g., selection of conflict; selection of method of resolution of conflict; or choice of move, addition, or deletion) ASPEN makes a stochastic choice of a combination of algorithms from the portfolio. This approach makes it possible for the search to escape from looping and from solutions that are locally but not globally optimum.

Sherwood, Robert↗

Kepler Data Validation II–Transit Model Fitting and Multiple-Planet Search

This paper discusses the transit model-fitting and multiple-planet search algorithms and performance of the Kepler Science Data Processing Pipeline, developed by the Kepler Science Operations Center (SOC). Threshold crossing events (TCEs), which are transit candidate events, are generated by the Transiting Planet Search (TPS) component of the pipeline and subsequently processed in the data validation (DV) component. The transit model is used in DV to fit TCEs to characterize planetary candidates and to derive parameters that are used in various diagnostic tests to classify them. After the signature associated with the TCE is removed from the light curve of the target star, the residual light curve goes through TPS again to search for additional TCEs. The iterative process of transit model fitting and multiple-planet search continues until no TCE is generated from the residual light curve or an upper limit is reached. The transit model-fitting and multiple-planet search performance of the final release (9.3, 2016January) of the pipeline is demonstrated with the results of the processing of four years (17 quarters) of flight data from the primary Kepler Mission. The transit model-fitting results are accessible from the NASA Exoplanet Archive. The final version of the SOC codebase is available through GitHub.

Threshold crossing events (TCEs↗

Demonstration of Automatically-Generated Adjoint Code for Use in Aerodynamic Shape Optimization

Gradient-based optimization requires accurate derivatives of the objective function and constraints. These gradients may have previously been obtained by manual differentiation of analysis codes, symbolic manipulators, finite-difference approximations, or existing automatic differentiation (AD) tools such as ADIFOR (Automatic Differentiation in FORTRAN). Each of these methods has certain deficiencies, particularly when applied to complex, coupled analyses with many design variables. Recently, a new AD tool called ADJIFOR (Automatic Adjoint Generation in FORTRAN), based upon ADIFOR, was developed and demonstrated. Whereas ADIFOR implements forward-mode (direct) differentiation throughout an analysis program to obtain exact derivatives via the chain rule of calculus, ADJIFOR implements the reverse-mode counterpart of the chain rule to obtain exact adjoint form derivatives from FORTRAN code. Automatically-generated adjoint versions of the widely-used CFL3D computational fluid dynamics (CFD) code and an algebraic wing grid generation code were obtained with just a few hours processing time using the ADJIFOR tool. The codes were verified for accuracy and were shown to compute the exact gradient of the wing lift-to-drag ratio, with respect to any number of shape parameters, in about the time required for 7 to 20 function evaluations. The codes have now been executed on various computers with typical memory and disk space for problems with up to 129 x 65 x 33 grid points, and for hundreds to thousands of independent variables. These adjoint codes are now used in a gradient-based aerodynamic shape optimization problem for a swept, tapered wing. For each design iteration, the optimization package constructs an approximate, linear optimization problem, based upon the current objective function, constraints, and gradient values. The optimizer subroutines are called within a design loop employing the approximate linear problem until an optimum shape is found, the design loop limit is reached, or no further design improvement is possible due to active design variable bounds and/or constraints. The resulting shape parameters are then used by the grid generation code to define a new wing surface and computational grid. The lift-to-drag ratio and its gradient are computed for the new design by the automatically-generated adjoint codes. Several optimization iterations may be required to find an optimum wing shape. Results from two sample cases will be discussed. The reader should note that this work primarily represents a demonstration of use of automatically- generated adjoint code within an aerodynamic shape optimization. As such, little significance is placed upon the actual optimization results, relative to the method for obtaining the results.

Green, Lawrence↗

A family of solution algorithms for nonlinear structural analysis based on relaxation equations

A family of hierarchical algorithms for nonlinear structural equations are presented. The algorithms are based on the Davidenko-Branin type homotopy and shown to yield consistent hierarchical perturbation equations. The algorithms appear to be particularly suitable to problems involving bifurcation and limit point calculations. An important by-product of the algorithms is that it provides a systematic and economical means for computing the stepsize at each iteration stage when a Newton-like method is employed to solve the systems of equations. Some sample problems are provided to illustrate the characteristics of the algorithms.

Park, K. C.↗

Direct Imaging of Extra-Solar Planets in Star Forming Regions: Lessons Learned from a False Positive Around IM Lup

Context. Most exoplanet imagers consist of ground-based adaptive optics coronagraphic cameras which are currently limited in contrast, sensitivity and astrometric precision, but advantageously observe in the near-infrared window (1 5 m). Because of these practical limitations, our current observational aim at detecting and characterizing planets puts heavy constraints on target selection, observing strategies, data reduction, and follow-up. Most surveys so far have thus targeted young systems (1 100 Myr) to catch the putative remnant thermal radiation of giant planets, which peaks in the near-infrared. They also favor systems in the solar neighborhood (d less than 80 pc), which eases angular resolution requirements but also ensures a good knowledge of the distance and proper motion, which are critical to secure the planet status, and enable subsequent characterization. Aims. Because of their youth, it is very tempting to target the nearby star forming regions, which are typically twice as far as the bulk of objects usually combed for planets by direct imaging. Probing these interesting reservoirs sets additional constraints that we review in this paper by presenting the planet search that we initiated in 2008 around the disk-bearing T Tauri star IM Lup, which is part of the Lupus star forming region (140-190 pc). Methods. We show and discuss why age determination, the choice of evolutionary model for both the central star and the planet, precise knowledge of the host star proper motion, relative or absolute (between different instruments) astrometric accuracy (including plate scale calibration), and patience are the key ingredients for exoplanet searches around more distant young stars. Results. Unfortunately, most of the time, precision and perseverance are not paying off: we discovered a candidate companion around IM Lup in 2008, which we report here to be an unbound background object. We nevertheless review in details the lessons learned from our endeavor, and additionally present the best detection limits ever calculated for IM Lup. We also accessorily report on the successful use of innovative data reduction techniques, such as the damped-LOCI and iterative roll subtraction.

D Mawet↗

Model-Based Systems Engineering in Concurrent Engineering Centers

Concurrent Engineering Centers (CECs) are specialized facilities with a goal of generating and maturing engineering designs by enabling rapid design iterations. This is accomplished by co-locating a team of experts (either physically or virtually) in a room with a focused design goal and a limited timeline of a week or less. The systems engineer uses a model of the system to capture the relevant interfaces and manage the overall architecture. A single model that integrates other design information and modeling allows the entire team to visualize the concurrent activity and identify conflicts more efficiently, potentially resulting in a systems model that will continue to be used throughout the project lifecycle. Performing systems engineering using such a system model is the definition of model-based systems engineering (MBSE); therefore, CECs evolving their approach to incorporate advances in MBSE are more successful in reducing time and cost needed to meet study goals. This paper surveys space mission CECs that are in the middle of this evolution, and the authors share their experiences in order to promote discussion within the community.

systems engineering↗