Search NASA⌕ Search

SEARCH · Search NASA

Results for “Iterative algorithms”

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 181 records · Page 10

Space transportation vehicle design evaluation using saturated designs

An important objective in the preliminary design and evaluation of space transportation vehicles is to find the best values of design variables that optimize the performance characteristic (e.g. dry weight). For a given configuration, the vehicle performance can be determined by the use of complex sizing and performance evaluation computer programs. These complex computer programs utilize iterative algorithms and they are generally too expensive and/or difficult to use directly in multidisciplinary design optimization. An alternative is to use response surface methodology (RSM) and obtain quadratic polynomial approximations to the functional relationships between performance characteristics and design variables. In RSM, these approximation models are then used to determine optimum design parameter values and for rapid sensitivity studies. Constructing a second-order model requires that 'n' design parameters be studied at least at 3 levels (values) so that the coefficients in the model can be estimated. There, 3(n) factorial experiments (point designs or observations) may be necessary. For small values of 'n' such as two or three, this design works well. However, when a large number of design parameters are under study, the number of design points required for a full-factorial design may become excessive. Fortunately, these quadratic polynomial approximations can be obtained by selecting an efficient design matrix using central composite designs (CCD) from design of experiments theory. Each unique point design from the CCD matrix is then conducted using computerized analysis tools (e.g. POST, CONSIZ, etc.). In the next step, least squares regression analysis is used to calculate the quadratic polynomial coefficients from the data. However, in some multidisciplinary applications involving a large number of design variables and several disciplines, the computerized performance synthesis programs may get too time consuming and expensive to run even with the use of efficient central composite designs. In such cases, it may be preferable to keep the number of design points to an absolute minimum and trade some model accuracy with cost. For this purpose, another class of experimental designs, called saturated D-optimal designs may be utilized for generating a matrix of vehicle designs. A design is called saturated when the number of design points is exactly equal to the number of terms in the model to be fitted. As a result, saturated designs require the absolute minimum number of design points ((n+1)(n+2)/s) to estimate the quadratic polynomial model coefficients. Saturated designs can be generated using the D-optimality criterion. A good saturated design should give rise to least squares estimates with minimum generalized variance.

Unal, Resit↗

Computation of selected eigenvalues of generalized eigenvalue problems

The Arnoldi (1951) and Lanczos (1950) iterative algorithms are used to obtain a few selected eigenvalues of the generalized eigenvalue problem A(x) = lambdaB(x), where A and B are n x n nonsymmetric banded complex matrices. A shift-and-invert strategy is used to increase the rate of convergence toward the desired eigenvalues, and the two approaches are evaluated in view of their performance in a model problem concerning the linear stability of compressible boundary layers. A general scheme for computing the eigenvalues that lie within a 'box' in the complex plane is presented.

Nayar, Narinder↗

Surface matching for correlation of virtual models: Theory and application

Virtual reality can enable a robot user to off line generate and test in a virtual environment a sequence of operations to be executed by the robot in an assembly cell. Virtual models of objects are to be correlated to the real entities they represent by means of a suitable transformation. A solution to the correlation problem, which is basically a problem of 3-dimensional adjusting, has been found exploiting the surface matching theory. An iterative algorithm has been developed, which matches the geometric surface representing the shape of the virtual model of an object, with a set of points measured on the surface in the real world. A peculiar feature of the algorithm is to work also if there is no one-to-one correspondence between the measured points and those representing the surface model. Furthermore the problem of avoiding convergence to local minima is solved, by defining a starting point of states ensuring convergence to the global minimum. The developed algorithm has been tested by simulation. Finally, this paper proposes a specific application, i.e., correlating a robot cell, equipped for biomedical use with its virtual representation.

Caracciolo, Roberto↗

Monitoring Mars with the Hubble Space Telescope: 1990-1991 observations

