Search NASA⌕ Search

SEARCH · Search NASA

Results for “computer experiments”

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 145 records · Page 8

Bayesian Treed Multivariate Gaussian Process with Adaptive Design: Application to a Carbon Capture Unit

Computer experiments (numerical simulations) are widely used in scientific research to study and predict the behavior of complex systems, which usually have responses consisting of a set of distinct outputs. The computational cost of the simulations at high resolution are often expensive and become impractical for parametric studies at different input values. To overcome these difficulties we develop a Bayesian treed multivariate Gaussian process (BTMGP) as an extension of the Bayesian treed Gaussian process (BTGP) in order to model and evaluate a multivariate process. A suitable choice of covariance function and the prior distributions facilitates the different Markov chain Monte Carlo (MCMC) movements. We utilize this model to sequentially sample the input space for the most informative values, taking into account model uncertainty and expertise gained. A simulation study demonstrates the use of the proposed method and compares it with alternative approaches. We apply the sequential sampling technique and BTMGP to model the multiphase flow in a full scale regenerator of a carbon capture unit. The application presented in this paper is an important tool for research into carbon dioxide emissions from thermal power plants.

Konomi, Bledar A.↗

First Annual Report on Pulsed Thermal Tomography Nondestructive Evaluation of Additively Manufactured Reactor Materials and Components: Pulsed Thermal Tomography Nondestructive Examination of Additively Manufactured Reactor Materials and Components

Additive manufacturing (AM, or 3D printing) for commercial nuclear energy applications is an emerging method for cost-efficient manufacturing aimed at replacing aging nuclear reactor parts and reducing costs for new construction. Because of the geometry of metallic structures of interest for nuclear applications, which consist of planar primitives with no symmetry of revolution, limited options are available for nondestructive evaluation (NDE), either during or post manufacturing. Known material flaws in AM include low-density regions consisting of non-sintered powder, which have to be detected to ensure the safety of long-term performance nuclear reactor components. As a solution to NDE of AM, we are developing pulsed thermal tomography (PTT) models and depth inversion algorithms for 3D imaging. PTT has many advantages because the method is non-contact and allows for in-service, NDE of AM nuclear reactor parts. By analyzing transients of surface temperature response due to internal thermal resistances, one can obtain 3D reconstructions of material effusivity using a unique inversion algorithm developed at Argonne. This report provides results of preliminary performance evaluation of PTT capability in detection of flaws in metallic structures, as well imaging complex geometry AM structures. Performance of PTT was investigated through modeling and experiments, Computer models of PTT were developed using COMSOL Heat Transfer module. Defects were modeled as cylindrical flat bottom holes (FBH), which is a common model of calibrated material flaws in thermal tomography experiments. Materials considered in this study include stainless steel 316 (SS316), stainless steel 304 (SS304), and Inconel 718. Theoretical analyses were conducted to validate inversion of simulated PTT data with COMSOL for a plate. Subsequently, 3D reconstructions were performed on COMSOL simulations for FBH, revealing a decrease in spatial resolution over depth due to thermal diffusion. The results of this study show that the performance of the inversion algorithm for detecting smaller defects depends strongly on the depth of the defect as well as the incident heat flux. The size of detectable defect was estimated by fitting a Gaussian function to surface temperature profile. The criteria for detectability was taken as 20mK noise equivalent temperature difference (NETD), which is currently the sensitivity limit of high-performance infrared cameras. It was determined through computer simulations that the smallest detectable FBH in SS316 has a 50µm diameter and is located 0.5mm below the plate surface. Preliminary experimental studies were performed to evaluate PTT performance in detecting calibrated flaws using metallic specimens with AM defects simulated as drilled-in FBH’s. High strength Stainless Steel 316 and Inconel 718 alloys were considered, as well as lower grade Stainless Steel 304, Nickel 200, and Hastelloy C276. Specimens investigated in this report consisted of approximately 1/4in-thick plates made out of these alloys using conventional manufacturing methods. The diameters of FBH’s varied from 1mm to 8mm, and their depths below the plate flat surface varied between 1mm and 6mm. The size of the smallest FBH was limited to 1mm because conventional mechanical drills were used for creating the holes. PTT imaging results have shown that 1mm-diameter FBH located 1mm and 2mm below the surface were detectable. Larger size FBH were detectable at greater depth. For example, 6mm-diameter FBH could be detected at 8mm depth. Image contrast varied slightly between the specimens, with the best reconstructions obtained in SS316 and C276 plates. Finally, PTT capability in imaging several AM structures fabricated from Inconel 718 (IN718) powder feedstock was investigated. The AM structures have complex geometry, but do not have calibrated internal defects. The objective is to determine PTT settings, such as the total integration time, for imaging of representative AM structures. A new FLIR X8500sc IR camera with higher spatial resolution (1280x1024 at 181Hz frame rate) was integrated into the PTT laboratory setup. Software tools were developed to ensure compatibility of new camera files with legacy effusivity reconstruction codes. The new camera was used to obtain 3-D reconstructions of AM IN718 nozzle plate and a particle filter plate. It was shown that PTT can scan through 2/3in-thick Inconel 718 plates in approximately 15s. Several modes of 3-D data visualization were explored, including using ImageJ and MATLAB software packages. The results demonstrate the capability of PTT in 3-D imaging of complex geometry AM structures. Intermediate results demonstrated in this report will be developed further to investigate detection of flaws in AM specimens.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Computing Legacy Software Behavior to Understand Functionality and Security Properties: An IBM/370 Demonstration

