Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 1,135 records · Page 63

Partitioning sparse matrices with eigenvectors of graphs

The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.

Pothen, Alex↗

Methodology for Time-Domain Estimation of Storm Time Geoelectric Fields Using the 3-D Magnetotelluric Response Tensors

Geoelectric fields at the Earth's surface caused by magnetic storms constitute a hazard to the operation of electric power grids and related infrastructure. The ability to estimate these geoelectric fields in close to real time and provide local predictions would better equip the industry to mitigate negative impacts on their operations. Here we report progress toward this goal: development of robust algorithms that convolve a magnetic storm time series with a frequency domain impedance for a realistic three-dimensional (3-D) Earth, to estimate the local, storm time geoelectric field. Both frequency domain and time domain approaches are presented and validated against storm time geoelectric field data measured in Japan. The methods are then compared in the context of a real-time application.

Kelbert, Anna↗

Parallel Processing of Broad-Band PPM Signals

A parallel-processing algorithm and a hardware architecture to implement the algorithm have been devised for timeslot synchronization in the reception of pulse-position-modulated (PPM) optical or radio signals. As in the cases of some prior algorithms and architectures for parallel, discrete-time, digital processing of signals other than PPM, an incoming broadband signal is divided into multiple parallel narrower-band signals by means of sub-sampling and filtering. The number of parallel streams is chosen so that the frequency content of the narrower-band signals is low enough to enable processing by relatively-low speed complementary metal oxide semiconductor (CMOS) electronic circuitry. The algorithm and architecture are intended to satisfy requirements for time-varying time-slot synchronization and post-detection filtering, with correction of timing errors independent of estimation of timing errors. They are also intended to afford flexibility for dynamic reconfiguration and upgrading. The architecture is implemented in a reconfigurable CMOS processor in the form of a field-programmable gate array. The algorithm and its hardware implementation incorporate three separate time-varying filter banks for three distinct functions: correction of sub-sample timing errors, post-detection filtering, and post-detection estimation of timing errors. The design of the filter bank for correction of timing errors, the method of estimating timing errors, and the design of a feedback-loop filter are governed by a host of parameters, the most critical one, with regard to processing very broadband signals with CMOS hardware, being the number of parallel streams (equivalently, the rate-reduction parameter).

Gray, Andrew↗

A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems

An algorithm is proposed for a scheme of simultaneous coordinate relaxation. A variant of root-shifting coordinate relaxation, this procedure consists of iterating several vectors at the same time, instead of one at a time. Results of application of the algorithm to test matrices are discussed. For many matrix eigenvalue problems for which coordinate relaxation is a viable approach, the present algorithm is more effective than previous implementations of coordinate relaxation. Total central processor operations should be decreased due to significantly improved convergence.

Raffenetti, R. C.↗

A discrete momentum-conserving explicit algorithm for rigid body dynamics analysis

A discrete momentum-conserving explicit time integration is presented. The accurate feature and simplicity of the present algorithm are realized by a mid-point implicit formula for integrating the Euler parameters and a second-order discrete momentum-conserving form of the central difference algorithm, respectively. The accuracy and robustness of the algorithm is demonstrated by example problems which exhibit large overall rigid motions under holonomic constraints.

Park, K. C.↗

A multi-satellite orbit determination problem in a parallel processing environment

The Engineering Orbit Analysis Unit at GE Valley Forge used an Intel Hypercube Parallel Processor to investigate the performance and gain experience of parallel processors with a multi-satellite orbit determination problem. A general study was selected in which major blocks of computation for the multi-satellite orbit computations were used as units to be assigned to the various processors on the Hypercube. Problems encountered or successes achieved in addressing the orbit determination problem would be more likely to be transferable to other parallel processors. The prime objective was to study the algorithm to allow processing of observations later in time than those employed in the state update. Expertise in ephemeris determination was exploited in addressing these problems and the facility used to bring a realism to the study which would highlight the problems which may not otherwise be anticipated. Secondary objectives were to gain experience of a non-trivial problem in a parallel processor environment, to explore the necessary interplay of serial and parallel sections of the algorithm in terms of timing studies, to explore the granularity (coarse vs. fine grain) to discover the granularity limit above which there would be a risk of starvation where the majority of nodes would be idle or under the limit where the overhead associated with splitting the problem may require more work and communication time than is useful.

