Searcharxiv⌕ Search

arXiv subjects

James Brannick

Publications and source records attributed to James Brannick.

22 records · Page 2Linked to original sources
arXiv2012

Algebraic multilevel preconditioners for the graph Laplacian based on matching in graphs

This paper presents estimates of the convergence rate and complexity of an algebraic multilevel preconditioner based on piecewise constant coarse vector spaces applied to the graph Laplacian. A bound is derived on the energy norm of the projection operator onto any piecewise constant vector space, which results in an estimate of the two-level convergence rate where the coarse level graph is obtained by matching. The two-level convergence of the method is then used to establish the convergence of an Algebraic Multilevel Iteration that uses the two-level scheme recursively. On structured grids, the method is proven to have convergence rate $\approx (1-1/\log n)$ and $O(n\log n)$ complexity for each cycle, where $n$ denotes the number of unknowns in the given problem. Numerical results of the algorithm applied to various graph Laplacians are reported. It is also shown that all the theoretical estimates derived for matching can be generalized to the case of aggregates containing more than two vertices.

math.NA↗
arXiv2011

An algebraic distances measure of AMG strength of connection

Algebraic multigrid is an iterative method that is often optimal for solving the matrix equations that arise in a wide variety of applications, including discretized partial differential equations. It automatically constructs a sequence of increasingly smaller matrix problems that enable efficient resolution of all scales present in the solution. One of the main components of the method is an adequate choice of coarse grids. The current coarsening methodology is based on measuring how a so-called algebraically smooth error value at one point depends on the error values at its neighbors. Such a concept of strength of connection is well understood for operators whose principal part is an M-matrix; however, the strength concept for more general matrices is not yet clearly understood, and this lack of knowledge limits the scope of AMG applicability. The purpose of this paper is to motivate a general definition of strength of connection, based on the notion of algebraic distances, discuss its implementation, and present the results of initial numerical experiments. The algebraic distance measure, we propose, uses as its main tool a least squares functional, which is also applied to define interpolation.

math.NA↗
arXiv2009

The role of multigrid algorithms for LQCD

We report on the first successful QCD multigrid algorithm which demonstrates constant convergence rates independent of quark mass and lattice volume for the Wilson Dirac operator. The new ingredient is the adaptive method for constructing the near null space on which the coarse grid multigrid Dirac operator acts. In addition we speculate on future prospects for extending this algorithm to the Domain Wall and Staggered discretizations, its exceptional suitability for high performance GPU code and its potential impact on simulations at the physical pion mass.

hep-lat↗