SEARCH · Engineering Papers

Results for “Computer Based Procedures”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

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

At least 199 records · Page 11

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis: Version 6.12 User's Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user's manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.13 User's Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user’s manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis (V.6.16 User's Manual)

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Nonrad: Computing nonradiative capture coefficients from first principles

Point defects in semiconductor crystals provide a means for carriers to recombine nonradiatively. This recombination process impacts the performance of devices. We present the Nonrad code that implements the first-principles approach of Alkauskas et al. (2014) [8] for the evaluation of nonradiative capture coefficients based on a quantum-mechanical description of the capture process. An approach for evaluating electron-phonon coupling within the projector augmented wave formalism is presented. We also show that the common procedure of replacing Dirac delta functions with Gaussians can introduce errors into the resulting capture rate, and implement an alternative scheme to properly account for vibrational broadening. Finally, we assess the accuracy of using an analytic approximation to the Sommerfeld parameter by comparing with direct numerical evaluation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations

In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

An Ab Initio Multiple Cloning Method for Non-Adiabatic Excited-State Molecular Dynamics in NWChem

The recently developed ab-initio multiple cloning (AIMC) approach based on the multicongurational Ehrenfest (MCE) method provides a powerful and accurate way of describing the excited-state dynamics of molecular systems. The AIMC method is a controlled approximation to non-adiabatic dynamics with a particular strength in the proper description of decoherence effects due to branching of vibrational wavepackets at a level crossing. In this work, we report a new implementation of the AIMC algorithm in the open source NWChem computational chemistry program. The framework combines linear-response time-dependent density functional theory with Ehrenfest mean-eld theory to determine the equations of motion for classical trajectories. The multi-dimensional wave function is decomposed into a superposition of Gaussian coherent states guided by Ehrenfest trajectories (i.e., MCE approach), which can clone with fully quantum mechanical amplitudes and phases. By using an efficient time-derivative based non-adiabatic coupling approach within the AIMC method, all observable are calculated on-the-y in the non-adiabatic molecular dynamics process. As a representative example, we apply our implementation to study the ultrafast photoinduced electronic and vibrational energy transfer in a pyridine molecule. The effects of the cloning procedure on electronic and vibrational coherence, relaxation and unidirectional energy transfer are discussed. This new AIMC implementation provides a high-level non-adiabatic molecular dynamics framework for simulating photoexcited dynamics in complex molecular systems and experimentally relevant ultrafast spectroscopic probes, such as nonlinear coherent optical and X-ray signals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2020

Scalable implementation of polynomial filtering for density functional theory calculation in PARSEC

In this work, we present an efficient implementation of polynomial filtering methods in PARSEC, a real-space pseudopotential based Kohn–Sham density functional theory solver. The implementation described here improves upon a Chebyshev-filtered subspace iteration algorithm used in the previous version of PARSEC. We present a hybrid polynomial filtering scheme that combines Chebyshev-filtered subspace iteration and a spectrum slicing method that partitions the spectrum into several spectral slices and uses bandpass-filtered subspace iteration to compute approximate eigenpairs within each interior slice simultaneously. We describe a procedure to partition a spectrum and construct polynomial filters. We also discuss a number of practical issues such as the use of appropriate data layouts for carrying out the computation on a two-dimensional process grid and how to achieve good load balance by allocating an appropriate number of process groups to each spectral slice. Numerical examples are presented to demonstrate the effectiveness of the hybrid polynomial filtering method as well as the superior parallel scalability of spectrum slicing in comparison to that of Chebyshev-filtered subspace iteration.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

CoRE MOF DB: A curated experimental metal-organic framework database with machine-learned properties for integrated material-process screening

