Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computer experiment”

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 217 records · Page 12

EUCLID: Experiments Underpinned by Computational Learning for Improvements in Nuclear Data [Slides]

EUCLID will design validation experiments optimized to resolve compensating errors and adjust nuclear data to experiments. A big part of the success of the EUCLID proposal was due to previous work supported by NCSP (MCNP, nuclear data, and NCERC capabilities). The work performed under EUCLID will similarly benefit the NCSP mission. It will lead to new MCNP capabilities, improved nuclear data and nuclear data capabilities, and new methodology and tools that will have large impact on future NCERC experiments.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Discovering Active Subspaces for High-Dimensional Computer Models

Dimension reduction techniques have long been an important topic in statistics, and active subspaces (AS) have received much attention this past decade in the computer experiments literature. The most common approach towards estimating the AS is to use Monte Carlo with numerical gradient evaluation. While sensible in some settings, this approach has obvious drawbacks. Recent research has demonstrated that active subspace calculations can be obtained in closed form, conditional on a Gaussian process (GP) surrogate, which can be limiting in high-dimensional settings for computational reasons. In this paper, we produce the relevant calculations for a more general case when the model of interest is a linear combination of tensor products. These general equations can be applied to the GP, recovering previous results as a special case, or applied to the models constructed by other regression techniques including multivariate adaptive regression splines (MARS). Furthermore, using a MARS surrogate has many advantages including improved scaling, better estimation of active subspaces in high dimensions and the ability to handle a large number of prior distributions in closed form. In one real-world example, we obtain the active subspace of a radiation-transport code with 240 inputs and 9,372 model runs in under half an hour.

97 MATHEMATICS AND COMPUTING↗

Gemma V&V/UQ/Credibility Activities: FY2020 Progress

This report describes the credibility activities undertaken in support of Gemma code development in FY20, which include Verification & Validation (V&V), Uncertainty Quantification (UQ), and Credibility process application. The main goal of these activities is to establish capabilities and process frameworks that can be more broadly applied to new and more advanced problems as the Gemma code development effort matures. This will provide Gemma developers and analysts with the tools needed to generate credibility evidence in support of Gemma predictions for future use cases. The FY20 Gemma V&V/UQ/Credibility activities described in this report include experimental uncertainty analysis, the development and use of methods for optimal design of computer experiments, and the development of a framework for validation. These initial activities supported the development of broader credibility planning for Gemma that continued into FY21.

97 MATHEMATICS AND COMPUTING↗

Software for Acoustic Rendering

SLAB is a software system that can be run on a personal computer to simulate an acoustic environment in real time. SLAB was developed to enable computational experimentation in which one can exert low-level control over a variety of signal-processing parameters, related to spatialization, for conducting psychoacoustic studies. Among the parameters that can be manipulated are the number and position of reflections, the fidelity (that is, the number of taps in finite-impulse-response filters), the system latency, and the update rate of the filters. Another goal in the development of SLAB was to provide an inexpensive means of dynamic synthesis of virtual audio over headphones, without need for special-purpose signal-processing hardware. SLAB has a modular, object-oriented design that affords the flexibility and extensibility needed to accommodate a variety of computational experiments and signal-flow structures. SLAB s spatial renderer has a fixed signal-flow architecture corresponding to a set of parallel signal paths from each source to a listener. This fixed architecture can be regarded as a compromise that optimizes efficiency at the expense of complete flexibility. Such a compromise is necessary, given the design goal of enabling computational psychoacoustic experimentation on inexpensive personal computers.

Miller, Joel D.↗

Comparison of open‐source three‐dimensional reconstruction pipelines for maize‐root phenotyping

Abstract Understanding three‐dimensional (3D) root traits is essential to improve water uptake, increase nitrogen capture, and raise carbon sequestration from the atmosphere. However, quantifying 3D root traits by reconstructing 3D root models for deeper field‐grown roots remains a challenge due to the unknown tradeoff between 3D root‐model quality and 3D root‐trait accuracy. Therefore, we performed two computational experiments. We first compared the 3D model quality generated by five state‐of‐the‐art open‐source 3D model reconstruction pipelines on 12 contrasting genotypes of field‐grown maize roots. These pipelines included COLMAP, COLMAP+PMVS (Patch‐based Multi‐View Stereo), VisualSFM, Meshroom, and OpenMVG+MVE (Multi‐View Environment). The COLMAP pipeline achieved the best performance regarding 3D model quality versus computational time and image number needed. In the second test, we compared the accuracy of 3D root‐trait measurement generated by the Digital Imaging of Root Traits 3D pipeline (DIRT/3D) using COLMAP‐based 3D reconstruction with our current DIRT/3D pipeline that uses a VisualSFM‐based 3D reconstruction on the same dataset of 12 genotypes, with 5–10 replicates per genotype. The results revealed that (1) the average number of images needed to build a denser 3D model was reduced from 3000 to 3600 (DIRT/3D [VisualSFM‐based 3D reconstruction]) to around 360 for computational test 1, and around 600 for computational test 2 (DIRT/3D [COLMAP‐based 3D reconstruction]); (2) denser 3D models helped improve the accuracy of the 3D root‐trait measurement; (3) reducing the number of images can help resolve data storage problems. The updated DIRT/3D (COLMAP‐based 3D reconstruction) pipeline enables quicker image collection without compromising the accuracy of 3D root‐trait measurements.

