Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithm Development”

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,477 records · Page 82

Comparison of Surface Radiation Budget Satellite algorithms for downwelled shortwave irradiance with Wisconsin Fire/SRB surface-truth data

Surface radiation instruments were operated at various locations during the Wisconsin First ISSCP (International Satellite Cloud Climatology Project) Regional Experiment (FIRE) and Surface Radiation Budget (SRB) experiment in October 1986. Satellite data were distributed to scientists who had previously developed satellite algorithms to estimate downwelled shortwave irradiance. Results of intercomparison of ground-truth values with the satellite-derived estimates are described.

Whitlock, C. H.↗

The use of random decrement technique for identification of structural modes of vibration

An algorithm is developed to obtain the free responses of a structure from its random responses due to some unknown or known random input or inputs, using the random-decrement technique without changing time correlation between signals. The algorithm is tested using random responses from a 'generalized payload' model and from the 'Space Shuttle' model. The resulting free responses are then used to identify the modal characteristics of the two systems.

Ibrahim, S. R.↗

Fast and stable recursive algorithms for continuous-time and discrete-time model conversions

Based on the Newton-Raphson method, this paper presents recursive algorithms that are rapidly convergent and more stable for modeling the equivalent continuous-time (discrete-time) model from the available discrete-time (continuous-time) model for a fixed sampling period. The newly developed recursive algorithms relax the constraints imposed upon the existing model conversion algorithms, and, thus, enhance the applications of microprocessors and associated microelectronics to digital control systems. A practical example is presented to demonstrate the effectiveness of the proposed procedures.

Shieh, L. S.↗

Machine learning for a Toolkit for Image Mining

A prototype user environment is described that enables a user with very limited computer skills to collaborate with a computer algorithm to develop search tools (agents) that can be used for image analysis, creating metadata for tagging images, searching for images in an image database on the basis of image content, or as a component of computer vision algorithms. Agents are learned in an ongoing, two-way dialogue between the user and the algorithm. The user points to mistakes made in classification. The algorithm, in response, attempts to discover which image attributes are discriminating between objects of interest and clutter. It then builds a candidate agent and applies it to an input image, producing an 'interest' image highlighting features that are consistent with the set of objects and clutter indicated by the user. The dialogue repeats until the user is satisfied. The prototype environment, called the Toolkit for Image Mining (TIM) is currently capable of learning spectral and textural patterns. Learning exhibits rapid convergence to reasonable levels of performance and, when thoroughly trained, Fo appears to be competitive in discrimination accuracy with other classification techniques.

Delanoy, Richard L.↗

Magellan Recorder Data Recovery Algorithms

This paper describes algorithms implemented by the Magellan High Rate Processor to recover radar data corrupted by the failure of an onboard tape recorder that dropped bits. For data with error correction coding, an algorithm was developed that decodes data in the presence of bit errors and missing bits.

Error↗

A Methodology for Determining Statistical Performance Compliance for Airborne Doppler Radar with Forward-Looking Turbulence Detection Capability

The objective of the research developed and presented in this document was to statistically assess turbulence hazard detection performance employing airborne pulse Doppler radar systems. The FAA certification methodology for forward looking airborne turbulence radars will require estimating the probabilities of missed and false hazard indications under operational conditions. Analytical approaches must be used due to the near impossibility of obtaining sufficient statistics experimentally. This report describes an end-to-end analytical technique for estimating these probabilities for Enhanced Turbulence (E-Turb) Radar systems under noise-limited conditions, for a variety of aircraft types, as defined in FAA TSO-C134. This technique provides for one means, but not the only means, by which an applicant can demonstrate compliance to the FAA directed ATDS Working Group performance requirements. Turbulence hazard algorithms were developed that derived predictive estimates of aircraft hazards from basic radar observables. These algorithms were designed to prevent false turbulence indications while accurately predicting areas of elevated turbulence risks to aircraft, passengers, and crew; and were successfully flight tested on a NASA B757-200 and a Delta Air Lines B737-800. Application of this defined methodology for calculating the probability of missed and false hazard indications taking into account the effect of the various algorithms used, is demonstrated for representative transport aircraft and radar performance characteristics.

Bowles, Roland L.↗

Periodic gravitational perturbations for conversion between osculating and mean orbit elements