Images of Mars obtained using the Planetary Camera on the Hubble Space Telescope during 1990 and 1991 are described and analyzed. Multispectral images of Mars record the martian season between L(sub s) = 348 deg and 60 deg corresponding to late winter and spring in the northern hemisphere. The wavelengths of these observations varied between 230 nm in the ultraviolet and 890 nm in the near infrared. We use these images to discuss atmospheric and polar phenomena, to constrain the aerosols and ozone in the martian atmosphere, and to compare surface albedo features within this data set as well as with previous observations. Two methods are used to constrain the opacity of the martian atmosphere: comparisons of ultraviolet images with atmospheric scattering models and examination of contrast changes of surface features observed at visible wavelengths. Our observations are consistent with a Mars which was quite different from the planet when it was viewed by Viking; we estimate an upper limit of 0.1 for equatorial dust opacity near vernal equinox, compared to values of 0.4 to 0.5 measured in Chryse by Viking Lander 1. Later, at L(sub s) = 60 deg, and upper limit of 0.2 was found for dust in the southern hemisphere. Except for suggestions of local dust activity near the north polar cap in late spring, there was no visual evidence of dust storms on the planet. The Hartley band of ozone is within the F230W filter bandpass, and the 230W/336W ratio is therefore sensitive to ozone. High latitude ozone is observed at a concentration similar to that observed by Mariner 9; a seasonal dependence in ozone concentration was observed with concentration decreasing at northern arctic latitudes and increasing at southern midlatitudes as L(sub s) increases from 350 deg to 60 deg. Despite the difference in dust loading, the behavior of condensate clouds and the recession of the north polar cap are consistent with those observed during Viking years. Late winter images of the north polar region reveal an active north polar hood with a maximum (UV) opacity of about 0.25 near 50 deg latitude; the hood seems to have an annular form, with the central, polar regions having smaller opacity. Clouds observed in the northern hemisphere to the south of the hood boundary are suggestive of fronts similar to those observed during the Mariner 9 mission. A diurnal variation in the hood clouds which is (anti) correlated with the amount of water vapor in the atmosphere is noted. Images were deconvolved using the Richardson-Lucy iterative algorithm to remove the defocussing effects of the spherical aberration of the HST primary. Even when Mars subtended less than 5 arcsec, in May 1991, the images were scientifically useful and comparable to photographic images obtained at opposition. Although the data are subject to the solar pointing constraint for HST, the relatively slow movement of the allowed observation window, which is more than one half martian year, with respect to the martian seasons will permit us to address the question of major variations in the martian atmosphere.

James, Philip B.↗

An Evaluation of the Measurement Requirements for an In-Situ Wake Vortex Detection System

Results of a numerical simulation are presented to determine the feasibility of estimating the location and strength of a wake vortex from imperfect in-situ measurements. These estimates could be used to provide information to a pilot on how to avoid a hazardous wake vortex encounter. An iterative algorithm based on the method of secants was used to solve the four simultaneous equations describing the two-dimensional flow field around a pair of parallel counter-rotating vortices of equal and constant strength. The flow field information used by the algorithm could be derived from measurements from flow angle sensors mounted on the wing-tip of the detecting aircraft and an inertial navigation system. The study determined the propagated errors in the estimated location and strength of the vortex which resulted from random errors added to theoretically perfect measurements. The results are summarized in a series of charts and a table which make it possible to estimate these propagated errors for many practical situations. The situations include several generator-detector airplane combinations, different distances between the vortex and the detector airplane, as well as different levels of total measurement error.

Fuhrmann, Henri D.↗

Reconfigurable Flight Control Designs With Application to the X-33 Vehicle

Two methods for control system reconfiguration have been investigated. The first method is a robust servomechanism control approach (optimal tracking problem) that is a generalization of the classical proportional-plus-integral control to multiple input-multiple output systems. The second method is a control-allocation approach based on a quadratic programming formulation. A globally convergent fixed-point iteration algorithm has been developed to make onboard implementation of this method feasible. These methods have been applied to reconfigurable entry flight control design for the X-33 vehicle. Examples presented demonstrate simultaneous tracking of angle-of-attack and roll angle commands during failures of the right body flap actuator. Although simulations demonstrate success of the first method in most cases, the control-allocation method appears to provide uniformly better performance in all cases.

Burken, John J.↗

Two Reconfigurable Flight-Control Design Methods: Robust Servomechanism and Control Allocation

Two methods for control system reconfiguration have been investigated. The first method is a robust servomechanism control approach (optimal tracking problem) that is a generalization of the classical proportional-plus-integral control to multiple input-multiple output systems. The second method is a control-allocation approach based on a quadratic programming formulation. A globally convergent fixed-point iteration algorithm has been developed to make onboard implementation of this method feasible. These methods have been applied to reconfigurable entry flight control design for the X-33 vehicle. Examples presented demonstrate simultaneous tracking of angle-of-attack and roll angle commands during failures of the fight body flap actuator. Although simulations demonstrate success of the first method in most cases, the control-allocation method appears to provide uniformly better performance in all cases.

Burken, John J.↗

First Year Wilkinson Microwave Anisotropy Probe(WMAP) Observations: Data Processing Methods and Systematic Errors Limits