09 BIOMASS FUELS↗

Tactical Defenses Against Systematic Variation in Wind Tunnel Testing

This paper examines the role of unexplained systematic variation on the reproducibility of wind tunnel test results. Sample means and variances estimated in the presence of systematic variations are shown to be susceptible to bias errors that are generally non-reproducible functions of those variations. Unless certain precautions are taken to defend against the effects of systematic variation, it is shown that experimental results can be difficult to duplicate and of dubious value for predicting system response with the highest precision or accuracy that could otherwise be achieved. Results are reported from an experiment designed to estimate how frequently systematic variations are in play in a representative wind tunnel experiment. These results suggest that significant systematic variation occurs frequently enough to cast doubts on the common assumption that sample observations can be reliably assumed to be independent. The consequences of ignoring correlation among observations induced by systematic variation are considered in some detail. Experimental tactics are described that defend against systematic variation. The effectiveness of these tactics is illustrated through computational experiments and real wind tunnel experimental results. Some tutorial information describes how to analyze experimental results that have been obtained using such quality assurance tactics.

DeLoach, Richard↗

Multi-stage heat release of multi-component fuels: Insights and implications for advanced engine operation

Multi-stage heat release (MSHR) is a unique phenomenon typically seen in lean/diluted and low- to intermediate-temperature combustion. Despite its relevance to advanced engine operation, the MSHR of multi-component fuels has barely been quantified. This study aims to characterize the MSHR of multi-component fuels in a rapid compression machine (RCM) at conditions representative of advanced combustion engines. New experimental data are first reported in the RCM at an equivalence ratio of 0.4, pressure of 60 bar and temperatures from 702 to 795 K for a research grade, multi-component gasoline surrogate, termed PACE-20. Here, experiments confirm the existence of MSHR for PACE-20 at all temperatures, and reveal the strong inhibiting effect of temperature on MSHR, where increasing temperature inhibits MSHR by suppressing first stage heat release and promoting second and third stage heat release. A detailed chemical kinetic model is also adopted to model the experiments, with good agreement observed. The response of MSHR characteristics to changes in different engine operating parameters (i.e., temperature, pressure, equivalence ratio and CO 2 dilution level) and fuel compositions (i.e., mole fraction of n-pentane, n-heptane, isooctane, cyclopentane, 1-hexene, ethanol and aromatics in PACE-20) is further evaluated via statistical analysis coupling quasi-random sampling, extensive computer experiments and high-dimensional model representation. The change in MSHR is characterized through 8 quantities of interest (QOIs), i.e., duration and extent of each heat release stage, and their standard deviations. The analysis highlights the dependence of the QOIs on the individual parameters as well as their interplays, with temperature exhibiting the strongest impact among all parameters. Furthermore, it is demonstrated that if MSHR is to be facilitated and combustion phasing is to be extended to enable engine operation at higher compression ratios, it is recommended to operate the engine at low intake temperatures, boosted intake pressures and high CO 2 dilutions (i.e., high EGR levels) with gasoline fuels containing more n-pentane and less aromatics.

42 ENGINEERING↗

The effect of grid aspect ratio on convergence

Vector stability theory and computational experiments are used to examine the effects of high aspect ratio grids on algorithm convergence. Emphasis is placed on identifying the degree of convergence deterioration that ADI schemes experience as grid aspect ratio increases and on deriving methods for circumventing this problem. Approximately factored implicit schemes are found to experience convergence deterioration because of nonoptimum local time stepping procedures and the increased need for viscous preconditioning. An enhanced algorithm is devised on the basis of improved selection of the local time step, appropriate definition of viscous preconditioning matrix, and proper implementation of boundary conditions. The novel algorithm provides uniformly efficient convergence at all aspect ratios for both Euler and Navier-Stokes computations for a variety of test problems.

