GPU-Accelerated WENO Schemes for the DNS of CompressibleTurbulent Flows on Exascale Computing Platforms
Explore the source record for details and available documents.
Engineering - Aeronautics, Mathematics and Computi↗
SEARCH · Engineering Papers
Results for “mathematics computing”
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.
Decomposing Planar Shapes into Quads Using Reinforcement Learning [Slides]
We aim to use machine learning to teach a computer to decompose models into meshable sub-shapes.
97 MATHEMATICS AND COMPUTING↗
Cyber Infrastructure for the Smart Electric Grid
As electric power systems undergo a transformative upgrade with the integration of advanced technologies to enable the smarter electric grid, professionals who work in the area require a new understanding of the evolving complexity of the grid. Cyber Infrastructure for the Smart Electric Grid delivers a comprehensive overview of the fundamental principles of smart grid operation and control, smart grid technologies, including sensors, communication networks, computation, data management, and cyber security, and the interdependencies between the component technologies on which a smart grid's security depends. The book offers readers the opportunity to critically analyze the smart grid infrastructure needed to sense, communicate, compute, and control in a secure way.
communication networks↗
Visualisation and outlier detection for probability density function ensembles
Abstract Exploratory data analysis (EDA) for functional data—data objects where observations are entire functions—is a difficult problem that has seen significant attention in recent literature. This surge in interest is motivated by the ubiquitous nature of functional data, which are prevalent in applications across fields such as meteorology, biology, medicine and engineering. Empirical probability density functions (PDFs) can be viewed as constrained functional data objects that must integrate to one and be nonnegative. They show up in contexts such as yearly income distributions, zooplankton size structure in oceanography and in connectivity patterns in the brain, among others. While PDF data are certainly common in modern research, little attention has been given to EDA specifically for PDFs. In this paper, we extend several methods for EDA on functional data for PDFs and compare them on simulated data that exhibit different types of variation, designed to mimic that seen in real‐world applications. We then use our new methods to perform EDA on the breakthrough curves observed in gas transport simulations for underground fracture networks.
97 MATHEMATICS AND COMPUTING↗
Special Issue: Geostatistics and Machine Learning
Abstract Recent years have seen a steady growth in the number of papers that apply machine learning methods to problems in the earth sciences. Although they have different origins, machine learning and geostatistics share concepts and methods. For example, the kriging formalism can be cast in the machine learning framework of Gaussian process regression. Machine learning, with its focus on algorithms and ability to seek, identify, and exploit hidden structures in big data sets, is providing new tools for exploration and prediction in the earth sciences. Geostatistics, on the other hand, offers interpretable models of spatial (and spatiotemporal) dependence. This special issue on Geostatistics and Machine Learning aims to investigate applications of machine learning methods as well as hybrid approaches combining machine learning and geostatistics which advance our understanding and predictive ability of spatial processes.
58 GEOSCIENCES↗
A series representation of the discrete fractional Laplace operator of arbitrary order
Although fractional powers of non-negative operators have received much attention in recent years, there is still little known about their behavior if real-valued exponents are greater than one. In this article, we define and study the discrete fractional Laplace operator of arbitrary real-valued positive order. Here a series representation of the discrete fractional Laplace operator for positive non-integer powers is developed. Its convergence to a series representation of a known case of positive integer powers is proven as the power tends to the integer value. Furthermore, we show that the new representation for arbitrary real-valued positive powers of the discrete Laplace operator is consistent with existing theoretical results.
97 MATHEMATICS AND COMPUTING↗
From multivariate to functional data analysis: Fundamentals, recent developments, and emerging areas
Functional data analysis (FDA), which is a branch of statistics on modeling infinite dimensional random vectors resided in functional spaces, has become a major research area for Journal of Multivariate Analysis. We review some fundamental concepts of FDA, their origins and connections from multivariate analysis, and some of its recent developments, including multi-level functional data analysis, high-dimensional functional regression, and dependent functional data analysis. Here, we also discuss the impact of these new methodology developments on genetics, plant science, wearable device data analysis, image data analysis, and business analytics. Two real data examples are provided to motivate our discussions.
97 MATHEMATICS AND COMPUTING↗
Systematically Improving Espresso: Insights from Mathematical Modeling and Experiment
Espresso is a beverage brewed using hot, high-pressure water forced through a bed of roasted coffee. Despite being one of the most widely consumed coffee formats, it is also the most susceptible to variation. Here, we report a novel model, complimented by experiment, that is able to isolate the contributions of several brewing variables, thereby disentangling some of the sources of variation in espresso extraction. Under the key assumption of homogeneous flow through the coffee bed, a monotonic decrease in extraction yield with increasingly coarse grind settings is predicted. However, experimental measurements show a peak in the extraction yield versus grind setting relationship, with lower extraction yields at both very coarse and fine settings. This result strongly suggests that inhomogeneous flow is operative at fine grind settings, resulting in poor reproducibility and wasted raw material. With instruction from our model, we outline a procedure to eliminate these shortcomings.
97 MATHEMATICS AND COMPUTING↗
Learning effective stochastic differential equations from microscopic simulations: Linking stochastic numerics to deep learning
We identify effective stochastic differential equations (SDEs) for coarse observables of fine-grained particle- or agent-based simulations; these SDEs then provide useful coarse surrogate models of the fine scale dynamics. We approximate the drift and diffusivity functions in these effective SDEs through neural networks, which can be thought of as effective stochastic ResNets. The loss function is inspired by, and embodies, the structure of established stochastic numerical integrators (here, Euler–Maruyama and Milstein); our approximations can thus benefit from backward error analysis of these underlying numerical schemes. They also lend themselves naturally to “physics-informed” gray-box identification when approximate coarse models, such as mean field equations, are available. Existing numerical integration schemes for Langevin-type equations and for stochastic partial differential equations can also be used for training; we demonstrate this on a stochastically forced oscillator and the stochastic wave equation. Our approach does not require long trajectories, works on scattered snapshot data, and is designed to naturally handle different time steps per snapshot. We consider both the case where the coarse collective observables are known in advance, as well as the case where they must be found in a data-driven manner.
97 MATHEMATICS AND COMPUTING↗
Mixed-mode oscillations in a three-timescale coupled Morris–Lecar system
Mixed-mode oscillations (MMOs) are complex oscillatory behaviors of multiple-timescale dynamical systems in which there is an alternation of large-amplitude and small-amplitude oscillations. It is well known that MMOs in two-timescale systems can arise either from a canard mechanism associated with folded node singularities or a delayed Andronov–Hopf bifurcation (DHB) of the fast subsystem. While MMOs in two-timescale systems have been extensively studied, less is known regarding MMOs emerging in three-timescale systems. In this work, we examine the mechanisms of MMOs in coupled Morris–Lecar neurons with three distinct timescales. We investigate two kinds of MMOs occurring in the presence of a singularity known as canard-delayed-Hopf (CDH) and in cases where CDH is absent. In both cases, we examine how features and mechanisms of MMOs vary with respect to variations in timescales. Our analysis reveals that MMOs supported by CDH demonstrate significantly stronger robustness than those in its absence. Moreover, we show that the mere presence of CDH does not guarantee the occurrence of MMOs. This work yields important insights into conditions under which the two separate mechanisms in two-timescale context, canard and DHB, can interact in a three-timescale setting and produce more robust MMOs, particularly against timescale variations.
97 MATHEMATICS AND COMPUTING↗
A mathematical model of asynchronous data flow in parallel computers *
Abstract We present a simplified model of data flow on processors in a high-performance computing framework involving computations necessitating inter-processor communications. From this ordinary differential model, we take its asymptotic limit, resulting in a model which treats the computer as a continuum of processors and data flow as an Eulerian fluid governed by a conservation law. We derive a Hamilton–Jacobi equation associated with this conservation law for which the existence and uniqueness of solutions can be proven. We then present the results of numerical experiments for both discrete and continuum models; these show a qualitative agreement between the two and the effect of variations in the computing environment’s processing capabilities on the progress of the modelled computation.
Barnard, Richard C.↗
Collective effects and pattern formation for directional locking of disks moving through obstacle arrays
We examine directional locking effects in an assembly of disks driven through a square array of obstacles as the angle of drive rotates from 0° to 90°. For increasing disk densities, the system exhibits a series of different dynamic patterns along certain locking directions, including one-dimensional or multiple-row chain phases and density-modulated phases. For nonlocking driving directions, the disks form disordered patterns or clusters. Here, when the obstacles are small or far apart, a large number of locking phases appear; however, as the number of disks increases, the number of possible locking phases drops due to the increasing frequency of collisions between the disks and obstacles. For dense arrays or large obstacles, we find an increased clogging effect in which immobile and moving disks coexist.
97 MATHEMATICS AND COMPUTING↗
Enhancing Distribution System Resilience: A First-Order Meta-RL Algorithm for Critical Load Restoration
The increasing frequency of extreme events and the integration of distributed energy resources (DERs) into modern grids have elevated the need for resilient and efficient critical load restoration strategies in distribution systems. However, the stochastic nature of renewable DERs, limited energy resource availability and the intricate nonlinearities inherent in complex grid control problem make the problem challenging. Although reinforcement learning (RL) and warm-start RL methods have shown promising results, their performance often falls short in rapidly adapting to new, unseen situations and typically requires exhaustive problem-specific tuning. To address these gaps, we propose a First-Order Meta-based RL (FOM-RL) algorithm within an online framework for adaptive and robust critical load restoration. By harnessing local DERs as the enabling technology, FOM-RL allows the RL agent to swiftly adapt to new unseen scenarios by leveraging previously acquired knowledge of different tasks. Experimental results provide evidence that proposed algorithm learns more efficiently and showcases generalization capabilities across diverse set of operational scenarios. Moreover, a rigorous theoretical analysis yields a tight sublinear regret bound, sensitive to temporal variability, with a task-averaged optimality gap bounded by O(VM+D*/(Tsquare root(M))). These results suggest that optimality improves with task similarity and an increased number of tasks M, reaffirming the efficacy and scalability of the proposed approach in addressing the complexities of critical load restoration in distribution systems.
complexity theory↗
AIR Algebraic Multigrid for a Space-Time Hybridizable Discontinuous Galerkin Discretization of Advection(-Diffusion)
This article investigates the efficiency, robustness, and scalability of approximate ideal restriction (AIR) algebraic multigrid as a preconditioner in the all-at-once solution of a space-time hybridizable discontinuous Galerkin discretization of advection-dominated flows. The motivation for this study is that the time-dependent advection-diffusion equation can be seen as a “steady” advection-diffusion problem in $(d+1)$-dimensions and AIR has been shown to be a robust solver for steady advection-dominated problems. Numerical examples demonstrate the effectiveness of AIR as a preconditioner for advection-diffusion problems on fixed and time-dependent domains, using both slab-by-slab and all-at-once space-time discretizations, and in the context of uniform and space-time adaptive mesh refinement. A closer look at the geometric coarsening structure that arises in AIR also explains why AIR can provide robust, scalable, space-time convergence on advective and hyperbolic problems, while most multilevel parallel-in-time schemes struggle with such problems.
97 MATHEMATICS AND COMPUTING↗
A Fast Algebraic Multigrid Solver and Accurate Discretization for Highly Anisotropic Heat Flux I: Open Field Lines
We present a novel solver technique for the anisotropic heat flux equation, aimed at the high level of anisotropy seen in magnetic confinement fusion plasmas. Such problems pose two major challenges: (i) discretization accuracy and (ii) efficient implicit linear solvers. We simultaneously address each of these challenges by constructing a new finite element discretization with excellent accuracy properties, tailored to a novel solver approach based on algebraic multigrid (AMG) methods designed for advective operators. We pose the problem in a mixed formulation, introducing the directional temperature gradient as an auxiliary variable. The temperature and auxiliary fields are discretized in a scalar discontinuous Galerkin space with upwinding principles used for discretizations of advection. We demonstrate the proposed discretization’s superior accuracy over other discretizations of anisotropic heat flux, achieving error 1000x smaller for anisotropy ratio of 10 9 , for closed field lines. The block matrix system is reordered and solved in an approach where the two advection operators are inverted using AMG solvers based on approximate ideal restriction, which is particularly efficient for upwind discontinuous Galerkin discretizations of advection. To ensure that the advection operators are nonsingular, in this paper we restrict ourselves to considering open (acyclic) magnetic field lines for the linear solvers. We demonstrate fast convergence of the proposed iterative solver in highly anisotropic regimes where other diffusion-based AMG methods fail.
97 MATHEMATICS AND COMPUTING↗
Supervised and Unsupervised Machine Learning to Understanding Reactive-transport Data [Slides]
Every physio-chemical variable affects the system. At well, carbonate minerals dominated the system along with clay minerals. At distant well, clay minerals dominated the system. Dominance of K at both well signifies that clay minerals play a major role in the system
54 ENVIRONMENTAL SCIENCES↗
Theory Manual for the Fuel Cycle Analysis Code REBUS
REBUS is a system of programs designed for the fuel cycle analysis of fast reactors and accelerator-driven systems. The first version of REBUS was developed in 1970 for calculating the equilibrium operating conditions of liquid metal fast breeder reactors. During the past five decades, various extensions and refinements have been made in the simulation of material motions in fuel cycle facilities and the solution of the neutronics and isotopic transmutation equations that govern the reactor behavior. The latest version complies with the standard code practices and interface dataset specifications of the committee on computer code coordination (CCCC). This report provides a detailed description of the physical processes and their mathematical models and solution methods of the current production version of REBUS. The models of the facilities and physical processes involved in fast reactor fuel cycle are first discussed. Then the mathematical formulation of these physical models is presented, followed by detailed discussions of solution methods of the resulting set of equations. Finally the output edit quantities are discussed along with their definitions.
11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
Covariance Testing and Update on 239 Pu and 235 U PFNS Covariances [Slides]
This presentation discusses in detail how covariances were obtained and tested. Along with a look into some of the mathematical checks that were performed. Possible "physics issues" in covariances were highlighted and addressed. Covariances for Dysprosium and Erbium-169 were touched on along with various uncertainties and issues. An update on Uranium-235 and Plutonium-239 Pu PFNS covariances was given.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