We describe the calibration and data processing methods used to generate full-sky maps of the cosmic microwave background (CMB) from the first year of Wilkinson Microwave Anisotropy Probe (WMAP) observations. Detailed limits on residual systematic errors are assigned based largely on analyses of the flight data supplemented, where necessary, with results from ground tests. The data are calibrated in flight using the dipole modulation of the CMB due to the observatory's motion around the Sun. This constitutes a full-beam calibration source. An iterative algorithm simultaneously fits the time-ordered data to obtain calibration parameters and pixelized sky map temperatures. The noise properties are determined by analyzing the time-ordered data with this sky signal estimate subtracted. Based on this, we apply a pre-whitening filter to the time-ordered data to remove a low level of l/f noise. We infer and correct for a small (approx. 1 %) transmission imbalance between the two sky inputs to each differential radiometer, and we subtract a small sidelobe correction from the 23 GHz (K band) map prior to further analysis. No other systematic error corrections are applied to the data. Calibration and baseline artifacts, including the response to environmental perturbations, are negligible. Systematic uncertainties are comparable to statistical uncertainties in the characterization of the beam response. Both are accounted for in the covariance matrix of the window function and are propagated to uncertainties in the final power spectrum. We characterize the combined upper limits to residual systematic uncertainties through the pixel covariance matrix.

Hinshaw, G.↗

A Generalized Fluid Formulation for Turbomachinery Computations

A generalized formulation of the equations of motion of an arbitrary fluid are developed for the purpose of defining a common iterative algorithm for computational procedures. The method makes use of the equations of motion in conservation form with separate pseudo-time derivatives used for defining the numerical flux for a Riemann solver and the convergence algorithm. The partial differential equations are complemented by an thermodynamic and caloric equations of state of a complexity necessary for describing the fluid. Representative solutions with a new code based on this general equation formulation are provided for three turbomachinery problems. The first uses air as a working fluid while the second uses gaseous oxygen in a regime in which real gas effects are of little importance. These nearly perfect gas computations provide a basis for comparing with existing perfect gas code computations. The third case is for the flow of liquid oxygen through a turbine where real gas effects are significant. Vortex shedding predictions with the LOX formulations reduce the discrepancy between perfect gas computations and experiment by approximately an order of magnitude, thereby verifying the real gas formulation as well as providing an effective case where its capabilities are necessary.

Merkle, Charles L.↗

On Study of Air/Space-borne Dual-Wavelength Radar for Estimates of Rain Profiles

In this study, a framework is discussed to apply air/space-borne dual-wavelength radar for the estimation of characteristic parameters of hydrometeors. The focus of our study is on the Global Precipitation Measurements (GPM) precipitation radar, a dual-wavelength radar that operates at Ku (13.8 GHz) and Ka (35 GHz) bands. As the droplet size distributions (DSD) of rain are expressed as the Gamma function, a procedure is described to derive the median volume diameter (D(sub 0)) and particle number concentration (N(sub T)) of rain. The correspondences of an important quantity of dual-wavelength radar, defined as deferential frequency ratio (DFR), to the D(sub 0) in the melting region are given as a function of the distance from the 0 C isotherm. A self-consistent iterative algorithm that shows a promising to account for rain attenuation of radar and infer the DSD without use of surface reference technique (SRT) is examined by applying it to the apparent radar reflectivity profiles simulated from the DSD model and then comparing the estimates with the model (true) results. For light to moderate rain the self-consistent rain profiling approach converges to unique and correct solutions only if the same shape factors of Gamma functions are used both to generate and retrieve the rain profiles, but does not converges to the true solutions if the DSD form is not chosen correctly. To further examine the dual-wavelength techniques, the self-consistent algorithm, along with forward and backward rain profiling algorithms, is then applied to the measurements taken from the 2nd generation Precipitation Radar (PR-2) built by Jet Propulsion Laboratory. It is found that rain profiles estimated from the forward and backward approaches are not sensitive to shape factor of DSD Gamma distribution, but the self-consistent method is.

Liao, Liang↗

Thermal Model of a Current-Carrying Wire in a Vacuum

A computer program implements a thermal model of an insulated wire carrying electric current and surrounded by a vacuum. The model includes the effects of Joule heating, conduction of heat along the wire, and radiation of heat from the outer surface of the insulation on the wire. The model takes account of the temperature dependences of the thermal and electrical properties of the wire, the emissivity of the insulation, and the possibility that not only can temperature vary along the wire but, in addition, the ends of the wire can be thermally grounded at different temperatures. The resulting second-order differential equation for the steady-state temperature as a function of position along the wire is highly nonlinear. The wire is discretized along its length, and the equation is solved numerically by use of an iterative algorithm that utilizes a multidimensional version of the Newton-Raphson method.

Border, James↗