Buelow, P. E. O.↗

Aeroelastic analysis of advanced propellers using an efficient Euler solver

A 3D Euler solver is coupled with a 3D structural dynamics model to investigate flutter of propfans. A hybrid scheme is used to reduce computational time for the Euler equations and a normal mode analysis is used for flutter calculations. Experimental and calculated flutter results are compared for an advanced propeller propfan which experienced flutter at transonic tip relative velocities. The predicted flutter calculations are in close agreement with the experimental data. A structural damping value of 0.5 percent was required to predict the behavior observed in the experiment. Computations show that the flutter behavior is dominated by the second mode, but coupling with the first mode is required. The addition of other modes to the calculations did not affect the flutter behavior.

Srivastava, R.↗

A versatile ground data display system for Spacelab experiments

A microprocessor-based data capture and display system suited to the needs of many Spacelab experimenters is described. Although developed specifically for the needs of the FAUST UV astronomy telescope, several features of the system may make it attractive to other groups who need to interact with their Spacelab data in real or near-real time. The display system captures data from the serial data stream originating in the Spacelab experiment computer input/output (ECIO) data channel, and can reformat and display several hundred variables per second in real time. The system offers a combination of CRT display and analog paper strip-chart output. A facility is also provided for simultaneously creating floppy-disk records of short segments of data according to prearranged criteria, to allow detailed examination of critical events in the operation of the experiment. The simplicity, economy, reliability, and flexibility of the display system suggest its use for monitoring a variety of low- and medium-data-rate Spacelab experiments.

Werthimer, D.↗

Effect of grid aspect ratio on convergence

The effects of high-aspect-ratio grids on algorithm convergence are considered by means of vector stability theory and computational experiments. The results indicate that approximately factored implicit schemes experience convergence deterioration because of nonoptimum local time-stepping procedures and increased need for viscous preconditioning. Based on this insight, an enhanced algorithm is devised using improved selection of the local time step, appropriate definition of the viscous preconditioning matrix, and proper implementation of the boundary conditions. The new algorithm provides uniformly efficient convergence at all aspect ratios for both Euler and Navier-Stokes computations for a variety of test problems.

Buelow, P. E. O.↗

Motion Dynamics of Motile Microbes in Pore-Networks and its Implications for Reactive Transport Processes

This report outlines new methods to improve simulations of microbial transport and microbially mediated reactions in porous media. A range of experimental, modeling, and machine learning tools are introduced to make these simulations faster, more reliable, and useful for real-world applications. At the microscopic level, the study investigates how different types of bacteria move through confined spaces. A new artificial intelligence tool called DeepTrackStat, is introduced to track motions dynamics as observed in videos of particles migrating through pore networks. This tool is especially helpful for studying fast-moving microbes and requires less computing power than traditional tracking methods. At larger scales, the research looks at how microbes and chemicals interact in zones where surface water and groundwater meet. To connect the small- and large-scale findings, the study presents a neural network model called STAMNet. This tool helps scale up detailed small-scale microbial motion behaviors to predict large-scale environmental changes more efficiently. By combining lab experiments, computer models, and artificial intelligence, the research presented supports smarter environmental decision-making, especially in bioremediation of contaminated groundwater and protection of water quality.

54 ENVIRONMENTAL SCIENCES↗

Automatic Differentiation of C++ Codes on Emerging Manycore Architectures with Sacado

Automatic differentiation (AD) is a well-known technique for evaluating analytic derivatives of calculations implemented on a computer, with numerous software tools available for incorporating AD technology into complex applications. However, a growing challenge for AD is the efficient differentiation of parallel computations implemented on emerging manycore computing architectures such as multicore CPUs, GPUs, and accelerators as these devices become more pervasive. In this work, we explore forward mode, operator overloading-based differentiation of C++ codes on these architectures using the widely available Sacado AD software package. In particular, we leverage Kokkos, a C++ tool providing APIs for implementing parallel computations that is portable to a wide variety of emerging architectures. Here we describe the challenges that arise when differentiating code for these architectures using Kokkos, and two approaches for overcoming them that ensure optimal memory access patterns as well as expose additional dimensions of fine-grained parallelism in the derivative calculation. We describe the results of several computational experiments that demonstrate the performance of the approach on a few contemporary CPU and GPU architectures. We then conclude with applications of these techniques to the simulation of discretized systems of partial differential equations.

97 MATHEMATICS AND COMPUTING↗

Deep Kronecker neural networks: A general framework for neural networks with adaptive activation functions