Organizations maintaining mainframe legacy software can benefit from code modernization and incorporation of security capabilities to address the current threat environment. Oak Ridge National Laboratory is developing the Hyperion system to compute the behavior of software as a means to gain understanding of software functionality and security properties. Computation of functionality is critical to revealing security attributes, which are in fact specialized functional behaviors of software. Oak Ridge is collaborating with MITRE Corporation to conduct a demonstration project to compute behavior of legacy IBM Assembly Language code for a federal agency. The ultimate goal is to understand functionality and security vulnerabilities as a basis for code modernization. This paper reports on the first phase, to define functional semantics for IBM Assembly instructions and conduct behavior computation experiments.

reverse engineering↗

Approximating Two-Stage Chance-Constrained Programs with Classical Probability Bounds

We consider a joint-chance constraint (JCC) as a union of sets, and approximate this union using bounds from classical probability theory. When these bounds are used in an optimization model constrained by the JCC, we obtain corresponding upper and lower bounds on the optimal objective function value. We compare the strength of these bounds against each other under two different sampling schemes, and observe that a larger correlation between the uncertainties tends to result in more computationally challenging optimization models. We also observe the same set of inequalities to provide the tightest upper and lower bounds in our computational experiments.

97 MATHEMATICS AND COMPUTING↗

Uncertainty quantification in scientific machine learning: Methods, metrics, and comparisons

Neural networks (NNs) are currently changing the computational paradigm on how to combine data with mathematical laws in physics and engineering in a profound way, tackling challenging inverse and ill-posed problems not solvable with traditional methods. However, quantifying errors and uncertainties in NN-based inference is more complicated than in traditional methods. This is because in addition to aleatoric uncertainty associated with noisy data, there is also uncertainty due to limited data, but also due to NN hyperparameters, overparametrization, optimization and sampling errors as well as model misspecification. Although there are some recent works on uncertainty quantification (UQ) in NNs, there is no systematic investigation of suitable methods towards quantifying the total uncertainty effectively and efficiently even for function approximation, and there is even less work on solving partial differential equations and learning operator mappings between infinite-dimensional function spaces using NNs. In this work, we present a comprehensive framework that includes uncertainty modeling, new and existing solution methods, as well as evaluation metrics and post-hoc improvement approaches. Further, to demonstrate the applicability and reliability of our framework, we present an extensive comparative study in which various methods are tested on prototype problems, including problems with mixed input-output data, and stochastic problems in high dimensions. In the Appendix, we include a comprehensive description of all the UQ methods employed. Further, to help facilitate the deployment of UQ in Scientific Machine Learning research and practice, we present and develop in [1] an open-source Python library (github.com/Crunch-UQ4MI/neuraluq), termed NeuralUQ, that is accompanied by an educational tutorial and additional computational experiments.

