Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1997

Efficient Computation of Closed-loop Frequency Response for Large Order Flexible Systems

An efficient and robust computational scheme is given for the calculation of the frequency response function of a large order, flexible system implemented with a linear, time invariant control system. Advantage is taken of the highly structured sparsity of the system matrix of the plant based on a model of the structure using normal mode coordinates. The computational time per frequency point of the new computational scheme is a linear function of system size, a significant improvement over traditional, full-matrix techniques whose computational times per frequency point range from quadratic to cubic functions of system size. This permits the practical frequency domain analysis of systems of much larger order than by traditional, full-matrix techniques. Formulations are given for both open and closed loop loop systems. Numerical examples are presented showing the advantages of the present formulation over traditional approaches, both in speed and in accuracy. Using a model with 703 structural modes, a speed-up of almost two orders of magnitude was observed while accuracy improved by up to 5 decimal places.

Maghami, Peiman G.↗
NASA NTRS2016

Probabilistic Damage Characterization Using the Computationally-Efficient Bayesian Approach

This work presents a computationally-ecient approach for damage determination that quanti es uncertainty in the provided diagnosis. Given strain sensor data that are polluted with measurement errors, Bayesian inference is used to estimate the location, size, and orientation of damage. This approach uses Bayes' Theorem to combine any prior knowledge an analyst may have about the nature of the damage with information provided implicitly by the strain sensor data to form a posterior probability distribution over possible damage states. The unknown damage parameters are then estimated based on samples drawn numerically from this distribution using a Markov Chain Monte Carlo (MCMC) sampling algorithm. Several modi cations are made to the traditional Bayesian inference approach to provide signi cant computational speedup. First, an ecient surrogate model is constructed using sparse grid interpolation to replace a costly nite element model that must otherwise be evaluated for each sample drawn with MCMC. Next, the standard Bayesian posterior distribution is modi ed using a weighted likelihood formulation, which is shown to improve the convergence of the sampling process. Finally, a robust MCMC algorithm, Delayed Rejection Adaptive Metropolis (DRAM), is adopted to sample the probability distribution more eciently. Numerical examples demonstrate that the proposed framework e ectively provides damage estimates with uncertainty quanti cation and can yield orders of magnitude speedup over standard Bayesian approaches.

Warner, James E.↗
NASA NTRS1971

Graphical method for analyzing digital computer efficiency

Analysis method utilizes graph-theoretic approach for evaluating computation cost and makes logical distinction between linear graph of a computation and linear graph of a program. It applies equally well to other processes which depend on quatitative edge nomenclature and precedence relationships between edges.

Chan, S. P.↗
NASA NTRS1992

Efficient Computation Of Confidence Intervals Of Parameters

Study focuses on obtaining efficient algorithm for estimation of confidence intervals of ML estimates. Four algorithms selected to solve associated constrained optimization problem. Hybrid algorithms, following search and gradient approaches, prove best.

Murphy, Patrick C.↗
NASA NTRS1972

Computational efficiency achieved by time splitting of finite difference operators.

A technique is presented for computing multidimensional time-dependent flow fields that avoids much of the inefficiency typically found in finite difference calculations. The technique initially divides the flow field into regions, each containing a mesh of general quadrilateral cells chosen to provide spatial resolution of the local features of the flow. A finite difference operator of second order accuracy, consisting of a sequence of one-dimensional operators (each operating at near maximum Courant-Friedrich-Lewy number) is then constructed for each region. Numerical results illustrating the technique for inviscid flows about simple bodies that generate shock waves, embedded shock waves, and expansion fans are presented and compared with exact theory.

Maccormack, R. W.↗
NASA NTRS1988

Storage and computationally efficient permutations of factorized covariance and square-root information arrays

A unified method to permute vector stored Upper triangular Diagonal factorized covariance and vector stored upper triangular Square Root Information arrays is presented. The method involves cyclic permutation of the rows and columns of the arrays and retriangularization with fast (slow) Givens rotations (reflections). Minimal computation is performed, and a one dimensional scratch array is required. To make the method efficient for large arrays on a virtual memory machine, computations are arranged so as to avoid expensive paging faults. This method is potentially important for processing large volumes of radio metric data in the Deep Space Network.

Muellerschoen, R. J.↗
NASA NTRS1990

Comparative study of computational efficiency of two LU schemes for non-equilibrium reacting flows

