Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computation time”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

The use of the FFT for the efficient solution of the problem of electromagnetic scattering by a body of revolution

The enhancement of the computational efficiency of the body of revolution (BOR) scattering problem is discused with a view to making it practical for solving large-body problems. The problem of EM scattering by a perfectly conducting BOR is considered, although the methods can be extended to multilayered dielectric bodies as well. Typically, the generation of the elements of the moment method matrix consumes a major portion of the computational time. It is shown how this time can be significantly reduced by manipulating the expression for the matrix elements to permit efficient FFT computation. A technique for extracting the singularity of the Green function that appears within the integrands of the matrix diagonal is also presented, further enhancing the usefulness of the FFT. The computation time can thus be improved by at least an order of magnitude for large bodies in comparison to that for previous algorithms.

Gedney, Stephen D.↗
NASA NTRS1988

Arranging computer architectures to create higher-performance controllers

Techniques for integrating microprocessors, array processors, and other intelligent devices in control systems are reviewed, with an emphasis on the (re)arrangement of components to form distributed or parallel processing systems. Consideration is given to the selection of the host microprocessor, increasing the power and/or memory capacity of the host, multitasking software for the host, array processors to reduce computation time, the allocation of real-time and non-real-time events to different computer subsystems, intelligent devices to share the computational burden for real-time events, and intelligent interfaces to increase communication speeds. The case of a helicopter vibration-suppression and stabilization controller is analyzed as an example, and significant improvements in computation and throughput rates are demonstrated.

Jacklin, Stephen A.↗
NASA NTRS1977

Onboard magnetic field modeling for Solar Maximum Mission /SMM/

Analysis and simulation results are presented for magnetic field models for use in attitude acquisition onboard Solar Maximum Mission (SMM). A study was made of the degree of the spherical harmonic expansion of the magnetic field required, considering mission requirements, modeling errors, and magnetometer quantization and biases. It is shown that a fifth-degree field is sufficient to provide two-degree roll angle determination accuracy with a residual magnetic bias of 10 milligauss. Also, a spherical harmonic expansion for the McIlwain L-parameter is included for the first time. This parameter will be telemetered to ground with experimental data. The fifth-degree expansion will provide the L-parameter to within two percent of accepted values. The additional onboard computational burden is the storage of 36 coefficients and an increase of about 15% in computation time. Prototype flight code was developed which is anticipated to require about 2000 bytes of core storage and 30 milliseconds of computation time per orbit point on the NSSC-1 computer.

Headrick, R. D.↗
NASA NTRS1977

Over-relaxation applied to the MacCormack finite-difference scheme

An over-relaxation procedure is applied to the MacCormack finite-difference scheme in order to reduce the computation time required to obtain a steady-state solution. The implementation of this acceleration procedure to an existing computer program using the regular MacCormack method is extremely simple and does not require additional storage. The over-relaxation procedure does not alter the steady-state solution, which is second-order accurate. The method is first applied to Burgers' equation. A stability condition and an expression for the increase in the rate of convergence are derived. The method is then applied to the calculation of the hypersonic viscous flow over a flat plate, using the complete Navier-Stokes equations, and the inviscid flow over a wedge. Reductions in computing time by factors of 3 and 1.5, respectively, are obtained by over-relaxation.

Desideri, J.-A.↗
NASA NTRS1979

Evaluation of finite element formulations for transient conduction forced-convection analysis

Conventional versus upwind convective finite elements, and lumped versus consistent formulations for practical conduction/forced convection analysis are evaluated on the basis of numerical studies, with finite element and finite difference lumped-parameter temperatures compared to closed-form analytical solutions for convection problems. Attention is given to two practical combined conduction and forced convection applications, stressing that the finite element method, showing superior accuracy, is competitive with the finite difference lumped-parameter method. Also considered are the computational time savings offered by the zero capacitance nodes procedure and comparative finite element and finite difference lumped-parameter computer times. The present study has reference to the design of actively cooled engine and airframe structures for hypersonic flight.

Thornton, E. A.↗
DOE OSTI2024

Multiparticle cumulant mapping for Coulomb explosion imaging: Calculations and algorithm

We present a versatile cumulant mapping algorithm for analyzing correlated particle emission, offering insights into complex electronic and nuclear dynamics. Recently, we have demonstrated the use of cumulant mapping to extract information-rich correlations between the momenta of multiple fragments produced in Coulomb explosion imaging experiments [C. Cheng et al., Phys. Rev. Lett. 130, 093001 (2023)]. We define cumulant mapping in terms of histograms, enabling fast computation of linear (additive) observables. However, applying the same algorithm to nonlinear (nonadditive) observables poses challenges, as the computation time of conventional estimators scales nonlinearly with data size. To overcome this, we develop estimators and an accompanying algorithm to enable computationally efficient estimation of the cumulant of interest. Comparisons of computation times and signal-to-noise ratios reveal the superior performance of our approach. This method is demonstrated on the (D+, D+, C+, O+) dissociation channel of CD 2 ⁢O 4+ produced in a strong-field ionization experiment. Additionally, Poisson statistics are used to simulate the two methods and provide insights into the efficiency of our algorithm. The proposed methodology unlocks efficient computation of cumulant mapping for a broader range of complex systems and observables, such as the laser pulse dependence of ionization dynamics.