11 physics-informed neural networks↗

Computational algorithms for analysis of data from thin-film thermoresistors on a radio-electronic printed circuit board

In the paper, the data analysis is considered for thin-film thermoresistors coated on to a radio-electronic printed circuit board to determine possible zones of its overheating. A mathematical model consists in an underdetermined system of linear algebraic equations with an infinite set of solutions. For computing a more real solution, two additional conditions are used: the smoothness of a solution and the positiveness of an increase of temperature during overheating. Computational experiments demonstrate that an overheating zone is determined exactly with a tolerable accuracy of temperature in it.

97 MATHEMATICS AND COMPUTING↗

Bi-objective approaches for home healthcare medical team planning and scheduling problem

In this paper, we study the medical team planning and scheduling in home healthcare within a weekly horizon, including the planning of nursing visits and the daily traveling route scheduling. Two objectives are considered: the first one is to minimize the total operation cost of the healthcare agency and the second one is to maximize the patient satisfaction. The problem is formulated as a mixed integer program, to seek for a trade-off between two objectives, with the characteristics of the patient requirements including nursing types, nursing frequency and service length considered. Medical team types, available service days and overwork penalty are also respected in the model. Then an ϵ-constraint method is adopted to obtain exact non-dominated solutions. To address large-scale problem instances, three heuristic approaches are developed to generate approximate Pareto fronts in a reasonable time. The set of non-dominated solutions are valuable for decision-making. Computational experiments are conducted and the results demonstrate the efficiency of the approaches.

97 MATHEMATICS AND COMPUTING↗

MapsTorch : automatic differentiation for X-ray fluorescence data analysis

X-ray fluorescence (XRF) is a popular spectroscopy technique for elemental analysis. Spectrum fitting and parameter tuning are at the core of XRF analysis and are conventionally manually intensive, especially for synchrotron experiments involving large amounts of diverse samples. This work introduces the automatic differentiation (AD) technique to XRF and an open-source package called MapsTorch. By transforming an analytical model of the XRF spectrum into a differentiable computation graph with AD, MapsTorch enables robust optimization of parameters and elemental intensities. We evaluate MapsTorch by conducting computational experiments on a large number of historical synchrotron XRF datasets and compare its performance with the currently practiced fitting tool NLopt. The results show that MapsTorch consistently achieves high-quality fits and often leads to better fitting quality than NLopt, particularly in tasks such as initial spectrum fitting and elemental intensity refinement. The robust performance of MapsTorch paves the way for developing automated and high-throughput XRF data analysis workflows to handle the increasing data volumes expected from next-generation synchrotron facilities.

X-ray fluorescence↗

Small-Noise Analysis and Symmetrization of Implicit Monte Carlo Samplers

Implicit samplers are algorithms for producing independent, weighted samples from multivariate probability distributions. These are often applied in Bayesian data assimilation algorithms. We use Laplace asymptotic expansions to analyze two implicit samplers in the small noise regime. Our analysis suggests a symmetrization of the algorithms that leads to improved implicit sampling schemes at a relatively small additional cost. Here, computational experiments confirm the theory and show that symmetrization is effective for small noise sampling problems.

97 MATHEMATICS AND COMPUTING↗

Polynomial Chaos Surrogate Construction for Random Fields with Parametric Uncertainty

Engineering and applied science rely on computational experiments to rigorously study physical systems. The mathematical models used to probe these systems are highly complex, and sampling-intensive studies often require prohibitively many simulations for acceptable accuracy. Surrogate models provide a means of circumventing the high computational expense of sampling such complex models. In particular, polynomial chaos expansions (PCEs) have been successfully used for uncertainty quantification studies of deterministic models where the dominant source of uncertainty is parametric. We discuss an extension to conventional PCE surrogate modeling to enable surrogate construction for stochastic computational models that have intrinsic noise in addition to parametric uncertainty. We develop a PCE surrogate on a joint space of intrinsic and parametric uncertainty, enabled by Rosenblatt transformations, which are evaluated via kernel density estimation of the associated conditional cumulative distributions. Furthermore, we extend the construction to random field data via the Karhunen–Loève expansion. We then take advantage of closed-form solutions for computing PCE Sobol indices to perform a global sensitivity analysis of the model which quantifies the intrinsic noise contribution to the overall model output variance. Additionally, the resulting joint PCE is generative in the sense that it allows generating random realizations at any input parameter setting that are statistically approximately equivalent to realizations from the underlying stochastic model. The method is demonstrated on a chemical catalysis example model and a synthetic example controlled by a parameter that enables a switch from unimodal to bimodal response distributions.

