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 775 records · Page 43
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Static Subspace Approximation for Random Phase Approximation Correlation Energies: Implementation and Performance

Developing theoretical understanding of complex reactions and processes at interfaces requires using methods that go beyond semilocal density functional theory to accurately describe the interactions between solvent, reactants and substrates. Methods based on many-body perturbation theory, such as the random phase approximation (RPA), have previously been limited due to their computational complexity. However, this is now a surmountable barrier due to the advances in computational power available, in particular through modern GPU-based supercomputers. In this work, we describe the implementation of RPA calculations within BerkeleyGW and show its favorable computational performance on large complex systems relevant for catalysis and electrochemistry applications. Our implementation builds off of the static subspace approximation which, by employing a compressed representation of the frequency dependent polarizability, enables the evaluation of the RPA correlation energy with significant acceleration and systematically controllable accuracy. We find that the computational cost of calculating the RPA correlation energy scales only linearly with system size for systems containing up to 50 thousand bands, and is expected to scale quadratically thereafter. We also show excellent strong scaling results across several supercomputers, demonstrating the performance and portability of this implementation.

algorithmic development↗
DOE OSTI2025

Grain2Mesh: Mesh Generation for Grain-Scale Nonlinear Elasticity Modeling

The nonlinear hysteretic behavior of rocks under cyclic loading is a crucial area of study in geomechanics. The macroscopic response of a variety of materials has been found to be contingent upon the behavior of the micro-scale structure. This project aims to develop a functional and maintainable software package for generating a multi-phase numerical mesh and accompanying simulation files for finite element modeling used in computational mechanics solvers. Meshes generated from images often lack key preprocessing that reduces noise and prevents mesh element distortion that can increase computational cost. By incorporating user feedback throughout, grain2mesh ensures a high-fidelity mesh that can be used to model grain-scale interactions such as shearing, crack propagation, and interfacial material contrast. Scientific applications of this software include material fracturing, stress-strain analysis for natural and engineered materials, and nonlinear meso-scale analysis.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

PINN surrogate of Li-ion battery models for parameter inference, Part II: Regularization and application of the pseudo-2D model

Bayesian parameter inference is useful to improve Li-ion battery diagnostics and can help formulate battery aging models. However, it is computationally intensive and cannot be easily repeated for multiple cycles, multiple operating conditions, or multiple replicate cells. To reduce the computational cost of Bayesian calibration, numerical solvers for physics-based models can be replaced with faster surrogates. A physics-informed neural network (PINN) is developed as a surrogate for the pseudo-2D (P2D) battery model calibration. For the P2D surrogate, additional training regularization was needed as compared to the PINN single-particle model (SPM) developed in Part I. Both the PINN SPM and P2D surrogate models are exercised for parameter inference and compared to data obtained from a direct numerical solution of the governing equations. A parameter inference study highlights the ability to use these PINNs to calibrate scaling parameters for the cathode Li diffusion and the anode exchange current density. By realizing computational speed-ups of ~2250x for the P2D model, as compared to using standard integrating methods, the PINN surrogates enable rapid state-of-health diagnostics. Finally, in the low-data availability scenario, the testing error was estimated to ~2 mV for the SPM surrogate and ~10 mV for the P2D surrogate which could be mitigated with additional data.

25 ENERGY STORAGE↗
DOE OSTI2024

Sparse-grid discontinuous Galerkin methods for the Vlasov–Poisson–Lenard–Bernstein model

Sparse-grid methods have recently gained interest in reducing the computational cost of solving high-dimensional kinetic equations. In this paper, we construct adaptive and hybrid sparse-grid methods for the Vlasov–Poisson–Lenard–Bernstein (VPLB) model. This model has applications to plasma physics and is simulated in two reduced geometries: a 0x3v space homogeneous geometry and a 1x3v slab geometry. Here we use the discontinuous Galerkin (DG) method as a base discretization due to its high-order accuracy and ability to preserve important structural properties of partial differential equations. We utilize a multiwavelet basis expansion to determine the sparse-grid basis and the adaptive mesh criteria. We analyze the proposed sparse-grid methods on a suite of three test problems by computing the savings afforded by sparse-grids in comparison to standard solutions of the DG method. The results are obtained using the adaptive sparse-grid discretization library ASGarD.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1998

