Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational costs”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS1999

Optimization of Aerospace Structure Subject to Damage Tolerance Criteria

The objective of this cooperative agreement was to seek computationally efficient ways to optimize aerospace structures subject to damage tolerance criteria. Optimization was to involve sizing as well as topology optimization. The work was done in collaboration with Steve Scotti, Chauncey Wu and Joanne Walsh at the NASA Langley Research Center. Computation of constraint sensitivity is normally the most time-consuming step of an optimization procedure. The cooperative work first focused on this issue and implemented the adjoint method of sensitivity computation in an optimization code (runstream) written in Engineering Analysis Language (EAL). The method was implemented both for bar and plate elements including buckling sensitivity for the latter. Lumping of constraints was investigated as a means to reduce the computational cost. Adjoint sensitivity computation was developed and implemented for lumped stress and buckling constraints. Cost of the direct method and the adjoint method was compared for various structures with and without lumping. The results were reported in two papers. It is desirable to optimize topology of an aerospace structure subject to a large number of damage scenarios so that a damage tolerant structure is obtained. Including damage scenarios in the design procedure is critical in order to avoid large mass penalties at later stages. A common method for topology optimization is that of compliance minimization which has not been used for damage tolerant design. In the present work, topology optimization is treated as a conventional problem aiming to minimize the weight subject to stress constraints. Multiple damage configurations (scenarios) are considered. Each configuration has its own structural stiffness matrix and, normally, requires factoring of the matrix and solution of the system of equations. Damage that is expected to be tolerated is local and represents a small change in the stiffness matrix compared to the baseline (undamaged) structure. The exact solution to a slightly modified set of equations can be obtained from the baseline solution economically without actually solving the modified system. Sherrnan-Morrison-Woodbury (SMW) formulas are matrix update formulas that allow this. SMW formulas were therefore used here to compute adjoint displacements for sensitivity computation and structural displacements in damaged configurations.

Akgun, Mehmet A.↗
NASA NTRS2000

Adjoint Techniques for Topology Optimization of Structures Under Damage Conditions

The objective of this cooperative agreement was to seek computationally efficient ways to optimize aerospace structures subject to damage tolerance criteria. Optimization was to involve sizing as well as topology optimization. The work was done in collaboration with Steve Scotti, Chauncey Wu and Joanne Walsh at the NASA Langley Research Center. Computation of constraint sensitivity is normally the most time-consuming step of an optimization procedure. The cooperative work first focused on this issue and implemented the adjoint method of sensitivity computation (Haftka and Gurdal, 1992) in an optimization code (runstream) written in Engineering Analysis Language (EAL). The method was implemented both for bar and plate elements including buckling sensitivity for the latter. Lumping of constraints was investigated as a means to reduce the computational cost. Adjoint sensitivity computation was developed and implemented for lumped stress and buckling constraints. Cost of the direct method and the adjoint method was compared for various structures with and without lumping. The results were reported in two papers (Akgun et al., 1998a and 1999). It is desirable to optimize topology of an aerospace structure subject to a large number of damage scenarios so that a damage tolerant structure is obtained. Including damage scenarios in the design procedure is critical in order to avoid large mass penalties at later stages (Haftka et al., 1983). A common method for topology optimization is that of compliance minimization (Bendsoe, 1995) which has not been used for damage tolerant design. In the present work, topology optimization is treated as a conventional problem aiming to minimize the weight subject to stress constraints. Multiple damage configurations (scenarios) are considered. Each configuration has its own structural stiffness matrix and, normally, requires factoring of the matrix and solution of the system of equations. Damage that is expected to be tolerated is local and represents a small change in the stiffness matrix compared to the baseline (undamaged) structure. The exact solution to a slightly modified set of equations can be obtained from the baseline solution economically without actually solving the modified system.. Shennan-Morrison-Woodbury (SMW) formulas are matrix update formulas that allow this (Akgun et al., 1998b). SMW formulas were therefore used here to compute adjoint displacements for sensitivity computation and structural displacements in damaged configurations.

Akgun, Mehmet A.↗
NASA NTRSDate not supplied

Low-cost Quantification of Fluid Flow Parameter Sensitivity using Reduced-order Modeling

