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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 289 records · Page 16

All sources NASA NTRS DOE OSTI

NASA NTRS1989

Computational analysis of a stability robustness margin for structured real-parameter perturbations

An efficient computational method is presented for stability robustness analysis with structured real-parameter perturbations. A generic model of a class of uncertain dynamical systems is used as an example. The parameter uncertainty is characterized by a real scalar, epsilon. Multilinearity of the closed-loop characteristic polynomial is exploited to permit application of the mapping theorem to calculate the stability robustness margin. It is found that sensitive geometry of the stability boundary in the epsilon, omega-plane renders problematic the calculation of the minimum epsilon as a function of omega. This difficulty is avoided by calculating the minimum distance to the image of the uncertainty domain over omega as a function of epsilon. It is also shown that a certain class of uncertain dynamical systems has the required multilinearity property and are thus amenable to the proposed technique.

Wedell, Evan↗

NASA NTRS1991

Efficiency and discrepancy in the direct simulation methods

The paper reviews the factors that affect the versatility, computational efficiency, and accuracy of the various direct simulation methods that are being applied to problems in rarefied gas dynamics. The influence of computer hardware developments on the cost-effectiveness is discussed, as are the software factors that influence the speed with which simulation programs can be applied to new problems. Particular attention is given to a novel method that improves the efficiency of the simulation for complex 3D problems. The topical issues of reduced resolution procedures, stored lists, and variance reduction schemes are discussed in some detail.

Bird, G. A.↗

NASA NTRS1983

Computational methods for aerodynamic design using numerical optimization

Five methods to increase the computational efficiency of aerodynamic design using numerical optimization, by reducing the computer time required to perform gradient calculations, are examined. The most promising method consists of drastically reducing the size of the computational domain on which aerodynamic calculations are made during gradient calculations. Since a gradient calculation requires the solution of the flow about an airfoil whose geometry was slightly perturbed from a base airfoil, the flow about the base airfoil is used to determine boundary conditions on the reduced computational domain. This method worked well in subcritical flow.

Peeters, M. F.↗

NASA NTRS1994

Convergence rate enhancement of navier-stokes codes on clustered grids

Our Sensitivity-Based Minimal Residual (SBMR) method which is based on our earlier Distributed Minimal Residual (DMR) method allows each component of the solution vector in a system of equations to have its own convergence speed. Our global SBMR method was found to consistently outperform the DMR method while requiring considerably less computer memory. Recently, we have developed and tested a new Line SBMR or LSBMR method and a Time-Step-Scaling (TSS) method that are even more robust and computationally efficient than our global SBMR method, especially on highly clustered computational grids in laminar and turbulent flow computations.

Choi, Kwang-Yoon↗

NASA NTRS1994

Structural optimization with approximate sensitivities

Computational efficiency in structural optimization can be enhanced if the intensive computations associated with the calculation of the sensitivities, that is, gradients of the behavior constraints, are reduced. Approximation to gradients of the behavior constraints that can be generated with small amount of numerical calculations is proposed. Structural optimization with these approximate sensitivities produced correct optimum solution. Approximate gradients performed well for different nonlinear programming methods, such as the sequence of unconstrained minimization technique, method of feasible directions, sequence of quadratic programming, and sequence of linear programming. Structural optimization with approximate gradients can reduce by one third the CPU time that would otherwise be required to solve the problem with explicit closed-form gradients. The proposed gradient approximation shows potential to reduce intensive computation that has been associated with traditional structural optimization.

Patnaik, S. N.↗

NASA NTRS2016

Visual Odometry for Autonomous Deep-Space Navigation Project

