Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic efficiency”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

On the development of efficient algorithms for three dimensional fluid flow

The difficulties of constructing efficient algorithms for three-dimensional flow are discussed. Reasonable candidates are analyzed and tested, and most are found to have obvious shortcomings. Yet, there is promise that an efficient class of algorithms exist between the severely time-step sized-limited explicit or approximately factored algorithms and the computationally intensive direct inversion of large sparse matrices by Gaussian elimination.

Maccormack, R. W.↗
NASA NTRS1981

Efficient algorithms for single-axis attitude estimation

The computationally efficient algorithms determine attitude from the measurement of art lengths and dihedral angles. The dependence of these algorithms on the solution of trigonometric equations was reduced. Both single time and batch estimators are presented along with the covariance analysis of each algorithm.

Shuster, M. D.↗
NASA NTRS1988

An efficient algorithm for computing the crossovers in satellite altimetry

An efficient algorithm has been devised to compute the crossovers in satellite altimetry. The significance of the crossovers is twofold. First, they are needed to perform the crossover adjustment to remove the orbit error. Secondly, they yield important insight into oceanic variability. Nevertheless, there is no published algorithm to make this very time consuming task easier, which is the goal of this report. The success of the algorithm is predicated on the ability to predict (by analytical means) the crossover coordinates to within 6 km and 1 sec of the true values. Hence, only one interpolation/extrapolation step on the data is needed to derive the crossover coordinates in contrast to the many interpolation/extrapolation operations usually needed to arrive at the same accuracy level if deprived of this information.

Tai, Chang-Kou↗
NASA NTRS1989

An efficient algorithm for computing the crossovers in satellite altimetry

An efficient algorithm has been devised to compute the crossovers in satellite altimetry. The significance of the crossovers is twofold. First, they are needed to perform the crossover adjustment to remove the orbit error. Secondly, they yield important insight into oceanic variability. Nevertheless, there is no published algorithm to make this very time-consuming task easier, which is the goal of this report. The success of the algorithm is predicated on the ability to predict (by analytical means) the crossover coordinates to within 6 km and 1 sec of the true values. Hence, only one interpolation/extrapolation step on the data is needed to derive the crossover coordinates in contrast to the many interpolation/extrapolation operations usually needed to arrive at the same accuracy level if deprived of this information.

Tai, Chang-Kou↗
NASA NTRS1989

Computationally efficient algorithm for the dynamics of multi-link mechanisms

A computationally efficient algorithm for the dynamics of multi-rigid-link mechanisms is presented which is applicable to on-board processing for robotic manipulator control systems. A formulation of the equations of motion for such systems is presented which results in a solution algorithm of the order the number of system degrees of freedom. The formulation is presented for tree topology systems, where the chain topology of typical manipulators is a subset. Comparison of this algorithm is made with existing multibody simulation programs to illustrate the increased computational efficiency.

Singh, R. P.↗
NASA NTRS1983

An efficient algorithm for generating random number pairs drawn from a bivariate normal distribution

An efficient algorithm for generating random number pairs from a bivariate normal distribution was developed. Any desired value of the two means, two standard deviations, and correlation coefficient can be selected. Theoretically the technique is exact and in practice its accuracy is limited only by the quality of the uniform distribution random number generator, inaccuracies in computer function evaluation, and arithmetic. A FORTRAN routine was written to check the algorithm and good accuracy was obtained. Some small errors in the correlation coefficient were observed to vary in a surprisingly regular manner. A simple model was developed which explained the qualities aspects of the errors.

Campbell, C. W.↗
NASA NTRS1983

Efficient Algorithms for Computing Trim and Small-Disturbance Equations of Motion of Aircraft Coordinated and Uncoordinated, Steady, Steep Turns

The development of computational algorithms that permit efficient calculation of aircraft trim states and of the associated small disturbance equations of motion for a systematic investigation of the statics and dynamics of aircraft in coordinated and uncoordinated, steady, steep turning flight is reported. The efficiency in the trim computation is realized by decoupling the governing equations. The small disturbance equations of motion, which are given in a general body axis system, include aerodynamic acceleration derivatives; they are cast in a familiar first order, vector matrix format of modern system theory. These algorithms were applied to a variety of rotorcraft simulation models. Results pertaining to a simulated hingeless rotor helicopter are also presented

Chen, Robert T. N.↗
NASA NTRS1972