Uncertainty quantification of computational fluid dynamics (CFD) simulations is a complicated procedure which still relies in many cases on engineering judgment and factors of safety. This is in part because the computational cost of measuring the simulation's sensitivity to all meaningful parameters (e.g., body surface roughness) and hyperparameters (e.g., subiteration convergence criterion) is intractable for even a single simulation. Reduced-order modeling dramatically lowers this computational cost of simulating fluid flows, but usually only where similar data is already available. In this work, fluid reduced-order models are utilized to quantify a flow's sensitivity to certain physical parameters for the purposes of improved uncertainty quantification. Characteristic observability and sensitivity are both explored. The resulting sensitivity quantifications enable more informed CFD frameworks and more rigorous uncertainty bounds on the resulting data.

uncertainty quantification↗
NASA NTRSDate not supplied

Low-cost Quantification of Fluid Flow Parameter Sensitivity using Reduced-order Modeling

Uncertainty quantification of computational fluid dynamics (CFD) simulations is a complicated procedure which still relies in many cases on engineering judgment and factors of safety. This is in part because the computational cost of measuring the simulation's sensitivity to all meaningful parameters (e.g., body surface roughness) and hyperparameters (e.g., subiteration convergence criterion) is intractable for even a single simulation. Reduced-order modeling dramatically lowers this computational cost of simulating fluid flows, but usually only where similar data is already available. In this work, fluid reduced-order models are utilized to quantify a flow's sensitivity to certain physical parameters for the purposes of improved uncertainty quantification. Characteristic observability and sensitivity are both explored. The resulting sensitivity quantifications enable more informed CFD frameworks and more rigorous uncertainty bounds on the resulting data.

uncertainty quantification↗
DOE OSTI2024

Impact of Momentum Perturbation on Convective Boundary Layer Turbulence

Mesoscale-to-microscale coupling is an important tool for conducting turbulence-resolving multiscale simulations of realistic atmospheric flows, which are crucial for applications ranging from wind energy to wildfire spread studies. Different techniques are used to facilitate the development of realistic turbulence in the large-eddy simulation (LES) domain while minimizing computational cost. Here, we explore the impact of a simple and computationally efficient Stochastic Cell Perturbation method using momentum perturbation (SCPM-M) to accelerate turbulence generation in boundary-coupled LES simulations using the Weather Research and Forecasting model. We simulate a convective boundary layer (CBL) to characterize the production and dissipation of turbulent kinetic energy (TKE) and the variation of TKE budget terms. Furthermore, we evaluate the impact of applying momentum perturbations of three magnitudes below, up to, and above the CBL on the TKE budget terms. Momentum perturbations greatly reduce the fetch associated with turbulence generation. When applied to half the vertical extent of the boundary layer, momentum perturbations produce an adequate amount of turbulence. However, when applied above the CBL, additional structures are generated at the top of the CBL, near the inversion layer. The magnitudes of the TKE budgets produced by SCPM-M when applied at varying heights and with different perturbation amplitudes are always higher near the surface and inversion layer than those produced by No-SCPM, as are their contributions to the TKE. This study provides a better understanding of how SCPM-M reduces computational costs and how different budget terms contribute to TKE in a boundary-coupled LES simulation.

17 WIND ENERGY↗
DOE OSTI2022

Automatic Detection of Defects in High-Reliability Components

Disastrous consequences can result from defects in manufactured parts—particularly the high consequence parts developed at Sandia. Identifying flaws in as-built parts can be done with nondestructive means, such as X-ray Computed Tomography (CT). However, due to artifacts and complex imagery, the task of analyzing the CT images falls to humans. Human analysis is inherently unreproducible, unscalable, and can easily miss subtle flaws. We hypothesized that deep learning methods could improve defect identification, increase the number of parts that can effectively be analyzed, and do it in a reproducible manner. We pursued two methods: 1) generating a defect-free version of a scan and looking for differences (PandaNet), and 2) using pre-trained models to develop a statistical model of normality (Feature-based Anomaly Detection System: FADS). Both PandaNet and FADS provide good results, are scalable, and can identify anomalies in imagery. In particular, FADS enables zero-shot (training-free) identification of defects for minimal computational cost and expert time. It significantly outperforms prior approaches in computational cost while achieving comparable results. FADS’ core concept has also shown utility beyond anomaly detection by providing feature extraction for downstream tasks.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Unifying Combinatorial and Graphical Methods in Artificial Intelligence

