Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational challenge”

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 325 records · Page 18

BEYONDPLANCK III. Commander3

We describe the computational infrastructure for end-to-end Bayesian cosmic microwave background (CMB) analysis implemented by the BeyondPlanck Collaboration. The code is called Commander3. It provides a statistically consistent framework for global analysis of CMB and microwave observations and may be useful for a wide range of legacy, current, and future experiments. The paper has three main goals. Firstly, we provide a high-level overview of the existing code base, aiming to guide readers who wish to extend and adapt the code according to their own needs or re-implement it from scratch in a different programming language. Secondly, we discuss some critical computational challenges that arise within any global CMB analysis framework, for instance in-memory compression of time-ordered data, fast Fourier transform optimization, and parallelization and load-balancing. Thirdly, we quantify the CPU and RAM requirements for the current BEYONDPLANCK analysis, finding that a total of 1.5 TB of RAM is required for efficient analysis and that the total cost of a full Gibbs sample for LFI is 170 CPU-hrs, including both low-level processing and high-level component separation, which is well within the capabilities of current low-cost computing facilities. The existing code base is made publicly available under a GNU General Public Library (GPL) license.

79 ASTRONOMY AND ASTROPHYSICS↗

Leverage Score Sampling for Parametric PDEs (Final Technical Report)

This final technical report summarizes the accomplishments of work performed under DOE Office of Science Award DE-SC0022266, which is titled “Leverage Score Sampling for Parametric PDEs”. The goal of the project was to extend methods from Randomized Numerical Linear Algebra (RandNLA) to tackle central computational challenges in model order reduction and uncertainty quantification (UQ) for parametric partial differential equations (PDEs). In particular, we sought to use importance sampling methods originally developed for RandNLA to develop sample efficient active learning algorithms for approximating high-dimensional scalar functions, e.g. by polynomials, Gaussian process models, and simple neural networks. Such methods can be immediately applied to developing surrogate models or to approximating quantity of interest (QoI) surfaces. In the context of PDEs, each sample used for learning equates to the solution of the differential equation for a particular set of parameters, so sample efficiency translates to improved computational efficiency for a variety of downstream tasks.

97 MATHEMATICS AND COMPUTING↗

Learning Optimal Solutions for Extremely Fast AC Optimal Power Flow

We develop, in this paper, a machine learning approach to optimize the real-time operation of electric power grids. In particular, we learn feasible solutions to the AC optimal power flow (OPF) problem with negligible optimality gaps. The AC OPF problem aims at identifying optimal operational conditions of the power grids that minimize power losses and/or generation costs. Due to the computational challenges with solving this nonconvex problem, many efforts have focused on linearizing or approximating the problem in order to solve the AC OPF on faster timescales. However, many of these approximations can be fairly poor representations of the actual system state and still require solving an optimization problem, which can be time consuming for large networks. In this work, we learn a mapping between the system loading and optimal generation values, enabling us to find near-optimal and feasible AC OPF solutions. This allows us to bypass solving the traditionally nonconvex AC OPF problem, resulting in a significant decrease in computational burden for grid operators.

machine learning↗

Learning Optimal Solutions for Extremely Fast AC Optimal Power Flow: Preprint

We develop, in this paper, a machine learning approach to optimize the real-time operation of electric power grids. In particular, we learn feasible solutions to the AC optimal power flow (OPF) problem with negligible optimality gaps. The AC OPF problem aims at identifying optimal operational conditions of the power grids that minimize power losses and/or generation costs. Due to the computational challenges with solving this nonconvex problem, many efforts have focused on linearizing or approximating the problem in order to solve the AC OPF on faster timescales. However, many of these approximations can be fairly poor representations of the actual system state and still require solving an optimization problem, which can be time consuming for large networks. In this work, we learn a mapping between the system loading and optimal generation values, enabling us to find near-optimal and feasible AC OPF solutions. This allows us to bypass solving the traditionally nonconvex AC OPF problem, resulting in a significant decrease in computational burden for grid operators.

machine learning↗

Final Technical Report: Mathematical Foundations for Uncertainty Quantification in Materials Design