Autonomous rendezvous and docking (AR&D) is a critical need for manned spaceflight, especially in deep space where communication delays essentially leave crews on their own for critical operations like docking. Previously developed AR&D sensors have been large, heavy, power-hungry, and may still require further development (e.g. Flash LiDAR). Other approaches to vision-based navigation are not computationally efficient enough to operate quickly on slower, flight-like computers. The key technical challenge for visual odometry is to adapt it from the current terrestrial applications it was designed for to function in the harsh lighting conditions of space. This effort leveraged Draper Laboratory’s considerable prior development and expertise, benefitting both parties. The algorithm Draper has created is unique from other pose estimation efforts as it has a comparatively small computational footprint (suitable for use onboard a spacecraft, unlike alternatives) and potentially offers accuracy and precision needed for docking. This presents a solution to the AR&D problem that only requires a camera, which is much smaller, lighter, and requires far less power than competing AR&D sensors. We have demonstrated the algorithm’s performance and ability to process ‘flight-like’ imagery formats with a ‘flight-like’ trajectory, positioning ourselves to easily process flight data from the upcoming ‘ISS Selfie’ activity and then compare the algorithm’s quantified performance to the simulated imagery. This will bring visual odometry beyond TRL 5, proving its readiness to be demonstrated as part of an integrated system.Once beyond TRL 5, visual odometry will be poised to be demonstrated as part of a system in an in-space demo where relative pose is critical, like Orion AR&D, ISS robotic operations, asteroid proximity operations, and more.

Robinson, Shane↗

NASA NTRS2016

Visual Odometry for Autonomous Deep-Space Navigation Project

Autonomous rendezvous and docking (AR&D) is a critical need for manned spaceflight, especially in deep space where communication delays essentially leave crews on their own for critical operations like docking. Previously developed AR&D sensors have been large, heavy, power-hungry, and may still require further development (e.g. Flash LiDAR). Other approaches to vision-based navigation are not computationally efficient enough to operate quickly on slower, flight-like computers. The key technical challenge for visual odometry is to adapt it from the current terrestrial applications it was designed for to function in the harsh lighting conditions of space. This effort leveraged Draper Laboratory's considerable prior development and expertise, benefitting both parties. The algorithm Draper has created is unique from other pose estimation efforts as it has a comparatively small computational footprint (suitable for use onboard a spacecraft, unlike alternatives) and potentially offers accuracy and precision needed for docking. This presents a solution to the AR&D problem that only requires a camera, which is much smaller, lighter, and requires far less power than competing AR&D sensors. We have demonstrated the algorithm's performance and ability to process 'flight-like' imagery formats with a 'flight-like' trajectory, positioning ourselves to easily process flight data from the upcoming 'ISS Selfie' activity and then compare the algorithm's quantified performance to the simulated imagery. This will bring visual odometry beyond TRL 5, proving its readiness to be demonstrated as part of an integrated system. Once beyond TRL 5, visual odometry will be poised to be demonstrated as part of a system in an in-space demo where relative pose is critical, like Orion AR&D, ISS robotic operations, asteroid proximity operations, and more.

Robinson, Shane↗

NASA NTRSDate not supplied

Validation of Cryogenic Propellant Tank Self-Pressurization

NASA’s near-future long-term space missions necessitate advancements in cryogenic fluid management (CFM), which includes safe and reliable long-term propellant storage. Consequently, NASA STMD (Space Technology Mission Directorate) has established the CFM Portfolio Project to improve CFM technologies for upcoming missions. As a part of CFM Modeling Portfolio, NASA Marshall Space Flight Center’s (MSFC) Fluid Dynamics branch within the Propulsion Systems Department is tasked with assessing and improving computational tools used to support flight projects such as Human Lander System and Commercial Lunar Payload Services. One of the challenging modeling problems is that of self-pressurization of propellant tank due to heat leakage over long time periods. Reduced order and nodal tools find it extremely difficult to accurately predict self-pressurization under transient conditions or where complex flow patterns or thermal gradients exist, and application of 3-D CFD (computational fluid dynamics) simulations is necessary to characterize these problems. Until recently, CFD simulations for these long-term processes (order of hours or days) have been too impractical to conduct due to prohibitive wall time and computational resource requirements. The requisite CFD tool need to be efficient, computationally scalable, modular with ability to incorporate various physics models, and robust enough to not accumulate conservation errors over several hours of simulated time. NASA MSFC’s Loci-Stream CFD tool along with the VOF module is a great candidate to fit this mold. In this paper, we validate Loci-Stream for predicting self-pressurization of a flight scale propellant tank so it can serve as a reliable design and analysis tool for NASA’s CFM application needs. Liquid hydrogen tank pressurization tests carried out at the K-site testing facility provide a reliable data set for this purpose. These tests were simulated using Loci-Stream solver with VOF module as well as a hybrid approach which uses a lumped model for the ullage gas domain and CFD simulation of the liquid propellant. Both are shown to have very good predictive capabilities over multiple K-site experiments.

