Search NASA⌕ Search

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.

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

At least 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
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↗
DOE OSTI2025

Integrating Analytical Solutions and U-Net Model for Predicting Groundwater Contaminant Plumes in Pump-and-Treat Systems

Pump-and-treat (P&T) is a common technique for groundwater remediation involving the extraction and treatment of contaminated water above ground. Optimizing the design and operation of the P&T well network is essential for maximizing the system’s effectiveness and efficiency. However, this optimization often necessitates many model evaluations, leading to computationally demanding tasks. This study introduces a novel approach that integrates analytical solutions for groundwater dynamics with the U-Net (Ronneberger et al., 2015) deep learning framework to predict groundwater contaminant plume migration under dynamic pumping conditions. By incorporating the Thiem equation (Thiem, 1906) into the input preprocessing, the U-Net model transforms sparse well data into a continuous spatial field that captures the hydraulic impacts of pumping activities. This integration enables the model to leverage both deep learning capabilities and classical physics-based groundwater theories, enhancing prediction accuracy and computational efficiency. These advancements can facilitate rapid, large-scale evaluations of P&T optimization simulations, allowing for timely and effective decision-making in well placement and system management. We demonstrate the model's robust performance across both simplified transient 2D models and a more complex 3D heterogeneous site model at the 200 West P&T facility at the Hanford Site. The U-Net-based model offers substantial computational advantages, reducing simulation times significantly compared to full physics-based models and providing a powerful tool for rapid site evaluation and P&T system optimization, such as evaluating alternative P&T well network designs. Our findings highlight the potential of advanced machine learning models to significantly enhance the efficiency and sustainability of groundwater remediation efforts, offering a novel application of U-Net architecture in environmental science.

Pump-and-treat↗
DOE OSTI2026

Second-order wave excitation forces in WEC-Sim/MOST: Implementation, experimental validation, and code-to-code comparison

Accurate prediction of second-order hydrodynamic loads is essential for floating bodies, including floating offshore wind turbines, wave energy converters, and hybrid wind–wave platforms. These nonlinear effects, arising from both sum- and difference-frequency forcing, are critical for capturing key response characteristics but remain challenging to model efficiently. In this work, we extend the open-source Wave Energy Converter Simulator / MATLAB for Offshore Simulation Tool by implementing second-order wave excitation forces, supporting both the full Quadratic Transfer Function formulation and the Newman approximation. The full Quadratic Transfer Function method is used for all code-to-code comparisons and experimental validation, while the Newman approximation is provided as a computationally lighter alternative. To benchmark the new capability, we perform a code-to-code comparison with OpenFAST and OrcaFlex. We then validate the enhanced model using wave-tank measurements of a 1:96 scale DeepCwind semi-submersible, showing that second-order effects are required to reproduce platform motions. The implementation employs a computationally efficient pre-computation strategy for second-order wave excitation forces, reducing simulation cost while maintaining engineering accuracy. Overall, this work advances the tool as an open-source and versatile tool for modelling floating offshore renewable-energy systems requiring second-order hydrodynamic fidelity.

17 WIND ENERGY↗
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

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, 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.↗
DOE OSTI2025

Desmearing two-dimensional small-angle neutron scattering data by central moment expansions

Resolution smearing is a critical challenge in the quantitative analysis of two-dimensional small-angle neutron scattering (SANS) data, particularly in studies of soft-matter flow and deformation using SANS. Here, we present a central moment expansion technique to address smearing in anisotropic scattering spectra, offering a model-free desmearing methodology. By accounting for directional variations in resolution smearing and enhancing computational efficiency, this approach reconstructs desmeared intensity distributions from smeared experimental data. Computational benchmarks using interacting hard-sphere fluids and Gaussian chain models validate the accuracy of the method, while simulated noise analyses confirm its robustness under experimental conditions. Experimental validation using rheological SANS data from shear-induced micellar structures demonstrates the practicality and effectiveness of the proposed algorithm. The desmearing technique provides a powerful tool for advancing the quantitative analysis of anisotropic scattering patterns, enabling precise insights into the interplay between material microstructure and macroscopic flow behavior.

anisotropic scattering spectra↗
DOE OSTI2025

Emerging applications: Neuromorphic computing and reservoir computing

The emergence of doped hafnium oxide (HfO 2 )-based ferroelectric films has enabled highly scalable and silicon-compatible ferroelectric devices, opening new frontiers in neuromorphic and reservoir computing. Among these, ferroelectric field-effect transistors (FeFETs) are particularly promising due to their analog memory characteristics and unique polarization dynamics. These properties make FeFETs ideal candidates for artificial synapses in neuromorphic architectures, supporting deep neural networks and spiking neural networks based on leaky-integrate-and-fire (LIF) mechanisms. Beyond neuromorphic computing, FeFETs also play a crucial role in physical reservoir computing, leveraging their intrinsic nonlinear and history-dependent behavior for efficient real-time learning. This approach offers significant advantages for time-series processing and edge artificial intelligence (AI) applications, addressing the growing need for energy-efficient computing. As a result, this article explores the principles, key demonstrations, and future potential of FeFET-based neuromorphic and reservoir computing, highlighting their impact on next-generation AI hardware.

36 MATERIALS SCIENCE↗
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.↗