A Parallel Solver for Graph Laplacians

Problems from graph drawing, spectral clustering, network flow and graph partitioning can all be expressed in terms of graph Laplacian matrices. There are a variety of practical approaches to solving these problems in serial. However, as problem sizes increase and single core speeds stagnate, parallelism is essential to solve such problems quickly. We present an unsmoothed aggregation multigrid method for solving graph Laplacians in a distributed memory setting. We introduce new parallel aggregation and low degree elimination algorithms targeted specifically at irregular degree graphs. These algorithms are expressed in terms of sparse matrix-vector products using generalized sum and product operations. This formulation is amenable to linear algebra using arbitrary distributions and allows us to operate on a 2D sparse matrix distribution, which is necessary for parallel scalability. Our solver outperforms the natural parallel extension of the current state of the art in an algorithmic comparison. We demonstrate scalability to 576 processes and graphs with up to 1.7 billion edges.Comment: PASC '18, Code: https://github.com/ligmg/ligm

Application of Multicanonical Multigrid Monte Carlo Method to the Two-Dimensional ϕ4\phi^4-Model: Autocorrelations and Interface Tension

We discuss the recently proposed multicanonical multigrid Monte Carlo method and apply it to the scalar $\phi^4$-model on a square lattice. To investigate the performance of the new algorithm at the field-driven first-order phase transitions between the two ordered phases we carefully analyze the autocorrelations of the Monte Carlo process. Compared with standard multicanonical simulations a real-time improvement of about one order of magnitude is established. The interface tension between the two ordered phases is extracted from high-statistics histograms of the magnetization applying histogram reweighting techniques.Comment: 49 pp. Latex incl. 14 figures (Fig.7 not included, sorry) as uuencoded compressed tar fil

On local Fourier analysis of multigrid methods for PDEs with jumping and random coefficients

In this paper, we propose a novel non-standard Local Fourier Analysis (LFA) variant for accurately predicting the multigrid convergence of problems with random and jumping coefficients. This LFA method is based on a specific basis of the Fourier space rather than the commonly used Fourier modes. To show the utility of this analysis, we consider, as an example, a simple cell-centered multigrid method for solving a steady-state single phase flow problem in a random porous medium. We successfully demonstrate the prediction capability of the proposed LFA using a number of challenging benchmark problems. The information provided by this analysis helps us to estimate a-priori the time needed for solving certain uncertainty quantification problems by means of a multigrid multilevel Monte Carlo method

A multigrid continuation method for elliptic problems with folds

We introduce a new multigrid continuation method for computing solutions of nonlinear elliptic eigenvalue problems which contain limit points (also called turning points or folds). Our method combines the frozen tau technique of Brandt with pseudo-arc length continuation and correction of the parameter on the coarsest grid. This produces considerable storage savings over direct continuation methods,as well as better initial coarse grid approximations, and avoids complicated algorithms for determining the parameter on finer grids. We provide numerical results for second, fourth and sixth order approximations to the two-parameter, two-dimensional stationary reaction-diffusion problem: Δu+λ exp(u/(1+au)) = 0. For the higher order interpolations we use bicubic and biquintic splines. The convergence rate is observed to be independent of the occurrence of limit points