Recently, a new graph Laplacian, called the inner product Laplacian, was introduced which generalizes many existing Laplacians, including the normalized and combinatorial Laplacian and their weighted variants. The key observation behind the inner product Laplacian is that by defining appropriate inner product spaces on the vertices and edges, the standard Laplacians can be recovered as Hodge Laplacians over the simplicial complex formed by the edges and vertices. These inner product spaces form a natural way to incorporate non-combinatorial information into the definition of a domain-specific Laplacian. In particular, in contrast to current domain-specific weighting schemes which rely solely on edge weights, information regarding the similarity of non-adjacent vertices and arbitrary pairs of edges can be effectively incorporated into the Laplacian. In order to illustrate this approach we consider the problem of calculating the potential energy of an atomistic configuration using Graph Neural Networks. In comparison with start-of-the-art approaches, such as SchNet, our approach replaces a learned (via auto-encoder) representation of the atom types with an inner product space on atoms based on scientific knowledge (e.g., electronegativity). We will illustrate how this approach captures key chemical properties of the molecules and compare the energy calculations with state-of-the-art neural network approaches. However, to compute the resulting Laplacian involves a mixture of sparse and dense matrix computation and yields a dense matrix as the basis for the graph convolution. This dense convolutional kernel necessitates moving away from the standard message passing framework for graph neural networks and increases the computational cost of applying the kernel. In order to mitigate these costs we investigate means of leveraging the mixed sparse and dense computations to reduce the overall computational cost and how these approaches can be automatically transferred to energy efficient hardware (e.g., field programmable gate arrays (FPGAs)).

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1996

A Comprehensive and Cost-Effective Computer Infrastructure for K-12 Schools

Since 1993, NASA Langley Research Center has been developing and implementing a low-cost Internet connection model, including system architecture, training, and support, to provide Internet access for an entire network of computers. This infrastructure allows local area networks which exceed 50 machines per school to independently access the complete functionality of the Internet by connecting to a central site, using state-of-the-art commercial modem technology, through a single standard telephone line. By locating high-cost resources at this central site and sharing these resources and their costs among the school districts throughout a region, a practical, efficient, and affordable infrastructure for providing scale-able Internet connectivity has been developed. As the demand for faster Internet access grows, the model has a simple expansion path that eliminates the need to replace major system components and re-train personnel. Observations of optical Internet usage within an environment, particularly school classrooms, have shown that after an initial period of 'surfing,' the Internet traffic becomes repetitive. By automatically storing requested Internet information on a high-capacity networked disk drive at the local site (network based disk caching), then updating this information only when it changes, well over 80 percent of the Internet traffic that leaves a location can be eliminated by retrieving the information from the local disk cache.

Warren, G. P.↗
NASA NTRS1982

The economics of time shared computing: Congestion, user costs and capacity

Time shared systems permit the fixed costs of computing resources to be spread over large numbers of users. However, bottleneck results in the theory of closed queueing networks can be used to show that this economy of scale will be offset by the increased congestion that results as more users are added to the system. If one considers the total costs, including the congestion cost, there is an optimal number of users for a system which equals the saturation value usually used to define system capacity.

Agnew, C. E.↗
NASA NTRS2017

Order-Reduced Solution of the Nonlinear High-Fidelity Generalized Method of Cells Micromechanics Relations

The High-Fidelity Generalized Method of Cells (HFGMC) is one technique for accurately simulating nonlinear composite material behavior. The HFGMC uses a higher-order approximation for the subcell displacement field that allows for a more accurate determination of the subcell stressstrain fields at the cost of some computational efficiency. In order to reduce computational costs associated with the solution of the ensuing system of simultaneous equations, the HFGMC global system of equations for doubly-periodic repeating unit cells with nonlinear constituents was reduced in size through the use of a Petrov-Galerkin-based Proper Orthogonal Decomposition order-reduction scheme. A number of cases were presented that address the computational feasibility of using order-reduction techniques to solve solid mechanics problems involving complex microstructures.

order-reduction↗
NASA NTRS1993

A parallelizable load balancing algorithm