Hong Q. Yang↗

NASA NTRSDate not supplied

Validation of Cryogenic Propellant Tank Self-Pressurization

NASA's near-future long-term space missions necessitate advancements in cryogenic fluid management (CFM), which includes safe and reliable long-term propellant storage. Consequently, NASA STMD (Space Technology Mission Directorate) has established the CFM Portfolio Project to improve CFM technologies for upcoming missions. As a part of CFM Modeling Portfolio, NASA Marshall Space Flight Center's (MSFC) Fluid Dynamics branch within the Propulsion Systems Department is tasked with assessing and improving computational tools used to support flight projects such as Human Lander System and Commercial Lunar Payload Services. One of the challenging modeling problems is that of self-pressurization of propellant tank due to heat leakage over long time periods. Reduced order and nodal tools find it extremely difficult to accurately predict self-pressurization under transient conditions or where complex flow patterns or thermal gradients exist, and application of 3-D CFD (computational fluid dynamics) simulations is necessary to characterize these problems. Until recently, CFD simulations for these long-term processes (order of hours or days) have been too impractical to conduct due to prohibitive wall time and computational resource requirements. The requisite CFD tool need to be efficient, computationally scalable, modular with ability to incorporate various physics models, and robust enough to not accumulate conservation errors over several hours of simulated time. NASA MSFC's Loci-Stream CFD tool along with the VOF module is a great candidate to fit this mold. In this paper, we validate Loci-Stream for predicting self-pressurization of a flight scale propellant tank so it can serve as a reliable design and analysis tool for NASA's CFM application needs. Liquid hydrogen tank pressurization tests carried out at the K-site testing facility provide a reliable data set for this purpose. These tests were simulated using Loci-Stream solver with VOF module as well as a hybrid approach which uses a lumped model for the ullage gas domain and CFD simulation of the liquid propellant. Both are shown to have very good predictive capabilities over multiple K-site experiments.

cryogenic fluid management↗

NASA NTRS1985

Towards developing robust algorithms for solving partial differential equations on MIMD machines

Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are proposed. These techniques reorganize the data dependency patterns to improve the processor utilization. The model problem finds the time-accurate solution to a parabolic partial differential equation discretized in space and implicitly marched forward in time. The algorithms are extensions of Jacobi and SOR. The extensions consist of iterating over a window of several timesteps, allowing efficient overlap of computation with communication. The methods increase the degree to which work can be performed while data are communicated between processors. The effect of the window size and of domain partitioning on the system performance is examined both by implementing the algorithm on a simulated multiprocessor system.

Saltz, J. H.↗

NASA NTRS1988

Towards developing robust algorithms for solving partial differential equations on MIMD machines

Saltz, Joel H.↗

NASA NTRS1990

Efficiency and discrepancy in the direct simulation methods

The paper reviews the factors that affect the versatility, computational efficiency, and accuracy of the various direct simulation methods that are being applied to problems in rarefied gas dynamics. The quality of the simulation can be affected by the underlying motivation and objectives. The influence of computer hardware developments on the cost-effectiveness is discussed, as are the software factors that influence the speed with which simulation programs can be applied to new problems. Particular attention is given to a novel method that improves the efficiency of the simulation for complex three-dimensional problems. The topical issues of reduced resolution procedures, stored lists, and variance reduction schemes are discussed in some detail.

Bird, G. A.↗

NASA NTRS1973

Fast modal extraction in NASTRAN via the FEER computer program

A new eigensolution routine, FEER (Fast Eigensolution Extraction Routine), used in conjunction with NASTRAN at Israel Aircraft Industries is described. The FEER program is based on an automatic matrix reduction scheme whereby the lower modes of structures with many degrees of freedom can be accurately extracted from a tridiagonal eigenvalue problem whose size is of the same order of magnitude as the number of required modes. The process is effected without arbitrary lumping of masses at selected node points or selection of nodes to be retained in the analysis set. The results of computational efficiency studies are presented, showing major arithmetic operation counts and actual computer run times of FEER as compared to other methods of eigenvalue extraction, including those available in the NASTRAN READ module. It is concluded that the tridiagonal reduction method used in FEER would serve as a valuable addition to NASTRAN for highly increased efficiency in obtaining structural vibration modes.

