Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational complexity”

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 1,603 records · Page 89

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗

Investigating an API for resilient exascale computing.

Increased HPC capability comes with increased complexity, part counts, and fault occurrences. In- creasing the resilience of systems and applications to faults is a critical requirement facing the viability of exascale systems, as the overhead of traditional checkpoint/restart is projected to outweigh its bene ts due to fault rates outpacing I/O bandwidths. As faults occur and propagate throughout hardware and software layers, pervasive noti cation and handling mechanisms are necessary. This report describes an initial investigation of fault types and programming interfaces to mitigate them. Proof-of-concept APIs are presented for the frequent and important cases of memory errors and node failures, and a strategy proposed for lesystem failures. These involve changes to the operating system, runtime, I/O library, and application layers. While a single API for fault handling among hardware and OS and application system-wide remains elusive, the e ort increased our understanding of both the mountainous challenges and the promising trailheads. 3

Stearley, Jon R.↗

Identifying recharge sources and their impacts on a North Central New Mexico shallow aquifer using unsupervised machine learning

In this article, shallow aquifers are important but highly variable resources in arid to semi-arid regions. Limited shallow aquifer volume results in high sensitivity to recharge fluctuations, which can impact the local fauna and flora, and transport of contaminants in the aquifer or vadose zone. Aquifer response to external forcing (e.g., precipitation) is usually solved by estimating aquifer parameters and running physics-based models to match known fluctuations of hydraulic head. However, this technique is time and computationally expensive. Furthermore, high aquifer complexity decreases precision in physics-based models. Alternatively supervised machine learning is used to predict aquifer dynamics. However, these techniques rely on input data and struggle to interpret aquifer response for missing sources (i.e., snowpack data). To counter these problems, we propose an unsupervised machine learning technique (NMFk) to estimate the impact of different sources on aquifer recharge. NMFk is used to understand the influence of external forcing on shallow aquifer recharge in the Pajarito Plateau (Los Alamos, NM, USA). The results show how NMFk can be used to reduce the data dimension in a complex field dataset to three recharge signals that cause fluctuations within the field data. Here, the source signals are interpreted as rainfall, snowmelt, and a delayed aquifer response to the previous two signals. These results evidence how heterogeneous aquifers delimited by canyons incised into the Pajarito Plateau respond in similar ways to the source signals identified by NMFk. Furthermore, results show the importance of the local geology where faults act as sinks, and anthropogenic disturbances can facilitate infiltration amplifying the interpreted signal.

54 ENVIRONMENTAL SCIENCES↗

Optimizing adiabatic quantum program compilation using a graph-theoretic framework

Adiabatic quantum computing has evolved in recent years from a theoretical field into an immensely practical area, a change partially sparked by D-Wave System’s quantum annealing hardware. These multimillion-dollar quantum annealers offer the potential to solve optimization problems millions of times faster than classical heuristics, prompting researchers at Google, NASA and Lockheed Martin to study how these computers can be applied to complex real-world problems such as NASA rover missions. Unfortunately, compiling (embedding) an optimization problem into the annealing hardware is itself a difficult optimization problem and a major bottleneck currently preventing widespread adoption. Additionally, while finding a single embedding is difficult, no generalized method is known for tuning embeddings to use minimal hardware resources. To address these barriers, we introduce a graph-theoretic framework for developing structured embedding algorithms. Using this framework, we introduce a biclique virtual hardware layer to provide a simplified interface to the physical hardware. Additionally, we exploit bipartite structure in quantum programs using odd cycle transversal (OCT) decompositions. By coupling an OCT-based embedding algorithm with new, generalized reduction methods, we develop a new baseline for embedding a wide range of optimization problems into fault-free D-Wave annealing hardware. Furthermore, to encourage the reuse and extension of these techniques, we provide an implementation of the framework and embedding algorithms.

97 MATHEMATICS AND COMPUTING↗

Data Provenance Hybridization Supporting Extreme-Scale Scientific WorkflowApplications

