mystic and pathos: the summer project that evolved into a career of research in artificial intelligence, machine learning, and high-performance computing [Slides]
Abstract not provided.
97 MATHEMATICS AND COMPUTING↗
SEARCH · Engineering Papers
Results for “Mathematical 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.
Improved force models for Euler - Lagrange computations
Explore the source record for details and available documents.
Engineering - Mechanical and civil engineering, Ma↗
Solving Unit Commitment Problems with Demand Responsive Loads
This work focuses on using variations of the Frank-Wolfe (FW) algorithm for solving unit commitment problems with high volumes of demand responsive loads on the power grid. We present a formulation of the unit commitment problem with demand responsive loads. We then show through reformulation and relaxations of the problem that variations of the Frank-Wolfe algorithm can be used to determine the time series decisions for the demand responsive loads. We show through computational experiments on the IEEE Reliability Test System that the timeseries of demand responsive load decisions obtained through our approach are near optimal and describe how large-scale parallel implementations of our approach can be highly computationally efficient.
demand response↗
Synergistic Catalysis between Pd and Fe in Gas Phase Hydrodeoxygenation of m-Cresol
In this work, a series of Pd/Fe2O3 catalysts were synthesized, characterized, and evaluated for the hydrodeoxygenation (HDO) of m-cresol. It was found that the addition of Pd remarkably promotes the catalytic activity of Fe while the product distributions resemble that of monometallic Fe catalyst, showing high selectivity towards the production of toluene (C-O cleavage without saturation of aromatic ring and C-C cleavage). Reduced catalysts featured with Pd patches on the top of reduced Fe nanoparticle surface, and the interaction between Pd and Fe was further confirmed using X-ray photoelectron spectroscopy (XPS), scanning transmission electron microscopy (STEM) and X-ray absorption near edge fine structure (XANES). A possible mechanism, including Pd assisted H2 dissociation and Pd facilitated stabilization of metallic Fe surface as well as Pd enhanced product desorption, is proposed to be responsible for the high activity and HDO selectivity in Pd-Fe catalysts. The synergic catalysis derived from Pd-Fe interaction found in this work was proved to be applicable to other precious metal promoted Fe catalysts, providing a promising strategy for future design of highly active and selective HDO catalysts.
09 BIOMASS FUELS↗
Hybrid programming-model strategies for GPU offloading of electronic structure calculation kernels
To address the challenge of performance portability and facilitate the implementation of electronic structure solvers, we developed the basic matrix library (BML) and Parallel, Rapid O(N), and Graph-based Recursive Electronic Structure Solver (PROGRESS) library. The BML implements linear algebra operations necessary for electronic structure kernels using a unified user interface for various matrix formats (dense and sparse) and architectures (CPUs and GPUs). Focusing on density functional theory and tight-binding models, PROGRESS implements several solvers for computing the single-particle density matrix and relies on BML. In this paper, we describe the general strategies used for these implementations on various computer architectures, using OpenMP target functionalities on GPUs, in conjunction with third-party libraries to handle performance critical numerical kernels. In this study, we demonstrate the portability of this approach and its performance in benchmark problems.
36 MATERIALS SCIENCE↗
Domain decomposition approaches for accelerating contour integration eigenvalue solvers for symmetric eigenvalue problems
This work discusses techniques for computing a few selected eigenvalue–eigenvector pairs of large and sparse symmetric matrices. A recently developed class of techniques to solve this type of problems is based on integrating the matrix resolvent operator along a complex contour that encloses the interval containing the eigenvalues of interest. This paper considers such contour integration techniques from a domain decomposition viewpoint and proposes two schemes. The first scheme can be seen as an extension of domain decomposition linear system solvers in the framework of contour integration methods for eigenvalue problems, such as FEAST. The second scheme focuses on integrating the resolvent operator primarily along the interface region defined by adjacent subdomains. A parallel implementation of the proposed schemes is described, and results on distributed computing environments are reported. These results show that domain decomposition approaches can lead to reduced run times and improved scalability.
97 MATHEMATICS AND COMPUTING↗
Final Report: Sublinear Algorithms for In-situ and In-transit Data Analysis at Exascale.
Post-Moore's law scaling is creating a disruptive shift in simulation workflows, as saving the entirety of raw data to persistent storage becomes expensive. We are moving away from a post-process centric data analysis paradigm towards a concurrent analysis framework, in which raw simulation data is processed as it is computed. Algorithms must adapt to machines with extreme concurrency, low communication bandwidth, and high memory latency, while operating within the time constraints prescribed by the simulation. Furthermore, in- put parameters are often data dependent and cannot always be prescribed. The study of sublinear algorithms is a recent development in theoretical computer science and discrete mathematics that has significant potential to provide solutions for these challenges. The approaches of sublinear algorithms address the fundamental mathematical problem of understanding global features of a data set using limited resources. These theoretical ideas align with practical challenges of in-situ and in-transit computation where vast amounts of data must be processed under severe communication and memory constraints. This report details key advancements made in applying sublinear algorithms in-situ to identify features of interest and to enable adaptive workflows over the course of a three year LDRD. Prior to this LDRD, there was no precedent in applying sublinear techniques to large-scale, physics based simulations. This project has definitively demonstrated their efficacy at mitigating high performance computing challenges and highlighted the rich potential for follow-on re- search opportunities in this space.
97 MATHEMATICS AND COMPUTING↗
Transforming Energy Through Computational Excellence: A Virtual Test-Drive of Energy Scenarios
Researchers at the National Renewable Energy Laboratory (NREL) are conducting groundbreaking research to decarbonize transportation systems and reduce emissions. As they plan for growing populations and related demands on aging infrastructure and energy systems, local transportation departments and city planners are facing significant, complex challenges. New approaches to planning and operations, as well as capitalizing on rapidly advancing technology, can address mobility and energy-centric challenges, including cost and energy efficiency, emissions reduction, decarbonization, and congestion.
33 ADVANCED PROPULSION SYSTEMS↗
Revisiting Power Systems Time-Domain Simulation Methods and Models
The changing nature of power systems dynamics is challenging present practices related to modeling and study of system-level dynamic behavior. While developing new techniques and models to handle the new modeling requirements, it is also critical to review some of the terminology used to describe existing simulation approaches and the embedded assumptions. This article provides a first-principles review of the simplifications and transformations commonly used in the formulation of time-domain simulation models. It introduces a taxonomy and classification of time-domain simulation models depending on their frequency bandwidth, network representation, and software availability. Furthermore, it focuses on the fundamental aspects of averaging techniques, and model reduction approaches that result in modeling choices, and discusses the associated challenges and opportunities of applying these methods in systems with large shares of Inverter Based Resources (IBRs). The article concludes with an illustrative simulation that compares the trajectories of an IBR-dominated system.
behavioral sciences↗
Development of a Multiphase Adjoint Capability in OpenFOAM
Thermal hydraulic predictions of flow regimes within nuclear reactor cores require significant computational resources and accuracy to ensure that the core design does not violate the thermal limits of materials. Multiphase computational fluid dynamics (CFD) has become a valuable computational capability for predicting flow characteristics as they relate to applications such as nuclear reactor safety and mixing phenomena around spacer grids within fuel assemblies. Multiphase CFD requires closure relationships for both the effects of turbulence as well as the transfer of mass, momentum, and energy between phases. Understanding the sensitivity of the parameters used in closure relationships is important for improving accuracy, but performing rigorous sensitivity analysis is computationally expensive. Adjoint mathematics have been utilized for reactor physics and fluid dynamics applications with respect to verification, sensitivity analysis, adaptive mesh refinement, and optimization. The usage of adjoint methods to predict the sensitivities of a variety of closure relationship parameters within a given problem has been shown to return sensitivity responses with significantly fewer computations than normal 'large-scale' methods. As the complexity of multiphase CFD methods increases, the demand for accurate verification tools and improvements in computational efficiency also increases, making the development of adjoint capabilities an attractive option. Closure relationships that describe interphase momentum physics in multiphase CFD modelling rely heavily on prescribed constants determined from experimental data. Due to the computational efficiency of an adjoint approach, the time to derive these closure relationships could be dramatically reduced, and data assimilation techniques could be used to return probability density functions of closure models derived using experimental data. This work develops a multiphase adjoint capability for the Eulerian-Eulerian two field, two phase equations. Specifically, the adjoint capability has been developed for the sub-cooled nucleate boiling solver boilEulerFoam developed by Dr. Nam Dinh of NC State University within the open-source CFD library OpenFOAM.
22 GENERAL STUDIES OF NUCLEAR REACTORS↗
Understanding Discrete Fracture Networks Through Spectral Graph Theory [Slides]
This presentation includes discussion of the use of spectral graph theory to understand fracture networks to reduce computational effort.
58 GEOSCIENCES↗
Fortran mimetic abstraction language (Formal) v0.1.
The Fortran mimetic abstraction language ("Formal") is a domain-specific language (DSL) embedded in Fortran 202Y [1]. Formal provides novel software abstractions for simulating phenomena governed by the partial differential equations (PDEs) of vector and tensor calculus. Such equations model an extremely broad set of physical phenomena, ranging from atmospheric winds to light propagation. Formal's data structures and algorithms mimic in form and behavior continuous functions and operators. Formal supports these mathematical constructs using mimetic discretizations that define a discrete calculus satisfying various tensor calculus theorems, thereby ensuring high-fidelity representations of the physics being modeled. [2] Formal 0.1.0 also lays a foundation for the future use of Fortran 202Y type-safe templates to facilitate the formal verification of tensor contractions in computational physics and artificial intelligence [3]. [1] "Fortran 202Y" is Fortran standard committee's informal designation for the next Fortran revision, which will likely be "Fortran 2028". [2] Corbino, J. and Castillo, J. (2020) Journal of Computational and Applied Mathematics, https://doi.org/10.1016/j.cam.2019.06.042. [3] Haveraaen, M., Järvi, J., & Rouson, D. (2019). Reflecting on Generics for Fortran. https://j3-fortran.org/doc/year/19/19-188.pdf.
Rouson, Damian [Lawrence Berkeley National Laborat↗
Computer model of cardiovascular control system responses to exercise
Approaches of systems analysis and mathematical modeling together with computer simulation techniques are applied to the cardiovascular system in order to simulate dynamic responses of the system to a range of exercise work loads. A block diagram of the circulatory model is presented, taking into account arterial segments, venous segments, arterio-venous circulation branches, and the heart. A cardiovascular control system model is also discussed together with model test results.
Croston, R. C.↗
Research and Education in Computational Science and Engineering
Over the past two decades the field of computational science and engineering (CSE) has penetrated both basic and applied research in academia, industry, and laboratories to advance discovery, optimize systems, support decision-makers, and educate the scientific and engineering workforce. Informed by centuries of theory and experiment, CSE performs computational experiments to answer questions that neither theory nor experiment alone is equipped to answer. CSE provides scientists and engineers of all persuasions with algorithmic inventions and software systems that transcend disciplines and scales. Carried on a wave of digital technology, CSE brings the power of parallelism to bear on troves of data. Mathematics-based advanced computing has become a prevalent means of discovery and innovation in essentially all areas of science, engineering, technology, and society; and the CSE community is at the core of this transformation. However, a combination of disruptive developments— including the architectural complexity of extreme-scale computing, the data revolution that engulfs the planet, and the specialization required to follow the applications to new frontiers—is redefining the scope and reach of the CSE endeavor. This report describes the rapid expansion of CSE and the challenges to sustaining its bold advances. The report also presents strategies and directions for CSE research and education for the next decade.
computational science and engineering↗
From Feynman diagrams to the amplituhedron: a gentle review
In this article we review, for a mathematical audience, the computation of (tree-level) scattering amplitudes in Yang-Mills theory in detail. In particular we demonstrate explicitly how the same formulas for six-particle NMHV helicity amplitudes are obtained from summing Feynman diagrams and from computing the canonical form of the n=6, k=1, m=4 amplituhedron.
Feynman diagrams↗
Analysis, approximation, and computation of a coupled solid/fluid temperature control problem
An optimization problem is formulated motivated by the desire to remove temperature peaks, i.e., 'hot spots', along the bounding surfaces of containers of fluid flows. The heat equation of the solid container is coupled to the energy equations for the fluid. Heat sources can be located in the solid body, the fluid, or both. Control is effected by adjustments to the temperature of the fluid at the inflow boundary. Both mathematical analyses and computational experiments are given.
Gunzburger, Max D.↗
Frameworks, Algorithms, and Scalable Technologies for Mathematics (FASTMath) SciDAC Institute
As computational models scale to larger computers, the rate at which they produce data has far outstripped the same computers ability to write that data and further the file systems ability to store that data. Almost all of the SciDAC applications, but especially those related to fusion solve very large scale PDEs whose scientific output his impacted by this problem. To gain access to dynamics in an exascale simulation that are not identifiable a priori and to make that dynamical data available to machine learning requires fundamental research in the area of in situ data data analytics. Here data analytics includes compression, visualization, uncertainty quantification, and machine learning. This in situ data analytics will enable on-the-fly spatial and temporal compression of solution dynamics, expose that space-time compressed field to machine learning algorithms that have been specialized to work with dynamically evolving data (existing machine learning algorithms treat data sets as static), greatly improving the opportunity for machine learning to provide feedback to the compression, all within an ongoing simulation, without the need to write data to files. The same concepts are also being applied to uncertainty quantification and multi-fidelity modeling which have similar needs for spatial and temporal compression of the ongoing exascale simulation to perform either without the typical, unacceptable writing of data to files.
97 MATHEMATICS AND COMPUTING↗
High-order finite-volume methods for hyperbolic conservation laws on mapped multiblock grids
Explore the source record for details and available documents.
97 MATHEMATICS AND COMPUTING↗