Newman, M. B.↗

NASA NTRS1991

Adaptive Grids For Computations Of Three-Dimensional Flows

Self-adaptive-grid method devised and enhanced for efficient computation of complicated three-dimensional flows. Extension of method developed for two-dimensional flows. Fictitious springs connecting points of computational grid used to determine optimum grid spacing. Each point connected to neighboring points by tension and torsion springs. Stiffnesses of tension springs related to flow-field quantities. Stiffnesses of torsion springs resist departure of grid from orthogonality.

Djomehri, M. Jahed↗

NASA NTRS1997

Efficient High-Pressure State Equations

A method is presented for a relatively accurate, noniterative, computationally efficient calculation of high-pressure fluid-mixture equations of state, especially targeted to gas turbines and rocket engines. Pressures above I bar and temperatures above 100 K are addressed The method is based on curve fitting an effective reference state relative to departure functions formed using the Peng-Robinson cubic state equation Fit parameters for H2, O2, N2, propane, methane, n-heptane, and methanol are given.

Harstad, Kenneth G.↗

NASA NTRS1993

Time-domain analysis of planar microstrip devices using a generalized Yee-algorithm based on unstructured grids

The generalized Yee-algorithm is presented for the temporal full-wave analysis of planar microstrip devices. This algorithm has the significant advantage over the traditional Yee-algorithm in that it is based on unstructured and irregular grids. The robustness of the generalized Yee-algorithm is that structures that contain curved conductors or complex three-dimensional geometries can be more accurately, and much more conveniently modeled using standard automatic grid generation techniques. This generalized Yee-algorithm is based on the the time-marching solution of the discrete form of Maxwell's equations in their integral form. To this end, the electric and magnetic fields are discretized over a dual, irregular, and unstructured grid. The primary grid is assumed to be composed of general fitted polyhedra distributed throughout the volume. The secondary grid (or dual grid) is built up of the closed polyhedra whose edges connect the centroid's of adjacent primary cells, penetrating shared faces. Faraday's law and Ampere's law are used to update the fields normal to the primary and secondary grid faces, respectively. Subsequently, a correction scheme is introduced to project the normal fields onto the grid edges. It is shown that this scheme is stable, maintains second-order accuracy, and preserves the divergenceless nature of the flux densities. Finally, for computational efficiency the algorithm is structured as a series of sparse matrix-vector multiplications. Based on this scheme, the generalized Yee-algorithm has been implemented on vector and parallel high performance computers in a highly efficient manner.

Gedney, Stephen D.↗

NASA NTRS1983

Enhancement of the CAVE computer code

The computer code CAVE (Conduction Analysis via Eigenvalues) is a convenient and efficient computer code for predicting two dimensional temperature histories within thermal protection systems for hypersonic vehicles. The capabilities of CAVE were enhanced by incorporation of the following features into the code: real gas effects in the aerodynamic heating predictions, geometry and aerodynamic heating package for analyses of cone shaped bodies, input option to change from laminar to turbulent heating predictions on leading edges, modification to account for reduction in adiabatic wall temperature with increase in leading sweep, geometry package for two dimensional scramjet engine sidewall, with an option for heat transfer to external and internal surfaces, print out modification to provide tables of select temperatures for plotting and storage, and modifications to the radiation calculation procedure to eliminate temperature oscillations induced by high heating rates. These new features are described.

Rathjen, K. A.↗

NASA NTRS1990

Predicting performance of parallel computations

An accurate and computationally efficient method for predicting the performance of a class of parallel computations running on concurrent systems is described. A parallel computation is modeled as a task system with precedence relationships expressed as a series-parallel directed acyclic graph. Resources in a concurrent system are modeled as service centers in a queuing network model. Using these two models as inputs, the method outputs predictions of expected execution time of the parallel computation and the concurrent system utilization. The method is validated against both detailed simulation and actual execution on a commercial multiprocessor. Using 100 test cases, the average error of the prediction when compared to simulation statistics is 1.7 percent, with a standard deviation of 1.5 percent; the maximum error is about 10 percent.

Mak, Victor W.↗