Here, we present an updated version of the Computation-Ready, Experimental (CoRE) Metal-Organic Framework (MOF) database, which includes a curated set of computation-ready MOF crystal structures designed for high-throughput computational materials discovery. Data collection and curation procedures were improved from the previous version to enable more frequent updates in the future. Machine-learning-predicted properties, such as stability metrics and heat capacities, are included in the dataset to streamline screening activities. An updated version of MOFid was developed to provide detailed information on metal nodes, organic linkers, and topologies of an MOF structure. DDEC6 partial atomic charges of MOFs were assigned based on a machine-learning model. Gibbs ensemble Monte Carlo simulations were used to classify the hydrophobicity of MOFs. The finalized dataset was subsequently used to perform integrated material-process screening for various carbon-capture conditions using high-fidelity temperature-swing adsorption (TSA) simulations. Our workflow identified multiple MOF candidates that are predicted to outperform CALF-20 for these applications.

CoRE MOF database↗

DOE OSTI2021

An Iterative Response-Surface-Based Approach for Chance-Constrained AC Optimal Power Flow Considering Dependent Uncertainty

A modern power system is characterized by a stochastic variation of the loads and an increasing penetration of renewable energy generation, which results in large uncertainties in its states. These uncertainties bring formidable challenges to the power system planning and operation process. To address these challenges, we propose a cost-effective, iterative response-surface-based approach for the chance-constrained AC optimal power-flow problem that aims to ensure the secure operation of the power systems considering dependent uncertainties. Starting from a stochastic-sampling-based framework, we first utilize the copula theory to simulate the dependence among multivariate uncertain inputs. Then, to reduce the prohibitive computational time required in the traditional Monte-Carlo method, we propose, instead of using the original complicated power-system model, to rely on a polynomial-chaos-based response surface. This response surface allows us to efficiently evaluate the time-consuming power-system model at arbitrary distributed sampled values with a negligible computational cost. This further enables us to efficiently conduct an online stochastic testing for the system states that not only screens out the statistical active constraints, but also assists in a better design of the tightened bounds without using any Gaussian or symmetric assumption. Finally, an iterative procedure is executed to fine-tune the optimal solution that better satisfies a predefined probability. The simulations conducted in multiple test systems demonstrate the excellent performance of the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2023

Two-link Staggered Quark Smearing in QUDA

Gauge covariant smearing based on the 3D lattice Laplacian can be used to create extended operators that have better overlap with hadronic ground states. For staggered quarks, we make use of two-link parallel transport to preserve taste properties. We have implemented the procedure in QUDA. We present the performance of this code on the NVIDIA A100 GPUs in Indiana University's Big Red 200 supercomputer and on the AMD MI250X GPUs in Oak Ridge Leadership Computer Facility's (OLCF's) Crusher and discuss its scalability. We also study the performance improvement from using NVSHMEM on OLCF's Summit. Reusing precomputed two-link products for all sources and sinks, it reduces the total smearing time for a baryon correlator measurement by a factor of 100-120 as compared with the original MILC code and reduces the overall time by 60-70%.

Gottlieb, Steven↗

DOE OSTI2023

A review of privacy in energy applications

As the distribution system continues to experience an increase in distributed energy resource (DER) and electric vehicle (EV) penetration, so does the need for new solutions that can help grid operators manage and leverage their capabilities. This will undoubtedly lead to new operational schemes and business opportunities that will transform the traditional consumer into a prosumer who will be more actively engaged in grid operations. Although the field is still under active development, many of the potential use cases presented in literature or industry are built upon edge computing, two-way communications, and other innovative computational constructs to attain their goals. However, at their core, many use cases assume a great level of data access to aid with the decision-making process, an assumption that may need to be revised to ensure fair and equitable operational processes are maintained. This may be particularly true as edge resources are predicted to participate in retail-side, many-to-many, or peer-to-peer markets and thus may lead to financial impacts if data access considerations are ignored. The need to revise data access mechanisms can be further justified by the introduction of new participants into the operational process, who do not have the same level of trust, nor the incentives to focus on energy delivery as their primary objective. At the same time, more consumers are becoming aware of their own data, and the potential impacts of its abuse. To help solution developers better understand these risks, this report has been developed to offer an initial introduction to the topic of privacy. This is achieved by 1) Highlighting the need for privacy-aware solutions; 2) Encouraging system designers to be inquisitive about the status quo; 3) Documenting the existing threat space; 4) Presenting and evaluating tools that may be helpful towards enabling better privacy postures; and 5) Making recommendations to encourage the adoption of better practices. From a technical perspective, the report focuses on evaluating two potential techniques by applying them to the Transactive Energy Space. Based on the obtained results, it can be established that differential privacy (DP) methods may have limited applicability when highly correlated, time-series data records need to be protected. However, DP may be a powerful tool when it is used to aggregate and analyze mid-size and large-size data sets in a more traditional statistical environment. The second tool under evaluation is threshold cryptography, which can guarantee complete secrecy (and thus privacy) but requires the establishment of key management procedures and dedicated communication channels for key coordination. Therefore, due to its increased computational overhead, the use of threshold cryptography must be weighted using a cost/benefit analysis on a per-application basis.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2021

