Search NASA⌕ Search

Engineering topics

Sutherland, James C.

Publications and source records attributed to Sutherland, James C..

At least 19 records

PCAfold 2.0—Novel tools and algorithms for low-dimensional manifold assessment and optimization

We describe an update to our open-source Python package, PCAfold, designed to help researchers generate, analyze and improve low-dimensional data manifolds. In the current version, PCAfold 2.0, we introduce novel tools and algorithms for assessing and optimizing low-dimensional manifolds. This includes a method that generates a “map” of local feature sizes that can help pinpoint researchers to problematic regions on a manifold. We introduce a novel cost function that characterizes the quality of a manifold topology with a single number. We develop two algorithms for feature selection based on principal component analysis (PCA) that use the cost function as an objective function to minimize. We introduce a quantity of interest (QoI)-aware dimensionality reduction strategy where data projections are computed using an artificial neural network and are directly optimized towards representing various projection-independent and projection-dependent QoIs. We also introduce an implementation of partition of unity networks (POUnets) for efficient reconstruction of QoIs from low-dimensional manifolds based on combining neural network classification with localized polynomial regression. Our software can be broadly applicable in all domains of science and engineering that aim to reduce data dimensionality, as well as in the fundamental research on representation learning.

97 MATHEMATICS AND COMPUTING↗

Cost function for low-dimensional manifold topology assessment

Abstract In reduced-order modeling, complex systems that exhibit high state-space dimensionality are described and evolved using a small number of parameters. These parameters can be obtained in a data-driven way, where a high-dimensional dataset is projected onto a lower-dimensional basis. A complex system is then restricted to states on a low-dimensional manifold where it can be efficiently modeled. While this approach brings computational benefits, obtaining a good quality of the manifold topology becomes a crucial aspect when models, such as nonlinear regression, are built on top of the manifold. Here, we present a quantitative metric for characterizing manifold topologies. Our metric pays attention to non-uniqueness and spatial gradients in physical quantities of interest, and can be applied to manifolds of arbitrary dimensionality. Using the metric as a cost function in optimization algorithms, we show that optimized low-dimensional projections can be found. We delineate a few applications of the cost function to datasets representing argon plasma, reacting flows and atmospheric pollutant dispersion. We demonstrate how the cost function can assess various dimensionality reduction and manifold learning techniques as well as data preprocessing strategies in their capacity to yield quality low-dimensional projections. We show that improved manifold topologies can facilitate building nonlinear regression models.

42 ENGINEERING↗

Accurate Compression of Tabulated Chemistry Models with Partition of Unity Networks

Tabulated chemistry models are widely used to simulate large-scale turbulent fires in applications including energy generation and fire safety. Tabulation via piecewise Cartesian interpolation suffers from the curse-of-dimensionality, leading to a prohibitive exponential growth in parameters and memory usage as more dimensions are considered. Artificial neural networks (ANNs) have attracted attention for constructing surrogates for chemistry models due to their ability to perform high-dimensional approximation. However, due to well-known pathologies regarding the realization of suboptimal local minima during training, in practice they do not converge and provide unreliable accuracy. Partition of unity networks (POUnets) are a recently introduced family of ANNs which preserve notions of convergence while performing high-dimensional approximation, discovering a mesh-free partition of space which may be used to perform optimal polynomial approximation. In this work, we assess their performance with respect to accuracy and model complexity in reconstructing unstructured flamelet data representative of nonadiabatic pool fire models. Our results show that POUnets can provide the desirable accuracy of classical spline-based interpolants with the low memory footprint of traditional ANNs while converging faster to significantly lower errors than ANNs. For example, we observe POUnets obtaining target accuracies in two dimensions with 40 to 50 times less memory and roughly double the compression in three dimensions. We also address the practical matter of efficiently training accurate POUnets by studying convergence over key hyperparameters, the impact of partition/basis formulation, and the sensitivity to initialization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Characterizing Tradeoffs in Memory, Accuracy, and Speed for Chemistry Tabulation Techniques