Deakyne, M. S.↗

Accuracy Assessment of Aqua-MODIS Aerosol Optical Depth Over Coastal Regions: Importance of Quality Flag and Sea Surface Wind Speed

Coastal regions around the globe are a major source for anthropogenic aerosols in the atmosphere, but the underlying surface characteristics are not favorable for the Moderate Resolution Imaging Spectroradiometer (MODIS) algorithms designed for retrieval of aerosols over dark land or open-ocean surfaces. Using data collected from 62 coastal stations worldwide from the Aerosol Robotic Network (AERONET) from approximately 2002-2010, accuracy assessments are made for coastal aerosol optical depth (AOD) retrieved from MODIS aboard Aqua satellite. It is found that coastal AODs (at 550 nm) characterized respectively by the MODIS Dark Land (hereafter Land) surface algorithm, the Open-Ocean (hereafter Ocean) algorithm, and AERONET all exhibit a log-normal distribution. After filtering by quality flags, the MODIS AODs respectively retrieved from the Land and Ocean algorithms are highly correlated with AERONET (with R(sup 2) is approximately equal to 0.8), but only the Land algorithm AODs fall within the expected error envelope greater than 66% of the time. Furthermore, the MODIS AODs from the Land algorithm, Ocean algorithm, and combined Land and Ocean product show statistically significant discrepancies from their respective counterparts from AERONET in terms of mean, probability density function, and cumulative density function, which suggest a need for future improvement in retrieval algorithms. Without filtering with quality flag, the MODIS Land and Ocean AOD dataset can be degraded by 30-50% in terms of mean bias. Overall, the MODIS Ocean algorithm overestimates the AERONET coastal AOD by 0.021 for AOD less than 0.25 and underestimates it by 0.029 for AOD greater than 0.25. This dichotomy is shown to be related to the ocean surface wind speed and cloud contamination effects on the satellite aerosol retrieval. The Modern Era Retrospective-Analysis for Research and Applications (MERRA) reveals that wind speeds over the global coastal region 25 (with a mean and median value of 2.94 meters per second and 2.66 meters per second, respectively) are often slower than 6 meters per second assumed in the MODIS Ocean algorithm. As a result of high correlation (R(sup 2) greater than 0.98) between the bias in binned MODIS AOD and the corresponding binned wind speed over the coastal sea surface, an empirical scheme for correcting the bias of AOD retrieved from the MODIS Ocean algorithm is formulated and is shown to be effective over the majority of the coastal AERONET stations, and hence can be used in future analysis of AOD trend and MODIS AOD data assimilation.

Anderson, J. C.↗

Goddard Enhanced Onboard Navigation System (GEONS) Mathematical Specifications

The National Aeronautics and Space Administration (NASA) Goddard Space Flight Center (GSFC) has developed the capability to provide high-accuracy attitude, orbit, and time autonomously onboard NASA spacecraft. The GSFC Mission Engineering and Systems Analysis Division has implemented NASA-developed navigation algorithms for high-accuracy real-time onboard orbit determination in the Global Positioning System (GPS) Enhanced Orbit Determination (GEODE) flight software. The Goddard Enhanced Onboard Navigation System (GEONS) extends the capabilities of the GEODE flight software to include additional measurement types and additional navigation algorithms.

Anne C. Long↗

Integration of a Decentralized Linear-Quadratic-Gaussian Control into GSFC's Universal 3-D Autonomous Formation Flying Algorithm