An efficient algorithm using matrix methods to solve wind tunnel force-balance equations

An iterative procedure applying matrix methods to accomplish an efficient algorithm for automatic computer reduction of wind-tunnel force-balance data has been developed. Balance equations are expressed in a matrix form that is convenient for storing balance sensitivities and interaction coefficient values for online or offline batch data reduction. The convergence of the iterative values to a unique solution of this system of equations is investigated, and it is shown that for balances which satisfy the criteria discussed, this type of solution does occur. Methods for making sensitivity adjustments and initial load effect considerations in wind-tunnel applications are also discussed, and the logic for determining the convergence accuracy limits for the iterative solution is given. This more efficient data reduction program is compared with the technique presently in use at the NASA Langley Research Center, and computational times on the order of one-third or less are demonstrated by use of this new program.

Smith, D. L.↗
NASA NTRS1985

An efficient algorithm for estimating noise covariances in distributed systems

An efficient computational algorithm for estimating the noise covariance matrices of large linear discrete stochatic-dynamic systems is presented. Such systems arise typically by discretizing distributed-parameter systems, and their size renders computational efficiency a major consideration. The proposed adaptive filtering algorithm is based on the ideas of Belanger, and is algebraically equivalent to his algorithm. The earlier algorithm, however, has computational complexity proportional to p to the 6th, where p is the number of observations of the system state, while the new algorithm has complexity proportional to only p-cubed. Further, the formulation of noise covariance estimation as a secondary filter, analogous to state estimation as a primary filter, suggests several generalizations of the earlier algorithm. The performance of the proposed algorithm is demonstrated for a distributed system arising in numerical weather prediction.

Dee, D. P.↗
NASA NTRS1977

Probe corrected far-field reconstruction from measurements on a cylinder: A novel formulation and efficient algorithm

A novel and numerically efficient method of far field evaluation from measurements taken on a cylinder is based on the representation of both the antenna and the probe fields as superpositions of plane waves. A system of two integral equations are established whose unknown functions are the azimuthal and elevation components of the antenna pattern and whose known terms are the set of measurement data taken with two different probes - the second probe in most practical instances being simply the same probe with a different geometrical orientation. The equations express the known data - for each angular position of the antenna under measurement - as the integrals of the products of the corresponding components of the unknown antenna and known probe patterns multiplied by a phase term. The convolutional nature of the integral equations makes their solutions straight-forward. If, as is virtually always the case, the probe is small or of moderate size so that the axis of rotation of the antenna mount is in the far field of the probe, the intervention of asymptotic techniques makes the solution numerically very efficient. The agreement of calculated and experimental patterns is excellent.

Borgiotti, G. V.↗
NASA NTRS1980

Accuracies of three computationally efficient algorithms for computing atmospheric transmittances

Three algorithms for calculating polychromatic atmospheric transmittance functions have been tested using a set of eleven distinct temperature profiles in order to compare transmittance accuracies achievable by the three methods. The comparison of rms errors demonstrates that the iterative method of McMillin and Fleming (1976) is the most accurate of the efficient algorithms currently available for gases with constant mixing ratios; its accuracy approaches that of the spectroscopic parameters and the computational approximations used in the ground-truth line-by-line calculations. The method of Arking et al. (1974), while less accurate, has the advantage of being perfectly general and easily adapted to cases where spectral bandwidths are varied

Mcmillin, L. M.↗
NASA NTRS1990

Efficient algorithms for dilated mappings of binary trees

The problem is addressed to find a 1-1 mapping of the vertices of a binary tree onto those of a target binary tree such that the son of a node on the first binary tree is mapped onto a descendent of the image of that node in the second binary tree. There are two natural measures of the cost of this mapping, namely the dilation cost, i.e., the maximum distance in the target binary tree between the images of vertices that are adjacent in the original tree. The other measure, expansion cost, is defined as the number of extra nodes/edges to be added to the target binary tree in order to ensure a 1-1 mapping. An efficient algorithm to find a mapping of one binary tree onto another is described. It is shown that it is possible to minimize one cost of mapping at the expense of the other. This problem arises when designing pipelined arithmetic logic units (ALU) for special purpose computers. The pipeline is composed of ALU chips connected in the form of a binary tree. The operands to the pipeline can be supplied to the leaf nodes of the binary tree which then process and pass the results up to their parents. The final result is available at the root. As each new application may require a distinct nesting of operations, it is useful to be able to find a good mapping of a new binary tree over existing ALU tree. Another problem arises if every distinct required binary tree is known beforehand. Here it is useful to hardwire the pipeline in the form of a minimal supertree that contains all required binary trees.