As high performance computing (HPC) infrastructures continue to grow in capability and complexity, so do the applications that they serve. HPC and distributed-area computing (DAC) (e.g. grid and cloud) users are looking increasingly toward workflow solutions to orchestrate their complex application coupling, pre- and post-processing needs To gain insight and a more quantitative understanding of a workflow’s performance our method includes not only the capture of traditional provenance information, but also the capture and integration of system environment metrics helping to give context and explanation for a workflow’s execution. In this paper, we describe IPPD’s provenance management solution (ProvEn) and its hybrid data store combining both of these data provenance perspectives.

provenance↗

Analysis of combustion acoustic phenomena in compression–ignition engines using large eddy simulation

As computational capabilities continue to grow, exploring the limits of computational fluid dynamics to capture complex and elusive phenomena, which are otherwise difficult to study by experimental techniques, is one of the main targets for the research community. This paper presents a detailed analysis of the physical processes that lead to combustion noise emissions in internal combustion engines. In particular, diesel combustion in a compression-ignition (CI) engine is studied in order to understand the singular behavior of the in-cylinder flow field responsible for the acoustic emissions. The main objective is, therefore, to improve the understanding of the phenomena involved in CI engine noise using large eddy simulations. Several visualization methods are employed to investigate the connection between combustion behavior and its effects on the pressure field. In addition, proper orthogonal decomposition is used to analyze the modal energy distribution among all the acoustic modes. The results show that the acoustic signature is fundamentally conditioned by the intensity of the premixed combustion rather than by the pressure oscillations generated by turbulent fluctuations in the flame surface established during the diffusion stage.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Understanding HPC Benchmark Performance on Intel Broadwell and Cascade Lake Processors

Hardware platforms in high performance computing are constantly getting more complex to handle even when considering multicore CPUs alone. Numerous features and configuration options in the hardware and the software environment that are relevant for performance are not even known to most application users or developers. Microbenchmarks, i.e., simple codes that fathom a particular aspect of the hardware, can help to shed light on such issues, but only if they are well understood and if the results can be reconciled with known facts or performance models. The insight gained from microbenchmarks may then be applied to real applications for performance analysis or optimization. In this paper we investigate two modern Intel x86 server CPU architectures in depth: Broadwell EP and Cascade Lake SP. We highlight relevant hardware configuration settings that can have a decisive impact on code performance and show how to properly measure on-chip and off-chip data transfer bandwidths. The new victim L3 cache of Cascade Lake and its advanced replacement policy receive due attention. Finally we use DGEMM, sparse matrix-vector multiplication, and the HPCG benchmark to make a connection to relevant application scenarios.

97 MATHEMATICS AND COMPUTING↗

Determining the impact of a severe dry to wet transition on watershed hydrodynamics in California, USA with an integrated hydrologic model

With the onset of climate change, regions relied upon for water supply are increasingly subject to end-member fluctuations between periods of severe drought followed by extreme precipitation. The impacts of these extreme conditions on watershed hydrodynamics in water-resource sensitive regions such as California are unknown despite their great importance for resilience and water management purposes. Understanding these impacts requires high-resolution physically based models to capture sharp variations of topography, land use, wetting fronts, etc. Here, an integrated hydrologic model was used in a high-performance computing framework to study the complex nonlinear dynamics occurring at a representative Californian watershed. The Cosumnes Watershed, one of the last major rivers in California without a dam, offers a rare opportunity to isolate the effects of water management from climate extremes. Here, we show model validation with comparisons between model outputs and local measurements in addition to various satellite-based products including (1) Snow Water Equivalent (SWE) with Snow Data Assimilation System (SNODAS) and a reconstruction method by Bair and co-authors, (2) soil moisture with Soil Moisture Active Passive (SMAP), and (3) evapotranspiration (ET) with Mapping Evapotranspiration at high Resolution with Internalized Calibration (METRIC). To assess changes in hydrodynamic behavior during climate extremes and their transitions, a simulation spanning a recent drought followed by the highest precipitation year on record (2015–2017) is discussed. From these simulations, we are able to highlight regions that are the most sensitive to climate extremes, which depend on many factors including hydrologic connectivity, geology and topography. These analyses provide a better understanding of the physical phenomena occurring in the watershed, strengthening our knowledge of how the system may respond to extreme conditions which might become the “new normal.”