97 MATHEMATICS AND COMPUTING↗

Coupled Models and Parallel Simulations for Three-Dimensional Full-Stokes Ice Sheet Modeling

A three-dimensional full-Stokes computational model is considered for determining the dynamics, temperature, and thickness of ice sheets. The governing thermomechanical equations consist of the three-dimensional full-Stokes system with nonlinear rheology for the momentum, an advective-diffusion energy equation for temperature evolution, and a mass conservation equation for icethickness changes. Here, we discuss the variable resolution meshes, the finite element discretizations, and the parallel algorithms employed by the model components. The solvers are integrated through a well-designed coupler for the exchange of parametric data between components. The discretization utilizes high-quality, variable-resolution centroidal Voronoi Delaunay triangulation meshing and existing parallel solvers. We demonstrate the gridding technology, discretization schemes, and the efficiency and scalability of the parallel solvers through computational experiments using both simplified geometries arising from benchmark test problems and a realistic Greenland ice sheet geometry.

58 GEOSCIENCES↗

Solving Unit Commitment Problems with Demand Responsive Loads: Preprint

This paper focuses on using variations of the Frank-Wolfe algorithm for solving unit commitment problems with high volumes of demand responsive loads on the power grid. We present a formulation of the unit commitment problem with demand responsive loads. We then show through reformulation and relaxations of the problem that variations of the Frank-Wolfe algorithm can be used to determine the time series decisions for the demand responsive loads. We show through computational experiments on the RTS-GMLC test system that the time series of demand responsive load decisions obtained through our approach are near optimal and provide details regarding how large scale parallel implementations of our approach can be highly computationally efficient.

demand response↗

A HPC “Cyber Wind Facility” Incorporating Fully-Coupled CFD/CSD for Turbine-Platform-Wake Interactions with the Atmosphere and Ocean

The central aims of the DOE-supported “Cyber Wind Facility” project center on the recognition that wind turbines over land and ocean generate power from atmospheric winds that are inherently turbulent and strongly varying, both spatially over the rotor disk and in temporally as the rotating blades pass through atmospheric eddies embedded within the mean wind. The daytime unstable atmospheric boundary layer (ABL) is particularly variable in space time as solar heating generates buoyancy-driven motions that interact with strong mean shear in the ABL “surface layer,” the lowest 200 - 300 m where wind turbines reside in farms. With the “Cyber Wind Facility” (CWF) program we initiate a research and technology direction in which “cyber data” are generated from “computational experiments” within a “facility” akin to a wind tunnel, but with true space-time atmospheric turbulence that drive utility-scale wind turbines at full-scale Reynolds numbers. With DOE support we generated the key “modules” within a computational framework to create a first generation Cyber Wind Facility (CWF) for single wind turbines in the daytime ABL---both over land where the ABL globally unstable and over water with closer-to-neutral atmospheric conditions but with time response strongly affected by wave-induced forcing of the wind turbine platform (here a buoy configuration). The CWF program has significantly improved the accuracy of actuator line models, evaluated with the Cyber Wind Facility in full blade-boundary-layer-resolved mode. The application of the CWF made in this program showed the existence of important ramp-like response events that likely contribute to bearing fatigue failure on the main shaft and that the advanced ALM method developed here captures the primary nonsteady response characteristics. Long-time analysis uncovered distinctive key dynamics that explain primary mechanisms that underlie potentially deleterious load transients. We also showed that blade bend-twist coupling plays a central role in the elastic responses of the blades to atmospheric turbulence, impacting turbine power.

17 WIND ENERGY↗

New frontiers for the materials genome initiative