We developed path-wise information theory-based and goal-oriented sensitivity analysis and parameter identification methods for complex high-dimensional dynamics and in particular of non-equilibrium extended molecular systems. The combination of these novel methodologies provided the first methods in the literature which are capable to handle UQ questions for stochastic complex systems with some or all of the following features: (a) multi-scale stochastic models such as (bio)chemical reaction networks, with a very large number of parameters, (b) spatially distributed systems such as Kinetic Monte Carlo or Langevin Dynamics, (c) non-equilibrium processes typically associated with coupled physico-chemical mechanisms, driven boundary conditions, hybrid micro-macro systems, etc. A particular computational challenge arises in simulations of multi-scale reaction networks and molecular systems. Mathematical techniques were applied to in silico prediction of novel materials with emphasis on the effect of microstructure on model uncertainty quantification (UQ). We outline acceleration methods to make calculations of real chemistry feasible followed by two complementary tasks on structure optimization and microstructure-induced UQ.

97 MATHEMATICS AND COMPUTING↗

Parallel Dynamics Simulation Using a Krylov-Schwarz Linear Solution Scheme

Fast dynamics simulation of large-scale power systems is a computational challenge because of the need to solve a large set of stiff, nonlinear differential-algebraic equations at every time step. The main bottleneck in dynamic simulations is the solution of a linear system during each nonlinear iteration of Newton’s method. In this paper, we present a parallel Krylov- Schwarz linear solution scheme that uses the Krylov subspacebased iterative linear solver GMRES with an overlapping restricted additive Schwarz preconditioner. As a result, performance tests of the proposed Krylov-Schwarz scheme for several large test cases ranging from 2,000 to 20,000 buses, including a real utility network, show good scalability on different computing architectures.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Robust reconstruction of single-cell RNA-seq data with iterative gene weight updates

Single-cell RNA-sequencing technologies have greatly enhanced our understanding of heterogeneous cell populations and underlying regulatory processes. However, structural (spatial or temporal) relations between cells are lost during cell dissociation. These relations are crucial for identifying associated biological processes. Many existing tissue-reconstruction algorithms use prior information about subsets of genes that are informative with respect to the structure or process to be reconstructed. When such information is not available, and in the general case when the input genes code for multiple processes, including being susceptible to noise, biological reconstruction is often computationally challenging. We propose an algorithm that iteratively identifies manifold-informative genes using existing reconstruction algorithms for single-cell RNA-seq data as subroutine. We show that our algorithm improves the quality of tissue reconstruction for diverse synthetic and real scRNA-seq data, including data from the mammalian intestinal epithelium and liver lobules.

59 BASIC BIOLOGICAL SCIENCES↗

Exploration of Turbulent Atomization Mechanisms for Diesel Spray Simulations

The atomization and initial spray formation processes in direct injection engines are not well understood due to the experimental and computational challenges associated with resolving these processes. Although different physical mechanisms, such as aerodynamic-induced instabilities and nozzle-generated turbulence and cavitation, have been proposed in the literature to describe these processes, direct validation of the theoretical basis of these models under engine-relevant conditions has not been possible to date. Recent developments in droplet sizing measurement techniques offer a new opportunity to evaluate droplet size distributions formed in the central and peripheral regions of the spray. There is therefore a need to understand how these measurements might be utilized to validate unobservable physics in the near nozzle-region. To address this need, we conduct a computational study using 3D CFD simulations in CONVERGE to explore the relationship between the selected primary atomization model and droplet sizes formed in the central and peripheral regions of the spray. Two existing primary atomization models from the literature are studied to characterize the influence of competing aerodynamics and turbulence mechanisms on the spray formation process. We develop and implement a new hybrid primary atomization model to evaluate the influence of the assumed turbulent scaling on the predicted spray structure. Local sensitivity analysis is performed over a wide range of ambient densities, injection pressures and nozzle diameters to compare the response of predicted droplet sizes in different regions of the spray to changes in injection and ambient conditions. Comparison of the predicted spray structure among the three spray models and against available measurements helps identify a set of experimental conditions and measurements that are needed to inform the development of improved atomization and spray breakup models.

33 ADVANCED PROPULSION SYSTEMS↗

High Performance Computing Facility Operational Assessment 2016 - Oak Ridge Leadership Computing Facility

Oak Ridge National Laboratory’s (ORNL’s) Leadership Computing Facility (OLCF) continues to surpass its operational target goals: supporting users; delivering fast, reliable systems; creating innovative solutions for high-performance computing (HPC) needs; and managing risks, safety, and security associated with operating one of the most powerful computers in the world. The results can be seen in the cutting-edge science delivered by users and the praise from the research community. Calendar year (CY) 2016 was filled with outstanding operational results and accomplishments: a very high rating from users on overall satisfaction for the third year in a row; the greatest number of core hours delivered to research projects; the largest number of research publications for the life of Titan; and success in delivering on the allocation of 60%, 30%, and 10% of core hours offered for the Innovative and Novel Computational Impact on Theory and Experiment (INCITE), Advanced Scientific Computing Research Leadership Computing Challenge (ALCC), and Director’s Discretionary (DD) programs, respectively. These accomplishments, coupled with the extremely high utilization rate, represent the fulfillment of the promise of Titan: maximum use by maximum-size simulations.

