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.

SourceResearch connectionFrom yearThrough year

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

At least 433 records · Page 24

All sources NASA NTRS DOE OSTI

NASA NTRS1985

PISCES: An environment for parallel scientific computation

The parallel implementation of scientific computing environment (PISCES) is a project to provide high-level programming environments for parallel MIMD computers. Pisces 1, the first of these environments, is a FORTRAN 77 based environment which runs under the UNIX operating system. The Pisces 1 user programs in Pisces FORTRAN, an extension of FORTRAN 77 for parallel processing. The major emphasis in the Pisces 1 design is in providing a carefully specified virtual machine that defines the run-time environment within which Pisces FORTRAN programs are executed. Each implementation then provides the same virtual machine, regardless of differences in the underlying architecture. The design is intended to be portable to a variety of architectures. Currently Pisces 1 is implemented on a network of Apollo workstations and on a DEC VAX uniprocessor via simulation of the task level parallelism. An implementation for the Flexible Computing Corp. FLEX/32 is under construction. An introduction to the Pisces 1 virtual computer and the FORTRAN 77 extensions is presented. An example of an algorithm for the iterative solution of a system of equations is given. The most notable features of the design are the provision for several granularities of parallelism in programs and the provision of a window mechanism for distributed access to large arrays of data.

Pratt, T. W.↗

NASA NTRS1983

A fast approach to identification using deconvolution

In this paper, we propose a fast approach to impulse response and noise-variance identification for a finite-order, linear, time-invariant, single-input/single-output system, whose input driving noise is white (stationary or nonstationary) and measurement noise is stationary, white and Gaussian. Our algorithm is an iterative block component method that includes two stages, deconvolution and prediction-error identification. Experiences with our method indicate that it works well and saves about an order of magnitude in computation. Analyses and examples are given in this paper to support this claim.

Chi, C.-Y.↗

NASA NTRS1988

A Generalized Method for Automatic Downhand and Wirefeed Control of a Welding Robot and Positioner

A generalized method for controlling a six degree-of-freedom (DOF) robot and a two DOF positioner used for arc welding operations is described. The welding path is defined in the part reference frame, and robot/positioner joint angles of the equivalent eight DOF serial linkage are determined via an iterative solution. Three algorithms are presented: the first solution controls motion of the eight DOF mechanism such that proper torch motion is achieved while minimizing the sum-of-squares of joint displacements; the second algorithm adds two constraint equations to achieve torch control while maintaining part orientation so that welding occurs in the downhand position; and the third algorithm adds the ability to control the proper orientation of a wire feed mechanism used in gas tungsten arc (GTA) welding operations. A verification of these algorithms is given using ROBOSIM, a NASA developed computer graphic simulation software package design for robot systems development.

Fernandez, Ken↗

NASA NTRS1987

Design of transonic airfoils and wings using a hybrid design algorithm

A method has been developed for designing airfoils and wings at transonic speeds. It utilizes a hybrid design algorithm in an iterative predictor/corrector approach, alternating between analysis code and a design module. This method has been successfully applied to a variety of airfoil and wing design problems, including both transport and highly-swept fighter wing configurations. An efficient approach to viscous airfoild design and the effect of including static aeroelastic deflections in the wing design process are also illustrated.

Campbell, Richard L.↗

NASA NTRS1988

Image segmentation by iterative parallel region growing with application to data compression and image analysis

Image segmentation can be a key step in data compression and image analysis. However, the segmentation results produced by most previous approaches to region growing are suspect because they depend on the order in which portions of the image are processed. An iterative parallel segmentation algorithm avoids this problem by performing globally best merges first. Such a segmentation approach, and two implementations of the approach on NASA's Massively Parallel Processor (MPP) are described. Application of the segmentation approach to data compression and image analysis is then described, and results of such application are given for a LANDSAT Thematic Mapper image.

Tilton, James C.↗

NASA NTRS1989

Least squares restoration of multi-channel images

In this paper, a least squares filter for the restoration of multichannel imagery is presented. The restoration filter is based on a linear, space-invariant imaging model and makes use of an iterative matrix inversion algorithm. The restoration utilizes both within-channel (spatial) and cross-channel information as constraints. Experiments using color images (three-channel imagery with red, green, and blue components) were performed to evaluate the filter's performance and to compare it with other monochrome and multichannel filters.

Chin, Roland T.↗

NASA NTRS1991

Transonic adaptive flutter suppression using approximate unsteady time domain aerodynamics