Chemistry tabulation is a common approach in practical simulations of turbulent combustion at engineering scales. Linear interpolants have traditionally been used for accessing precomputed multidimensional tables but suffer from large memory requirements and discontinuous derivatives. Higher-degree interpolants address some of these restrictions but are similarly limited to relatively low-dimensional tabulation. Artificial neural networks (ANNs) can be used to overcome these limitations but cannot guarantee the same accuracy as interpolants and introduce challenges in reproducibility and reliable training. These challenges are enhanced as the physics complexity to be represented within the tabulation increases. Here, we assess the efficiency, accuracy, and memory requirements of Lagrange polynomials, tensor product B-splines, and ANNs as tabulation strategies. We analyze results in the context of nonadiabatic flamelet modeling where higher dimension counts are necessary. While ANNs do not require structuring of data, providing benefits for complex physics representation, interpolation approaches often rely on some structuring of the table. Interpolation using structured table inputs that are not directly related to the variables transported in a simulation can incur additional query costs. This is demonstrated in the present implementation of heat losses. We show that ANNs, despite being difficult to train and reproduce, can be advantageous for high-dimensional, unstructured datasets relevant to nonadiabatic flamelet models. Furthermore we demonstrate that Lagrange polynomials show significant speedup for similar accuracy compared to B-splines.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Assessment of various tar and soot treatment methods and a priori analysis of the steady laminar flamelet model for use in coal combustion simulation

Soot formed in the fuel-rich regions of coal flames is known to have a significant impact on the radiative heat transfer characteristics of the flame. It is therefore important to account for the effect of soot radiation when simulating coal combustion systems. Several recent coal combustion studies have used acetylene as a surrogate for devolatilized tar and neglect soot formation altogether, while others have utilized empirical models for tar and soot or even chemical mechanisms which include tar and soot as species. In this work, we investigate several methods of treating coal-derived tar and soot and the impact each treatment has on predicted furnace temperature, particle mass loss, and other quantities of interest. Furthermore, we perform a priori comparisons of simulation results to calculations from a steady laminar flamelet model in order to assess the accuracy of a flamelet approach for each tar and soot treatment considered. Data used as a basis for the study is generated through One-Dimensional Turbulence (ODT) simulation of a coal combustion system in which high- fidelity models are used for gas phase chemistry and devolatilization, where char combustion is neglected.

97 MATHEMATICS AND COMPUTING↗

State space parameterization of explosive eigenvalues during autoignition

Explosive modes such as ignition and extinction are characterized by an eigenvalue of the chemical Jacobian matrix with positive real part, representing the transient instability of chain-branching chemistry and thermal feedback. Formation and eigen-decomposition of the Jacobian matrix are expensive operations whose cost increases cubically with chemical mechanism size. As an alternative to directly computing the eigenvalues of the Jacobian, we explore principal component analysis (PCA) along with nonlinear regression as a methodology to parameterize the eigenvalues by state variables (or linear combinations thereof). We evaluate this modeling strategy using homogeneous autoignition data on two different applications: pseudotransient continuation (Ψtc)-based ODE solvers and chemical explosive mode analysis (CEMA). Results indicate that the PCA-based parameterization of the eigenvalues appears feasible for Ψtc solvers in autoignition calculations over a range of temperatures and pressures. Our results also show that eigenvalue models are capable of tracking sharp discontinuities (such as ignition or extinction) in the eigenvalue for computational flame diagnostics such as CEMA.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An a priori Analysis of Mixture Fraction-Based Modeling of Coal Combustion

Due to the high computational cost associated with using detailed kinetic mechanisms, it is common practice to implement reaction models which rely on relatively small number of variables when simulating turbulent combustion systems. In this study, we perform an a priori assessment of the accuracy of three chemistry models: a Burke-Schumann chemistry model, an equilibrium chemistry model, and a steady laminar flamelet model. All chemistry modeling approaches considered include a mixture fraction for devolatilization products, and a normalized enthalpy deficit as parameters, with scalar dissipation rate as an additional input parameter for the flamelet model. Data used as a basis for the study is generated through One-Dimensional Turbulence (ODT) simulation of a coal combustion system in which high-fidelity models are used for gas phase chemistry and devolatilization. The flamelet model was found to be more accurate than both the equilibrium and Burke-Schumann models over a majority of parameter space. The performance of all models considered declined substantially for sufficiently fuel-rich conditions. Furthermore, the analysis in this work indicate that both differential diffusion and speciation of volatiles have a perceptible negative impact on flamelet reconstructions, though the effect of differential diffusion was more substantial.

97 MATHEMATICS AND COMPUTING↗

An evaluation of the efficacy of various coal combustion models for predicting char burnout