97 MATHEMATICS AND COMPUTING↗

Parallel Vehicular Traffic Simulation using Reverse Computation-based Optimistic Execution

Vehicular traffic simulations are useful in applications such as emergency management and homeland security planning tools. High speed of traffic simulations translates directly to speed of response and level of resilience in those applications. Here, a parallel traffic simulation approach is presented that is aimed at reducing the time for simulating emergency vehicular traffic scenarios. Three unique aspects of this effort are: (1) exploration of optimistic simulation applied to vehicular traffic simulation (2) addressing reverse computation challenges specific to optimistic vehicular traffic simulation (3) achieving absolute (as opposed to self-relative) speedup with a sequential speed equal to that of a fast, de facto standard sequential simulator for emergency traffic. The design and development of the parallel simulation system is presented, along with a performance study that demonstrates excellent sequential performance as well as parallel performance.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Computing Reaction Kinetics with MC-PDFT–OPESf: Combining Multireference Electronic Structure Theory and Enhanced Sampling

Accurate rate constants are crucial for understanding and optimizing catalytic reactions mediated by enzymes, metalloproteins, and heterogeneous catalysts. These systems frequently present a dual computational challenge. Multiconfigurational reaction sites require multireference techniques for the accurate treatment of the electronic structure, and high activation barriers prevent efficient sampling of unbiased reactive transitions. In this work, we combine multiconfiguration pair-density functional theory (MC-PDFT) as an accurate and efficient multireference electronic structure method with on-the-fly probability-enhanced sampling flooding (OPESf) as an enhanced sampling method capable of accelerating reactive transitions. We demonstrate the approach on the Diels–Alder [4+2] cycloaddition between cis-butadiene and ethene as a reaction characterized by a large activation barrier and multireference character. MC-PDFT–OPESf provides reaction rates in agreement with experiments at a fraction of the computational cost required by conventional unbiased ab initio calculations. Here, we propose MC-PDFT–OPESf as an efficient approach for computing kinetics in strongly correlated molecular systems.

Chemical calculations↗

Progress on a New Integrated 3-D UCG Simulator and its Initial Application

A comprehensive simulator is being developed for underground coal gasification (UCG), with the capability to support site selection, design, hazard analyses, operations, and monitoring (Nitao et al., 2010). UCG is computationally challenging because it involves tightly-coupled multi-physical/chemical processes, with vastly different timescales. This new capability will predict cavity growth, product gas composition and rate, and the interaction with the host environment, accounting for site characteristics, injection gas composition and rate, and associated water-well extraction rates. Progress on the new simulator includes completion and system integration of a wall model, a rock spalling model, a cavity boundary tracking model, a one-dimensional cavity gas reactive transport model, a rudimentary rubble heat, mass, and reaction model, and coupling with a pre-existing hydrology simulator. An existing geomechanical simulator was enhanced to model cavity collapse and overburden subsidence. A commercial computational fluid dynamics (CFD) code is being evaluated to model cavity gas flow and combustion in two and three dimensions. Although the simulator is midway in its development, it was applied to modeling the Hoe Creek III field test (Stephens, 1981) conducted in the 1970s, in order to evaluate and demonstrate the simulator's basic capabilities, gain experience, and guide future development. Furthermore, it is consistent with our philosophy of incremental, spiral software development, which helps in identifying and resolving potential problems early in the process. The simulation accounts for two coal seams, two injection points, and air and oxygen phases. Approximate extent and shape of cavity growth showed reasonable agreement with interpreted field data. Product gas composition and carbon consumed could not be simultaneously matched for a given set of parameter values due to the rudimentary rubble model currently used, although they can be matched using separate parameter sets. This result is not surprising and confirms plans for a more sophisticated rubble model as our next step, as well as adding geomechanical collapse modeling and higher accuracy cavity gas reactive transport models. The results are very encouraging and demonstrate that our approach is sound.

01 COAL, LIGNITE, AND PEAT↗

The benzene radical anion: A computationally demanding prototype for aromatic anions