Algorithms for converting between osculating and mean orbit elements are currently limited to computing the contribution due to the second zonal harmonic (J2). This paper presents an improved conversion algorithm that includes the effects of all zonal, sectorial and tesseral harmonics, second order J2, and third-body gravitational perturbations. Mean elements are useful for preliminary orbit and maneuver design; however, for more precise work, such as groundtrack targeting, osculating elements are required. This improved conversion algorithm was developed to meet accuracy requirements for the TOPEX/Poseidon mission; but, additional use can be considered for satellites orbiting planets like Venus that do not have a dominant J2. Results are presented from tests performed using the new algorithm with the planned TOPEX/Poseidon earth orbit as well as the Mars Observer and proposed circular Magellan (Venus) orbits.

Guinn, Joseph R.↗

Automated navigation assessment for earth survey sensors using island targets

An automated method has been developed for performing navigation assessment on satellite-based Earth sensor data. The method utilizes islands as targets which can be readily located in the sensor data and identified with reference locations. The essential elements are an algorithm for classifying the sensor data according to source, a reference catalog of island locations, and a robust pattern-matching algorithm for island identification. The algorithms were developed and tested for the Sea-viewing Wide Field-of-view Sensor (SeaWiFS), an ocean color sensor. This method will allow navigation error statistics to be automatically generated for large numbers of points, supporting analysis over large spatial and temporal ranges.

Patt, Frederick S.↗

An Automated Method for Navigation Assessment for Earth Survey Sensors Using Island Targets

An automated method has been developed for performing navigation assessment on satellite-based Earth sensor data. The method utilizes islands as targets which can be readily located in the sensor data and identified with reference locations. The essential elements are an algorithm for classifying the sensor data according to source, a reference catalogue of island locations, and a robust pattern-matching algorithm for island identification. The algorithms were developed and tested for the Sea-viewing Wide Field-of-view Sensor (SeaWiFS), an ocean colour sensor. This method will allow navigation error statistics to be automatically generated for large numbers of points, supporting analysis over large spatial and temporal ranges.

Patt, F. S.↗

A General Algorithm for Reusing Krylov Subspace Information. I. Unsteady Navier-Stokes

A general algorithm is developed that reuses available information to accelerate the iterative convergence of linear systems with multiple right-hand sides A x = b (sup i), which are commonly encountered in steady or unsteady simulations of nonlinear equations. The algorithm is based on the classical GMRES algorithm with eigenvector enrichment but also includes a Galerkin projection preprocessing step and several novel Krylov subspace reuse strategies. The new approach is applied to a set of test problems, including an unsteady turbulent airfoil, and is shown in some cases to provide significant improvement in computational efficiency relative to baseline approaches.

Carpenter, Mark H.↗

Three-Dimensional Imaging and Numerical Reconstruction of Graphite/Epoxy Composite Microstructure Based on Ultra-High Resolution X-Ray Computed Tomography

A combined experimental and computational study aimed at high-resolution 3D imaging, visualization, and numerical reconstruction of fiber-reinforced polymer microstructures at the fiber length scale is presented. To this end, a sample of graphite/epoxy composite was imaged at sub-micron resolution using a 3D X-ray computed tomography microscope. Next, a novel segmentation algorithm was developed, based on concepts adopted from computer vision and multi-target tracking, to detect and estimate, with high accuracy, the position of individual fibers in a volume of the imaged composite. In the current implementation, the segmentation algorithm was based on Global Nearest Neighbor data-association architecture, a Kalman filter estimator, and several novel algorithms for virtualfiber stitching, smoothing, and overlap removal. The segmentation algorithm was used on a sub-volume of the imaged composite, detecting 508 individual fibers. The segmentation data were qualitatively compared to the tomographic data, demonstrating high accuracy of the numerical reconstruction. Moreover, the data were used to quantify a) the relative distribution of individual-fiber cross sections within the imaged sub-volume, and b) the local fiber misorientation relative to the global fiber axis. Finally, the segmentation data were converted using commercially available finite element (FE) software to generate a detailed FE mesh of the composite volume. The methodology described herein demonstrates the feasibility of realizing an FE-based, virtual-testing framework for graphite/fiber composites at the constituent level.

Czabaj, M. W.↗

Developing IEEE Std 2800-Compliant Algorithms for Transmission-Connected Inverter-Based Resources