Reducing Earth Topography Resolution for SMAP Mission Ground Tracks Using K-Means Clustering

The K-means clustering algorithm is used to reduce Earth topography resolution for the SMAP mission ground tracks. As SMAP propagates in orbit, knowledge of the radar antenna footprints on Earth is required for the antenna misalignment calibration. Each antenna footprint contains a latitude and longitude location pair on the Earth surface. There are 400 pairs in one data set for the calibration model. It is computationally expensive to calculate corresponding Earth elevation for these data pairs. Thus, the antenna footprint resolution is reduced. Similar topographical data pairs are grouped together with the K-means clustering algorithm. The resolution is reduced to the mean of each topographical cluster called the cluster centroid. The corresponding Earth elevation for each cluster centroid is assigned to the entire group. Results show that 400 data points are reduced to 60 while still maintaining algorithm performance and computational efficiency. In this work, sensitivity analysis is also performed to show a trade-off between algorithm performance versus computational efficiency as the number of cluster centroids and algorithm iterations are increased.

ground tracks↗

Numerical Modeling of Pressurization of Cryogenic Propellant Tank for Integrated Vehicle Fluid System

This paper presents a numerical model of pressurization of a cryogenic propellant tank for the Integrated Vehicle Fluid (IVF) system using the Generalized Fluid System Simulation Program (GFSSP). The IVF propulsion system, being developed by United Launch Alliance, uses boiloff propellants to drive thrusters for the reaction control system as well as to run internal combustion engines to develop power and drive compressors to pressurize propellant tanks. NASA Marshall Space Flight Center (MSFC) has been running tests to verify the functioning of the IVF system using a flight tank. GFSSP, a finite volume based flow network analysis software developed at MSFC, has been used to develop an integrated model of the tank and the pressurization system. This paper presents an iterative algorithm for converging the interface boundary conditions between different component models of a large system model. The model results have been compared with test data.

Majumdar, Alok K.↗

Spectral Confusion for Cosmological Surveys of Redshifted C II Emission

Far-infrared cooling lines are ubiquitous features in the spectra of star-forming galaxies. Surveys of redshifted fine-structure lines provide a promising new tool to study structure formation and galactic evolution at redshifts including the epoch of reionization as well as the peak of star formation. Unlike neutral hydrogen surveys, where the 21 cm line is the only bright line, surveys of redshifted fine-structure lines suffer from confusion generated by line broadening, spectral overlap of different lines, and the crowding of sources with redshift. We use simulations to investigate the resulting spectral confusion and derive observing parameters to minimize these effects in pencilbeam surveys of redshifted far-IR line emission. We generate simulated spectra of the 17 brightest far-IR lines in galaxies, covering the 150-1300 μm wavelength region corresponding to redshifts 0 < z < 7, and develop a simple iterative algorithm that successfully identifies the 158 μm [C II] line and other lines. Although the [C II] line is a principal coolant for the interstellar medium, the assumption that the brightest observed lines in a given line of sight are always [C II] lines is a poor approximation to the simulated spectra once other lines are included. Blind line identification requires detection of fainter companion lines from the same host galaxies, driving survey sensitivity requirements. The observations require moderate spectral resolution 700 < R < 4000 with angular resolution between 20″ and 10′, sufficiently narrow to minimize confusion yet sufficiently large to include a statistically meaningful number of sources.

galactic evolution at redshifts↗

Formulation and Implementation of Inflow/Outflow Boundary Conditions to Simulate Propulsive Effects

Boundary conditions appropriate for simulating flow entering or exiting the computational domain to mimic propulsion effects have been implemented in an adaptive Cartesian simulation package. A robust iterative algorithm to control mass flow rate through an outflow boundary surface is presented, along with a formulation to explicitly specify mass flow rate through an inflow boundary surface. The boundary conditions have been applied within a mesh adaptation framework based on the method of adjoint-weighted residuals. This allows for proper adaptive mesh refinement when modeling propulsion systems. The new boundary conditions are demonstrated on several notional propulsion systems operating in flow regimes ranging from low subsonic to hypersonic. The examples show that the prescribed boundary state is more properly imposed as the mesh is refined. The mass-flowrate steering algorithm is shown to be an efficient approach in each example. To demonstrate the boundary conditions on a realistic complex aircraft geometry, two of the new boundary conditions are also applied to a modern low-boom supersonic demonstrator design with multiple flow inlets and outlets.

Boundary↗

A Trilateration Scheme for Relative Positioning