54 ENVIRONMENTAL SCIENCES↗

Understanding Dynamical Systems in High-Dimensional Parameter Spaces (Final Report)

In the last few decades, computational models, especially of the complex dynamical systems of greatest interest, i.e., climate, high energy density science, combustion, etc. have become increasingly accurate and sophisticated. Consequently, they are now routinely used to predict outcomes of experiments or to inform design decisions. However, many such simulations depend on a (large) number of parameters in order to, for example, approximate physical phenom whose exact solution is unknown or describe material properties in situations with little or no experimental data. Choosing these parameters and understanding how the outcomes of such a simulation changes with respect to the inputs are rapidly becoming some of the primary challenges in many application areas. Simulations have long been too complex for humans to fully comprehend and thus are often treated as black-box systems. The inputs to the systems are typically a collection of parameters with expert-selected ranges, and the outputs are various quantities of interest (QoIs) describing the performance of the system. Therefore, the fundamental challenge can be described as one of understanding a high-dimensional (many input parameters), multi-variate (many QoIs) function. Unfortunately, existing analysis tools are only of limited use for this task as most techniques can neither deal with many input dimensions nor offer opportunities to jointly study several QoIs. Furthermore, data analysis has long relied on an exploratory process in which scientist first visualize the available data, for example, using scatter plots or 3D renderings, form new hypotheses on some phenomena of interest, and subsequently test these hypotheses using dedicated analysis or statistics approaches. However, for high-dimensional functions this exploration is difficult if not impossible using existing tools as there are too many QoIs to simultaneously observe, and visualizations of high-dimensional spaces are abstract and difficult to understand if they exist at all. The goal of this project is to build new analysis techniques and tool that offer high level insights for exploring high-dimensional scientific data. And to extend existing approach beyond single scalar functions and instead consider multiple QoIs simultaneously.

97 MATHEMATICS AND COMPUTING↗

Quantum-Inspired Bayesian Sampling for Uncertainty Quantification and Machine Learning (Final Technical Report)

With increasing simulation and measurement data, machine learning and artificial intelligence have been widely used in computational decision-making of complex engineering systems. The resulting tools, such as uncertainty quantification solvers, reinforcement learning, and physics-informed machine learning, have achieved great success in critical DOE tasks such as material discovery and design, energy system modeling and control, and numerical weather and climate prediction. A core topic in scientific machine learning and artificial intelligence is Bayesian inference: given an observed data set, people want to estimate the posterior distribution of a (possibly large) number of hidden parameters. Due to the flexibility and weak assumptions, Bayesian sampling has been the mainstream Bayesian inference solvers despite the rapid progress of approximate Bayesian inference. Classical Bayesian sampling methods such as Markov-chain Monte Carlo suffer from a low-acceptance rate due to the random walk nature, therefore state-of-the-art techniques use Hamiltonian Monte Carlo and its variants to efficiently draw posterior samples in a high dimension. The key idea of Hamiltonian Monte Carlo and its variants is to simulate the Hamiltonian dynamics of a classical particle with a fixed mass, and their performance significantly degrades when the posterior distribution is highly spiky or has multiple modes. Leveraging the idea of quantum physics, this project has investigated new theory, algorithms and applications of Bayesian inference (especially Bayesian sampling). The main results include: (1) novel quantum-inspired Bayesian sampling methods that can lead to better accuracy for challenging multi-modal or spiky distributions, (2) more scalable machine learning framework leveraging tensor-compressed Bayesian inference, and (3) Bayesian and sampling approaches for verifying the robustness of continuous and binary neural networks.

97 MATHEMATICS AND COMPUTING↗

TomoPyUI : a user-friendly tool for rapid tomography alignment and reconstruction