We present a parallelizable load balancing algorithm for grid-based problems that employs a give and take concept among neighboring subdomains. The algorithm is found to converge very quickly to almost perfect load balance while minimizing the surface-to-volume ratio of the domains. The algorithm can be used for problems whose volume cost grows nonlinearly with the number of elements, because it measures continuously the computational cost to be incurred for each subdomain. This is an advantage over most algorithms currently in use (e.g., recursive subdivision), which assume a linear relationship between the computational cost and the number of elements.

Loehner, Rainald↗
DOE OSTI2023

Neural message-passing for objective-based uncertainty quantification and optimal experimental design

Various real-world scientific applications involve the mathematical modeling of complex uncertain systems with numerous unknown parameters. Accurate parameter estimation is often practically infeasible in such systems, as the available training data may be insufficient and the cost of acquiring additional data may be high. In such cases, based on a Bayesian paradigm, we can design robust operators retaining the best overall performance across all possible models and design optimal experiments that can effectively reduce uncertainty to enhance the performance of such operators maximally. While objective-based uncertainty quantification (objective-UQ) based on MOCU (mean objective cost of uncertainty) provides an effective means for quantifying uncertainty in complex systems, the high computational cost of estimating MOCU has been a challenge in applying it to real-world scientific/engineering problems. In this work, we propose a novel scheme to reduce the computational cost for objective-UQ via MOCU based on a data-driven approach. We adopt a neural message-passing model for surrogate modeling, incorporating a novel axiomatic constraint loss that penalizes an increase in the estimated system uncertainty. As an illustrative example, we consider the optimal experimental design (OED) problem for uncertain Kuramoto models, where the goal is to predict the experiments that can most effectively enhance robust synchronization performance through uncertainty reduction. We show that our proposed approach can accelerate MOCU-based OED by four to five orders of magnitude, without any visible performance loss compared to the state-of-the-art. The proposed approach applies to general OED tasks, beyond the Kuramoto model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Reinforcement Learning as a Parsimonious Alternative to Prediction Cascades: A Case Study on Image Segmentation

Deep learning architectures have achieved state-of-the-art (SOTA) performance on computer vision tasks such as object detection and image segmentation. This may be attributed to the use of over-parameterized, monolithic deep learning architectures executed on large datasets. Although such large architectures lead to increased accuracy, this is usually accompanied by a larger increase in computation and memory requirements during inference. While this is a non-issue in traditional machine learning (ML) pipelines, the recent confluence of machine learning and fields like the Internet of Things (IoT) has rendered such large architectures infeasible for execution in low-resource settings. For some datasets, large monolithic pipelines may be overkill for simpler inputs. To address this problem, previous efforts have proposed decision cascades where inputs are passed through models of increasing complexity until the desired performance is achieved. However, we argue that cascaded prediction leads to sub-optimal throughput and increased computational cost due to wasteful intermediate computations. To address this, we propose PaSeR (Parsimonious Segmentation with Reinforcement Learning) a non-cascading, cost-aware learning pipeline as an efficient alternative to cascaded decision architectures. Through experimental evaluation on both real-world and standard datasets, we demonstrate that PaSeR achieves better accuracy while minimizing computational cost relative to cascaded models. Further, we introduce a new metric IoU/GigaFlop to evaluate the balance between cost and performance. On the real-world task of battery material phase segmentation, PaSeR yields 179% improvement over SOTA MatPhase model and a 196% improvement over IDK Cascades under the IoU/GigaFlop metric. We also demonstrate PaSeR’s adaptability to complementary models trained on a noisy MNIST dataset, where it outperforms all baselines on IoU/GigaFlop by an average of 44%.

Srikshan, Bharat↗
DOE OSTI2025

Prototype-Wise Sensitivity Analysis of Urban Building Energy Simulation Surrogate Modeling Accuracy

Urban Building Energy Modeling (UBEM) is an important reference for urban energy-related policymaking. Because of the significant impact of urban microclimates on the energy simulation, UBEM requires simulations of many microclimate-prototype pairs. Surrogate modeling is commonly used to reduce the cost of simulation computations. In UBEM surrogate modeling, it is important to determine the percentage of microclimates related to a prototype used for generating surrogate model training data. This study analyzes the prototype-wise variations and sensitivities of surrogate model estimation accuracy to the microclimate sampling ratios. The results of the study can help determine the number of simulations used for generating surrogate modeling data, avoid redundant simulations, and reduce the computational cost for UBEM surrogate modeling and its time.