Here we propose a new type of neural networks, Kronecker neural networks (KNNs), that form a general framework for neural networks with adaptive activation functions. KNNs employ the Kronecker product, which provides an efficient way of constructing a very wide network while keeping the number of parameters low. Our theoretical analysis reveals that under suitable conditions, KNNs induce a faster decay of the loss than that by the feed-forward networks. This is also empirically verified through a set of computational examples. Furthermore, under certain technical assumptions, we establish global convergence of gradient descent for KNNs. As a specific case, we propose the Rowdy activation function that is designed to get rid of any saturation region by injecting sinusoidal fluctuations, which include trainable parameters. The proposed Rowdy activation function can be employed in any neural network architecture like feed-forward neural networks, Recurrent neural networks, Convolutional neural networks etc. The effectiveness of KNNs with Rowdy activation is demonstrated through various computational experiments including function approximation using feed-forward neural networks, solution inference of partial differential equations using the physics-informed neural networks, and standard deep learning benchmark problems using convolutional and fully-connected neural networks.

97 MATHEMATICS AND COMPUTING↗

Numerical Investigation and Optimization of a Flushwall Injector for Scramjet Applications at Hypervelocity Flow Conditions

An investigation utilizing Reynolds-averaged simulations (RAS) was performed in order to demonstrate the use of design and analysis of computer experiments (DACE) methods in Sandia’s DAKOTA software package for surrogate modeling and optimization. These methods were applied to a flow- path fueled with an interdigitated flushwall injector suitable for scramjet applications at hyper- velocity conditions and ascending along a constant dynamic pressure flight trajectory. The flight Mach number, duct height, spanwise width, and injection angle were the design variables selected to maximize two objective functions: the thrust potential and combustion efficiency. Because the RAS of this case are computationally expensive, surrogate models are used for optimization. To build a surrogate model a RAS database is created. The sequence of the design variables comprising the database were generated using a Latin hypercube sampling (LHS) method. A methodology was also developed to automatically build geometries and generate structured grids for each design point. The ensuing RAS analysis generated the simulation database from which the two objective functions were computed using a one-dimensionalization (1D) of the three-dimensional simulation data. The data were fitted using four surrogate models: an artificial neural network (ANN), a cubic polynomial, a quadratic polynomial, and a Kriging model. Variance-based decomposition showed that both objective functions were primarily driven by changes in the duct height. Multiobjective design optimization was performed for all four surrogate models via a genetic algorithm method. Optimal solutions were obtained at the upper and lower bounds of the flight Mach number range. The Kriging model predicted an optimal solution set that exhibited high values for both objective functions. Additionally, three challenge points were selected to assess the designs on the Pareto fronts. Further sampling among the designs of the Pareto fronts may be required to lower the surrogate model errors and perform more accurate surrogate-model-based optimization.

Shenoy, Rajiv R.↗

A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems

We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.

97 MATHEMATICS AND COMPUTING↗

An Application of the Difference Potentials Method to Solving External Problems in CFD

Numerical solution of infinite-domain boundary-value problems requires some special techniques that would make the problem available for treatment on the computer. Indeed, the problem must be discretized in a way that the computer operates with only finite amount of information. Therefore, the original infinite-domain formulation must be altered and/or augmented so that on one hand the solution is not changed (or changed slightly) and on the other hand the finite discrete formulation becomes available. One widely used approach to constructing such discretizations consists of truncating the unbounded original domain and then setting the artificial boundary conditions (ABC's) at the newly formed external boundary. The role of the ABC's is to close the truncated problem and at the same time to ensure that the solution found inside the finite computational domain would be maximally close to (in the ideal case, exactly the same as) the corresponding fragment of the original infinite-domain solution. Let us emphasize that the proper treatment of artificial boundaries may have a profound impact on the overall quality and performance of numerical algorithms. The latter statement is corroborated by the numerous computational experiments and especially concerns the area of CFD, in which external problems present a wide class of practically important formulations. In this paper, we review some work that has been done over the recent years on constructing highly accurate nonlocal ABC's for calculation of compressible external flows. The approach is based on implementation of the generalized potentials and pseudodifferential boundary projection operators analogous to those proposed first by Calderon. The difference potentials method (DPM) by Ryaben'kii is used for the effective computation of the generalized potentials and projections. The resulting ABC's clearly outperform the existing methods from the standpoints of accuracy and robustness, in many cases noticeably speed up the multigrid convergence, and at the same time are quite comparable to other methods from the standpoints of geometric universality and simplicity of implementation.

Ryaben 'Kii, Victor S.↗