Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 829 records · Page 46

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↗

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.↗

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↗

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↗

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↗

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↗

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↗

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↗

Adaptive Multiresolution or Adaptive Mesh Refinement? A Case Study for 2D Euler Equations

We present adaptive multiresolution (MR) computations of the two-dimensional compressible Euler equations for a classical Riemann problem. The results are then compared with respect to accuracy and computational efficiency, in terms of CPU time and memory requirements, with the corresponding finite volume scheme on a regular grid. For the same test-case, we also perform computations using adaptive mesh refinement (AMR) imposing similar accuracy requirements. The results thus obtained are compared in terms of computational overhead and compression of the computational grid, using in addition either local or global time stepping strategies. We preliminarily conclude that the multiresolution techniques yield improved memory compression and gain in CPU time with respect to the adaptive mesh refinement method.

97 MATHEMATICS AND COMPUTING↗

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.↗

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.↗

Fast Computational Algorithms for Partial Differential Equations and Uncertainty Quantifications

This project concerned the construction, testing and analysis of computational algorithms for solving parameterized and stochastic partial differential equations. The study and understanding of equations of this type is of fundamental importance in numerous engineering and scientific applications. Examples include simulation of plasma dynamics in models of electric propulsion and nuclear fusion, simulation of multiphase flows, such as the flow of water, gas and oil in reservoirs, and structural analysis of the dependence of structures on materials. Parametrization is used in such settings when properties of the models such as viscosity of fluids or electric resistivity of materials are not precisely understood and instead are treated as random variables. The resulting solutions are themselves random, and having such solutions will enable engineers to use probabilistic methods to assess the likelihood of events, for example, whether a pollutant in a liquid will exceed a limit, and to use such analyses to develop ways to ensure positive outcomes. Construction of accurate (high resolution) computational solutions is expensive, requiring significant computer time and computational resources, and there is need to reduce computational cost to make simulation useful and effective. The aim of the project was to construct algorithms to efficiently compute surrogate solutions to parameterized problems to allow for efficient and accurate simulation. The technical approach used focused on two related strategies, based on rank-reduction methods and reduced-order models. These methods construct surrogate solutions of parameter-dependent models by projection or interpolation into low-dimensional approximation spaces. Cost savings are achieved if the low-dimensional spaces can be identified and constructed efficiently and if the resulting low-dimensional algebraic systems can be solved cheaply. Accomplishments include: Theoretical and empirical demonstration of the effectiveness of fast multigrid solution strategies for computing low-rank representations of parameter-dependent solutions to discrete partial differential equations, including the first proof establishing so-called textbook convergence properties for low-rank methods. Development of efficient solution algorithms for solving nonlinear parameter-dependent partial differential equations used in models of fluid dynamics. Developent of efficient algorithms for low-rank representation of solutions of time-dependent simulations of fluid dynamics using multi-dimensional tensor representations of solutions.

97 MATHEMATICS AND COMPUTING↗

Tools for Accurate and Efficient Analysis of Complex Evolutionary Mechanisms in Microbial Genomes (Final Report)

I proposed to develop computationally efficient tools for accurate detection and reconstruction of microbes' complex evolutionary mechanisms, thus enabling rapid and accurate annotation, analysis and understanding of their genomes. To achieve this goal, I proposed to address three aspects. (1) Mathematical modeling. A major challenge facing the accurate detection of HGT is that of distinguishing between these two events on the one hand and other events that have similar "effects." I proposed to develop a novel mathematical approach for distinguishing among these events. Further, I proposed to develop a set of novel optimization criteria for the evolutionary analysis of microbial genomes in the presence of these complex evolutionary events. (2) Algorithm design. In this aspect of the project, I proposed to develop an array of efficient and accurate algorithms for analyzing microbial genomes based on the formulated optimization criteria. Further, I proposed to test the viability of the criteria and the accuracy of the algorithms in an experimental setting using both synthetic as well as biological data. (3) Software development. I proposed the final outcome to be a suite of software tools which implements the mathematical models as well as the algorithms developed.

59 BASIC BIOLOGICAL SCIENCES↗

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.↗

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.↗

High Performance Computing - Power Application Programming Interface Specification

Achieving practical exascale supercomputing will require massive increases in energy efficiency. The bulk of this improvement will likely be derived from hardware advances such as improved semiconductor device technologies and tighter integration, hopefully resulting in more energy efficient computer architectures. Still, software will have an important role to play. With every generation of new hardware, more power measurement and control capabilities are exposed. Many of these features require software involvement to maximize feature benefits. This trend will allow algorithm designers to add power and energy efficiency to their optimization criteria. Similarly, at the system level, opportunities now exist for energy-aware scheduling to meet external utility constraints such as time of day cost charging and power ramp rate limitations. Finally, future architectures might not be able to operate all components at full capability for a range of reasons including temperature considerations or power delivery limitations. Software will need to make appropriate choices about how to allocate the available power budget given many, sometimes conflicting considerations.

97 MATHEMATICS AND COMPUTING↗

An efficient method to estimate the probability density of seismic Green's functions

We present a computationally efficient method to approximate the probability distribution of seismic Green's functions given the uncertainty of an Earth model. The method is based on the Karhunen-Loève (KL) theorem and an approximation of the Green's function (or seismogram) covariance. Using Monte Carlo (MC) simulations as a control case, we demonstrate that our KL-based method can accurately reproduce a probability distribution of seismograms that results from an uncertain Earth model for a MC-derived seismogram covariance. We then describe a method to estimate the covariance of the seismograms resulting from those Earth models that is not based on MC simulations. We use the estimated Green's function covariance in conjunction with our KL-based method to produce a Green's function probability distribution, and compare that distribution to a Green's function probability distribution produced using a MC finite difference method. We find that the Green's function probability distribution approximated using our KL-based method generally mimics that produced using the MC simulations, especially for direct-arriving body waves. However the accuracy of the KL-based method generally decreases for later times in the simulated Green's function distribution.

58 GEOSCIENCES↗

A Homotopy-Based Method for Robust Computation of Controlling Unstable Equilibrium Points

This paper proposes a homotopy-based method for efficiently computing and precisely determining controlling unstable equilibrium points (CUEPs) in transient stability analysis and screening using direct methods. The proposed method is intended to overcome potential numerical convergence problems associated with computing CUEPs. These convergence problems are mostly due to irregularities in the region of convergence of CUEPs which make it difficult to determine suitable initial points. The most commonly used initial points in computing CUEPs are minimum gradient points (MGPs) on the stability boundary which in turn rely on the determination of exit points (EPs-points at which sustained-fault trajectories exit system stability boundaries). However, determination of MGPs and EPs are computationally involved and sophisticated numerical methods have been introduced such as stability-boundary-following procedure and shadowing method to correct the solution trajectory. The proposed method does not depend on MGPs and also does not require accurate EPs. The proposed method maps the solution from EPs to the CUEPs. The proposed method is applied on several known systems including the NE 39 bus system and the reduced WECC system and the results are provided. The results are compared with the traditional methods such as Boundary of stability region based CUEP method (BCU method).

42 ENGINEERING↗