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

Faster Antenna Noise Temperature Calculations Using a Novel Approximation Technique

In order to properly tradeoff the various antenna and feed configurations for the Square Kilometre Array (SKA) optical design it is necessary to evaluate the gain and noise temperature of each configuration over a wide range of frequencies. German Cortes describes the standard technique for computing antenna noise temperature. However, since the total antenna pattern needs to be calculated over the entire 4 pi steradians at a fine enough resolution to accurately include the main beam, the computer time required is enormous. Even at modest frequencies and reflector sizes (approximately 5 to 10 GHz for a 12 meter main reflector) the technique can take days on a single node of a supercomputer. Utilizing the standard technique to compute the noise temperature for all the cases required to properly characterize the SKA design is clearly not feasible. At least a 100 to 1000 speedup in the computation time is required. This paper describes an approximation technique that can accomplish this improvement with extremely small errors in noise temperature calculation of a few tenths of Kelvin.

Reflector Antennas↗

A High-Performance Computing Predictive GNSS Performance Monitor for Autonomous Air Vehicles in Urban Environments

This report offers analysis and design insights for leveraging High-Performance Computing (HPC) to predict line-of-sight (LOS) Global Navigation Satellite System (GNSS) availability in a city. This work is motivated by the emerging fields of Advanced and Urban Air Mobility (AAM/UAM), where regulatory authorities are seeking city-scale, meter-resolution risk forecasting in order to safely integrate new flight missions with existing urban life and infrastructure. This work addresses the technical challenge of efficiently computing urban GNSS satellite visibility to predict GNSS performance metrics under these requirements. We present a new HPC-optimized shadow casting algorithm variant as a ray-based approach to forecasting satellite visibility. We apply this algorithm variant in a software-defined prognostic service which generates a GNSS navigation risk-correlated map as a path planning-style potential field. We detail dominant computational burdens, viable simplifying assumptions, and different algorithmic implementations, intending to demonstrate a baseline of computation time needed by each stage in such a service. We conclude by analyzing the prototype service’s prediction accuracy compared to receiver data from Corpus Christi, Texas. This informs design trade-offs along the dimensions of hardware, computation time, and tolerable forecasting error (including proportions of false positives and false negatives).

GNSS↗

Simulation and Flight Test Capability for Testing Prototype Sense and Avoid System Elements

NASA Langley Research Center (LaRC) and The MITRE Corporation (MITRE) have developed, and successfully demonstrated, an integrated simulation-to-flight capability for evaluating sense and avoid (SAA) system elements. This integrated capability consists of a MITRE developed fast-time computer simulation for evaluating SAA algorithms, and a NASA LaRC surrogate unmanned aircraft system (UAS) equipped to support hardware and software in-the-loop evaluation of SAA system elements (e.g., algorithms, sensors, architecture, communications, autonomous systems), concepts, and procedures. The fast-time computer simulation subjects algorithms to simulated flight encounters/ conditions and generates a fitness report that records strengths, weaknesses, and overall performance. Reviewed algorithms (and their fitness report) are then transferred to NASA LaRC where additional (joint) airworthiness evaluations are performed on the candidate SAA system-element configurations, concepts, and/or procedures of interest; software and hardware components are integrated into the Surrogate UAS research systems; and flight safety and mission planning activities are completed. Onboard the Surrogate UAS, candidate SAA system element configurations, concepts, and/or procedures are subjected to flight evaluations and in-flight performance is monitored. The Surrogate UAS, which can be controlled remotely via generic Ground Station uplink or automatically via onboard systems, operates with a NASA Safety Pilot/Pilot in Command onboard to permit safe operations in mixed airspace with manned aircraft. An end-to-end demonstration of a typical application of the capability was performed in non-exclusionary airspace in October 2011; additional research, development, flight testing, and evaluation efforts using this integrated capability are planned throughout fiscal year 2012 and 2013.

Howell, Charles T.↗

Discrete-State Simulated Annealing For Traveling-Wave Tube Slow-Wave Circuit Optimization