Variable Complexity Structural Optimization of Shells

Structural designers today face both opportunities and challenges in a vast array of available analysis and optimization programs. Some programs such as NASTRAN, are very general, permitting the designer to model any structure, to any degree of accuracy, but often at a higher computational cost. Additionally, such general procedures often do not allow easy implementation of all constraints of interest to the designer. Other programs, based on algebraic expressions used by designers one generation ago, have limited applicability for general structures with modem materials. However, when applicable, they provide easy understanding of design decisions trade-off. Finally, designers can also use specialized programs suitable for designing efficiently a subset of structural problems. For example, PASCO and PANDA2 are panel design codes, which calculate response and estimate failure much more efficiently than general-purpose codes, but are narrowly applicable in terms of geometry and loading. Therefore, the problem of optimizing structures based on simultaneous use of several models and computer programs is a subject of considerable interest. The problem of using several levels of models in optimization has been dubbed variable complexity modeling. Work under NASA grant NAG1-1808 has been concerned with the development of variable complexity modeling strategies with special emphasis on response surface techniques. In addition several modeling issues for the design of shells of revolution were studied.

Haftka, Raphael T.↗
NASA NTRS1999

Variable Complexity Structural Optimization of Shells

Structural designers today face both opportunities and challenges in a vast array of available analysis and optimization programs. Some programs such as NASTRAN, are very general, permitting the designer to model any structure, to any degree of accuracy, but often at a higher computational cost. Additionally, such general procedures often do not allow easy implementation of all constraints of interest to the designer. Other programs, based on algebraic expressions used by designers one generation ago, have limited applicability for general structures with modem materials. However, when applicable, they provide easy understanding of design decisions trade-off. Finally, designers can also use specialized programs suitable for designing efficiently a subset of structural problems. For example, PASCO and PANDA2 are panel design codes, which calculate response and estimate failure much more efficiently than general-purpose codes, but are narrowly applicable in terms of geometry and loading. Therefore, the problem of optimizing structures based on simultaneous use of several models and computer programs is a subject of considerable interest. The problem of using several levels of models in optimization has been dubbed variable complexity modeling. Work under NASA grant NAG1-2110 has been concerned with the development of variable complexity modeling strategies with special emphasis on response surface techniques. In addition, several modeling issues for the design of shells of revolution were studied.

Haftka, Raphael T.↗
DOE OSTI2023

Quantifying spatiotemporal variability in occupant exposure to an indoor airborne contaminant with an uncertain source location

Well-mixed zone models are often employed to compute indoor air quality and occupant exposures. While effective, a potential downside to assuming instantaneous, perfect mixing is underpredicting exposures to high intermittent concentrations within a room. When such cases are of concern, more spatially resolved models, like computational-fluid dynamics methods, are used for some or all of the zones. But, these models have higher computational costs and require more input information. A preferred compromise would be to continue with a multi-zone modeling approach for all rooms, but with a better assessment of the spatial variability within a room. Here to do so, we present a quantitative method for estimating a room's spatiotemporal variability, based on influential room parameters. Our proposed method disaggregates variability into the variability in a room's average concentration, and the spatial variability within the room relative to that average. This enables a detailed assessment of how variability in particular room parameters impacts the uncertain occupant exposures. To demonstrate the utility of this method, we simulate contaminant dispersion for a variety of possible source locations. We compute breathing-zone exposure during the releasing (source is active) and decaying (source is removed) periods. Using CFD methods, we found after a 30 minutes release the average standard deviation in the spatial distribution of exposure was approximately 28% of the source average exposure, whereas variability in the different average exposures was lower, only 10% of the total average. We also find that although uncertainty in the source location leads to variability in the average magnitude of transient exposure, it does not have a particularly large influence on the spatial distribution during the decaying period, or on the average contaminant removal rate. By systematically characterizing a room's average concentration, its variability, and the spatial variability within the room important insights can be gained as to how much uncertainty is introduced into occupant exposure predictions by assuming a uniform in-room contaminant concentration. We discuss how the results of these characterizations can improve our understanding of the uncertainty in occupant exposures relative to well-mixed models.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

