Use of a time-sharing computer in nuclear chemistry.
Computer-analyzer system for nuclear chemistry, noting advantage of on-line data acquisition and analysis coupled with time sharing economy
Fryklund, J.↗
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.
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.↗
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.↗
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.↗
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.↗
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.↗
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↗
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↗
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.↗
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.↗
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.↗
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.↗
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.↗
Derivation and application of hard deadlines for real-time control systems
The computation-time delay in the feedback controller of a real-time control system may cause failure to update the control input during one or more sampling periods. If this delay exceeds a certain limit called a hard deadline, either the necessary conditions for system stability are violated or the system leaves the allowed state-space. In such a case a dynamic failure is said to occur to the system. A method for calculating the hard deadlines in linear time-invariant control systems by considering system stability and the allowed state-space is presented. To derive necessary conditions for (asymptotic) system stability, the state difference equation is modified based on an assumed maximum delay and the probability distribution of delays whose magnitudes are less than, or equal to, the assumed maximum delay. Moreover, the allowed state-space - which is derived from given input and state constraints - is used to calculate the hard deadline as a function of time and the system state. A one-shot delay model in which a single event causes a dynamic failure is also considered. The knowledge of hard deadline is then applied to the design of error recovery in a triple modular redundant (TMR) controller computer.
Shin, Kang G.↗
Optimization of transistor design including large signal device/circuit interactions at extremely high frequencies (20-100+GHz)
Transistor design for extremely high frequency applications requires consideration of the interaction between the device and the circuit to which it is connected. Traditional analytical transistor models are to approximate at some of these frequencies and may not account for variations of dopants and semiconductor materials (especially some of the newer materials) within the device. Physically based models of device performance are required. These are based on coupled systems of partial differential equations and typically require 20 minutes of Cray computer time for a single AC operating point. A technique is presented to extract parameters from a few partial differential equation solutions for the device to create a nonlinear equivalent circuit model which runs in approximately 1 second of personal computer time. This nonlinear equivalent circuit model accurately replicates the contact current properties of the device as computed by the partial differential solver on which it is based. Using the nonlinear equivalent circuit model of the device, optimization of systems design can be performed based on device/circuit interactions.
Levy, Ralph↗
Using a Quadtree Algorithm To Assess Line of Sight
A matched pair of computer algorithms determines whether line of sight (LOS) is obstructed by terrain. These algorithms were originally designed for use in conjunction with combat-simulation software in military training exercises, but could also be used for such commercial purposes as evaluating lines of sight for antennas or determining what can be seen from a "room with a view." The quadtree preparation algorithm operates on an array of digital elevation data and only needs to be run once for a terrain region, which can be quite large. Relatively little computation time is needed, as each elevation value is considered only one and one-third times. The LOS assessment algorithm uses that quadtree to answer LOS queries. To determine whether LOS is obstructed, a piecewise-planar (or higher-order) terrain skin is computationally draped over the digital elevation data. Adjustments are made to compensate for curvature of the Earth and for refraction of the LOS by the atmosphere. Average computing time appears to be proportional to the number of queries times the logarithm of the number of elevation data points. Accuracy is as high as is possible for the available elevation data, and symmetric results are assured. In the simulation, the LOS query program runs as a separate process, thereby making more random-access memory available for other computations.
Gonzalez, Joseph↗
Simulating Nonlinear Deformations of Solar Sail Membranes Using Explicit Time Integration
In this study, the explicit time integration method is employed to predict deformation of highly flexible solar sail structural components. The nonlinear static analysis of a highly flexible ribbon structure is presented to demonstrate the need for having the explicit time integration method in the analysis toolbox for solar sail. Static analyses of the ribbon structure produce ambiquous results whereas the explicit time integration method determines the correct results. Extensive benchmarking examples are also presented to build confidence in the use of the explicit method. Previously determined nonlinear wrinkling deformations of solar sail membranes are found by the explicit method. As the explicit method is known to often require more computational time than nonlinear static methods, a study on mass scaling was also conducted. The computational times are reported for the nonlinear static and explicit time integration solutions to calibrate the advantage of using mass scaling for these problems.
Wang, John T.↗
Computation of scalar far-field patterns of large-aperture antennas
In computer programs used for evaluating the performance of high-gain antennas, efficient numerical methods for calculating the far-field patterns must be used since the majority of computer time and storage requirements may be attributed to this phase of the program. The numerical method most frequently used is the Fast Fourier Transform (FFT), which computes the far field as the Fourier transform of the field distribution in the antenna aperture. A new numerical method that in many applications is superior to the FFT in terms of reducing computer time and storage requirements is described.
Omalley, T. A.↗