The systems of equations governing chemically nonequilibrium flows are solved numerically by two lower-upper(LU) algorithms, namely, LU-SSOR (Yoon and Jameson, 1987) and LU-SW (Steger and Warming, 1981). The methods of flux-Jacobian splitting differentiate the two LU algorithms. The LU-SSOR gives a simpler implicit operator with less temporal damping, while the LU-SW converges faster but requires more computation for each iteration. Relative efficiencies and mutual merits of these two LU algorithms are compared. The results show that LU-SW with upwind-differenced right-hand-side gives the best convergence.

Tsai, Y.-L. Peter↗
NASA NTRS1989

A computationally efficient modelling of laminar separation bubbles

The goal is to accurately predict the characteristics of the laminar separation bubble and its effects on airfoil performance. Toward this end, a computational model of the separation bubble was developed and incorporated into the Eppler and Somers airfoil design and analysis program. Thus far, the focus of the research was limited to the development of a model which can accurately predict situations in which the interaction between the bubble and the inviscid velocity distribution is weak, the so-called short bubble. A summary of the research performed in the past nine months is presented. The bubble model in its present form is then described. Lastly, the performance of this model in predicting bubble characteristics is shown for a few cases.

Dini, Paolo↗
NASA NTRS1992

Using the stereokinetic effect to convey depth - Computationally efficient depth-from-motion displays

Recent developments in microelectronics have encouraged the use of 3D data bases to create compelling volumetric renderings of graphical objects. However, even with the computational capabilities of current-generation graphical systems, real-time displays of such objects are difficult, particularly when dynamic spatial transformations are involved. In this paper we discuss a type of visual stimulus (the stereokinetic effect display) that is computationally far less complex than a true three-dimensional transformation but yields an equally compelling depth impression, often perceptually indiscriminable from the true spatial transformation. Several possible applications for this technique are discussed (e.g., animating contour maps and air traffic control displays so as to evoke accurate depth percepts).

Kaiser, Mary K.↗
NASA NTRS2019

Efficient computation of optimal low thrust gravity perturbed orbit transfers

We have developed a new method for solving low-thrust fuel-optimal orbit transfer problems in the vicinity of a large body (planet or asteroid), considering a high-fidelity spherical harmonic gravity model. The algorithm is formulated via the indirect optimization method, leading to a two-point boundary value problem (TPBVP). We make use of a hyperbolic tangent smoothing law for performing continuation on the thrust magnitude to reduce the sharpness of the control switches in early iterations and thus promote convergence. The TPBVP is solved using the method of particular solutions (MPS) shooting method and Picard-Chebyshev numerical integration. Application of Picard-Chebyshev integration affords an avenue for increased efficiency that is not available with step-by-step integrators. We demonstrate that computing the particular solutions with only a low-fidelity force model greatly increases the efficiency of the algorithm while ultimately achieving near machine precision accuracy. A salient feature of the MPS is that it is parallelizable, and thus further speedups are available. It is also shown that, for near Earth orbits and over a small number of en-route revolutions around the Earth, only the zonal perturbation terms are required in the costate equations to obtain a solution that is accurate to machine precision and optimal to engineering precision. The proposed framework can be used for trajectory design around small asteroids and also for orbit debris rendezvous and removal tasks.

Junkins, John L.↗
NASA NTRS1991

Numerical algorithm comparison for the accurate and efficient computation of high-incidence vortical flow

Computations from two Navier-Stokes codes, NSS and F3D, are presented for a tangent-ogive-cylinder body at high angle of attack. Features of this steady flow include a pair of primary vortices on the leeward side of the body as well as secondary vortices. The topological and physical plausibility of this vortical structure is discussed. The accuracy of these codes are assessed by comparison of the numerical solutions with experimental data. The effects of turbulence model, numerical dissipation, and grid refinement are presented. The overall efficiency of these codes are also assessed by examining their convergence rates, computational time per time step, and maximum allowable time step for time-accurate computations. Overall, the numerical results from both codes compared equally well with experimental data, however, the NSS code was found to be significantly more efficient than the F3D code.

Chaderjian, Neal M.↗
NASA NTRS1991

Efficient computation of aerodynamic influence coefficients for aeroelastic analysis on a transputer network