Iqbal, M. Ashraf↗
NASA NTRS2024

A Computationally Efficient Algorithm for Sampling the Rudd Differential Cross Section

Monte Carlo radiation transport codes such as RITRACKS or Geant4 are used to simulate the interaction of ions with matter. These codes rely on sampling algorithms to determine interactions and various physical properties of particles involved in the simulations. It is crucial to develop efficient sampling algorithms since Monte Carlo radiation transport simulations can be time consuming. This work presents an efficient sampling algorithm to determine the energy of secondary electrons following ion-water interactions. The applicability and intended use of the algorithm are discussed in detail, and it is shown that the new algorithm is up to 6X10 4 times faster than the method currently used in Geant4-DNA.

Floriane Poignant↗
NASA NTRS1995

An efficient algorithm for choosing scattering directions in Monte Carlo work with arbitrary phase functions

This paper describes an efficient Monte Carlo algorithm for choosing a new direction of a photon after a scattering interaction. The algorithm chooses a scattering angle by linear interpolation in a table of the inverse cumulative scattering probability. A Legendre expansion of the phase function makes it easy to apply Clenshaw's algorithm to build the interpolation table. The points in the table are close enough together that linear interpolation is accurate. With a table of 100,000 entries, we can keep the absolute and relative errors in matching the probability distribution below 10(exp -5).

Barkstrom, Bruce R.↗
NASA NTRS2008

Efficient Algorithm for Rectangular Spiral Search

An algorithm generates grid coordinates for a computationally efficient spiral search pattern covering an uncertain rectangular area spanned by a coordinate grid. The algorithm does not require that the grid be fixed; the algorithm can search indefinitely, expanding the grid and spiral, as needed, until the target of the search is found. The algorithm also does not require memory of coordinates of previous points on the spiral to generate the current point on the spiral.

Brugarolas, Paul↗
DOE OSTI2025

A Novel Protection Scheme for Unbalanced Faults in Inverter Dominated Networks: A Computationally Efficient Algorithm for Entry-Level Relays

Microgrids are now a common practice in distribution systems to increase resilience and reliability. However, microgrid protection remains a critical challenge, considering its requirement to operate in both grid connected and islanded, and the variability in fault characteristics under each mode of operation. This paper presents unbalanced power (S unb ) based fault detection algorithm, which considers local voltage and current unbalances to determine faults in the system. S unb is a computationally efficient fault detection algorithm that is suitable for implementation in the programmable logic of entry level protective relays. In addition, the difference in current and voltage unbalance (D n ) is used to determine the fault type. The proposed method demonstrates high sensitivity and selectivity for line-to-ground (LG), line-to-line (LL), and double line-to-ground (LLG) faults, representing the most common faults in distribution systems. It also allows relay coordination with upstream and downstream protection devices in both island and grid connected operation, while preserving grading margins. The same pickup and time multiplier settings of a particular relay for both modes of operation eliminates the need for adaptive settings, which rely on communication networks. Validation was performed with a hardware-in-the-loop (HIL) setup using Typhoon HIL real time simulator interfaced with three entry-level, SEL 751 relays. Results confirmed the algorithm’s ability to discriminate fault conditions, and determine the fault type under both operating modes, maintain fast detection times, and ensure proper protection coordination.

fault classification↗
NASA NTRS1989

Numerically efficient algorithm for model development of high-order systems

A technique for estimating transfer functions in partial fraction expansion form from frequency response data for a high-order system is presented. The problem formulation avoids many of the numerical difficulties associated with high-order polynomials and has the advantage of having the option to fix the camping and frequency of a mode, if known, during the estimation process. The resulting transfer function(s) may be converted to Jordan-Form time domain equations directly. During the implementation of this technique, a frequency and amplitude normalizing window was developed that maximized the efficiency of the optimization algorithm. The combination of estimating the transfer function in factored form, the ability to fix preciously determined parameters and the effectiveness of the normalizing window led to a progressive approach to synthesizing transfer functions from frequency response data for high-order systems.

Parada, L. O.↗