Engineering Papers⌕ Search

Engineering topics

Knepley, Matthew G.

Publications and source records attributed to Knepley, Matthew G..

Multiphysics modelling in PyLith: poroelasticity

SUMMARY PyLith, a community, open-source code for modelling quasi-static and dynamic crustal deformation with an emphasis on earthquake faulting, has recently been updated with a flexible multiphysics implementation. We demonstrate the versatility of the multiphysics implementation by extending the code to model fully coupled continuum poromechanics. We verify the newly incorporated physics using standard benchmarks for a porous medium saturated with a slightly compressible fluid. The benchmarks include the 1-D consolidation problem as outlined by Terzaghi, Mandel’s problem for the 2-D case, and Cryer’s problem for the 3-D case. All three benchmarks have been added to the PyLith continuous integration test suite. We compare the closed form analytical solution for each benchmark against solutions generated by our updated code, and lastly, demonstrate that the poroelastic material formulation may be used alongside the existing fault implementation in PyLith.

Geochemistry & Geophysics↗

Droplet formation simulation using mixed finite elements

Droplet formation happens in finite time due to the surface tension force. The linear stability analysis is useful to estimate the size of a droplet but fails to approximate the shape of the droplet. This is due to a highly nonlinear flow description near the point where the first pinch-off happens. A one-dimensional axisymmetric mathematical model was first developed by Eggers and Dupont [“Drop formation in a one-dimensional approximation of the Navier–Stokes equation,” J. Fluid Mech. 262, 205–221 (1994)] using asymptotic analysis. This asymptotic approach to the Navier–Stokes equations leads to a universal scaling explaining the self-similar nature of the solution. Numerical models for the one-dimensional model were developed using the finite difference [Eggers and Dupont, “Drop formation in a one-dimensional approximation of the Navier–Stokes equation,” J. Fluid Mech. 262, 205–221 (1994)] and finite element method [Ambravaneswaran et al., “Drop formation from a capillary tube: Comparison of one-dimensional and two-dimensional analyses and occurrence of satellite drops,” Phys. Fluids 14, 2606–2621 (2002)]. The focus of this study is to provide a robust computational model for one-dimensional axisymmetric droplet formation using the Portable, Extensible Toolkit for Scientific Computation. The code is verified using the Method of Manufactured Solutions and validated using previous experimental studies done by Zhang and Basaran [“An experimental study of dynamics of drop formation,” Phys. Fluids 7, 1184–1203 (1995)]. The present model is used for simulating pendant drops of water, glycerol, and paraffin wax, with an aspiration of extending the application to simulate more complex pinch-off phenomena.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PETSc Users Manual (Revision 3.15)

This manual describes the use of the Portable, Extensible Toolkit for Scientific Computation (PETSc) for the numerical solution of partial differential equations and related problems on high-performance computers. PETSc is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all distributed memory communication.

97 MATHEMATICS AND COMPUTING↗

Extending Petsc's Composable Hierarchically Nested Linear Solvers

The Contributions from the RELACS group at both Rice University and the University at Buffalo in this phase of the PETSc Composable Solvers effort have centered around four main areas: scalable mesh processing, mesh adaptivity, solvers for subsurface flow, and performance modeling. The prominence of mesh processing demonstrates the tight relationship between meshing and discretization on the one hand, and optimal solvers on the other. All optimal solvers that we consider depend on some notion of hierarchy, and we express this using the DMPlex abstraction in PETSc. This relationship demands tight integration between the DM and SNES/TS components in PETSc that is the foundation of much of this work. In addition, interpretation of performance results for scalable solvers necessitates that information from the discretization and solver enter the performance model. Without this, comparing different solvers can be a fruitless exercise. Some major accomplishment of the past three years in these areas include: scalable mesh loading in PETSc on more than 10K cores, integrated mesh adaptivity using both p4est and Pragmatic, scalable multigrid for DG discretizations of subsurface flow, and predictive performance modeling incorporating error estimates.

79 ASTRONOMY AND ASTROPHYSICS↗

Manycore Parallel Computing for a Hybridizable Discontinuous Galerkin Nested Multigrid Method

In this work, we present a parallel computing strategy for a hybridizable discontinuous Galerkin (HDG) nested geometric multigrid (GMG) solver. Parallel GMG solvers require a combination of coarse-grain and fine-grain parallelism to improve time-to-solution performance. In this work we focus on fine-grain parallelism. We use Intel's second generation Xeon Phi (Knights Landing) manycore processor. The GMG method achieves ideal convergence rates of 0.2 or less, for high polynomial orders. A matrix free (assembly free) technique is exploited to save considerable memory usage and increase arithmetic intensity. HDG enables static condensation, and due to the discontinuous nature of the discretization, we developed a matrix vector multiply routine that does not require any costly synchronizations or barriers. Our algorithm is able to attain 80% of peak bandwidth performance for higher order polynomials. This is possible due to the data locality inherent in the HDG method. Very high performance is realized for high order schemes, due to good arithmetic intensity, which declines as the order is reduced.

97 MATHEMATICS AND COMPUTING↗

Comparative Study of Finite Element Methods Using the Time-Accuracy-Size(TAS) Spectrum Analysis

We present a performance analysis appropriate for comparing algorithms using different numerical discretizations. By taking into account the total time-to-solution, numerical accuracy with respect to an error norm, and the computation rate, a cost-benefit analysis can be performed to determine which algorithm and discretization are particularly suited for an application. This work extends the performance spectrum model in for interpretation of hardware and algorithmic tradeoffs in numerical PDE simulation. As a proof-of-concept, popular finite element software packages are used to illustrate this analysis for Poisson’s equation.