The Materials Genome Initiative (MGI) advanced a new paradigm for materials discovery and design, namely that the pace of new materials deployment could be accelerated through complementary efforts in theory, computation, and experiment. Along with numerous successes, new challenges are inviting researchers to refocus the efforts and approaches that were originally inspired by the MGI. In May 2017, the National Science Foundation sponsored the workshop “Advancing and Accelerating Materials Innovation Through the Synergistic Interaction among Computation, Experiment, and Theory: Opening New Frontiers” to review accomplishments that emerged from investments in science and infrastructure under the MGI, identify scientific opportunities in this new environment, examine how to effectively utilize new materials innovation infrastructure, and discuss challenges in achieving accelerated materials research through the seamless integration of experiment, computation, and theory. This article summarizes key findings from the workshop and provides perspectives that aim to guide the direction of future materials research and its translation into societal impacts.

36 MATERIALS SCIENCE↗

Weak and strong orders of linear recurring sequences

The concept of the strong order of linear recurring sequence (LRS) is introduced in this paper. Necessary and sufficient conditions for the existence of the strong LRS order are derived. The strong LRS order is exploited for the formalization of the problem of the extension of a sequence from the available fragment (fragments) of that sequence. The definition of the strong LRS order opens new possibilities for formal sequence analysis whenever the weak LRS order of that sequence exists. Computational experiments with discrete iterative maps are used to illustrate the applicability of the strong LRS order in nonlinear system analysis.

97 MATHEMATICS AND COMPUTING↗

Learning Symbolic Expressions: Mixed-Integer Formulations, Cuts, and Heuristics

Here, in this paper, we consider the problem of learning a regression function without assuming its functional form. This problem is referred to as symbolic regression. An expression tree is typically used to represent a solution function, which is determined by assigning operators and operands to the nodes. Cozad and Sahinidis propose a nonconvex mixed-integer nonlinear program (MINLP), in which binary variables are used to assign operators and nonlinear expressions are used to propagate data values through nonlinear operators, such as square, square root, and exponential. We extend this formulation by adding new cuts that improve the solution of this challenging MINLP. We also propose a heuristic that iteratively builds an expression tree by solving a restricted MINLP. We perform computational experiments and compare our approach with a mixed-integer program–based method and a neural network–based method from the literature.

97 MATHEMATICS AND COMPUTING↗

A polyhedral study of production ramping

Here, we give strong formulations of ramping constraints—used to model the maximum change in production level for a generator or machine from one time period to the next—and production limits. For the two-period case, we give a complete description of the convex hull of the feasible solutions. The two-period inequalities can be readily used to strengthen ramping formulations without the need for separation. For the general case, we define exponential classes of multi-period variable upper bound and multi-period ramping inequalities, and give conditions under which these inequalities define facets of ramping polyhedra. Finally, we present exact polynomial separation algorithms for the inequalities and report computational experiments on using them in a branch-and-cut algorithm to solve unit commitment problems in power generation.

97 MATHEMATICS AND COMPUTING↗

Electron transfer and atom exchange between aqueous Fe(II) and structural Fe(III) in clays. Role in U and Hg(II) transformations

During this project, we investigated Fe electron transfer and atom exchange between aqueous Fe(II) and structural Fe(III) in clay minerals. We used selective chemical extractions, enriched Fe isotope tracer experiments, computational molecular modeling, and Mössbauer spectroscopy. Our findings indicate that structural Fe(III) in clay minerals is reduced by aqueous Fe(II) and that electron transfer occurs when Fe(II) is sorbed to either basal planes and edge OH-groups of clay mineral. Findings from highly enriched isotope experiments suggest that up to 30 % of the Fe atoms in the structure of some clay minerals exhanges with aqueous Fe(II). First principles calculations using a small polaron hopping approach suggest surprisingly fast electron mobility at room temperature in a nontronite clay mineral and are consistent with temperature dependent Mössbauer data Fast electron mobility suggests that electrons may be able to conduct through the mineral fast enough to enable exchange of Fe between the aqueous phase and clay mineral structure. over the time periods we observed. Our findings suggest that Fe in clay minerals is not as stable as previously thought.

54 ENVIRONMENTAL SCIENCES↗