Algorithms based on the global optimization technique of simulated annealing (SA) have proven useful in designing traveling-wave tube (TWT) slow-wave circuits for high RF power efficiency. The characteristic of SA that enables it to determine a globally optimized solution is its ability to accept non-improving moves in a controlled manner. In the initial stages of the optimization, the algorithm moves freely through configuration space, accepting most of the proposed designs. This freedom of movement allows non-intuitive designs to be explored rather than restricting the optimization to local improvement upon the initial configuration. As the optimization proceeds, the rate of acceptance of non-improving moves is gradually reduced until the algorithm converges to the optimized solution. The rate at which the freedom of movement is decreased is known as the annealing or cooling schedule of the SA algorithm. The main disadvantage of SA is that there is not a rigorous theoretical foundation for determining the parameters of the cooling schedule. The choice of these parameters is highly problem dependent and the designer needs to experiment in order to determine values that will provide a good optimization in a reasonable amount of computational time. This experimentation can absorb a large amount of time especially when the algorithm is being applied to a new type of design. In order to eliminate this disadvantage, a variation of SA known as discrete-state simulated annealing (DSSA), was recently developed. DSSA provides the theoretical foundation for a generic cooling schedule which is problem independent, Results of similar quality to SA can be obtained, but without the extra computational time required to tune the cooling parameters. Two algorithm variations based on DSSA were developed and programmed into a Microsoft Excel spreadsheet graphical user interface (GUI) to the two-dimensional nonlinear multisignal helix traveling-wave amplifier analysis program TWA3. The algorithms were used to optimize the computed RF efficiency of a TWT by determining the phase velocity profile of the slow-wave circuit. The mathematical theory and computational details of the DSSA algorithms will be presented and results will be compared to those obtained with a SA algorithm.

Wilson, Jeffrey D.↗

Configuring Airspace Sectors with Approximate Dynamic Programming

In response to changing traffic and staffing conditions, supervisors dynamically configure airspace sectors by assigning them to control positions. A finite horizon airspace sector configuration problem models this supervisor decision. The problem is to select an airspace configuration at each time step while considering a workload cost, a reconfiguration cost, and a constraint on the number of control positions at each time step. Three algorithms for this problem are proposed and evaluated: a myopic heuristic, an exact dynamic programming algorithm, and a rollouts approximate dynamic programming algorithm. On problem instances from current operations with only dozens of possible configurations, an exact dynamic programming solution gives the optimal cost value. The rollouts algorithm achieves costs within 2% of optimal for these instances, on average. For larger problem instances that are representative of future operations and have thousands of possible configurations, excessive computation time prohibits the use of exact dynamic programming. On such problem instances, the rollouts algorithm reduces the cost achieved by the heuristic by more than 15% on average with an acceptable computation time.

Bloem, Michael↗

Multi-Agent Motion Planning using Deep Learning for Space Applications

State-of-the-art motion planners cannot scale to a large number of systems. Motion planning for multiple agents is an NP (non-deterministic polynomial-time) hard problem, so the computation time increases exponentially with each addition of agents. This computational demand is a major stumbling block to the motion planner's application to future NASA missions involving the swarm of space vehicles. We applied a deep neural network to transform computationally demanding mathematical motion planning problems into deep learning-based numerical problems. We showed optimal motion trajectories can be accurately replicated using deep learning-based numerical models in several 2D and 3D systems with multiple agents. The deep learning-based numerical model demonstrates superior computational efficiency with plans generated 1000 times faster than the mathematical model counterpart.

Madani, Ramtin↗

An efficient user-oriented method for calculating compressible flow about three-dimensional inlets

This method uses a so-called panel method to calculate incompressible flow about arbitrary three-dimensional inlets with or without centerbodies for four fundamental flow conditions: unit onset flows parallel to each of the coordinate axes plus static operation. The computing time is scarcely longer than for a single solution. A linear superposition of these solutions quite rigorously gives incompressible flow about the inlet for any angle of attack, angle of yaw, and mass flow rate. Compressibility is accounted for by applying a well-proven correction to the incompressible flow. Since the computing times for the combination and the compressibility correction are small, flows at a large number of inlet operating conditions are obtained very cheaply. A number of graphical output features are provided to aid the user, including streamline tracing and automatic generation of curves of constant pressure, Mach number, and flow inclination at selected inlet cross sections. This paper describes the method in some detail and presents calculated results.

