Kyle Gerard Felker
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Kyle Gerard Felker has a total of 65 co-authors. Here are the top co-authors by number of shared publications:
- Paul K. Romano
Argonne National Laboratory
3 shared publications A.R. Siegel
Argonne National Laboratory, Nuclear Engineering Division, United States and Argonne National Laboratory, Mathematics and Computer Science Division, United States
2 shared publicationsB. Forget
2 shared publicationsChristopher J. White
2 shared publications- James M. Stone
School of Natural Sciences, Institute for Advanced Study, Princeton, NJ, USA
2 shared publications K. Smith
2 shared publications
Latest Publications
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1966-1979
What to Support When You’re Compressing
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1966-1979
Open AccessWhat to Support When You’re Compressing
- Open Access
Implementation of AI/Deep Learning Disruption Predictor into a Plasma Control System
This paper reports on advances to the state-of-the-art deep-learning disruption prediction models based on the Fusion Recurrent Neural Network (FRNN) originally introduced a 2019 Nature publication. In particular, the predictor now features not only the disruption score, as an indicator of the probability of an imminent disruption, but also a sensitivity score in real-time to indicate the underlying reasons for the imminent disruption. This adds valuable physics-interpretability for the deep-learning model and can provide helpful guidance for control actuators now that it is fully implemented into a modern Plasma Control System (PCS). The advance is a significant step forward in moving from modern deep-learning disruption prediction to real-time control and brings novel AI-enabled capabilities relevant for application to the future burning plasma ITER system. Our analyses use large amounts of data from JET and DIII-D vetted in the earlier NATURE publication. In addition to when a shot is predicted to disrupt, this paper addresses reasons why by carrying out sensitivity studies. FRNN is accordingly extended to use many more channels of information, including measured DIII-D signals such as (i) the n1rms signal that is correlated with the n =1 modes with finite frequency, including neoclassical tearing mode and sawtooth dynamics, (ii) the bolometer data indicative of plasma impurity content, and (iii) q-min, the minimum value of the safety factor relevant to the key physics of kink modes. The additional channels and interpretability features expand the ability of the deep learning FRNN software to provide information about disruption subcategories as well as more precise and direct guidance for the actuators in a plasma control system.
Open AccessImplementation of AI/Deep Learning Disruption Predictor into a Plasma Control System
This paper reports on advances to the state-of-the-art deep-learning disruption prediction models based on the Fusion Recurrent Neural Network (FRNN) originally introduced a 2019 Nature publication. In particular, the predictor now features not only the disruption score, as an indicator of the probability of an imminent disruption, but also a sensitivity score in real-time to indicate the underlying reasons for the imminent disruption. This adds valuable physics-interpretability for the deep-learning model and can provide helpful guidance for control actuators now that it is fully implemented into a modern Plasma Control System (PCS). The advance is a significant step forward in moving from modern deep-learning disruption prediction to real-time control and brings novel AI-enabled capabilities relevant for application to the future burning plasma ITER system. Our analyses use large amounts of data from JET and DIII-D vetted in the earlier NATURE publication. In addition to when a shot is predicted to disrupt, this paper addresses reasons why by carrying out sensitivity studies. FRNN is accordingly extended to use many more channels of information, including measured DIII-D signals such as (i) the n1rms signal that is correlated with the n =1 modes with finite frequency, including neoclassical tearing mode and sawtooth dynamics, (ii) the bolometer data indicative of plasma impurity content, and (iii) q-min, the minimum value of the safety factor relevant to the key physics of kink modes. The additional channels and interpretability features expand the ability of the deep learning FRNN software to provide information about disruption subcategories as well as more precise and direct guidance for the actuators in a plasma control system.
- Top Cited Papers
- 25 June 2020
- Published by American Astronomical Society in The Astrophysical Journal Supplement Series
- Vol. 249 (1)
The Athena++ Adaptive Mesh Refinement Framework: Design and Magnetohydrodynamic Solvers
The design and implementation of a new framework for adaptive mesh refinement calculations are described. It is intended primarily for applications in astrophysical fluid dynamics, but its flexible and modular design enables its use for a wide variety of physics. The framework works with both uniform and nonuniform grids in Cartesian and curvilinear coordinate systems. It adopts a dynamic execution model based on a simple design called a “task list” that improves parallel performance by overlapping communication and computation, simplifies the inclusion of a diverse range of physics, and even enables multiphysics models involving different physics in different regions of the calculation. We describe physics modules implemented in this framework for both nonrelativistic and relativistic magnetohydrodynamics (MHD). These modules adopt mature and robust algorithms originally developed for the Athena MHD code and incorporate new extensions: support for curvilinear coordinates, higher-order time integrators, more realistic physics such as a general equation of state, and diffusion terms that can be integrated with super-time-stepping algorithms. The modules show excellent performance and scaling, with well over 80% parallel efficiency on over half a million threads. The source code has been made publicly available.
- 25 June 2020
- Published by American Astronomical Society in The Astrophysical Journal Supplement Series
- Vol. 249 (1)
Top Cited PapersThe Athena++ Adaptive Mesh Refinement Framework: Design and Magnetohydrodynamic Solvers
The design and implementation of a new framework for adaptive mesh refinement calculations are described. It is intended primarily for applications in astrophysical fluid dynamics, but its flexible and modular design enables its use for a wide variety of physics. The framework works with both uniform and nonuniform grids in Cartesian and curvilinear coordinate systems. It adopts a dynamic execution model based on a simple design called a “task list” that improves parallel performance by overlapping communication and computation, simplifies the inclusion of a diverse range of physics, and even enables multiphysics models involving different physics in different regions of the calculation. We describe physics modules implemented in this framework for both nonrelativistic and relativistic magnetohydrodynamics (MHD). These modules adopt mature and robust algorithms originally developed for the Athena MHD code and incorporate new extensions: support for curvilinear coordinates, higher-order time integrators, more realistic physics such as a general equation of state, and diffusion terms that can be integrated with super-time-stepping algorithms. The modules show excellent performance and scaling, with well over 80% parallel efficiency on over half a million threads. The source code has been made publicly available.
- Open Access
The Athena++ Adaptive Mesh Refinement Framework: Design and Magnetohydrodynamic Solvers
The design and implementation of a new framework for adaptive mesh refinement (AMR) calculations is described. It is intended primarily for applications in astrophysical fluid dynamics, but its flexible and modular design enables its use for a wide variety of physics. The framework works with both uniform and nonuniform grids in Cartesian and curvilinear coordinate systems. It adopts a dynamic execution model based on a simple design called a "task list" that improves parallel performance by overlapping communication and computation, simplifies the inclusion of a diverse range of physics, and even enables multiphysics models involving different physics in different regions of the calculation. We describe physics modules implemented in this framework for both non-relativistic and relativistic magnetohydrodynamics (MHD). These modules adopt mature and robust algorithms originally developed for the Athena MHD code and incorporate new extensions: support for curvilinear coordinates, higher-order time integrators, more realistic physics such as a general equation of state, and diffusion terms that can be integrated with super-time-stepping algorithms. The modules show excellent performance and scaling, with well over 80% parallel efficiency on over half a million threads. The source code has been made publicly available.
Open AccessThe Athena++ Adaptive Mesh Refinement Framework: Design and Magnetohydrodynamic Solvers
The design and implementation of a new framework for adaptive mesh refinement (AMR) calculations is described. It is intended primarily for applications in astrophysical fluid dynamics, but its flexible and modular design enables its use for a wide variety of physics. The framework works with both uniform and nonuniform grids in Cartesian and curvilinear coordinate systems. It adopts a dynamic execution model based on a simple design called a "task list" that improves parallel performance by overlapping communication and computation, simplifies the inclusion of a diverse range of physics, and even enables multiphysics models involving different physics in different regions of the calculation. We describe physics modules implemented in this framework for both non-relativistic and relativistic magnetohydrodynamics (MHD). These modules adopt mature and robust algorithms originally developed for the Athena MHD code and incorporate new extensions: support for curvilinear coordinates, higher-order time integrators, more realistic physics such as a general equation of state, and diffusion terms that can be integrated with super-time-stepping algorithms. The modules show excellent performance and scaling, with well over 80% parallel efficiency on over half a million threads. The source code has been made publicly available.
- 1 December 2018
- Published by Elsevier in Journal of Computational Physics
- Vol. 375, 1365-1400
A fourth-order accurate finite volume method for ideal MHD via upwind constrained transport
- 1 December 2018
- Published by Elsevier in Journal of Computational Physics
- Vol. 375, 1365-1400
A fourth-order accurate finite volume method for ideal MHD via upwind constrained transport
- Open Access
- 1 April 2014
- Published by Elsevier in Computer Physics Communications
- Vol. 185 (4) , 1195-1199
Improved cache performance in Monte Carlo transport calculations using energy banding
- 1 April 2014
- Published by Elsevier in Computer Physics Communications
- Vol. 185 (4) , 1195-1199
Open AccessImproved cache performance in Monte Carlo transport calculations using energy banding
- Open Access
- 14 July 2013
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 28 (1) , 87-96
Multi-core performance studies of a Monte Carlo neutron transport code
Performance results are presented for a multi-threaded version of the OpenMC Monte Carlo neutronics code using OpenMP in the context of nuclear reactor criticality calculations. Our main interest is production computing, and thus we limit our approach to threading strategies that both require reasonable levels of development effort and preserve the code features necessary for robust application to real-world reactor problems. Several approaches are developed and the results compared on several multi-core platforms using a popular reactor physics benchmark. A broad range of performance studies are distilled into a simple, consistent picture of the empirical performance characteristics of reactor Monte Carlo algorithms on current multi-core architectures.
- 14 July 2013
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 28 (1) , 87-96
Open AccessMulti-core performance studies of a Monte Carlo neutron transport code
Performance results are presented for a multi-threaded version of the OpenMC Monte Carlo neutronics code using OpenMP in the context of nuclear reactor criticality calculations. Our main interest is production computing, and thus we limit our approach to threading strategies that both require reasonable levels of development effort and preserve the code features necessary for robust application to real-world reactor problems. Several approaches are developed and the results compared on several multi-core platforms using a popular reactor physics benchmark. A broad range of performance studies are distilled into a simple, consistent picture of the empirical performance characteristics of reactor Monte Carlo algorithms on current multi-core architectures.
- Open Access
- 1 February 2013
- Published by Elsevier in Journal of Computational Physics
- Vol. 235, 901-911
The effect of load imbalances on the performance of Monte Carlo algorithms in LWR analysis
- 1 February 2013
- Published by Elsevier in Journal of Computational Physics
- Vol. 235, 901-911
Open AccessThe effect of load imbalances on the performance of Monte Carlo algorithms in LWR analysis
- 4 June 2012
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 27 (2) , 210-216
Optimizing Memory Constrained Environments in Monte Carlo Nuclear Reactor Simulations
Monte Carlo neutron transport codes are a growing subject of research in nuclear reactor analysis. For robust reactor analysis, large scale neutron transport simulations require computation of reaction rates for tens of billions of particles involving several hundred isotopes. When employing physical-space domain decomposition, minimizing memory consumption while safely and efficiently exchanging massive amounts of data is a significant challenge. To address this problem, we implement and test several “memory-aware”, in-place, sparse, all-to-all MPI communication implementations. The algorithms are developed and tested within the open source MADRE (Memory-Aware Data Redistribution) project, which gives application programmers a simple API and set of tools and algorithms for carrying out memory-transparent in-place communication. We explore memory and communication efficiency tradeoffs for a range of in-place algorithms using a simple Monte Carlo communication kernel intended to mimic the behavior of our full Monte Carlo neutronics code.
- 4 June 2012
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 27 (2) , 210-216
Optimizing Memory Constrained Environments in Monte Carlo Nuclear Reactor Simulations
Monte Carlo neutron transport codes are a growing subject of research in nuclear reactor analysis. For robust reactor analysis, large scale neutron transport simulations require computation of reaction rates for tens of billions of particles involving several hundred isotopes. When employing physical-space domain decomposition, minimizing memory consumption while safely and efficiently exchanging massive amounts of data is a significant challenge. To address this problem, we implement and test several “memory-aware”, in-place, sparse, all-to-all MPI communication implementations. The algorithms are developed and tested within the open source MADRE (Memory-Aware Data Redistribution) project, which gives application programmers a simple API and set of tools and algorithms for carrying out memory-transparent in-place communication. We explore memory and communication efficiency tradeoffs for a range of in-place algorithms using a simple Monte Carlo communication kernel intended to mimic the behavior of our full Monte Carlo neutronics code.