The management and processing of synchrotron and neutron computed tomography data can be a complex, labor-intensive and unstructured process. Users devote substantial time to both manually processing their data ( i.e. organizing data/metadata, applying image filters etc. ) and waiting for the computation of iterative alignment and reconstruction algorithms to finish. In this work, we present a solution to these problems: TomoPyUI , a user interface for the well known tomography data processing package TomoPy . This highly visual Python software package guides the user through the tomography processing pipeline from data import, preprocessing, alignment and finally to 3D volume reconstruction. The TomoPyUI systematic intermediate data and metadata storage system improves organization, and the inspection and manipulation tools (built within the application) help to avoid interrupted workflows. Notably, TomoPyUI operates entirely within a Jupyter environment. Herein, we provide a summary of these key features of TomoPyUI , along with an overview of the tomography processing pipeline, a discussion of the landscape of existing tomography processing software and the purpose of TomoPyUI , and a demonstration of its capabilities for real tomography data collected at SSRL beamline 6-2c.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Parameterized Neural Ordinary Differential Equations: Applications to Computational Physics Problems

This work proposes an extension of neural ordinary differential equations (NODEs) by introducing an additional set of ODE input parameters to NODEs. This extension allows NODEs to learn multiple dynamics specified by the input parameter instances. Our extension is inspired by the concept of parameterized ordinary differential equations, which are widely investigated in computational science and engineering contexts, where characteristics of the governing equations vary over the input parameters. We apply the proposed parameterized NODEs (PNODEs) for learning latent dynamics of complex dynamical processes that arise in computational physics, which is an essential component for enabling rapid numerical simulations for time-critical physics applications. For this, we propose an encoder-decoder-type framework, which models latent dynamics as PNODEs. We demonstrate the effectiveness of PNODEs with important benchmark problems from computational physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evaluating Chemical Kinetics Predictions for Propane Using 3-D and 0-D Models in a Boosted Spark-Ignited Engine

Propane has been shown to be a promising alternative fuel to reduce emissions while simultaneously achieving high efficiencies in medium- and heavy-duty engines. These high-power density applications require boosted engines which, combined with high compression ratio, can lead to auto-ignition and knock. While three-dimensional (3-D) computational fluid dynamics (CFD) models are often used for resolving the complex fluid flow in engines, these models can become computationally expensive when simulating detailed chemical kinetics. Likewise, zero-dimensional (0-D) models are computationally concise enough for kinetics development, but lack any flow-field information which governs the flame propagation processes in spark ignition (SI) engines. This work presents a comprehensive comparison between 3-D and 0-D closed cycle simulations at knocking conditions in a high compression ratio high stroke-to-bore ratio propane engine. In order to initialize the flow-field for the 3-D closed cycle (intake valve closing, (IVC) to exhaust valve opening, (EVO)) simulation, a motored multi-cycle 3-D model was run using Converge to create a map at IVC, reducing the computational time. The map allowed a non-homogeneous 3-D closed cycle simulation to be satisfactorily validated against experiments, while a homogeneous case using only the turbulence field mapping was also simulated, mimicking 0-D modeling. The 3-D simulations were used to prescribe the initial conditions (e.g., IVC thermodynamics, speciation, burn-rate profile) for a 2-zone 0-D SI engine model in Chemkin Pro for both cases. It was found that 2-zone 0-D modeling underpredicted the knock onset timing, likely due to the lack of thermal stratification in the unburned gas region. Future work will carry multi-zone 0-D modeling to capture the fuel auto-ignition in the unburned region.