This study addresses the compliance of Inverter-based Resources (IBRs) with IEEE Standard 2800, a leading standard that defines interconnection and interoperability requirements for IBRs integrated into transmission systems. Focusing on abnormal grid scenarios, the research evaluates the specific demands on IBRs, proposing a controller development framework for abnormal grid conditions. This framework caters to maintaining ride-through operation in line with IEEE Std 2800, alongside managing currents during voltage ride-through scenarios. The effectiveness of this proposed controller frame-work is rigorously validated through case studies, employing a MATLAB/Simulink model of an IBR to test its performance under diverse grid fault conditions, ensuring the IBRs' alignment with standard requirements and their robust performance in enhancing grid reliability.

IEEE Std 2800↗

Developing IEEE Std 2800-Compliant Algorithms for Transmission-Connected Inverter-Based Resources

This study addresses the compliance of Inverter-based Resources (IBRs) with IEEE Standard 2800, a leading standard that defines interconnection and interoperability requirements for IBRs integrated into transmission systems. Focusing on abnormal grid scenarios, the research evaluates the specific demands on IBRs, proposing a controller development framework for abnormal grid conditions. This framework caters to maintaining ride-through operation in line with IEEE Std 2800, alongside managing currents during voltage ride-through scenarios. The effectiveness of this proposed controller framework is rigorously validated through case studies, employing a MATLAB/Simulink model of an IBR to test its performance under diverse grid fault conditions, ensuring the IBRs' alignment with standard requirements and their robust performance in enhancing grid reliability.

grid↗

Flux-split algorithms for the multi-dimensional Euler equations with real gases

Upwind algorithms are developed for the numerical solution of the multidimensional Euler equations for real gases. Flux-splitting methods are derived which account for a general equation of state. Approximations to the state equation based on physical arguments result in simplified algorithms which may be implemented into existing perfect-gas codes. Applications of the method to several high-Mach-number high-temperature flows are presented for two and three space dimensions.

Grossman, B.↗

Description of the computations and pilot procedures for planning fuel-conservative descents with a small programmable calculator

A simplified flight management descent algorithm was developed and programmed on a small programmable calculator. It was designed to aid the pilot in planning and executing a fuel conservative descent to arrive at a metering fix at a time designated by the air traffic control system. The algorithm may also be used for planning fuel conservative descents when time is not a consideration. The descent path was calculated for a constant Mach/airspeed schedule from linear approximations of airplane performance with considerations given for gross weight, wind, and nonstandard temperature effects. The flight management descent algorithm and the vertical performance modeling required for the DC-10 airplane is described.

Vicroy, D. D.↗

User's manual for a fuel-conservative descent planning algorithm implemented on a small programmable calculator

A simplified flight management descent algorithm was developed and programmed on a small programmable calculator. It was designed to aid the pilot in planning and executing a fuel conservative descent to arrive at a metering fix at a time designated by the air traffic control system. The algorithm may also be used for planning fuel conservative descents when time is not a consideration. The descent path was calculated for a constant Mach/airspeed schedule from linear approximations of airplane performance with considerations given for gross weight, wind, and nonstandard temperature effects. An explanation and examples of how the algorithm is used, as well as a detailed flow chart and listing of the algorithm are contained.

Vicroy, D. D.↗

On discrete inner-outer and spectral factorizations

Reliable algorithms are developed to perform inner-outer, coprime, and spectral factorizations for discrete FDLTI systems. It is shown that the discrete algebraic Riccati equation plays an important role in obtaining state-space representations for all key factorizations. The implementation of algorithms can be carried out efficiently using real matrix operations.

Chu, Cheng-Chih↗

Highly parallel sparse Cholesky factorization

Several fine grained parallel algorithms were developed and compared to compute the Cholesky factorization of a sparse matrix. The experimental implementations are on the Connection Machine, a distributed memory SIMD machine whose programming model conceptually supplies one processor per data element. In contrast to special purpose algorithms in which the matrix structure conforms to the connection structure of the machine, the focus is on matrices with arbitrary sparsity structure. The most promising algorithm is one whose inner loop performs several dense factorizations simultaneously on a 2-D grid of processors. Virtually any massively parallel dense factorization algorithm can be used as the key subroutine. The sparse code attains execution rates comparable to those of the dense subroutine. Although at present architectural limitations prevent the dense factorization from realizing its potential efficiency, it is concluded that a regular data parallel architecture can be used efficiently to solve arbitrarily structured sparse problems. A performance model is also presented and it is used to analyze the algorithms.

Gilbert, John R.↗