Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational 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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

On Computationally Efficient Radiative Transfer Calculations for Three-Dimensional Entry Problems

The current work presents an efficient simulation framework for rigorously modeling radiative fields emanating from non-equilibrium planetary entry flows in complex three-dimensional domains. Key to this endeavor is adoption of finite-volume discretization in lieu of brute-force ray tracing. This change in conjunction with mesh sweeping and Lebedev-type quadrature for angular integration allows spatial-angular resolution of radiative transfer to be performed in a computationally tractable manner. Additionally, a new methodology has been established to build standalone reduced-order spectral databases for non-equilibrium radiative properties that can be applied to a broad range of hypersonic planetary entry problems with minimal loss in accuracy. The efficacy of the new framework has been demonstrated on the atomic nitrogen radiative system. The resulting reduced-order model requires three orders-of-magnitude fewer spectral evaluations and results in a 95% decrease in memory footprint. A comparative study for representative forebody and afterbody lines-of-sight from Stardust, FIRE II, and meteor entries into the Earth atmosphere indicates that both total intensity variation and detailed spectra can be retrieved with as few as 625 reduced-order groups (contrasting with the 100,000 frequencies in the original full set model). Similarly, three-dimensional predictions of radiative heating experienced by the Orion forebody are in excellent agreement with legacy radiation solvers while requiring only a sliver (roughly 0.5%) of computing wall time.

3D radiation↗
NASA NTRS1988

A computationally efficient modelling of laminar separation bubbles

The goal of this research is to accurately predict the characteristics of the laminar separation bubble and its effects on airfoil performance. To this end, a model of the bubble is under development and will be incorporated in the analysis section of the Eppler and Somers program. As a first step in this direction, an existing bubble model was inserted into the program. It was decided to address the problem of the short bubble before attempting the prediction of the long bubble. In the second place, an integral boundary-layer method is believed more desirable than a finite difference approach. While these two methods achieve similar prediction accuracy, finite-difference methods tend to involve significantly longer computer run times than the integral methods. Finally, as the boundary-layer analysis in the Eppler and Somers program employs the momentum and kinetic energy integral equations, a short-bubble model compatible with these equations is most preferable.

Maughmer, Mark D.↗
NASA NTRS1975

Development of an efficient computer code to solve the time-dependent Navier-Stokes equations

A research effort was conducted with the goal of reducing computer time of a Navier Stokes Computer Code for prediction of viscous flow fields about lifting bodies. A two-dimensional, time-dependent, laminar, transonic computer code (STOKES) was modified to incorporate a non-uniform timestep procedure. The non-uniform time-step requires updating of a zone only as often as required by its own stability criteria or that of its immediate neighbors. In the uniform timestep scheme each zone is updated as often as required by the least stable zone of the finite difference mesh. Because of less frequent update of program variables it was expected that the nonuniform timestep would result in a reduction of execution time by a factor of five to ten. Available funding was exhausted prior to successful demonstration of the benefits to be derived from the non-uniform time-step method.

Harp, J. L., Jr.↗
NASA NTRS1976

Use of steepest descent and various approximations for efficient computation of minimum noise aircraft landing trajectories

The following areas related to landing trajectory optimization research were discussed: (1) programming and modifying the steepest descent optimization procedure, (2) successfully iterating toward the optimum for a four-mile trajectory, (3) beginning optimization runs for a twenty-mile trajectory, and (4) adapt wind tunnel data for computer usage. Other related areas were discussed in detail in the two previous annual reports.

Cook, G.↗
NASA NTRS1976

Efficient computer algorithms for infrared astronomy data processing

Data processing techniques to be studied for use in infrared astronomy data analysis systems are outlined. Only data from space based telescope systems operating as survey instruments are considered. Resulting algorithms, and in some cases specific software, will be applicable for use with the infrared astronomy satellite (IRAS) and the shuttle infrared telescope facility (SIRTF). Operational tests made during the investigation use data from the celestial mapping program (CMP). The overall task differs from that involved in ground-based infrared telescope data reduction.

Pelzmann, R. F., Jr.↗
NASA NTRS1987

Efficient computation of parameter confidence intervals

An important step in system identification of aircraft is the estimation of stability and control derivatives from flight data along with an assessment of parameter accuracy. When the maximum likelihood estimation technique is used, parameter accuracy is commonly assessed by the Cramer-Rao lower bound. It is known, however, that in some cases the lower bound can be substantially different from the parameter variance. Under these circumstances the Cramer-Rao bounds may be misleading as an accuracy measure. This paper discusses the confidence interval estimation problem based on likelihood ratios, which offers a more general estimate of the error bounds. Four approaches are considered for computing confidence intervals of maximum likelihood parameter estimates. Each approach is applied to real flight data and compared.

Murphy, Patrick C.↗
NASA NTRS1989

Efficient Computation Of Behavior Of Aircraft Tires

NASA technical paper discusses challenging application of computational structural mechanics to numerical simulation of responses of aircraft tires during taxing, takeoff, and landing. Presents details of three main elements of computational strategy: use of special three-field, mixed-finite-element models; use of operator splitting; and application of technique reducing substantially number of degrees of freedom. Proposed computational strategy applied to two quasi-symmetric problems: linear analysis of anisotropic tires through use of two-dimensional-shell finite elements and nonlinear analysis of orthotropic tires subjected to unsymmetric loading. Three basic types of symmetry and combinations exhibited by response of tire identified.