Hess, J. L.↗

An efficient user-oriented method for calculating compressible flow in an about three-dimensional inlets

A panel method is used to calculate incompressible flow about arbitrary three-dimensional inlets with or without centerbodies for four fundamental flow conditions: unit onset flows parallel to each of the coordinate axes plus static operation. The computing time is scarcely longer than for a single solution. A linear superposition of these solutions quite rigorously gives incompressible flow about the inlet for any angle of attack, angle of yaw, and mass flow rate. Compressibility is accounted for by applying a well-proven correction to the incompressible flow. Since the computing times for the combination and the compressibility correction are small, flows at a large number of inlet operating conditions are obtained rather cheaply. Geometric input is aided by an automatic generating program. A number of graphical output features are provided to aid the user, including surface streamline tracing and automatic generation of curves of curves of constant pressure, Mach number, and flow inclination at selected inlet cross sections. The inlet method and use of the program are described. Illustrative results are presented.

Hess, J. L.↗

Time-dependent computational studies of flames in microgravity

The research performed at the Center for Reactive Flow and Dynamical Systems in the Laboratory for Computational Physics and Fluid Dynamics, at the Naval Research Laboratory, in support of the NASA Microgravity Science and Applications Program is described. The primary focus was on investigating fundamental questions concerning the propagation and extinction of premixed flames in Earth gravity and in microgravity environments. The approach was to use detailed time-dependent, multispecies, numerical models as tools to simulate flames in different gravity environments. The models include a detailed chemical kinetics mechanism consisting of elementary reactions among the eight reactive species involved in hydrogen combustion, coupled to algorithms for convection, thermal conduction, viscosity, molecular and thermal diffusion, and external forces. The external force, gravity, can be put in any direction relative to flame propagation and can have a range of values. A combination of one-dimensional and two-dimensional simulations was used to investigate the effects of curvature and dilution on ignition and propagation of flames, to help resolve fundamental questions on the existence of flammability limits when there are no external losses or buoyancy forces in the system, to understand the mechanism leading to cellular instability, and to study the effects of gravity on the transition to cellular structure. A flame in a microgravity environment can be extinguished without external losses, and the mechanism leading to cellular structure is not preferential diffusion but a thermo-diffusive instability. The simulations have also lead to a better understanding of the interactions between buoyancy forces and the processes leading to thermo-diffusive instability.

Oran, Elaine S.↗

Time-dependent Computational Studies of Premixed Flames in Microgravity

This report describes the research performed at the Center for Reactive Flow and Dynamical Systems in the Laboratory for Computational Physics and Fluid Dynamics, at the Naval Research Laboratory, in support of NASA Microgravity Science and Applications Program. The primary focus of this research is on investigating fundamental questions concerning the propagation and extinction of premixed flames in earth gravity and in microgravity environments. Our approach is to use detailed time-dependent, multispecies, numerical models as tools to simulate flames in different gravity environments. The models include a detailed chemical kinetics mechanism consisting of elementary reactions among the eight reactive species involved in hydrogen combustion, coupled to algorithms for convection, thermal conduction, viscosity, molecular and thermal diffusion, and external forces. The external force, gravity, can be put in any direction relative to flame propagation and can have a range of values. Recently more advanced wall boundary conditions such as isothermal and no-slip have been added to the model. This enables the simulation of flames propagating in more practical systems than before. We have used the numerical simulations to investigate the effects of heat losses and buoyancy forces on the structure and stability of flames, to help resolve fundamental questions on the existence of flammability limits when there are no external losses or buoyancy forces in the system, to understand the interaction between the various processes leading to flame instabilities and extinguishment, and to study the dynamics of cell formation and splitting. Our studies have been able to bring out the differences between upward- and downward-propagating flames and predict the zero-gravity behavior of these flames. The simulations have also highlighted the dominant role of wall heat losses in the case of downward-propagating flames. The simulations have been able to qualitatively predict the formation of multiple cells and the cessation of cell-splitting. Our studies have also shown that some flames in a microgravity environment can be extinguished due to a chemical instability and without any external losses. However, further simulations are needed to more completely understand upward-propagating and zero-gravity flames as well as to understand the potential effect of radiative heat losses.