A decentralized control is investigated for applicability to the autonomous formation flying control algorithm developed by GSFC for the New Millenium Program Earth Observer-1 (EO-1) mission. This decentralized framework has the following characteristics: The approach is non-hierarchical, and coordination by a central supervisor is not required; Detected failures degrade the system performance gracefully; Each node in the decentralized network processes only its own measurement data, in parallel with the other nodes; Although the total computational burden over the entire network is greater than it would be for a single, centralized controller, fewer computations are required locally at each node; Requirements for data transmission between nodes are limited to only the dimension of the control vector, at the cost of maintaining a local additional data vector. The data vector compresses all past measurement history from all the nodes into a single vector of the dimension of the state; and The approach is optimal with respect to standard cost functions. The current approach is valid for linear time-invariant systems only. Similar to the GSFC formation flying algorithm, the extension to linear LQG time-varying systems requires that each node propagate its filter covariance forward (navigation) and controller Riccati matrix backward (guidance) at each time step. Extension of the GSFC algorithm to non-linear systems can also be accomplished via linearization about a reference trajectory in the standard fashion, or linearization about the current state estimate as with the extended Kalman filter. To investigate the feasibility of the decentralized integration with the GSFC algorithm, an existing centralized LQG design for a single spacecraft orbit control problem is adapted to the decentralized framework while using the GSFC algorithm's state transition matrices and framework. The existing GSFC design uses both reference trajectories of each spacecraft in formation and by appropriate choice of coordinates and simplified measurement modeling is formulated as a linear time-invariant system. Results for improvements to the GSFC algorithm and a multiple satellite formation will be addressed. The goal of this investigation is to progressively relax the assumptions that result in linear time-invariance, ultimately to the point of linearization of the non-linear dynamics about the current state estimate as in the extended Kalman filter. An assessment will then be made about the feasibility of the decentralized approach to the realistic formation flying application of the EO-1/Landsat 7 formation flying experiment.

Folta, David C.↗

Parallel tridiagonal equation solvers

Three parallel algorithms were compared for the direct solution of tridiagonal linear systems of equations. The algorithms are suitable for computers such as ILLIAC 4 and CDC STAR. For array computers similar to ILLIAC 4, cyclic odd-even reduction has the least operation count for highly structured sets of equations, and recursive doubling has the least count for relatively unstructured sets of equations. Since the difference in operation counts for these two algorithms is not substantial, their relative running times may be more related to overhead operations, which are not measured in this paper. The third algorithm, based on Buneman's Poisson solver, has more arithmetic operations than the others, and appears to be the least favorable. For pipeline computers similar to CDC STAR, cyclic odd-even reduction appears to be the most preferable algorithm for all cases.

Stone, H. S.↗

Application of a ground based minicomputer system for real time, closed loop control of remotely piloted aircraft models used in stall/spin research

The paper describes a minicomputer-based, real-time closed loop remote control system at NASA Langley outdoor facility which is used to determine the stall/departure/spin characteristics of high-performance aircraft. The experiments are conducted with 15% dynamically scaled, unpowered models that are dropped from 3000 m and ground controlled. The effects of time delays and sampling rates on the stability of the control system and the selection of digital algorithms to meet frequency response and real time constraints are examined. Also described is the implementation of the modular software for the flexible programming of multi-axis control laws.

Montoya, R. J.↗

A Generalized Guidance Approach to In-Space Solid-Propellant Vehicle Maneuvers

Exploration-class vehicles that require fully autonomous ascent and descent must employ robust, explicit path-adaptive guidance algorithms that can operate in a wide range of physical environments. Vehicle designs that employ solid-propellant rocket motors (SRMs) for maneuvers are attractive from a systems engineering perspective because of their simplicity and reliability, but may cause complications for both mission designers and GNC engineers when dealing with total impulse uncertainty, as well as proper energy management of a motor with an uncontrolled cutoff time. This paper presents a simplified guidance algorithm, named Simple Cross-Product Steering (SxS), that was derived during early studies of NASA’s Mars Sample Return mission’s Mars Ascent Vehicle. The algorithm takes roots in a flight-proven guidance algorithm commonly referred to as Cross-Product Steering. SxS has been shown to provide sufficient guidance accuracy for in-space SRM burns in a simulated Martian environment, and preliminary studies have been conducted to test the algorithm in a solid-propellant lunar braking scenario. A method for predicting proper motor ignition time during execution of the Cross-Product Steering algorithm is the primary contribution of this paper. Mechanization notes are also provided that were realized in early phases of MAV. Results are shown for an example ascent vehicle in a simulated Mars environment.