Real-Time and Adaptive Reservoir Computing With Application to Profile Prediction in Fusion Plasma

Nuclear fusion is a promising alternative to address the problem of sustainable energy production. The tokamak is an approach to fusion based on magnetic plasma confinement, constituting a complex physical system with many control challenges. Here we study the characteristics and optimization of reservoir computing (RC) for real-time and adaptive prediction of plasma profiles in the DIII-D tokamak. Our experiments demonstrate that RC achieves comparable results to state-of-the-art (deep) convolutional neural networks (CNNs) and long short-term memory (LSTM) models, with a significantly easier and faster training procedure. This efficient approach allows for fast and frequent adaptation of the model to new situations, such as changing plasma conditions or different fusion devices.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2022

LaSDI: Parametric Latent Space Dynamics Identification

Enabling fast and accurate physical simulations with data has become an important area of computational physics to aid in inverse problems, design-optimization, uncertainty quantification, and other various decision-making applications. This paper presents a data-driven framework for parametric latent space dynamics identification procedure that enables fast and accurate simulations. The parametric model is achieved by building a set of local latent space model and designing an interaction among them. An individual local latent space dynamics model achieves accurate solution in a trust region. By letting the set of trust region to cover the whole parameter space, our model shows an increase in accuracy with an increase in training data. Herein we introduce two different types of interaction mechanisms, i.e., point-wise and region-based approach. Both linear and nonlinear data compression techniques are used. We illustrate the framework of Latent Space Dynamics Identification (LaSDI) enable a fast and accurate solution process on various partial differential equations, i.e., Burgers’ equations, radial advection problem, and nonlinear heat conduction problem, achieving 0 (100)x speed-up and 0 (1)% relative error with respect to the corresponding full order models.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Volumetric analysis and mesh generation of real and artificial microstructural geometries

Producing a viable finite element mesh of realistic microstructural structural geometry is a critical step in analyzing the thermo-mechanical behavior of complex multi-material composites. Advancements in imaging technology such as micro computed tomography have allowed modelers to access high resolution mesoscale geometries for direct numerical simulation. However, converting from voxel based 3D images to usable finite element meshes has been challenging. A robust method including algorithms and software scripts for generating finite element meshes from 3D imaged microstructures is presented in this paper. It includes a routine for inserting cohesive elements around material interfaces to enable modeling of interface properties including delamination and damage. The algorithms and procedures presented in this method leverage currently available software packages for processing surface based geometry into volume based meshes. In addition to converting real geometry from physical imaging systems, algorithms for producing numerically generated and statistically equivalent microstructural geometry are also included. These artificial microstructures can be a valuable resource for modelers when physical specimens do not exist or are limited in quantity: Method establishes a workflow from voxel data to viable finite element mesh including interface information, and Includes a method for synthetic geometry generation based on metrics from real microstructures.

36 MATERIALS SCIENCE↗

DOE OSTI2020

Optimal control of coupled quantum systems based on the first-order Magnus expansion: Application to multiple dipole-dipole-coupled molecular rotors