Kailasanath, K.↗

Nuclear reactor descriptions for space power systems analysis

For the small, high performance reactors required for space electric applications, adequate neutronic analysis is of crucial importance, but in terms of computational time consumed, nuclear calculations probably yield the least amount of detail for mission analysis study. It has been found possible, after generation of only a few designs of a reactor family in elaborate thermomechanical and nuclear detail to use simple curve fitting techniques to assure desired neutronic performance while still performing the thermomechanical analysis in explicit detail. The resulting speed-up in computation time permits a broad detailed examination of constraints by the mission analyst.

Mccauley, E. W.↗

Reliability enhancement of Navier-Stokes codes through convergence enhancement

Reduction of total computing time required by an iterative algorithm for solving Navier-Stokes equations is an important aspect of making the existing and future analysis codes more cost effective. Several attempts have been made to accelerate the convergence of an explicit Runge-Kutta time-stepping algorithm. These acceleration methods are based on local time stepping, implicit residual smoothing, enthalpy damping, and multigrid techniques. Also, an extrapolation procedure based on the power method and the Minimal Residual Method (MRM) were applied to the Jameson's multigrid algorithm. The MRM uses same values of optimal weights for the corrections to every equation in a system and has not been shown to accelerate the scheme without multigriding. Our Distributed Minimal Residual (DMR) method based on our General Nonlinear Minimal Residual (GNLMR) method allows each component of the solution vector in a system of equations to have its own convergence speed. The DMR method was found capable of reducing the computation time by 10-75 percent depending on the test case and grid used. Recently, we have developed and tested a new method termed Sensitivity Based DMR or SBMR method that is easier to implement in different codes and is even more robust and computationally efficient than our DMR method.

Choi, K.-Y.↗

Analysis of Sample Acquisition Dynamics Using Discrete Element Method

The analysis presented in this paper is conducted in the framework of the Ocean Worlds Autonomy Testbed for Exploration Research and Simulation (OceanWATERS) project, currently under development at NASA Ames Research Center. OceanWATERS aims at designing a simulation environment which allows for testing autonomy of scientific lander missions to the icy moons of our solar system. Mainly focused on reproducing the end effector interaction with the inherent terrain, this paper introduces a novel discrete element method (DEM)-based approach to determine forces and torques acting on the lander’s scoop during the sample acquisition process. An accurate force feedback from the terrain on the scoop is required by fault-detection and autonomous decision-making algorithms to identify when the requested torque on the robotic arm’s joints exceeds the maximum available torque. Knowledge of the terrain force feedback significantly helps evaluating the arm’s links structural properties and properly selecting actuators for the joints. Models available in literature constitute a partial representation of the dynamics of the interaction. As an example, Balovnev derived an analytical expression of the vertical and horizontal force acting on a bucket while collecting a sample as a function of its geometry and velocity, soil parameters and reached depth. Although the model represents an adequate approximation of the two force components, it ignores the direction orthogonal to the scoop motion and neglects the torque. This work relies on DEM analysis to compensate for analytical models’ deficiencies and inaccuracies, i. e. provide force and torque 3D vectors, defined in the moving reference (body) frame attached to the scoop, at each instant of the sample collection process. Results from the first presented analysis relate to the specific OceanWATERS sampling strategy, which consists of collecting the sample through five consecutive passes with increasing depth, each pass following the same circularlinear- circular trajectory. Data is collected given a specific scoop design interacting with two types of bulk materials, which may characterize the surface of icy planetary bodies: snow and ice. Although specifically concerned with the OceanWATERS design, this first analysis provides the expected force trends for similar sampling strategies and allows to deduce phenomenological information about the general scooping process. In order to further instruct the community on the use of DEM tools as a solution to the sampling collection problem, two more analyses have been carried out, mainly focused on reducing the DEM computation time, which increases with a decrease in particle size. After running a set of identical simulations, where the only changing parameter is the size of the spherical particle, it is observed that the resulting force trajectories, starting from a given particle size, converge to the true trend. It is deducible that a further decrease in size yields negligible improvements in the accuracy, while it sensibly increases computation time. A final analysis aims at discussing limitations of approximating bulk material particles having a complex shape, e. g. ice fragments, with spheres, by comparing force trends resulting in the two cases for the same simulation scenario.