97 MATHEMATICS AND COMPUTING↗

Solvation thermodynamics of neutral and charged solutes using the solvation‐layer interface condition continuum dielectric model

Abstract We demonstrate that the solvation‐layer interface condition (SLIC) continuum dielectric model for molecular electrostatics, combined with a simple solvent‐accessible‐surface‐area (SASA)‐proportional model for nonpolar solvent effects, accurately predicts solvation entropies of neutral and charged small molecules. The SLIC/SASA model has only seven fitting parameters in total and achieves this accuracy using a training set with only 20 compounds. Despite this simplicity, solvation free energies and entropies are nearly as accurate as those predicted by the more sophisticated Langevin dipoles solvation model. Surprisingly, the model automatically reproduces the negligible contribution of electrostatics to the solvation of hydrophobic compounds. Opportunities for improvement include nonpolar solvation, anion solvation entropies, and heat capacities. More molecular realism may be needed for these quantities. To enable a future, explicit‐solvent‐based assessment of the SLIC/SASA implicit‐solvent model, we predict solvation entropies for the Mobley test set, which are available as Supporting Information.

Mehdizadeh Rahimi, Ali↗

Landau Collision Integral Solver with Adaptive Mesh Refinement on Emerging Architectures

The Landau collision integral is an accurate model for the small-angle dominated Coulomb collisions in fusion plasmas. Here, we investigate a high order accurate, fully conservative, finite element discretization of the nonlinear multispecies Landau integral with adaptive mesh refinement using the PETSc library (ulwww.mcs.anl.gov/petsc). We develop algorithms and techniques to efficiently utilize emerging architectures with an approach that minimizes memory usage and movement and is suitable for vector processing. The Landau collision integral is vectorized with Intel AVX-512 intrinsics and the solver sustains as much as 22% of the theoretical peak flop rate of the Second Generation Intel Xeon Phi (``Knights Landing'') processor.

97 MATHEMATICS AND COMPUTING↗

Scalable smoothing strategies for a geometric multigrid method for the immersed boundary equations

The immersed boundary (IB) method is a widely used approach to simulating fluid-structure interaction (FSI). Although explicit versions of the IB method can suffer from severe time step size restrictions, these methods remain popular because of their simplicity and generality. In prior work (Guy et al., Adv Comput Math, 2015), some of us developed a geometric multigrid preconditioner for a stable semi-implicit IB method under Stokes flow conditions; however, this solver methodology used a Vanka-type smoother that presented limited opportunities for parallelization. This work extends this Stokes-IB solver methodology by developing smoothing techniques that are suitable for parallel implementation. Specifically, we demonstrate that an additive version of the Vanka smoother can yield an effective multigrid preconditioner for the Stokes-IB equations, and we introduce an efficient Schur complement-based smoother that is also shown to be effective for the Stokes-IB equations. We investigate the performance of these solvers for a broad range of material stiffnesses, both for Stokes flows and flows at nonzero Reynolds numbers, and for thick and thin structural models. We show here that linear solver performance degrades with increasing Reynolds number and material stiffness, especially for thin interface cases. Nonetheless, the proposed approaches promise to yield effective solution algorithms, especially at lower Reynolds numbers and at modest-to-high elastic stiffnesses.

97 MATHEMATICS AND COMPUTING↗

Communication: Modeling charge-sign asymmetric solvation free energies with nonlinear boundary conditions

We show that charge-sign-dependent asymmetric hydration can be modeled accurately using linear Poisson theory after replacing the standard electric-displacement boundary condition with a simple nonlinear boundary condition. Using a single multiplicative scaling factor to determine atomic radii from molecular dynamics Lennard-Jones parameters, the new model accurately reproduces MD free-energy calculations of hydration asymmetries for: (i) monatomic ions, (ii) titratable amino acids in both their protonated and unprotonated states, and (iii) the Mobley “bracelet” and “rod” test problems [D. L. Mobley, A. E. Barber II, C. J. Fennell, and K. A. Dill, “Charge asymmetries in hydration of polar solutes,” J. Phys. Chem. B 112, 2405–2414 (2008)]. Remarkably, the model also justifies the use of linear response expressions for charging free energies. Our boundary-element method implementation demonstrates the ease with which other continuum-electrostatic solvers can be extended to include asymmetry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mesh Algorithms for PDE with Sieve I: Mesh Distribution

We have developed a new programming framework, called Sieve, to support parallel numerical partial differential equation(s) (PDE) algorithms operating over distributed meshes. We have also developed a reference implementation of Sieve in C++ as a library of generic algorithms operating on distributed containers conforming to the Sieve interface. Sieve makes instances of the incidence relation, or arrows, the conceptual first-class objects represented in the containers. Further, generic algorithms acting on this arrow container are systematically used to provide natural geometric operations on the topology and also, through duality, on the data. Finally, coverings and duality are used to encode not only individual meshes, but all types of hierarchies underlying PDE data structures, including multigrid and mesh partitions. In order to demonstrate the usefulness of the framework, we show how the mesh partition data can be represented and manipulated using the same fundamental mechanisms used to represent meshes. We present the complete description of an algorithm to encode a mesh partition and then distribute a mesh, which is independent of the mesh dimension, element shape, or embedding. Moreover, data associated with the mesh can be similarly distributed with exactly the same algorithm. The use of a high level of abstraction within the Sieve leads to several benefits in terms of code reuse, simplicity, and extensibility. We discuss these benefits and compare our approach to other existing mesh libraries.

Knepley, Matthew G.↗