Douvry-Rabjeau, Julien [Oakland University, Roches↗

Parallel accelerated Custom Correlation Coefficient calculations for genomics applications

The massive quantities of genomic data being made available through gene sequencing techniques are enabling breakthroughs in genomic science in many areas such as medical advances in the diagnosis and treatment of diseases. Analyzing this data, however, is a computational challenge insofar as the computational costs of the relevant algorithms can grow with quadratic, cubic or higher complexity—leading to the need for leadership scale computing. In this paper we describe a new approach to calculations of the Custom Correlation Coefficient (CCC) between Single Nucleotide Polymorphisms (SNPs) across a population, suitable for parallel systems equipped with graphics processing units (GPUs) or Intel Xeon Phi processors. We describe the mapping of the algorithms to accelerated processors, techniques used for eliminating redundant calculations due to symmetries, and strategies for efficient mapping of the calculations to many-node parallel systems. Results are presented demonstrating high per-node performance and near-ideal parallel scalability with rates of more than nine quadrillion (9 × 10 15 ) elementwise comparisons achieved per second with the latest optimized code on the ORNL Titan system, this being orders of magnitude faster than rates achieved using other codes and platforms as reported in the literature. Also it is estimated that as many as 90 quadrillion (90 × 10 15 ) comparisons per second may be achievable on the upcoming ORNL Summit system, an additional 10X performance increase. Finally, in a companion paper we describe corresponding techniques applied to calculations of the Proportional Similarity metric for comparative genomics applications.

97 MATHEMATICS AND COMPUTING↗

Quantifying transport and electrocatalytic reaction processes in a gastight rotating cylinder electrode reactor via integration of Computational Fluid Dynamics modeling and experiments

Understanding the complexity of the multiple processes of mass, momentum, charge, and heat transport, and how these affect reaction kinetics at the electrode/electrolyte interface is one of the major challenges in the field of energy and catalysis. The rapid and rational scale-up of electrocatalytic systems to industrial scales require a detailed understanding of nonlinear transport-reaction processes, accessible only through the building of multi-physics models that capture with high fidelity the complexity of real-world devices. The gastight rotating cylinder electrode (RCE) reactor is a promising lab-scale tool that can decouple transport from intrinsic kinetics to generate data for first-principle models useful in the design of industrial, electrochemical reactors. Computational Fluid Dynamics (CFD) studies have previously been used to investigate the bulk flow in RCE reactors for simple corrosion and electroplating processes. However, the quantification of changes in local concentration within the viscous layer where catalysis takes place requires capturing the correct flow conditions inside the hydrodynamic boundary layer near the surface of the electrode. Further, this requires simulations with spatial resolution in the nm and μm scale and temporal resolutions between ms and s scales that are similar to the timescales for reactions on the electrode surface. In this study, experimental electrocatalysis is combined with CFD modeling to elucidate and parameterize the hydrodynamics in a gastight RCE reactor. CFD simulations of the electrochemical ferricyanide reduction reaction under mass transport limited conditions are used to evaluate the validity of the CFD model parameters by comparing calculated dimensionless mass transport descriptors to dimensionless correlations obtained experimentally. Justifications for assumptions and details of the simulation methods used in this study are presented to provide a detailed understanding of the effect that each model parameter has on the ability to accurately simulate electrocatalysis in RCE systems. The simulation methodology reported here is a first step towards the development of multi-scale models for the study of transport dependent electrocatalytic processes, such as the electrochemical transformation of CO 2 to fuels and chemicals.

42 ENGINEERING↗

A gated graph transformer for protein complex structure quality assessment and its performance in CASP15

Abstract Motivation Proteins interact to form complexes to carry out essential biological functions. Computational methods such as AlphaFold-multimer have been developed to predict the quaternary structures of protein complexes. An important yet largely unsolved challenge in protein complex structure prediction is to accurately estimate the quality of predicted protein complex structures without any knowledge of the corresponding native structures. Such estimations can then be used to select high-quality predicted complex structures to facilitate biomedical research such as protein function analysis and drug discovery. Results In this work, we introduce a new gated neighborhood-modulating graph transformer to predict the quality of 3D protein complex structures. It incorporates node and edge gates within a graph transformer framework to control information flow during graph message passing. We trained, evaluated and tested the method (called DProQA) on newly-curated protein complex datasets before the 15th Critical Assessment of Techniques for Protein Structure Prediction (CASP15) and then blindly tested it in the 2022 CASP15 experiment. The method was ranked 3rd among the single-model quality assessment methods in CASP15 in terms of the ranking loss of TM-score on 36 complex targets. The rigorous internal and external experiments demonstrate that DProQA is effective in ranking protein complex structures. Availability and implementation The source code, data, and pre-trained models are available at https://github.com/jianlin-cheng/DProQA.

59 BASIC BIOLOGICAL SCIENCES↗