Pan, Xiyu↗
DOE OSTI2023

A Real-Time Degradation Estimation Approach for Batteries in PV and Battery Hybrid Plant Operation

Conventional cyclic degradation assessment for batteries is often limited in its ability to provide real-time degradation information during operation, because the estimation of degradation is commonly performed after a specific evaluation period. Modified methods can provide real-time evaluation but at the cost of high computation complexity. This paper proposes a novel estimation method that addresses these limitations. It efficiently determines the incremental degradation of any two consecutive state-of-charge (SOC) samples during battery operation, thus enabling real-time estimation. To validate the proposed method, measurement data from lithium-ion phosphate (LFP) battery testing was adopted, and the results were compared with the conventional model and the measured capacity. The results demonstrate accuracy over the evaluation period in terms of cumulative degradation, and a reduced computation cost compared with other methods. This approach has benefits in various applications, especially in cases where batteries experience irregular charging and discharging stress cycles such as PV and battery hybrid plants.

Wang, Shumeng↗
DOE OSTI2021

AN AUTOMATED MACHINE LEARNING-GENETIC ALGORITHM FRAMEWORK WITH ACTIVE LEARNING FOR DESIGN OPTIMIZATION

The use of machine learning (ML)-based surrogate models is a promising technique to significantly accelerate simulation-driven design optimization of internal combustion (IC) engines, due to the high computational cost of running computational fluid dynamics (CFD) simulations. However, training the ML models requires hyperparameter selection, which is often done using trial-and-error and domain expertise. Another challenge is that the data required to train these models are often unknown a priori. In this work, we present an automated hyperparameter selection technique coupled with an active learning approach to address these challenges. The technique presented in this study involves the use of a Bayesian approach to optimize the hyperparameters of the base learners that make up a super learner model. In addition to performing hyperparameter optimization (HPO), an active learning approach is employed, where the process of data generation using simulations, ML training, and surrogate optimization is performed repeatedly to refine the solution in the vicinity of the predicted optimum. The proposed approach is applied to the optimization of a compression ignition engine with control parameters relating to fuel injection, in-cylinder flow, and thermodynamic conditions. It is demonstrated that by automatically selecting the best values of the hyperparameters, a 1.6% improvement in merit value is obtained, compared to an improvement of 1.0% with default hyperparameters. Overall, the framework introduced in this study reduces the need for technical expertise in training ML models for optimization while also reducing the number of simulations needed for performing surrogate-based design optimization.

Owoyele, Opeoluwa↗
NASA NTRS1979

Developments in the computation of turbulent boundary layers

Computational techniques applicable to turbulent boundary layers are classified into solutions of Reynolds-averaged equations, in which all the effects of the turbulence are modelled, and solutions of three-dimensional, time dependent Navier-Stokes equations, in which the large eddies are calculated and only the turbulence at scales smaller than the computational mesh spacings has to be modelled. Current computation costs place engineering computations in the first of these categories; large eddy simulations are appropriate currently for special studies of the dynamical processes of turbulence in idealized flow fields. It is shown that the two methods are interrelated and that each can gain from advances in the other. The degree of success of a pair of increasingly complex Reynolds stress models to broaden their range of applicability is examined through comparisons with experimental data for a variety of flow conditions. An example of a large-eddy simulation is presented, compared with experimental results, and used to evaluate the models for pressure rate-of-strain correlations and dissipation in the Reynolds-averaged equations.

Rubesin, M. W.↗
NASA NTRS1981

Development and implementation of a low cost micro computer system for LANDSAT analysis and geographic data base applications

Since the implementation of the GRID and IMGRID computer programs for multivariate spatial analysis in the early 1970's, geographic data analysis subsequently moved from large computers to minicomputers and now to microcomputers with radical reduction in the costs associated with planning analyses. Programs designed to process LANDSAT data to be used as one element in a geographic data base were used once NIMGRID (new IMGRID), a raster oriented geographic information system, was implemented on the microcomputer. Programs for training field selection, supervised and unsupervised classification, and image enhancement were added. Enhancements to the color graphics capabilities of the microsystem allow display of three channels of LANDSAT data in color infrared format. The basic microcomputer hardware needed to perform NIMGRID and most LANDSAT analyses is listed as well as the software available for LANDSAT processing.

Faust, N.↗