We introduce a trilateration scheme that evaluates the 3-dimensional (3-D) relative position between a reference spacecraft and a target spacecraft using raw-range measurements from a distance baseline of known locations, which we call “anchors”. The anchors can be antennas of a ground-based network (e.g., Deep Space Network (DSN) or Near Earth Network (NEN) stations), or satellites of a spacebased network (e.g., global positioning system (GPS) or tracking and data relay satellite (TDRS)). We define raw-range as the range that includes all the systematic errors that occur during range measurements. A unique feature of this approach is that accurate relative position is derived from a “differencing function” of raw-range measurements of the reference spacecraft and target spacecraft, thereby eliminating most of the systematic errors, such as media effects, ephemeris errors, instrument delays, clock bias, etc. There can be an arbitrary number of target spacecraft, and relative positioning of target spacecraft with respect to the reference spacecraft can be done simultaneously. In this paper, we first assume an idealized system in which clocks on the reference and target spacecraft are synchronized, with clocks of the anchors synchronized as well. We develop a novel iterative algorithm that computes the relative position of the target spacecraft with respect to the reference spacecraft. We illustrate the relative positioning method using the scenario of a network of three ground stations (i.e., the anchors) at Goldstone, California, USA, Madrid, Spain, and Marlargue, Argentina tracking two spacecraft at geosynchronous orbit distance. We demonstrate that the algorithm converges to submeter accuracy in estimating the relative position, in the presence of random errors and systematic errors in raw-range measurements, and in the presence of angular errors in estimating the pointing vectors between the anchors and the reference spacecraft. Next, we relax the requirement of perfect time synchronization between spacecraft, and show that by using an additional anchor, one can estimate and remove the clock biases between the reference and target spacecraft. We add a ground station at Kourou to the above example of three ground stations of Goldstone, Madrid, and Marlargue, and demonstrate that the updated algorithm also converges to meter-level accuracy (submeter in some cases) in the presence of clock biases in addition to the random errors, systematic errors, and angular errors as shown in the above case. We compare this scheme with a similar trilateration scheme for relative positioning scheme first proposed by Montenbruck in 2002.

Cheung, Kar-Ming↗

Affine Generalized Inverse for Optimal Control Allocation

This research is a follow on to the "Optimal Control Prediction Method for Control Allocation" paper in which the Prediction Method iterative algorithm was introduced. Previously, the Prediction Method was shown to provide optimal control allocation solutions over the entire Attainable Moment Set for the Moore-Penrose and the generalized (weighted) inverse. As an extension to the Prediction Method, this paper introduces a family of Moore Penrose Affine Generalized Inverses, applicable for all moments, which compute control allocation solutions using a constant matrix and fixed null-space vector. The Moore-Penrose Affine Generalized Inverse is proven to yield equivalent solutions to those of the Prediction Method and therefore is guaranteed to yield Moore-Penrose optimal control allocation solutions. While the Prediction Method is applicable for any moment along an a priori specified moment direction, the Affine Generalized Inverse is shown to yield optimal control allocation solutions in a neighborhood of the given moment which is not restricted to a specified moment direction. Furthermore, the Affine Generalized Inverse is shown to provide the time derivative of optimal control allocation solutions and to facilitate maintaining solutions within control effector rate limitations. The Moore-Penrose Affine Generalized Inverse is broadened to encompass any arbitrary (weighted) Affine Generalized Inverse. Finally, a method of creating a moment lookup table is outlined to utilize the Affine Generalized Inverse as an offline control allocation solution for all moments in the Attainable Moment Set.

Acheson, Michael J.↗

An Active Subspace Method for Accelerating Convergence in Delaunay-Based Optimization via Dimension Reduction

Delaunay-based derivative-free optimization, ∆DOGS, is an efficient and provably-convergent global optimization method for the problems which has computationally expensive objection function and the analytical expression for the objective function is not available. ∆-DOGS is a novel optimization scheme in the family of response surface methods (RSMs); however, it suffers from the curse of dimensionality since the computational cost increases dramatically as the number of design parameters increases. As a result, the number of design parameters in ∆-DOGS algorithm is relatively low (n.10). To avoid such problems, this paper proposes a combination of derivative-free optimization, seeking the global minimizer of an expensive and nonconvex objective function f(x) and active subspace method, detecting the directions of the most variability using evaluations of the gradient. The contribution of other directions to the objective function is bounded by a sufficiently small constant. This new algorithm iteratively applied Delaunay-based derivative-free optimization to seek the minimizer on the d-dimensional active subspace that has most function variation. Inverse mapping is needed to project data from active subspace to full-model for evaluating function values. This task is overcome by solving an inequality constrained problem that curves the response surface of the objective function. The test results show that this strategy is effective on a handful of optimization problems.

Bewley, Thomas R.↗