Catanoso, Damiana↗

Convergence acceleration of viscous and inviscid hypersonic flow calculations

The convergence of inviscid and viscous hypersonic flow calculations using a two-dimensional flux-splitting code is accelerated by applying a Richardson-type overrelaxation method. Successful results are presented for various cases; and a 50 percent savings in computer time is usually achieved. An analytical formula for the overrelaxation factor is derived, and the performance of this scheme is confirmed numerically. Moreover, application of this overrelaxation scheme produces a favorable preconditioning for Wynn's epsilon-algorithm. Both techniques have been extended to viscous three-dimensional flows and applied to accelerate the convergence of the compressible Navier-Stokes code. A savings of 40 percent in computer time is achieved in this case.

Cheer, A.↗

Parametric Analysis of Aircraft WingWeight Using Low-Order Physics-Based Analysis

In the conceptual aircraft design phase, prediction of the empty weight typically relies on empirically-based regression equations which execute quickly and require little detailed information about the internal structural layout. Since they are based on existing aircraft, however, empirical methods can lose their validity for newer technologies and unconventional configurations. Designers can transition to higher-order, physics-based analysis methods to improve the accuracy of the weight prediction, but at the cost of complex model setup and increased computational time. This paper describes a methodology for low-order aero-structural analysis of conceptual aircraft configurations that increases the use of physics-based analysis in conceptual design, but is less complex and time-consuming than higher-order methods such as finite-element analysis. The methodology uses Vehicle Sketch Pad (OpenVSP) to model the aircraft geometry, and ASWING to perform the aero-structural analysis. The internal forces and moments from the ASWING analysis are post-processed to calculate the resulting direct and shear stresses in the structure, and the thickness distributions of the aircraft components are varied to match the maximum von Mises stress at each cross section to the material allowable. To offset the increased computational time relative to empirical weight equations, a process is studied which uses parametric variation to develop a regression equation relating the weight of the aircraft wing to major design variables. This new weight equation is similar to existing empirical equations, but is built using the more physics-based methodology; the new equation could be used to augment or replace portions of the empirical database to improve the validity of the wing weight prediction for unconventional configurations and advanced technologies.

Olson, Erik D.↗

Monitoring by Use of Clusters of Sensor-Data Vectors

The inductive monitoring system (IMS) is a system of computer hardware and software for automated monitoring of the performance, operational condition, physical integrity, and other aspects of the health of a complex engineering system (e.g., an industrial process line or a spacecraft). The input to the IMS consists of streams of digitized readings from sensors in the monitored system. The IMS determines the type and amount of any deviation of the monitored system from a nominal or normal ( healthy ) condition on the basis of a comparison between (1) vectors constructed from the incoming sensor data and (2) corresponding vectors in a database of nominal or normal behavior. The term inductive reflects the use of a process reminiscent of traditional mathematical induction to learn about normal operation and build the nominal-condition database. The IMS offers two major advantages over prior computational monitoring systems: The computational burden of the IMS is significantly smaller, and there is no need for abnormal-condition sensor data for training the IMS to recognize abnormal conditions. The figure schematically depicts the relationships among the computational processes effected by the IMS. Training sensor data are gathered during normal operation of the monitored system, detailed computational simulation of operation of the monitored system, or both. The training data are formed into vectors that are used to generate the database. The vectors in the database are clustered into regions that represent normal or nominal operation. Once the database has been generated, the IMS compares the vectors of incoming sensor data with vectors representative of the clusters. The monitored system is deemed to be operating normally or abnormally, depending on whether the vector of incoming sensor data is or is not, respectively, sufficiently close to one of the clusters. For this purpose, a distance between two vectors is calculated by a suitable metric (e.g., Euclidean distance) and "sufficiently close" signifies lying at a distance less than a specified threshold value. It must be emphasized that although the IMS is intended to detect off-nominal or abnormal performance or health, it is not necessarily capable of performing a thorough or detailed diagnosis. Limited diagnostic information may be available under some circumstances. For example, the distance of a vector of incoming sensor data from the nearest cluster could serve as an indication of the severity of a malfunction. The identity of the nearest cluster may be a clue as to the identity of the malfunctioning component or subsystem. It is possible to decrease the IMS computation time by use of a combination of cluster-indexing and -retrieval methods. For example, in one method, the distances between each cluster and two or more reference vectors can be used for the purpose of indexing and retrieval. The clusters are sorted into a list according to these distance values, typically in ascending order of distance. When a set of input data arrives and is to be tested, the data are first arranged as an ordered set (that is, a vector). The distances from the input vector to the reference points are computed. The search of clusters from the list can then be limited to those clusters lying within a certain distance range from the input vector; the computation time is reduced by not searching the clusters at a greater distance.

