Matthew Knepley

Dr. Matthew Knepley

orcid

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2012 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
DKDavid I. Ketcheson
David I. Ketcheson
Kyle MandliKyle Mandli
Kyle Mandli
AAAron J. Ahmadia
Aron J. Ahmadia
AAAmal Alghamdi
Amal Alghamdi
MLManuel Quezada de Luna
Manuel Quezada de Luna
MEMatthew Emmett
Matthew Emmett
Development of scientific software involves tradeoffs between ease of use, generality, and performance. We describe the design of a general hyperbolic PDE solver that can be operated with the convenience of MATLAB yet achieves efficiency near that of hand-coded Fortran and scales to the largest supercomputers. This is achieved by using Python for most of the code while employing automatically wrapped Fortran kernels for computationally intensive routines, and using Python bindings to interface with a parallel computing library and other numerical packages. The software described here is PyClaw, a Python-based structured grid solver for general systems of hyperbolic PDEs [K. T. Mandli et al., PyClaw Software, Version 1.0, http://numerics.kaust.edu.sa/pyclaw/ (2011)]. PyClaw provides a powerful and intuitive interface to the algorithms of the existing Fortran codes Clawpack and SharpClaw, simplifying code development and use while providing massive parallelism and scalable solvers via the PETSc library. The package is further augmented by use of PyWENO for generation of efficient high-order weighted essentially nonoscillatory reconstruction code. The simplicity, capability, and performance of this approach are demonstrated through application to example problems in shallow water flow, compressible flow, and elasticity.

1 June 2011 in Computer Physics Communications
Verified
Journal Article
Open access
RYRio Yokota
Rio Yokota
JBJaydeep P. Bardhan
Jaydeep P. Bardhan
MKMatthew Knepley
Matthew Knepley
LBL.A. Barba
L.A. Barba
THTsuyoshi Hamada
Tsuyoshi Hamada
We present teraflop-scale calculations of biomolecular electrostatics enabled by the combination of algorithmic and hardware acceleration. The algorithmic acceleration is achieved with the fast multipole method (FMM) in conjunction with a boundary element method (BEM) formulation of the continuum electrostatic model, as well as the BIBEE approximation to BEM. The hardware acceleration is achieved through graphics processors, GPUs. We demonstrate the power of our algorithms and software for the calculation of the electrostatic interactions between biological molecules in solution. The applications demonstrated include the electrostatics of protein--drug binding and several multi-million atom systems consisting of hundreds to thousands of copies of lysozyme molecules. The parallel scalability of the software was studied in a cluster at the Nagasaki Advanced Computing Center, using 128 nodes, each with 4 GPUs. Delicate tuning has resulted in strong scaling with parallel efficiency of 0.8 for 256 and 0.5 for 512 GPUs. The largest application run, with over 20 million atoms and one billion unknowns, required only one minute on 512 GPUs. We are currently adapting our BEM software to solve the linearized Poisson-Boltzmann equation for dilute ionic solutions, and it is also designed to be flexible enough to be extended for a variety of integral equation problems, ranging from Poisson problems to Helmholtz problems in electromagnetics and acoustics to high Reynolds number flow

22 March 2010 in The Journal of Chemical Physics
Verified
Journal Article
Closed access
PDF file
MKMatthew Knepley
Matthew Knepley
DKDmitry A. Karpeev
Dmitry A. Karpeev
SDSeth Davidovits
Seth Davidovits
RERobert S. Eisenberg
Robert S. Eisenberg
DGDirk Gillespie
Dirk Gillespie
Classical density functional theory (DFT) of fluids is a valuable tool to analyze inhomogeneous fluids. However, few numerical solution algorithms for three-dimensional systems exist. Here we present an efficient numerical scheme for fluids of charged, hard spheres that uses O(N log N) operations and O(N) memory, where N is the number of grid points. This system-size scaling is significant because of the very large N required for three-dimensional systems. The algorithm uses fast Fourier transforms (FFTs) to evaluate the convolutions of the DFT Euler–Lagrange equations and Picard (iterative substitution) iteration with line search to solve the equations. The pros and cons of this FFT/Picard technique are compared to those of alternative solution methods that use real-space integration of the convolutions instead of FFTs and Newton iteration instead of Picard. For the hard-sphere DFT, we use fundamental measure theory. For the electrostatic DFT, we present two algorithms. One is for the “bulk-fluid” functional of Rosenfeld [Y. Rosenfeld, J. Chem. Phys. 98, 8126 (1993)] that uses O(N log N) operations. The other is for the “reference fluid density” (RFD) functional [D. Gillespie et al., J. Phys.: Condens. Matter 14, 12129 (2002)]. This functional is significantly more accurate than the bulk-fluid functional, but the RFD algorithm requires O(N2) operations.

1 January 2005 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
RKRobert C. Kirby
Robert C. Kirby
MKMatthew Knepley
Matthew Knepley
ALAnders Logg
Anders Logg
LSL. Ridgway Scott
L. Ridgway Scott
Assembling stiffness matrices represents a significant cost in many finite element computations. We address the question of optimizing the evaluation of these matrices. By finding redundant computations, we are able to significantly reduce the cost of building local stiffness matrices for the Laplace operator and for the trilinear form for Navier--Stokes operators. For the Laplace operator in two space dimensions, we have developed a heuristic graph algorithm that searches for such redundancies and generates code for computing the local stiffness matrices. Up to cubics, we are able to build the stiffness matrix on any triangle in less than one multiply-add pair per entry. Up to sixth degree, we can do it in less than about two pairs. Preliminary low-degree results for Poisson and Navier-Stokes operators in three dimensions are also promising.

1 May 2010 in Computer Methods in Applied Mechanics and Engineering
Verified
Journal Article
Open access
RYRio Yokota
Rio Yokota
LBL.A. Barba
L.A. Barba
MKMatthew Knepley
Matthew Knepley
We have developed a parallel algorithm for radial basis function (RBF) interpolation that exhibits O(N) complexity,requires O(N) storage, and scales excellently up to a thousand processes. The algorithm uses a GMRES iterative solver with a restricted additive Schwarz method (RASM) as a preconditioner and a fast matrix-vector algorithm. Previous fast RBF methods, --,achieving at most O(NlogN) complexity,--, were developed using multiquadric and polyharmonic basis functions. In contrast, the present method uses Gaussians with a small variance (a common choice in particle methods for fluid simulation, our main target application). The fast decay of the Gaussian basis function allows rapid convergence of the iterative solver even when the subdomains in the RASM are very small. The present method was implemented in parallel using the PETSc library (developer version). Numerical experiments demonstrate its capability in problems of RBF interpolation with more than 50 million data points, timing at 106 seconds (19 iterations for an error tolerance of 10^-15 on 1024 processors of a Blue Gene/L (700 MHz PowerPC processors). The parallel code is freely available in the open-source model.Comment: Submitted to Computer Methods in Applied Mechanics and Engineerin

26 May 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
JZJunchao Zhang
Junchao Zhang
JBJed Brown
Jed Brown
SBSatish Balay
Satish Balay
JFJacob Faibussowitsch
Jacob Faibussowitsch
MKMatthew Knepley
Matthew Knepley
SZStefano Zampini
Stefano Zampini
PetscSF, the communication component of the Portable, Extensible Toolkit for Scientific Computation (PETSc), is designed to provide PETSc's communication infrastructure suitable for exascale computers that utilize GPUs and other accelerators. PetscSF provides a simple application programming interface (API) for managing common communication patterns in scientific computations by using a star-forest graph representation. PetscSF supports several implementations based on MPI and NVSHMEM, whose selection is based on the characteristics of the application or the target architecture. An efficient and portable model for network and intra-node communication is essential for implementing large-scale applications. The Message Passing Interface, which has been the de facto standard for distributed memory systems, has developed into a large complex API that does not yet provide high performance on the emerging heterogeneous CPU-GPU-based exascale systems. In this article, we discuss the design of PetscSF, how it can overcome some difficulties of working directly with MPI on GPUs, and we demonstrate its performance, scalability, and novel features.