Matthew Gregg Knepley
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
Matthew Gregg Knepley has a total of 142 co-authors. Here are the top co-authors by number of shared publications:
- Jed Brown
University of Colorado Boulder
5 shared publications - Lorena A. Barba
The George Washington University, Washington, D.C., USA
5 shared publications - Mark F. Adams
Lawrence Berkeley National Laboratory, Berkeley, CA 94720 USA
5 shared publications - Jaydeep P. Bardhan
Dept. of Molecular Biophysics and Physiology Rush University Medical Center 60612 Chicago IL
4 shared publications - Barry Smith
Argonne National Laboratory
3 shared publications - Lawrence Mitchell
NVIDIA Corporation, Santa Clara, CA 95051 USA
3 shared publications
Latest Publications
- Open Access
Error Estimation for Adaptive Mesh Refinement in Droplet Simulations
We present a one-dimensional shear-force-driven droplet formation model with a flux-based error estimator. The model is derived using asymptotic expansion and a front-tracking method to simulate the droplet interface. The model is then discretized using the Galerkin finite element method in the mixed form. However, the solution gradients exhibit large jumps across element boundaries and can grow rapidly due to the highly convective pinch-off process. This leads to an erroneous droplet interface and incorrect curvature. Therefore, the mesh must be sufficiently refined to capture the interface accurately. The mixed form of the governing equation naturally provides smooth interface gradients that can be used to compute the error estimate. The computed error estimate is then used to drive the adaptive mesh refinement algorithm. The efficacy of the error estimator is illustrated by comparing the droplet profiles obtained with adaptive refinement to those obtained with regular refinement. The adaptive mesh refinement approach reduces the computational cost significantly without compromising accuracy. For an 85% glycerol droplet in co-flowing air, AMR reproduces pinch-off location, surface area, volume, and pinch-off time with only ≈1% accuracy loss compared to the highly refined reference while reducing wall-clock time from 638 s to 153 s (4.17× speedup) and reducing the maximum element count from 800 to 146 (81.75% reduction).
Open AccessError Estimation for Adaptive Mesh Refinement in Droplet Simulations
We present a one-dimensional shear-force-driven droplet formation model with a flux-based error estimator. The model is derived using asymptotic expansion and a front-tracking method to simulate the droplet interface. The model is then discretized using the Galerkin finite element method in the mixed form. However, the solution gradients exhibit large jumps across element boundaries and can grow rapidly due to the highly convective pinch-off process. This leads to an erroneous droplet interface and incorrect curvature. Therefore, the mesh must be sufficiently refined to capture the interface accurately. The mixed form of the governing equation naturally provides smooth interface gradients that can be used to compute the error estimate. The computed error estimate is then used to drive the adaptive mesh refinement algorithm. The efficacy of the error estimator is illustrated by comparing the droplet profiles obtained with adaptive refinement to those obtained with regular refinement. The adaptive mesh refinement approach reduces the computational cost significantly without compromising accuracy. For an 85% glycerol droplet in co-flowing air, AMR reproduces pinch-off location, surface area, volume, and pinch-off time with only ≈1% accuracy loss compared to the highly refined reference while reducing wall-clock time from 638 s to 153 s (4.17× speedup) and reducing the maximum element count from 800 to 146 (81.75% reduction).
- Open Access
- 4 February 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 554
Structure preservation using discrete gradients in the Vlasov-Poisson-Landau system
- 4 February 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 554
Open AccessStructure preservation using discrete gradients in the Vlasov-Poisson-Landau system
- 8 January 2026
- Published by Elsevier in Computer Physics Communications
- Vol. 321
A projection method for particle resampling
- 8 January 2026
- Published by Elsevier in Computer Physics Communications
- Vol. 321
A projection method for particle resampling
- 16 December 2025
- Published by Elsevier in Environmental Modelling & Software
- Vol. 197
Development of a River Dynamical Core for E3SM to simulate compound flooding on Exascale-class heterogeneous supercomputers
- 16 December 2025
- Published by Elsevier in Environmental Modelling & Software
- Vol. 197
Development of a River Dynamical Core for E3SM to simulate compound flooding on Exascale-class heterogeneous supercomputers
- Open Access
- 18 August 2025
- Published by The Open Journal in Journal of Open Source Software
- Vol. 10 (112) , 7831
Underworld3: Mathematically Self-Describing Modelling in Python for Desktop, HPC and Cloud
Underworld3 is a finite element, geophysical-fluid-dynamics modelling framework designed to be both straightforward to use and highly scalable to peak high-performance computing environments. It implements the Lagrangian-particle finite element methodology outlined in Moresi et al. (2003). Underworld3 inherits the design patterns of earlier versions of underworld including: (1) A python user interface that is inherently safe for parallel computation. (2) A symbolic interface based on sympy that allows users to construct and simplify combinations of mathematical functions, unknowns and the spatial gradients of unknowns on the fly. (3) Interchangeable Lagrangian, Semi-Lagrangian and Eulerian time derivatives with symbolic representations wrapping the underlying implementation. (4) Fast, robust, parallel numerical solvers based on PETSc (Balay et al., 2024) and petsc4py (Dalcin et al., 2011), (5) Flexible, Lagrangian "particle" swarms for handling transport-dominated unknowns that are fully interchangeable with other data-types and can also be treated as symbolic quantities. (6) Unstructured and adaptive meshing that is fully compatible with the symbolic framework.
- 18 August 2025
- Published by The Open Journal in Journal of Open Source Software
- Vol. 10 (112) , 7831
Open AccessUnderworld3: Mathematically Self-Describing Modelling in Python for Desktop, HPC and Cloud
Underworld3 is a finite element, geophysical-fluid-dynamics modelling framework designed to be both straightforward to use and highly scalable to peak high-performance computing environments. It implements the Lagrangian-particle finite element methodology outlined in Moresi et al. (2003). Underworld3 inherits the design patterns of earlier versions of underworld including: (1) A python user interface that is inherently safe for parallel computation. (2) A symbolic interface based on sympy that allows users to construct and simplify combinations of mathematical functions, unknowns and the spatial gradients of unknowns on the fly. (3) Interchangeable Lagrangian, Semi-Lagrangian and Eulerian time derivatives with symbolic representations wrapping the underlying implementation. (4) Fast, robust, parallel numerical solvers based on PETSc (Balay et al., 2024) and petsc4py (Dalcin et al., 2011), (5) Flexible, Lagrangian "particle" swarms for handling transport-dominated unknowns that are fully interchangeable with other data-types and can also be treated as symbolic quantities. (6) Unstructured and adaptive meshing that is fully compatible with the symbolic framework.
- Open Access
- 28 June 2025
- Published by Springer Nature in Engineering with Computers
- Vol. 41 (5) , 3451-3462
Transformations of computational meshes
Computational meshes, as a way to partition space, form the basis of much of PDE simulation technology, for instance for the finite element and finite volume discretization methods. In complex simulations, we are often driven to modify an input mesh, for example, to refine, coarsen, extrude, change cell types, or filter it. Mesh manipulation code can be voluminous, error-prone, spread over many special cases, and hard to understand and maintain by subsequent developers. We present a simple, table-driven paradigm for mesh transformation which can execute a large variety of transformations in a performant, parallel manner, along with experiments in the open source library PETSc which can be run by the reader.
- 28 June 2025
- Published by Springer Nature in Engineering with Computers
- Vol. 41 (5) , 3451-3462
Open AccessTransformations of computational meshes
Computational meshes, as a way to partition space, form the basis of much of PDE simulation technology, for instance for the finite element and finite volume discretization methods. In complex simulations, we are often driven to modify an input mesh, for example, to refine, coarsen, extrude, change cell types, or filter it. Mesh manipulation code can be voluminous, error-prone, spread over many special cases, and hard to understand and maintain by subsequent developers. We present a simple, table-driven paradigm for mesh transformation which can execute a large variety of transformations in a performant, parallel manner, along with experiments in the open source library PETSc which can be run by the reader.
- 11 March 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 47 (2) , B360-B381
A Performance Portable, Fully Implicit Landau Collision Operator with Batched Linear Solvers
Modern accelerators use hierarchical parallel programming models that enable massive multithreading within a processing element (PE), with multiple PEs per device driven by traditional processes. Batching is a technique for exposing PE-level parallelism in algorithms that have traditionally run on MPI processes or multiple threads within a single process. Opportunities for batching arise in, for example, kinetic discretizations of magnetized plasmas where collisions are advanced in velocity space at each spatial point independently. This paper builds on previous work on a high-performance, fully nonlinear, Landau collision operator by batching the linear solver, as well as batching the spatial point problems and adding new support for multiple grids for multiscale, multispecies problems. An anisotropic relaxation verification test that agrees well with previously published results and analytical models is presented. The performance results from NVIDIA A100 and AMD MI250X nodes are presented with hardware utilization analysis for each architecture. The entire implicit Landau operator time advance is implemented in Kokkos for performance portability, running entirely on the device and is available in the PETSc numerical library. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://gitlab.com/markadams4/batch_paper_data and in the supplementary materials ( batch_paper_data-main.zip [9.15MB]). [Formula: see text]
- 11 March 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 47 (2) , B360-B381
A Performance Portable, Fully Implicit Landau Collision Operator with Batched Linear Solvers
Modern accelerators use hierarchical parallel programming models that enable massive multithreading within a processing element (PE), with multiple PEs per device driven by traditional processes. Batching is a technique for exposing PE-level parallelism in algorithms that have traditionally run on MPI processes or multiple threads within a single process. Opportunities for batching arise in, for example, kinetic discretizations of magnetized plasmas where collisions are advanced in velocity space at each spatial point independently. This paper builds on previous work on a high-performance, fully nonlinear, Landau collision operator by batching the linear solver, as well as batching the spatial point problems and adding new support for multiple grids for multiscale, multispecies problems. An anisotropic relaxation verification test that agrees well with previously published results and analytical models is presented. The performance results from NVIDIA A100 and AMD MI250X nodes are presented with hardware utilization analysis for each architecture. The entire implicit Landau operator time advance is implemented in Kokkos for performance portability, running entirely on the device and is available in the PETSc numerical library. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://gitlab.com/markadams4/batch_paper_data and in the supplementary materials ( batch_paper_data-main.zip [9.15MB]). [Formula: see text]
- 4 March 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 47 (2) , A657-A688
Stencil Composition for Finite Difference Approximations of Partial Differential Equations
Stencil composition uses the idea of function composition, wherein two stencils with arbitrary orders of derivative are composed to obtain a stencil with a derivative order equal to the sum of the orders of the composing stencils. In this paper, we show how stencil composition can be applied to form finite difference stencils in order to numerically solve partial differential equations (PDEs). We present various properties of stencil composition and investigate the relationship between the order of accuracy of the composed stencil and that of the composing stencils. We also present comparisons between the stability restrictions of composed higher-order PDEs to their compact versions and numerical experiments wherein we verify the order of accuracy by convergence tests. To demonstrate an application to PDEs, a boundary value problem involving the two-dimensional biharmonic equation is numerically solved using stencil composition and the order of accuracy is verified by performing a convergence test. The method is then applied to the Cahn–Hilliard phase-field model. In addition to sample results in two and three dimensions for this benchmark problem, the stability, spectral properties, and sparsity are explored.
- 4 March 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 47 (2) , A657-A688
Stencil Composition for Finite Difference Approximations of Partial Differential Equations
Stencil composition uses the idea of function composition, wherein two stencils with arbitrary orders of derivative are composed to obtain a stencil with a derivative order equal to the sum of the orders of the composing stencils. In this paper, we show how stencil composition can be applied to form finite difference stencils in order to numerically solve partial differential equations (PDEs). We present various properties of stencil composition and investigate the relationship between the order of accuracy of the composed stencil and that of the composing stencils. We also present comparisons between the stability restrictions of composed higher-order PDEs to their compact versions and numerical experiments wherein we verify the order of accuracy by convergence tests. To demonstrate an application to PDEs, a boundary value problem involving the two-dimensional biharmonic equation is numerically solved using stencil composition and the order of accuracy is verified by performing a convergence test. The method is then applied to the Cahn–Hilliard phase-field model. In addition to sample results in two and three dimensions for this benchmark problem, the stability, spectral properties, and sparsity are explored.
- 18 January 2025
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 39 (2) , 306-325
PETSc/TAO developments for GPU-based early exascale systems
The Portable Extensible Toolkit for Scientific Computation (PETSc) library provides scalable solvers for nonlinear time-dependent differential and algebraic equations and for numerical optimization via the Toolkit for Advanced Optimization (TAO). PETSc is used in dozens of scientific fields and is an important building block for many simulation codes. During the U.S. Department of Energy’s Exascale Computing Project, the PETSc team has made substantial efforts to enable efficient utilization of the massive fine-grain parallelism present within exascale compute nodes and to enable performance portability across exascale architectures. We recap some of the challenges that designers of numerical libraries face in such an endeavor, and then discuss the many developments we have made, which include the addition of new GPU backends, features supporting efficient on-device matrix assembly, better support for asynchronicity and GPU kernel concurrency, and new communication infrastructure. We evaluate the performance of these developments on some pre-exascale systems as well as the early exascale systems Frontier and Aurora, using compute kernel, communication layer, solver, and mini-application benchmark studies, and then close with a few observations drawn from our experiences on the tension between portable performance and other goals of numerical libraries.
- 18 January 2025
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 39 (2) , 306-325
PETSc/TAO developments for GPU-based early exascale systems
The Portable Extensible Toolkit for Scientific Computation (PETSc) library provides scalable solvers for nonlinear time-dependent differential and algebraic equations and for numerical optimization via the Toolkit for Advanced Optimization (TAO). PETSc is used in dozens of scientific fields and is an important building block for many simulation codes. During the U.S. Department of Energy’s Exascale Computing Project, the PETSc team has made substantial efforts to enable efficient utilization of the massive fine-grain parallelism present within exascale compute nodes and to enable performance portability across exascale architectures. We recap some of the challenges that designers of numerical libraries face in such an endeavor, and then discuss the many developments we have made, which include the addition of new GPU backends, features supporting efficient on-device matrix assembly, better support for asynchronicity and GPU kernel concurrency, and new communication infrastructure. We evaluate the performance of these developments on some pre-exascale systems as well as the early exascale systems Frontier and Aurora, using compute kernel, communication layer, solver, and mini-application benchmark studies, and then close with a few observations drawn from our experiences on the tension between portable performance and other goals of numerical libraries.
- 21 November 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 46 (6) , B830-B859
Efficient N-to-M Checkpointing Algorithm for Finite Element Simulations
In this work, we introduce a new algorithm for N-to-M checkpointing in finite element simulations. This new algorithm allows efficient saving/loading of functions representing physical quantities associated with the mesh representing the physical domain. Specifically, the algorithm allows for using different numbers of parallel processes for saving and loading, allowing for restarting and postprocessing on the process count appropriate to the given phase of the simulation and other conditions. For demonstration, we implemented this algorithm in PETSc, the Portable, Extensible Toolkit for Scientific Computation, and added a convenient high-level interface into Firedrake, a system for solving partial differential equations using finite element methods. We evaluated our new implementation by saving and loading data involving 8.2 billion finite element degrees of freedom using 8,192 parallel processes on ARCHER2, the UK National Supercomputing Service. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://zenodo.org/records/7675345 . [Formula: see text]
- 21 November 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 46 (6) , B830-B859
Efficient N-to-M Checkpointing Algorithm for Finite Element Simulations
In this work, we introduce a new algorithm for N-to-M checkpointing in finite element simulations. This new algorithm allows efficient saving/loading of functions representing physical quantities associated with the mesh representing the physical domain. Specifically, the algorithm allows for using different numbers of parallel processes for saving and loading, allowing for restarting and postprocessing on the process count appropriate to the given phase of the simulation and other conditions. For demonstration, we implemented this algorithm in PETSc, the Portable, Extensible Toolkit for Scientific Computation, and added a convenient high-level interface into Firedrake, a system for solving partial differential equations using finite element methods. We evaluated our new implementation by saving and loading data involving 8.2 billion finite element degrees of freedom using 8,192 parallel processes on ARCHER2, the UK National Supercomputing Service. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://zenodo.org/records/7675345 . [Formula: see text]