74 ATOMIC AND MOLECULAR PHYSICS↗
NASA NTRS1974

A real-time digital computer program for the simulation of a single rotor helicopter

A computer program was developed for the study of a single-rotor helicopter on the Langley Research Center real-time digital simulation system. Descriptions of helicopter equations and data, program subroutines (including flow charts and listings), real-time simulation system routines, and program operation are included. Program usage is illustrated by standard check cases and a representative flight case.

Houck, J. A.↗
NASA NTRS1975

Minimization search method for data inversion

Technique has been developed for determining values of selected subsets of independent variables in mathematical formulations. Required computation time increases with first power of the number of variables. This is in contrast with classical minimization methods for which computational time increases with third power of the number of variables.

Fymat, A. L.↗
DOE OSTI2020

Recent Experiences Calculating g-functions for Use in Simulation of Ground Heat Exchangers

Temperature response functions, known as g-functions, are a computationally efficient method for simulating ground heat exchangers (GHEs), used with ground-source heat pump (GSHP) systems, either as part of a whole-building energy simulation or as part of a dedicated ground heat exchanger design tool. In fact, at present, they are the only feasible way to simulate a ground-source heat pump system in a whole-building energy simulation. This paper summarizes recent developments in the field and recent experience using a new open-source g-function calculation tool known as pygfunction (Cimmino 2018a, 2018b). This experience includes accuracy, computation time, memory requirements and sensitivity to boundary conditions. With larger ground heat exchangers, e.g. in excess of 100 boreholes, the computational time and memory requirements can create challenges.

Spitler, Jeffery↗
NASA NTRS1989

History of visual systems in the Systems Engineering Simulator

The Systems Engineering Simulator (SES) houses a variety of real-time computer generated visual systems. The earliest machine dates from the mid-1960's and is one of the first real-time graphics systems in the world. The latest acquisition is the state-of-the-art Evans and Sutherland CT6. Between the span of time from the mid-1960's to the late 1980's, tremendous strides have been made in the real-time graphics world. These strides include advances in both software and hardware engineering. The purpose is to explore the history of the development of these real-time computer generated image systems from the first machine to the present. Hardware advances as well as software algorithm changes are presented. This history is not only quite interesting but also provides us with a perspective with which we can look backward and forward.

Christianson, David C.↗
NASA NTRS2009

Highly Scalable Matching Pursuit Signal Decomposition Algorithm

Matching Pursuit Decomposition (MPD) is a powerful iterative algorithm for signal decomposition and feature extraction. MPD decomposes any signal into linear combinations of its dictionary elements or atoms . A best fit atom from an arbitrarily defined dictionary is determined through cross-correlation. The selected atom is subtracted from the signal and this procedure is repeated on the residual in the subsequent iterations until a stopping criterion is met. The reconstructed signal reveals the waveform structure of the original signal. However, a sufficiently large dictionary is required for an accurate reconstruction; this in return increases the computational burden of the algorithm, thus limiting its applicability and level of adoption. The purpose of this research is to improve the scalability and performance of the classical MPD algorithm. Correlation thresholds were defined to prune insignificant atoms from the dictionary. The Coarse-Fine Grids and Multiple Atom Extraction techniques were proposed to decrease the computational burden of the algorithm. The Coarse-Fine Grids method enabled the approximation and refinement of the parameters for the best fit atom. The ability to extract multiple atoms within a single iteration enhanced the effectiveness and efficiency of each iteration. These improvements were implemented to produce an improved Matching Pursuit Decomposition algorithm entitled MPD++. Disparate signal decomposition applications may require a particular emphasis of accuracy or computational efficiency. The prominence of the key signal features required for the proper signal classification dictates the level of accuracy necessary in the decomposition. The MPD++ algorithm may be easily adapted to accommodate the imposed requirements. Certain feature extraction applications may require rapid signal decomposition. The full potential of MPD++ may be utilized to produce incredible performance gains while extracting only slightly less energy than the standard algorithm. When the utmost accuracy must be achieved, the modified algorithm extracts atoms more conservatively but still exhibits computational gains over classical MPD. The MPD++ algorithm was demonstrated using an over-complete dictionary on real life data. Computational times were reduced by factors of 1.9 and 44 for the emphases of accuracy and performance, respectively. The modified algorithm extracted similar amounts of energy compared to classical MPD. The degree of the improvement in computational time depends on the complexity of the data, the initialization parameters, and the breadth of the dictionary. The results of the research confirm that the three modifications successfully improved the scalability and computational efficiency of the MPD algorithm. Correlation Thresholding decreased the time complexity by reducing the dictionary size. Multiple Atom Extraction also reduced the time complexity by decreasing the number of iterations required for a stopping criterion to be reached. The Course-Fine Grids technique enabled complicated atoms with numerous variable parameters to be effectively represented in the dictionary. Due to the nature of the three proposed modifications, they are capable of being stacked and have cumulative effects on the reduction of the time complexity.