This paper presents a method for performing approximate optimal control simulations for quantum systems with multiple coupled degrees of freedom. In this work, the time evolution is simulated using the first-order Magnus expansion in the interaction picture, where the couplings between different degrees of freedom are treated as the perturbation. A numerical implementation procedure is presented that leverages upon pairwise couplings and the separability of the zeroth-order time evolution operator to achieve a reduced computational cost, which is analyzed with respect to the number of degrees of freedom. The formulation is compatible with gradient-free methods to optimize the control field, and a stochastic hill climbing algorithm is adopted for this purpose. As illustrations, optimal control simulations are performed for systems of two and three dipole-dipole-coupled molecular rotors under the influence of a control field. For the two-rotor system, the field is optimized to achieve either orientation or entanglement objectives. For the three-rotor system, the field is optimized either to orient all three rotors in the same direction or to orient one rotor in a particular direction while the other two rotors point in the opposite direction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Global properties of nuclei at finite-temperature within the covariant energy density functional theory

In stellar environments nuclei appear at finite temperatures, becoming extremely hot in core-collapse supernovae and neutron-star mergers. However, due to theoretical and computational complexity, most model calculations of nuclear properties are performed at zero temperature, while those existing at finite temperatures are limited only to selected regions of the nuclide chart. In this study we perform the global calculation of nuclear properties for even-even 8 ≤ Z ≤ 104 nuclei at temperatures in range 0 ≤ T ≤ 2 MeV. Calculations are based on the finite-temperature relativistic Hartree-Bogoliubov model supplemented by the Bonche-Levit-Vautherin vapor subtraction procedure. We find that near the neutron-drip line the continuum states have significant contribution already at moderate temperature T ≈ 1 MeV, thus emphasizing the necessity of the vapor subtraction procedure. Results include neutron emission lifetimes, quadrupole deformations, neutron-skin thickness, proton and neutron pairing gaps, entropy and excitation energy. Up to the temperature T ≈ 1 MeV, the nuclear landscape is influenced only moderately by the finite-temperature effects, mainly by reducing the pairing correlations. Here, as the temperature increases further, the effects on nuclear structures become pronounced, reducing both the deformations and the shell effects.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2024

Design by analysis rules for ASME Section III, Division 5, Class B components

The current rules for elevated temperature ASME Section III, Division 5, Class B components, other than piping, were basically adapted from the Design-by-Rule approach for Section VIII, Division 1 vessels. A goal of the proposed new rules is to explicitly account for the design life and cyclic service while recognizing the less-rigorous requirements commensurate with lesser safety consideration. Further goals are to maximize the use of modern computational technology, for example finite element analysis in conjunction with reference stress concepts, and to avoid the need for stress classification. This paper summarizes the work done to address these issues. A summary of the design-by-analysis for primary loads, strain limit evaluation, and creep-fatigue damage assessment is presented. The proposed design-by-analysis creep-fatigue damage calculation approach uses a new elastic follow-up-based Isochronous Stress Strain Curve stress relaxation procedure. A set of sample problems are selected to validate the proposed design-by-analysis rules for creep-fatigue damage assessment. The proposed Class B rules are evaluated against the Class A elastic design rules and the experimental data obtained from a family of a simplified model test-based key-feature test results. The proposed Class B creep-fatigue damage assessment methodology yields conservative design cycles estimates compared to the experimental results.

36 MATERIALS SCIENCE↗

DOE OSTI2020

Reinforcement-based Program Induction in a Neural Virtual Machine

We present a neural virtual machine that can be trained to perform algorithmic tasks. Rather than combining a neural controller with non-neural memory storage as has been done in the past, this architecture is purely neural and emulates tape-based memory via fast associative weights (onestep learning). Here we formally define the architecture, and then extend the system to learn programs using recurrent policy gradient reinforcement learning based on examples of program inputs labeled with corresponding output targets, which are compared against actual output to generate a sparse reward signal. We describe the policy gradient training procedure used, and report its empirical performance on a number of smallscale list processing tasks, such as finding the maximum list element, filtering out certain elements, and reversing the order of the elements. These results show that program induction via reinforcement learning is possible using sparse rewards and solely neural computations.

Katz, Garrett E.↗