The benzene radical anion is studied with ab initio coupled-cluster theory in large basis sets. Unlike the usual assumption, we find that, at the level of theory investigated, the minimum energy geometry is non-planar with tetrahedral distortion at two opposite carbon atoms. The anion is well known for its instability to auto-ionization which poses computational challenges to determine its properties. Despite the importance of the benzene radical anion, the considerable attention it has received in the literature so far has failed to address the details of its structure and shape-resonance character at a high level of theory. Here, we examine the dynamic Jahn-Teller effect and its impact on the anion potential energy surface. We find that a minimum energy geometry of C{sub 2} symmetry is located below one D{sub 2h} stationary point on a C{sub 2h} pseudo-rotation surface. The applicability of standard wave function methods to an unbound anion is assessed with the stabilization method. The isotropic hyperfine splitting constants (A{sub iso}) are computed and compared to data obtained from experimental electron spin resonance experiments. Satisfactory agreement with experiment is obtained with coupled-cluster theory and large basis sets such as cc-pCVQZ.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Adaptive Dynamic Simulations for Distribution Systems Using Multistate Load Models

Running electromechanical simulations with a small time-step for a long period of time is computationally challenging, especially when large system models are used. Typically, simulations with a small time-step, 1 millisecond or less, are only run for a few seconds or a couple of minutes. While this trade-off has allowed for short duration simulations of large systems, it has prevented the complete analysis of power system phenomena that span minutes to hours, such as fault induced delayed voltage recovery. As power system operations become more complex with the deployment of new technologies, it will become more important to model dynamic behavior over greater time scales. This will include the ability to model system dynamics at the distribution level, including the end-use loads. This paper will present a computationally efficient method of adaptive dynamic simulations that enable transitions between time-series and dynamic modes, as necessary to capture system dynamics, while also being able to run for extended periods of time. This capability can support the direct analysis of dynamic events, co-simulation of transmission and distribution systems, and the development of reduced-order models.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Simulating the Birth of the Universe on a PetaFlop

In the beginning, when the universe was less than one microsecond old and more than one trillion degrees hot, it transformed from a plasma of quarks and gluons into bound states of quarks we reefer to as protons and neutrons, the fundamental building blocks of nuclear matter that make up most of the visible universe. We believe this happened because the theory of quantum chromodynamics (QCD), which governs the interactions of the strong nuclear force, predicts it should happen when such conditions occur. Recent experiments at the Relativistic Heavy Ion Collider at Brookhaven National Laboratory have provided direct evidence of the existence of this phase transition in collisions between gold nuclei at the highest attainable energies. But calculating the properties of this phase transition has been notoriously difficult and computationally challenging. What we've been able to discern via this theory has come by situating space and time onto a 4D grid of lattice points, on a volume no bigger than the size of a large nucleus. This discrete formulation of QCD known as lattice QCD (LQCD) can be tamed in a way that's numerically amenable to massively parallel machines. Indeed, our LQCD code scaled with perfect speedup all the way to the 131,072 CPU cores on the world's fastest supercomputer, the BlueGene/L (BG/L) system at Lawrence Livermore National Laboratory (LLNL). Efforts are currently under way to calculate this phase transition's properties using tens of teraflops spread across many of the world's fastest computers. However, the lattice discretization used in our calculations of space-time breaks one of the most crucial properties of the underlying theory: the basic symmetry of chiral rotations. Chiral symmetry can't be fully restored on the lattice, but it can be restored and controlled to a high degree by using the method of domain wall fermions (DWF). DWF introduces an extra fifth dimension, in which chiral symmetry is restored with only a small amount of breaking, which decreases as the fifth dimension's size increases. In particular, researchers have estimated that a fifth dimension of roughly 64 lattice points is sufficient to restore symmetry with a systematic error of only a few percent, even around the transition temperature. Studies have also shown that DWF exhibits excellent fidelity in incorporating the transition's basic driving forces. But the computational cost of this calculation is roughly 2 x 64 = 128 times higher than the cost of current methods that don't preserve this symmetry on the lattice, and thus it falls outside the realm of current terascale supercomputing. With petascale supercomputing, however, this restriction is lifted. If we had petascale supercomputing for our calculation, we could use computational techniques similar to those used on BG/L to calculate the thermodynamic properties--or more precisely, the equation of state--of the quark-gluon plasma just as it begins to form protons and neutrons as it did in the very early universe. The basic level of parallelism again comes from the division of the 4D grid into subgrids assigned to nodes on a massively parallel machine, thereby providing perfect speedup. DWF's fifth dimension provides yet another level of parallelism: given that the nodes of a massively parallel petascale supercomputer will likely consist of several CPU cores per chip, it's natural to fully map the fifth dimension along the node chip's CPU cores. On a 16-CPU core chip, for example, we could assign four fifth-dimension 'slices' per CPU core for a total of 64. In this way, the new level of parallelism in the application matches the new level of parallelism in the hardware. The communication patterns along the fifth dimension are nearest-lattice-neighbor only and can be handled via shared memory or any other on-chip data transfer mechanism, thus alleviating off-chip data transfers while exploiting the hardware's native capability.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Machine learning-accelerated path integral molecular dynamics simulations of reactive organic electrolytes