PANNA: Properties from Artificial Neural Network Architectures

We report prediction of material properties from first principles is often a computationally expensive task. Recently, artificial neural networks and other machine learning approaches have been successfully employed to obtain accurate models at a low computational cost by leveraging existing example data. Here, we present a software package “Properties from Artificial Neural Network Architectures” (PANNA) that provides a comprehensive toolkit for creating neural network models for atomistic systems following the Behler–Parrinello topology. Besides the core routines for neural network training, it includes data parser, descriptor builder for Behler–Parrinello class of symmetry functions and force-field generator suitable for integration within molecular dynamics packages. PANNA offers a variety of activation and cost functions, regularization methods, as well as the possibility of using fully-connected networks with custom size for each atomic species. PANNA benefits from the optimization and hardware-flexibility of the underlying TensorFlow engine which allows it to be used on multiple CPU/GPU/TPU systems, making it possible to develop and optimize neural network models based on large datasets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

One‐at‐a‐Time Parameter Perturbation Ensemble of the Community Land Model, Version 5.1

Comprehensive land models are subject to significant parametric uncertainty, which can be hard to quantify due to the large number of parameters and high model computational costs. We constructed a large parameter perturbation ensemble (PPE) for the Community Land Model version 5.1 with biogeochemistry configuration (CLM5.1-BGC). We performed more than 2,000 simulations perturbing 211 parameters across six forcing scenarios. This provides an expansive data set, which can be used to identify the most influential parameters on a wide range of output variables globally, by biome, or by plant functional type. We found that parameter effects can exceed scenario effects and that a small number of parameters explains a large fraction of variance across our ensemble. The most important parameters can differ regionally and also based on the forcing scenario. The software infrastructure developed for this experiment has greatly reduced the human and computer time needed for CLM PPEs, which can facilitate routine investigation of parameter sensitivity and uncertainty, as well as automated calibration.