Coal combustion is comprised of several subprocesses including devolatilization and heterogeneous reactions of the coal char with O 2 , CO 2 , H 2 O and potentially several other species. Much effort has been put forth to develop models for these processes which vary widely in both complexity and computational cost. This work investigates the efficacy of models for devolatilization and char reactions at either end of the complexity and cost spectrums for a range of particle sizes and furnace temperatures and across coal types. The overlap of simulated devolatilization and char consumption is also examined. In the gas phase, a detailed kinetics model based on a reduced version of the GRI 3.0 mechanism is used. The Char Conversion Kinetics and an n th -order Langmuir-Hinshelwood models are considered for char oxidation. The Chemical Percolation and Devolatilization and a two-step model are considered for devolatilization. Results indicate that high-fidelity models perform better at representing particle temperature and mass data across a wide range of O 2 concentrations as well as coal types. A significant overlap in devolatilization and char consumption is observed for both char chemistry and devolatilization models.

01 COAL, LIGNITE, AND PEAT↗

The effect of model fidelity on prediction of char burnout for single-particle coal combustion

In this study, practical simulation of industrial-scale coal combustion relies on the ability to accurately capture the dynamics of coal subprocesses while also ensuring the computational cost remains reasonable. The majority of the residence time occurs post-devolatilization, so it is of great importance that a balance between the computational efficiency and accuracy of char combustion models is carefully considered. In this work, we consider the importance of model fidelity during char combustion by comparing combinations of simple and complex gas and particle-phase chemistry models. Detailed kinetics based on the GRI 3.0 mechanism and infinitely-fast chemistry are considered in the gas-phase. The Char Conversion Kinetics model and nth-Order Langmuir–Hinshelwood model are considered for char consumption. For devolatilization, the Chemical Percolation and Devolatilization and Kobayashi-Sarofim models are employed. The relative importance of gasification versus oxidation reactions in air and oxyfuel environments is also examined for various coal types. Results are compared to previously published experimental data collected under laminar, single-particle conditions. Calculated particle temperature histories are strongly dependent on the choice of gas phase and char chemistry models, but only weakly dependent on the chosen devolatilization model. Particle mass calculations were found to be very sensitive to the choice of devolatilization model, but only somewhat sensitive to the choice of gas chemistry and char chemistry models. High-fidelity models for devolatilization generally resulted in particle temperature and mass calculations that were closer to experimentally observed values.

01 COAL, LIGNITE, AND PEAT↗

Wasatch: An architecture-proof multiphysics development environment using a Domain Specific Language and graph theory

To address the coding and software challenges of modern hybrid architectures, we propose an approach to multiphysics code development for high-performance computing. This approach is based on using a Domain Specific Language (DSL) in tandem with a directed acyclic graph (DAG) representation of the problem to be solved that allows runtime algorithm generation. When coupled with a large-scale parallel framework, the result is a portable development framework capable of executing on hybrid platforms and handling the challenges of multiphysics applications. In addition, we share our experience developing a code in such an environment – an effort that spans an interdisciplinary team of engineers and computer scientists.

97 MATHEMATICS AND COMPUTING↗

Nebo: An efficient, parallel, and portable domain-specific language for numerically solving partial differential equations

This study presents Nebo, a declarative domain-specific language embedded in C++ for discretizing partial differential equations for transport phenomena on multiple architectures. Application programmers use Nebo to write code that appears sequential but can be run in parallel, without editing the code. Currently Nebo supports single-thread execution, multi-thread execution, and many-core (GPU-based) execution. With single-thread execution, Nebo performs on par with code written by domain experts. With multi-thread execution, Nebo can linearly scale (with roughly 90% efficiency) up to 12 cores, compared to its single-thread execution. Moreover, Nebo’s many-core execution can be over 140x faster than its single-thread execution.

97 MATHEMATICS AND COMPUTING↗

Algorithms and Abstractions for Assembly in PDE Codes: Workshop Report

The emergence of high-concurrency architectures offering unprecedented performance has brought many high-performance partial differential equation (PDE) discretization codes to the precipice of a major refactor. To help address this challenge a workshop titled "Algorithms and Abstractions for Assembly in PDE Codes" was held in the Computer Science Research Institute at Sandia National Laboratories on May 12th-14th, 2014. This document summarizes the goals of the workshop and the results of the presentations and subsequent discussions.

97 MATHEMATICS AND COMPUTING↗

DAG-Based Software Frameworks for PDEs

The task-based approach to software and parallelism is well-known and has been proposed as a potential candidate, named the silver model, for exascale software. This approach is not yet widely used in the large-scale multi-core parallel computing of complex systems of partial differential equations. After surveying task-based approaches we investigate how well the Uintah software and an extension named Wasatch fit in the task-based paradigm and how well they perform on large scale parallel computers. The conclusion is that these approaches show great promise for petascale but that considerable algorithmic challenges remain.

Directed Acyclic Graph↗