Iverson, David L.↗

The use of multigrid techniques in the solution of the Elrod algorithm for a dynamically loaded journal bearing

A numerical solution to a theoretical model of vapor cavitation in a dynamically loaded journal bearing is developed, utilizing a multigrid iterative technique. The code is compared with a presently existing direct solution in terms of computational time and accuracy. The model is based on the Elrod algorithm, a control volume approach to the Reynolds equation which mimics the Jakobssen-Floberg and Olsson cavitation theory. Besides accounting for a moving cavitation boundary and conservation of mass at the boundary, it also conserves mass within the cavitated region via liquid striations. The mixed nature of the equations (elliptic in the full film zone and nonelliptic in the cavitated zone) coupled with the dynamic aspects of the problem create interesting difficulties for the present solution approach. Emphasis is placed on the methods found to eliminate solution instabilities. Excellent results are obtained for both accuracy and reduction of computational time.

Woods, Claudia M.↗

Simulation of Satellite, Airborne and Terrestrial LiDAR with DART (I):Waveform Simulation with Quasi-Monte Carlo Ray Tracing

Light Detection And Ranging (LiDAR) provides unique data on the 3-D structure of atmosphere constituents and the Earth's surface. Simulating LiDAR returns for different laser technologies and Earth scenes is fundamental for evaluating and interpreting signal and noise in LiDAR data. Different types of models are capable of simulating LiDAR waveforms of Earth surfaces. Semi-empirical and geometric models can be imprecise because they rely on simplified simulations of Earth surfaces and light interaction mechanisms. On the other hand, Monte Carlo ray tracing (MCRT) models are potentially accurate but require long computational time. Here, we present a new LiDAR waveform simulation tool that is based on the introduction of a quasi-Monte Carlo ray tracing approach in the Discrete Anisotropic Radiative Transfer (DART) model. Two new approaches, the so-called "box method" and "Ray Carlo method", are implemented to provide robust and accurate simulations of LiDAR waveforms for any landscape, atmosphere and LiDAR sensor configuration (view direction, footprint size, pulse characteristics, etc.). The box method accelerates the selection of the scattering direction of a photon in the presence of scatterers with non-invertible phase function. The Ray Carlo method brings traditional ray-tracking into MCRT simulation, which makes computational time independent of LiDAR field of view (FOV) and reception solid angle. Both methods are fast enough for simulating multi-pulse acquisition. Sensitivity studies with various landscapes and atmosphere constituents are presented, and the simulated LiDAR signals compare favorably with their associated reflectance images and Laser Vegetation Imaging Sensor (LVIS) waveforms. The LiDAR module is fully integrated into DART, enabling more detailed simulations of LiDAR sensitivity to specific scene elements (e.g., atmospheric aerosols, leaf area, branches, or topography) and sensor configuration for airborne or satellite LiDAR sensors.

Gastellu-Etchegorry, Jean-Philippe↗