Hydrogen bonded electrolytes that exhibit accelerated proton transport via sequential reactive hops have drawn interest for their promise in clean energy applications. Molecular dynamics simulations of these electrolytes offer the opportunity to uncover microscopic mechanistic details that could be used to design and tune the properties of candidate electrolyte technologies. However, accurately modeling the proton transfer reactions and transport properties that give rise to high charge conductivites in these electrolytes proves computationally challenging because of the need to perform lengthy condensed phase simulations, treating both the electronic and nuclear degrees of freedom quantum mechanically. In this paper, we demonstrate that such a modeling task can be efficiently achieved with the use of density functional theory (DFT)-trained machine learning potentials (MLP) to accelerate path integral molecular dynamics (PIMD) simulations. We highlight the practical utility of this approach by using it to benchmark how closely PIMD simulations employing different DFT exchange–correlation functionals reproduce the composition-dependent densities, diffusion coefficients, and electrical conductivities of mixtures consisting of imidazole and levulinic acid. Even with the speedup afforded by our MLPs, PIMD simulations remain quite expensive. Furthermore, in order to render PIMD more computationally tractable, we introduce and benchmark the accuracy of a ring polymer contraction approach that leverages a computationally efficient short-range MLP to accelerate our PIMD simulations by an additional factor of four.

Chemical bonding↗

Estimating and Calibrating DER Model Parameters Using Levenberg–Marquardt Algorithm in Renewable Rich Power Grid

The proliferation of inverter-based distributed energy resources (IBDERs) has increased the number of control variables and dynamic interactions, leading to new grid control challenges. For stability analysis and designing appropriate protection controls, it is important that IBDER models are accurate. This paper focuses on the accurate estimation and parameter calibration of DER_A, a recently proposed aggregated IBDER model. In particular, we focus on the parameters of the reactive power–voltage regulation module. We formulate the problem of parameter tuning as a non-linear least square minimization problem and solve it using the Levenberg–Marquardt (LM) method. The LM method is primarily chosen due to its flexibility in adaptively selecting between the steepest descent and Gauss–Newton methods through a damping parameter. The LM approach is used to minimize the error between the actual measurements and the estimated response of the model. Further, the computational challenges posed by the numerical calculation of the Jacobian are tackled using a quasi-Newton root-finding approach. The proposed method is validated on a real feeder model in the northeastern part of the United States. The feeder is modeled in OpenDSS and the measurements thus obtained are fed to the DER_A model for calibration. The simulation results indicate that our approach is able to successfully calibrate the relevant model parameters quickly and with high accuracy, with a total sum of square error of 3.57 × 10 –7 .

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DECA: Discrete Event inspired Cellular Automata for grain structure prediction in additive manufacturing

Microstructure largely dictates macroscopic material properties and is strongly affected by processing. Therefore, the simulation of microstructure evolution in response to thermal fields during processing is of significant interest within the computational materials science community. Additive manufacturing (AM) has emerged as a technique for producing complex geometries and unique microstructures. Yet, complex and rapid thermal cycles in AM pose computational challenges for existing microstructure models. This work proposes a discrete event inspired cellular automata (CA) approach, titled DECA, to accelerate simulation of grain structure evolution in AM. In contrast to conventional time-stepped CA models, this model directly solves the times capture events would take place allowing for stepping in events rather than time (a technique also found in the field of discrete-event simulation). In comparison to purely serial discrete-event models, DECA allows for temporary violation of the causality constraint, but detects and corrects these violations, leading to an emergent phenomenon dubbed causality rippling, in which previously calculated capture events are overwritten. The amount of repeated calculations, defined by the capture ratio, is taken as a measure of computational inefficiency, and the model parameters that affect this ratio are evaluated. The new DECA approach was found to be more computationally efficient than conventional time-stepped CA models while guaranteeing an accurate solution, which can only be achieved in the conventional models for vanishingly small time steps. Finally, opportunities for parallelization and scaling of the new approach are discussed.

36 MATERIALS SCIENCE↗