GNC↗

A Generalized Guidance Approach to In-Space Solid-Propellant Vehicle Maneuvers

Exploration-class vehicles that require fully autonomous ascent and descent must employ robust, explicit path-adaptive guidance algorithms that can operate in a wide range of physical environments. Vehicle designs that employ solid-propellant rocket motors (SRMs) for maneuvers are attractive from a system engineering perspective because of their simplicity and reliability but may cause complications for both mission designers and GNC engineers when dealing with total impulse uncertainty, as well as proper energy management of a motor with an uncontrolled cutoff time. This paper presents a simplified guidance algorithm, named Simple Cross-Product Steering (SxS), that was derived during early studies of NASA’s Mars Sample Return mission’s Mars Ascent Vehicle. The algorithm takes roots in a flight-proven guidance algorithm commonly referred to as Cross-Product Steering. This algorithm has been shown to provide sufficient guidance accuracy for in-space SRM burns in a simulated Martian environment, and preliminary studies have been conducted to test the algorithm in a solid-propellant lunar braking scenario. A method for predicting proper motor ignition time during execution of the Cross-Product Steering algorithm is the primary contribution of this paper. Mechanization notes are also provided that were realized in early phases of MAV. Results are shown for an example ascent vehicle a simulated Mars environment.

Jason M Everett↗

Averaging analysis of adaptive control algorithms

The method of averaging is used to analyze discrete-time indirect adaptive control. The analysis focuses on various prediction-error-driven identification algorithms coupled with a general linear control law. The plant is not required to be in the model set of the identifier, which accounts for systems with unmodeled plant dynamics. Exogenous input signals including known command signals and unknown disturbances are also included. Both gradient and Newton-based algorithms are considered.

Phillips, Stephen M.↗

A curve fitting method for solving the flutter equation

A curve fitting approach was developed to solve the flutter equation for the critical flutter velocity. The psi versus nu curves are approximated by cubic and quadratic equations. The curve fitting technique utilized the first and second derivatives of psi with respect to nu. The method was tested for two structures, one structure being six times the total mass of the other structure. The algorithm never showed any tendency to diverge from the solution. The average time for the computation of a flutter velocity was 3.91 seconds on an IBM Model 50 computer for an accuracy of five per cent. For values of nu close to the critical root of the flutter equation the algorithm converged on the first attempt. The maximum number of iterations for convergence to the critical flutter velocity was five with an assumed value of nu relatively distant from the actual crossover.

Cooper, J. L.↗

Near-Real-Time Satellite Cloud Products for Icing Detection and Aviation Weather over the USA

A set of physically based retrieval algorithms has been developed to derive from multispectral satellite imagery a variety of cloud properties that can be used to diagnose icing conditions when upper-level clouds are absent. The algorithms are being applied in near-real time to the Geostationary Operational Environmental Satellite (GOES) data over Florida, the Southern Great Plains, and the midwestern USA. The products are available in image and digital formats on the world-wide web. The analysis system is being upgraded to analyze GOES data over the CONUS. Validation, 24-hour processing, and operational issues are discussed.

Minnis, Patrick↗

Low-thrust guidance study Final report

Computer algorithm to determine minimum-time optimal control for continuous low-thrust propulsion systems operating in inverse-square gravity field

GRAVITATIONAL FIELD↗

Recursive ideal observer detection of known M-ary signals in multiplicative and additive Gaussian noise.

This paper presents the derivation of the recursive algorithms necessary for real-time digital detection of M-ary known signals that are subject to independent multiplicative and additive Gaussian noises. The motivating application is minimum probability of error detection of digital data-link messages aboard civil aircraft in the earth reflection multipath environment. For each known signal, the detector contains one Kalman filter and one probability computer. The filters estimate the multipath disturbance. The estimates and the received signal drive the probability computers. Outputs of all the computers are compared in amplitude to give the signal decision. The practicality and usefulness of the detector are extensively discussed.

Painter, J. H.↗