Aeroelastic analysis is multi-disciplinary and computationally expensive. Hence, it can greatly benefit from parallel processing. As part of an effort to develop an aeroelastic capability on a distributed memory transputer network, a parallel algorithm for the computation of aerodynamic influence coefficients is implemented on a network of 32 transputers. The aerodynamic influence coefficients are calculated using a 3-D unsteady aerodynamic model and a parallel discretization. Efficiencies up to 85 percent were demonstrated using 32 processors. The effect of subtask ordering, problem size, and network topology are presented. A comparison to results on a shared memory computer indicates that higher speedup is achieved on the distributed memory system.

Janetzke, David C.↗
NASA NTRS2009

A Simple and Efficient Computational Approach to Chafed Cable Time-Domain Reflectometry Signature Prediction

A method for the prediction of time-domain signatures of chafed coaxial cables is presented. The method is quasi-static in nature, and is thus efficient enough to be included in inference and inversion routines. Unlike previous models proposed, no restriction on the geometry or size of the chafe is required in the present approach. The model is validated and its speed is illustrated via comparison to simulations from a commercial, three-dimensional electromagnetic simulator.

Kowalski, Marc Edward↗
NASA NTRS2003

A Computationally Efficient Meshless Local Petrov-Galerkin Method for Axisymmetric Problems

The Meshless Local Petrov-Galerkin (MLPG) method is one of the recently developed element-free methods. The method is convenient and can produce accurate results with continuous secondary variables, but is more computationally expensive than the finite element method. To overcome this disadvantage, a simple Heaviside test function is chosen. The computational effort is significantly reduced by eliminating the domain integral for the axisymmetric potential problems and by simplifying the domain integral for the axisymmetric elasticity problems. The method is evaluated through several patch tests for axisymmetric problems and example problems for which the exact solutions are available. The present method yielded very accurate solutions. The sensitivity of several parameters of the method is also studied.

Raju, I. S.↗
NASA NTRS1993

Computationally efficient algorithms for real-time attitude estimation

For many practical spacecraft applications, algorithms for determining spacecraft attitude must combine inputs from diverse sensors and provide redundancy in the event of sensor failure. A Kalman filter is suitable for this task, however, it may impose a computational burden which may be avoided by sub optimal methods. A suboptimal estimator is presented which was implemented successfully on the Delta Star spacecraft which performed a 9 month SDI flight experiment in 1989. This design sought to minimize algorithm complexity to accommodate the limitations of an 8K guidance computer. The algorithm used is interpreted in the framework of Kalman filtering and a derivation is given for the computation.

Pringle, Steven R.↗
NASA NTRS1988

Storage and computationally efficient permutations of factorized covariance and square-root information matrices

A unified method to permute vector-stored upper-triangular diagonal factorized covariance (UD) and vector stored upper-triangular square-root information filter (SRIF) arrays is presented. The method involves cyclical permutation of the rows and columns of the arrays and retriangularization with appropriate square-root-free fast Givens rotations or elementary slow Givens reflections. A minimal amount of computation is performed and only one scratch vector of size N is required, where N is the column dimension of the arrays. To make the method efficient for large SRIF arrays on a virtual memory machine, three additional scratch vectors each of size N are used to avoid expensive paging faults. The method discussed is compared with the methods and routines of Bierman's Estimation Subroutine Library (ESL).

Muellerschoen, R. J.↗
NASA NTRS2020

Computationally Efficient Modeling and Data Assimilation of Near-Surface Variability

Near-surface (< 20m) ocean exhibits high variability due to coupled interactions, for e.g., with the atmosphere, sea ice, land, etc. Here we focus on atmospheric heat and momentum (wind) forcing, which are known to cause diurnal variability within the mixed layer. Only recently with a combination of sufficiently high vertical/horizontal resolution (75L, 1/4deg) and sub-daily atmospheric forcing fields, ocean models are starting to resolve this diurnal variability. However, the computation expense of such a high vertical resolution is burdensome in the context of coupled modeling and data assimilation. An alternative approach is to parameterize this diurnal variability with a prognostic model, that is embedded into the ocean model.In the first part of this presentation, we will demonstrate results with the above two approaches, by comparing them to profiles of near-surface temperature and salinity. In the context of data assimilation and reanalysis, this modeling capability opens the door to re-examine and perhaps improve specification of background (or, ensemble) error characteristics. The second half of this talk will focus on illustrating diurnally varying errors within an ensemble DA, and possible approaches to improve localization (horizontal/vertical) to extract maximum possible observational information content from in-situ and satellite observations of sea surface temperature.

Akella, Santha↗
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↗