A digital adaptive controller is applied to the active flutter suppression problem of a wing under time varying flight conditions in subsonic and transonic flow. Linear quadratic controller gain at each time step is obtained using an iterative Riccati solver. The digital adaptive optimal controller is robust with respect to the unknown external loads. Flutter and divergence instabilities are simultaneously suppressed using a trailing-edge control surface and displacement sensing. A new transonic unsteady aerodynamic approximation methodology is developed which enables one to carry out the rapid calculation required for transonic aeroservoelastic applications. This approximation is based on a combination of unsteady subsonic aerodynamics combined with a transonic correction procedure. Aeroservoelastic transient time response is obtained using Roger's approximation, state transition matrices and an iterative time marching algorithm. The aeroservoelastic system in the time domain is modeled using a deterministic ARMA model together with a parameter estimator. Transonic flutter boundaries of a wing structure are computed, in the time domain, using an estimated aeroelastic system matrix and are in good agreement with experimental data for the low transonic Mach number range.

Pak, Chan-Gi↗

NASA NTRS1993

Sand transport on Mars: Preliminary results from models

Most studies of active aeolian processes on Mars have focused on dust, i.e., particles approximately 1 micron in diameter that are transported in suspension by wind. The presence of sand dunes on Mars indicates that larger grains (approximately greater than 60 microns, transported primarily in saltation) are also present. Although indirect evidence suggests that some dunes may be active, definitive evidence is lacking. Nonetheless, numerous studies demonstrate that sand is substantially easier to transport by wind than dust, and it is reasonable to infer that sand transportation in saltation occurs under present Martian conditions. In order to assess potential source regions, transportation pathways, and sites of deposition for sand on Mars, an iterative sand transport algorithm was developed that is based on the Mars General Circulation Model of Pollack et al. The results of the dust transport model are then compared with observed surface features, such as dune field locations observed on images, and surficial deposits as inferred from Viking IRTM observations. Preliminary results suggest that the north polar dune fields in the vicinity of 270 degrees W, 70 degrees N originated from weathered polar layered plains centered at 280 degrees W, 85 degrees N, and that Thaumasia Fossae, southern Hellas Planitia, and the area west of Hellespontus Montes are sand depositional sites. Examples of transportation 'corridors' include a westward pathway in the latitudinal band 35 degrees N to 45 degrees N, and a pathway southward from Solis Planum to Thaumasia Fossae, among others.

Greeley, R.↗

NASA NTRS1993

A global approach to kinematic path planning to robots with holonomic and nonholonomic constraints

Robots in applications may be subject to holonomic or nonholonomic constraints. Examples of holonomic constraints include a manipulator constrained through the contact with the environment, e.g., inserting a part, turning a crank, etc., and multiple manipulators constrained through a common payload. Examples of nonholonomic constraints include no-slip constraints on mobile robot wheels, local normal rotation constraints for soft finger and rolling contacts in grasping, and conservation of angular momentum of in-orbit space robots. The above examples all involve equality constraints; in applications, there are usually additional inequality constraints such as robot joint limits, self collision and environment collision avoidance constraints, steering angle constraints in mobile robots, etc. The problem of finding a kinematically feasible path that satisfies a given set of holonomic and nonholonomic constraints, of both equality and inequality types is addressed. The path planning problem is first posed as a finite time nonlinear control problem. This problem is subsequently transformed to a static root finding problem in an augmented space which can then be iteratively solved. The algorithm has shown promising results in planning feasible paths for redundant arms satisfying Cartesian path following and goal endpoint specifications, and mobile vehicles with multiple trailers. In contrast to local approaches, this algorithm is less prone to problems such as singularities and local minima.

Divelbiss, Adam↗

NASA NTRS1996

Research in Computational Aeroscience Applications Implemented on Advanced Parallel Computing Systems

Improving the numerical linear algebra routines for use in new Navier-Stokes codes, specifically Tim Barth's unstructured grid code, with spin-offs to TRANAIR is reported. A fast distance calculation routine for Navier-Stokes codes using the new one-equation turbulence models is written. The primary focus of this work was devoted to improving matrix-iterative methods. New algorithms have been developed which activate the full potential of classical Cray-class computers as well as distributed-memory parallel computers.

Wigton, Larry↗

NASA NTRS2002

Cerebral blood flow velocity declines before arterial pressure in patients with orthostatic vasovagal presyncope