Tanner, John A.↗
NASA NTRS1989

A computationally efficient modelling of laminar separation bubbles

In order to predict the aerodynamic characteristics of airfoils operating at low Reynolds numbers, it is necessary to accurately account for the effects of laminar (transitional) separation bubbles. Generally, the greatest difficulty comes about when attempting to determine the increase in profile drag that results from the presence of separation bubbles. While a number of empirically based separation bubble models have been introduced in the past, the majority assume that the bubble development is fully predictable from upstream conditions. One way of accounting for laminar separation bubbles in airfoil design is the bubble analog used in the design and analysis program of Eppler and Somers. A locally interactive separation bubble model was developed and incorporated into the Eppler and Somers program. Although unable to account for strong interactions such as the large reduction in suction peak sometimes caused by leading edge bubbles, it is able to predict the increase in drag and the local alteration of the airfoil pressure distribution that is caused by bubbles occurring in the operational range which is of most interest.

Dini, Paolo↗
NASA NTRS1989

Labeled trees and the efficient computation of derivations

The effective parallel symbolic computation of operators under composition is discussed. Examples include differential operators under composition and vector fields under the Lie bracket. Data structures consisting of formal linear combinations of rooted labeled trees are discussed. A multiplication on rooted labeled trees is defined, thereby making the set of these data structures into an associative algebra. An algebra homomorphism is defined from the original algebra of operators into this algebra of trees. An algebra homomorphism from the algebra of trees into the algebra of differential operators is then described. The cancellation which occurs when noncommuting operators are expressed in terms of commuting ones occurs naturally when the operators are represented using this data structure. This leads to an algorithm which, for operators which are derivations, speeds up the computation exponentially in the degree of the operator. It is shown that the algebra of trees leads naturally to a parallel version of the algorithm.

Grossman, Robert↗
NASA NTRS1989

Efficient computer algebra algorithms for polynomial matrices in control design

The theory of polynomial matrices plays a key role in the design and analysis of multi-input multi-output control and communications systems using frequency domain methods. Examples include coprime factorizations of transfer functions, cannonical realizations from matrix fraction descriptions, and the transfer function design of feedback compensators. Typically, such problems abstract in a natural way to the need to solve systems of Diophantine equations or systems of linear equations over polynomials. These and other problems involving polynomial matrices can in turn be reduced to polynomial matrix triangularization procedures, a result which is not surprising given the importance of matrix triangularization techniques in numerical linear algebra. Matrices with entries from a field and Gaussian elimination play a fundamental role in understanding the triangularization process. In the case of polynomial matrices, matrices with entries from a ring for which Gaussian elimination is not defined and triangularization is accomplished by what is quite properly called Euclidean elimination. Unfortunately, the numerical stability and sensitivity issues which accompany floating point approaches to Euclidean elimination are not very well understood. New algorithms are presented which circumvent entirely such numerical issues through the use of exact, symbolic methods in computer algebra. The use of such error-free algorithms guarantees that the results are accurate to within the precision of the model data--the best that can be hoped for. Care must be taken in the design of such algorithms due to the phenomenon of intermediate expressions swell.

Baras, J. S.↗
NASA NTRS1990

Computational efficiency of parallel combinatorial OR-tree searches

The performance of parallel combinatorial OR-tree searches is analytically evaluated. This performance depends on the complexity of the problem to be solved, the error allowance function, the dominance relation, and the search strategies. The exact performance may be difficult to predict due to the nondeterminism and anomalies of parallelism. The authors derive the performance bounds of parallel OR-tree searches with respect to the best-first, depth-first, and breadth-first strategies, and verify these bounds by simulation. They show that a near-linear speedup can be achieved with respect to a large number of processors for parallel OR-tree searches. Using the bounds developed, the authors derive sufficient conditions for assuring that parallelism will not degrade performance and necessary conditions for allowing parallelism to have a speedup greater than the ratio of the numbers of processors. These bounds and conditions provide the theoretical foundation for determining the number of processors required to assure a near-linear speedup.

Li, Guo-Jie↗
NASA NTRS1989

A computationally efficient modelling of laminar separation bubbles

In order to predict the aerodynamic characteristics of airfoils operating at low Reynolds numbers, it is necessary to accurately account for the effects of laminar (transitional) separation bubbles. Generally, the greatest difficulty comes about when attempting to determine the increase in profile drag that results from the presence of separation bubbles. While a number of empirically based separation bubble models have been introduced in the past, the majority assume that the bubble development is fully predictable from upstream conditions. One way of accounting for laminar separation bubbles in airfoil design is the bubble analog used in the design and analysis program of Eppler and Somers. A locally interactive separation bubble model was developed and incorporated into the Eppler and Somers program. Although unable to account for strong interactions such as the large reduction in suction peak sometimes caused by leading edge bubbles, it is able to predict the increase in drag and the local alteration of the airfoil pressure distribution that is caused by bubbles occurring in the operational range which is of most interest.

Dini, Paolo↗