Kennedy, Daniel [NSF National Center for Atmospher↗
DOE OSTI2026

FAIR Data and Interpretable AI Framework for Architectured Metamaterials (Final Report)

This research program established a transformative framework for the discovery and design of mechanical metamaterials, which are architected structures engineered to control physical phenomena like sound and vibration in ways natural materials cannot. To overcome the traditional reliance on trial-and-error, the project developed an interpretable Artificial Intelligence (AI) framework that moves beyond "black box" models to reveal the specific geometric patterns—such as "unit-cell templates"—that govern a material’s performance. A major breakthrough was the development of a hierarchical design method, which allows a single material to block vibrations across multiple frequency ranges simultaneously by layering patterns at different scales without them interfering with one another. This was further expanded to include irregular, graph-based designs that use spanning tree algorithms to ensure structural connectivity while allowing for customized, direction-dependent properties like stiffness and acoustic impedance. Beyond design, the project addressed the practicalities of real-world production by developing uncertainty quantification techniques that account for manufacturing defects and material variability, reducing the need for expensive physical testing by orders of magnitude. To speed up the discovery process, the team implemented Gaussian Process Regression and other surrogate models that provide accurate performance predictions at a fraction of the traditional computational cost. The AI-generated designs were successfully validated through fabrication of physical samples and wave propagation experiments, confirming their ability to accurately guide or reflect waves as predicted. By contributing these tools and high-quality FAIR benchmark datasets to the wider scientific community, this work provides a scalable foundation for advancing technologies in aerospace vibration control, medical imaging, and noise reduction.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Mapping Vegetation at Species Level with High-Resolution Multispectral and Lidar Data Over a Large Spatial Area: A Case Study with Kudzu

Mapping vegetation species is critical to facilitate related quantitative assessment, and mapping invasive plants is important to enhance monitoring and management activities. Integrating high-resolution multispectral remote-sensing (RS) images and lidar (light detection and ranging) point clouds can provide robust features for vegetation mapping. However, using multiple sources of high-resolution RS data for vegetation mapping on a large spatial scale can be both computationally and sampling intensive. Here, we designed a two-step classification workflow to potentially decrease computational cost and sampling effort and to increase classification accuracy by integrating multispectral and lidar data in order to derive spectral, textural, and structural features for mapping target vegetation species. We used this workflow to classify kudzu, an aggressive invasive vine, in the entire Knox County (1362 km2) of Tennessee (U.S.). Object-based image analysis was conducted in the workflow. The first-step classification used 320 kudzu samples and extensive, coarsely labeled samples (based on national land cover) to generate an overprediction map of kudzu using random forest (RF). For the second step, 350 samples were randomly extracted from the overpredicted kudzu and labeled manually for the final prediction using RF and support vector machine (SVM). Computationally intensive features were only used for the second-step classification. SVM had constantly better accuracy than RF, and the producer’s accuracy, user’s accuracy, and Kappa for the SVM model on kudzu were 0.94, 0.96, and 0.90, respectively. SVM predicted 1010 kudzu patches covering 1.29 km2 in Knox County. We found the sample size of kudzu used for algorithm training impacted the accuracy and number of kudzu predicted. The proposed workflow could also improve sampling efficiency and specificity. Our workflow had much higher accuracy than the traditional method conducted in this research, and could be easily implemented to map kudzu in other regions as well as map other vegetation species.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Physics‐Informed Machine Learning Method for Large‐Scale Data Assimilation Problems

Abstract We develop a physics‐informed machine learning approach for large‐scale data assimilation and parameter estimation and apply it for estimating transmissivity and hydraulic head in the two‐dimensional steady‐state subsurface flow model of the Hanford Site given synthetic measurements of said variables. In our approach, we extend the physics‐informed conditional Karhunen‐Loéve expansion (PICKLE) method to modeling subsurface flow with unknown flux (Neumann) and varying head (time‐dependent Dirichlet) boundary conditions. We demonstrate that the PICKLE method is comparable in accuracy with the standard maximum a posteriori (MAP) method, but is significantly faster than MAP for large‐scale problems. Both methods use a mesh to discretize the computational domain. In MAP, the parameters and states are discretized on the mesh; therefore, the size of the MAP parameter estimation problem directly depends on the mesh size. In PICKLE, the mesh is used to evaluate the residuals of the governing equation, while the parameters and states are approximated by the truncated conditional Karhunen‐Loéve expansions with the number of parameters controlled by the smoothness of the parameter and state fields, and not by the mesh size. For a considered example, we demonstrate that the computational cost of PICKLE increases near linearly (as N 1.15 ) with the number of grid nodes N , while that of MAP increases much faster (as N 3.28 ). We also show that once trained for one set of Dirichlet boundary conditions (i.e., one river stage), the PICKLE method provides accurate estimates of the hydraulic head for any value of the Dirichlet boundary conditions (i.e., for any river stage).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Gaussian approximation potential for amorphous Si : H

Hydrogenation of amorphous silicon (a–Si : H) is critical for reducing defect densities, passivating midgap states and surfaces, and improving photoconductivity in silicon-based electro-optical devices. Modeling the atomic-scale structure of this material is critical to understanding these processes, which in turn is needed to describe c–Si/a–Si : H heterojunctions that are at the heart of modern solar cells with world-record efficiency. Density functional theory (DFT) studies achieve the required high accuracy but are limited to moderate system sizes of 100 atoms or so by their high computational cost. Simulations of amorphous materials have been hindered by this high cost because large structural models are required to capture the medium-range order that is characteristic of such materials. Empirical potential models are much faster, but their accuracy is not sufficient to correctly describe the frustrated local structure. Data-driven, machine-learned interatomic potentials have broken this impasse and have been highly successful in describing a variety of amorphous materials in their elemental phase. Here, we extend the Gaussian approximation potential (GAP) for silicon by incorporating the interaction with hydrogen, thereby significantly improving the degree of realism with which amorphous silicon can be modeled. We show that our Si : H GAP enables the simulation of hydrogenated silicon with an accuracy very close to DFT but with computational expense and run times reduced by several orders of magnitude for large structures. Here, we demonstrate the capabilities of the Si : H GAP by creating models of hydrogenated liquid and amorphous silicon and showing that their energies, forces, and stresses are in excellent agreement with DFT results, and their structure as captured by bond and angle distributions are in agreement with both DFT and experiments.

36 MATERIALS SCIENCE↗
NASA NTRS2003

Probabilistic Unsteady Aerodynamic Analysis

Probabilistic CFD design is needed because we are asked to do more with less. To cost effectively accomplish the design task, we need to formally quantify the effect of uncertainties (variables) in the design. Probabilistic design is one effective method to formally quantify the effect of uncertainties. Our objective is to establish a revolutionary new early design process, by developing non-deterministic physics-based probabilistic design tools, which will include all the life cycle processes. This work was concerned with the usefulness of parametric optimization method coupled with a Navier-Stokes analysis code for the aero-thermodynamic design of turbomachinery combustor liner. The interconnection between the CFD code and NESSUS codes will facilitate the coupling between the thermal profiles and structural design. We have developed new concepts for reducing the computational cost of unsteady, three-dimensional, compressible aerodynamic analyses for multistage turbomachinery flows. The flow was modeled by the three-dimensional Favre-Reynolds-averaged Navier-Stokes equations using the k-E turbulence closure, which was integrated using an implicit third-order upwind solver. The methodology developed in this work is expected to lead to the design optimization of turbomachinery blades.

Gorla, Rama S. R.↗
DOE OSTI2023

High-Order Mesh hr-adaptivity for Surface Fitting to Implicit Geometries

We present an ℎ𝑟-adaptivity framework for morphing a given mesh to fit a target surface prescribed as the zero isocontour of a discrete function. In this framework, high-order meshing is posed as a variational minimization problem that depends on the mesh quality prescribed via the target matrix optimization paradigm (TMOP) and position of a subset of mesh nodes with respect to the target surface. The proposed formulation ensures that the variational problem is converged and mesh quality degradation near the surface is limited, even when the mesh topology is incompatible with the target surface. Additionally, a mesh subset-based approach and ℎ-refinement is introduced to efficiently increase fitting accuracy while reducing the computational cost of the mesh morphing problem. The ℎ𝑟-adaptivity technique extends to different element types in two- and three-dimensions, and can be used in existing finite element and spectral element frameworks to obtain high-order body-fitted meshes. Various numerical experiments demonstrate the robustness and accuracy of the fitting approach for problems of practical interest such as Lagrangian hydrodynamics and topology optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A hybrid adaptive multiresolution approach for the efficient simulation of reactive flows

Computational studies that use block-structured adaptive mesh refinement (AMR) approaches suffer from unnecessarily high mesh resolution in regions adjacent to important solution features. This deficiency limits the performance of AMR codes. In this work a novel hybrid adaptive multiresolution (HAMR) approach to AMR-based calculations is introduced to address this issue. The multiresolution (MR) smoothness indicators are used to identify regions of smoothness on the mesh where the computational cost of individual physics solvers may be decreased by replacing direct calculations with interpolation. We suggest an approach to balance the errors due to the adaptive discretization and the interpolation of physics quantities such that the overall accuracy of the HAMR solution is consistent with that of the MR-driven AMR solution. The performance of the HAMR scheme is evaluated for a range of test problems, from pure hydrodynamics to turbulent combustion.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2002

Human performance cognitive-behavioral modeling: a benefit for occupational safety

Human Performance Modeling (HPM) is a computer-aided job analysis software methodology used to generate predictions of complex human-automation integration and system flow patterns with the goal of improving operator and system safety. The use of HPM tools has recently been increasing due to reductions in computational cost, augmentations in the tools' fidelity, and usefulness in the generated output. An examination of an Air Man-machine Integration Design and Analysis System (Air MIDAS) model evaluating complex human-automation integration currently underway at NASA Ames Research Center will highlight the importance to occupational safety of considering both cognitive and physical aspects of performance when researching human error.

Occupational Health↗