Christensen, Daniel↗
NASA NTRS2019

Cloud Giovanni: Reining in Costs and Improving Performance with Analytical Data Stores Using Scalable Serverless Architecture

Giovanni is the Geospatial Interactive Online Visualization ANd aNalysis Infrastructure developed at NASA GES DISC which provides a simple and intuitive way to visualize, analyze, and access vast amounts of Earth science data. It receives large number of user requests each day for a variety of analysis and visualization services, which leads to the big data challenge of serving gradually increasing large data volumes with diverse statistical algorithms. We hereby propose a multi-dimensional accumulation method which provides fast and cost-efficient cloud analysis for diverse services including both area averaging and time averaging. This method involves the weighted volume integration over multiple variable dimensions (time and space), and is implemented in AWS using Athena providing serverless and highly scalable data analysis. Compared to the standard method, this approach dramatically reduced the computational time by order of magnitude with a minimal AWS cost incurred. For example, for a benchmark of 10-year area averaging over the 1x1 degree daily variable, the computational time was reduced from minutes to seconds, and the Athena cost is only $5 for 100,000 requests.

Zhang, Hailiang↗
NASA NTRS1988

Understanding of and applications for robot vision guidance at KSC

The primary thrust of robotics at KSC is for the servicing of Space Shuttle remote umbilical docking functions. In order for this to occur, robots performing servicing operations must be capable of tracking a swaying Orbiter in Six Degrees of Freedom (6-DOF). Currently, in NASA KSC's Robotic Applications Development Laboratory (RADL), an ASEA IRB-90 industrial robot is being equipped with a real-time computer vision (hardware and software) system to allow it to track a simulated Orbiter interface (target) in 6-DOF. The real-time computer vision system effectively becomes the eyes for the lab robot, guiding it through a closed loop visual feedback system to move with the simulated Orbiter interface. This paper will address an understanding of this vision guidance system and how it will be applied to remote umbilical servicing at KSC. In addition, other current and future applications will be addressed.

Shawaga, Lawrence M.↗
NASA NTRS2012

Real-Time Cognitive Computing Architecture for Data Fusion in a Dynamic Environment

A novel cognitive computing architecture is conceptualized for processing multiple channels of multi-modal sensory data streams simultaneously, and fusing the information in real time to generate intelligent reaction sequences. This unique architecture is capable of assimilating parallel data streams that could be analog, digital, synchronous/asynchronous, and could be programmed to act as a knowledge synthesizer and/or an "intelligent perception" processor. In this architecture, the bio-inspired models of visual pathway and olfactory receptor processing are combined as processing components, to achieve the composite function of "searching for a source of food while avoiding the predator." The architecture is particularly suited for scene analysis from visual data and odorant.

Duong, Tuan A.↗
NASA NTRS1975

Three-dimensional time dependent computation of turbulent flow

The three-dimensional, primitive equations of motion are solved numerically for the case of isotropic box turbulence and the distortion of homogeneous turbulence by irrotational plane strain at large Reynolds numbers. A Gaussian filter is applied to governing equations to define the large scale field. This gives rise to additional second order computed scale stresses (Leonard stresses). The residual stresses are simulated through an eddy viscosity. Uniform grids are used, with a fourth order differencing scheme in space and a second order Adams-Bashforth predictor for explicit time stepping. The results are compared to the experiments and statistical information extracted from the computer generated data.

Kwak, D.↗
NASA NTRS2002

Development of an Efficient Binaural Simulation for the Analysis of Structural Acoustic Data

Binaural or "virtual acoustic" representation has been proposed as a method of analyzing acoustic and vibroacoustic data. Unfortunately, this binaural representation can require extensive computer power to apply the Head Related Transfer Functions (HRTFs) to a large number of sources, as with a vibrating structure. This work focuses on reducing the number of real-time computations required in this binaural analysis through the use of Singular Value Decomposition (SVD) and Equivalent Source Reduction (ESR). The SVD method reduces the complexity of the HRTF computations by breaking the HRTFs into dominant singular values (and vectors). The ESR method reduces the number of sources to be analyzed in real-time computation by replacing sources on the scale of a structural wavelength with sources on the scale of an acoustic wavelength. It is shown that the effectiveness of the SVD and ESR methods improves as the complexity of the source increases. In addition, preliminary auralization tests have shown that the results from both the SVD and ESR methods are indistinguishable from the results found with the exhaustive method.

Lalime, Aimee L.↗
NASA NTRS1978

Improved methods for calculating the thickness noise

Advanced methods to compute the rotor thickness noise which is predominant in the case of high speed rotor were developed. These methods were deduced from a previous method by transforming the integral coordinate, commuting the order of integration and differential, and/or performing chordwise integration analytically with some adequate assumption. The necessary computational times and waveforms obtained by the previous and three advanced methods were compared. It was then concluded that the advanced methods could save the computational time compared with the previous method with the same accuracy.

Nakamura, Y.↗