OBJECTIVES: We studied hemodynamic changes leading to orthostatic vasovagal presyncope to determine whether changes of cerebral artery blood flow velocity precede or follow reductions of arterial pressure. BACKGROUND: Some evidence suggests that disordered cerebral autoregulation contributes to the occurrence of orthostatic vasovagal syncope. We studied cerebral hemodynamics with transcranial Doppler recordings, and we closely examined the temporal sequence of changes of cerebral artery blood flow velocity and systemic arterial pressure in 15 patients who did or did not faint during passive 70 degrees head-up tilt. METHODS: We recorded photoplethysmographic arterial pressure, RR intervals (electrocardiogram) and middle cerebral artery blood flow velocities (mean, total, mean/RR interval; Gosling's pulsatility index; and cerebrovascular resistance [mean cerebral velocity/mean arterial pressure, MAP]). RESULTS: Eight men developed presyncope, and six men and one woman did not. Presyncopal patients reported light-headedness, diaphoresis, or a sensation of fatigue 155 s (range: 25 to 414 s) before any cerebral or systemic hemodynamic change. Average cerebral blood flow velocity (CBFV) changes (defined by an iterative linear regression algorithm) began 67 s (range: 9 to 198 s) before reductions of MAP. Cerebral and systemic hemodynamic measurements remained constant in nonsyncopal patients. CONCLUSIONS: Presyncopal symptoms and CBFV changes precede arterial pressure reductions in patients with orthostatic vasovagal syncope. Therefore, changes of cerebrovascular regulation may contribute to the occurrence of vasovagal reactions.

Non-NASA Center↗

NASA NTRS2006

Development of Comprehensive Reduced Kinetic Models for Supersonic Reacting Shear Layer Simulations

Large-scale simulations of multi-dimensional unsteady turbulent reacting flows with detailed chemistry and transport can be computationally extremely intensive even on distributed computing architectures. With the development of suitable reduced chemical kinetic models, the number of scalar variables to be integrated can be decreased, leading to a significant reduction in the computational time required for the simulation with limited loss of accuracy in the results. A general MATLAB-based automated mechanism reduction procedure is presented to reduce any complex starting mechanism (detailed or skeletal) with minimal human intervention. Based on the application of the quasi steady-state (QSS) approximation for certain chemical species and on the elimination of the fast reaction rates in the mechanism, several comprehensive reduced models, capable of handling different fuels such as C2H4, CH4 and H2, have been developed and thoroughly tested for several combustion problems (ignition, propagation and extinction) and physical conditions (reactant compositions, temperatures, and pressures). A key feature of the present reduction procedure is the explicit solution of the concentrations of the QSS species, needed for the evaluation of the elementary reaction rates. In contrast, previous approaches relied on an implicit solution due to the strong coupling between QSS species, requiring computationally expensive inner iterations. A novel algorithm, based on the definition of a QSS species coupling matrix, is presented to (i) introduce appropriate truncations to the QSS algebraic relations and (ii) identify the optimal sequence for the explicit solution of the concentration of the QSS species. With the automatic generation of the relevant source code, the resulting reduced models can be readily implemented into numerical codes.

Zambon, A. C.↗

NASA NTRS2011

Efficient Kriging Algorithms

More efficient versions of an interpolation method, called kriging, have been introduced in order to reduce its traditionally high computational cost. Written in C++, these approaches were tested on both synthetic and real data. Kriging is a best unbiased linear estimator and suitable for interpolation of scattered data points. Kriging has long been used in the geostatistic and mining communities, but is now being researched for use in the image fusion of remotely sensed data. This allows a combination of data from various locations to be used to fill in any missing data from any single location. To arrive at the faster algorithms, sparse SYMMLQ iterative solver, covariance tapering, Fast Multipole Methods (FMM), and nearest neighbor searching techniques were used. These implementations were used when the coefficient matrix in the linear system is symmetric, but not necessarily positive-definite.

Memarsadeghi, Nargess↗

NASA NTRS2005

Algorithm for Identifying Erroneous Rain-Gauge Readings

An algorithm analyzes rain-gauge data to identify statistical outliers that could be deemed to be erroneous readings. Heretofore, analyses of this type have been performed in burdensome manual procedures that have involved subjective judgements. Sometimes, the analyses have included computational assistance for detecting values falling outside of arbitrary limits. The analyses have been performed without statistically valid knowledge of the spatial and temporal variations of precipitation within rain events. In contrast, the present algorithm makes it possible to automate such an analysis, makes the analysis objective, takes account of the spatial distribution of rain gauges in conjunction with the statistical nature of spatial variations in rainfall readings, and minimizes the use of arbitrary criteria. The algorithm implements an iterative process that involves nonparametric statistics.

Rickman, Doug↗

NASA NTRS2018

An Innovative Control Allocation Scheme to Address Reaction Thruster Interactions on a 3U CubeSat

A wealth of literature exists on control allocation algorithms for over-actuated air vehicles, launch vehicles, and spacecraft's. Most of these algorithms focus primarily on minimizing some objective function such as command tracking error and/or control effector usage. Linear allocators (pseudo inverses) are usually the conventional choice due to their simplicity and the ability to achieve a significant portion of the theoretical moment/impulse space. Generally, it is assumed that there exists minimal interaction effects between control effectors. In fact, very few studies address the problem of control effector interactions in the context of control allocation, especially for small spacecraft's with a reaction control system (RCS). This paper presents a CubeSat RCS design with a four thruster tetrahedral layout such that when two or more thrusters re, the resultant impulse differs noticeably compared to the sum of the contributions from individual thruster rings. This undesirable effect is caused by the design of the propellant tank and regulator. To mitigate this issue, an innovative modified pseudo inverse (MPI) control allocation algorithm was developed that adjusts the pseudo inverse solution based on test data. The algorithm is iteration-free and superior to the standard pseudo inverse in minimizing the command tracking error.

Pei, Jing↗

NASA NTRS2019

Terrestrial Single-Station Analog for Constraining the Martian Core and Deep Interior: Implications for InSight

We used a terrestrial single-station seismometer to quantify the uncertainty of InSight (INterior explorations using Seismic Investigations, Geodesy and Heat Transport) data for determining Martian core size. To mimic Martian seismicity, we formed a catalog using 917 terrestrial earthquakes, from which we randomly selected events. We stacked ScS amplitudes on modeled arrival times and searched for where ScS produced coherent seismic amplitudes. A core detection was defined by a coherent peak with small offset between predicted and user-selected arrival times. Iterating the detection algorithm with varying signal-to-noise (SNR) ranges and quantity of events determined the selection frequency of each model and quantified core depth uncertainty. Increasing the quantity of events reduced core depth uncertainty while increasing the recovery rate, while increasing event SNR had little effect. Including ScS2 multiples increased the recovery rate and reduced core depth uncertainty when we used low quantities of events. The most-frequent core depths varied by back azimuth, suggesting our method is sensitive to the presence of mantle heterogeneities. When we added 1° in source distance errors, core depth uncertainty increased by up to 11 km and recovery rates decreased by <5%. Altering epicentral distances by 25% added ~35 km of uncertainty and reduced recovery rates to <50% in some cases. From these experiments, we estimate that if InSight can detect five events with high location precision (<10% epicentral distance errors), that there is at least an 88% chance of core depth recovery using ScS alone with uncertainty in core depth approaching 18 km and decreasing as more events are located.

Marusiak, Angela G.↗

NASA NTRS2019

Terrestrial Single-Station Analog for Constraining the Martian Core and Deep Interior: Implications for InSight

We used a terrestrial single-station seismometer to quantify the uncertainty of InSight (INterior explorations using Seismic Investigations, Geodesy and Heat Transport) data for determining Martian core size. To mimic Martian seismicity, we formed a catalog using 917 terrestrial earthquakes, from which we randomly selected events. We stacked ScS amplitudes on modeled arrival times and searched for where ScS produced coherent seismic amplitudes. A core detection was defined by a coherent peak with small offset between predicted and user-selected arrival times. Iterating the detection algorithm with varying signal-to-noise (SNR) ranges and quantity of events determined the selection frequency of each model and quantified core depth uncertainty. Increasing the quantity of events reduced core depth uncertainty while increasing the recovery rate, while increasing event SNR had little effect. Including ScS2 multiples increased the recovery rate and reduced core depth uncertainty when we used low quantities of events. The most-frequent core depths varied by back azimuth, suggesting our method is sensitive to the presence of mantle heterogeneities. When we added 1° in source distance errors, core depth uncertainty increased by up to 11 km and recovery rates decreased by <5%. Altering epicentral distances by 25% added ~35 km of uncertainty and reduced recovery rates to <50% in some cases. From these experiments, we estimate that if InSight can detect five events with high location precision (< 10% epicentral distance errors), that there is at least an 88% chance of core depth recovery using ScS alone with uncertainty in core depth approaching 18 km and decreasing as more events are located.

Angela G Marusiak↗

DOE OSTI2021

Market-based Co-optimization of Energy and Ancillary Services with Distributed Energy Resource Flexibilities

Energy storage systems and flexible loads have attracted significant interests due to their capabilities to provide various grid services. In this paper, the flexibilities are optimally allocated among multiple distributed energy resource aggregators with energy storage systems and flexible buildings by the utility coordinator through market-based co-optimization. An iterative market clearing algorithm is developed to determine the optimal energy and ancillary service prices, with consideration of both local dynamics and network constraints. Simulation results demonstrate the effectiveness of the proposed algorithm and the benefits of co-optimizing the energy and ancillary service markets.

Ma, Ke↗