An Efficient Multigrid Method for Graph Laplacian Systems II: Robust Aggregation
نویسندگان
چکیده
منابع مشابه
An Efficient Multigrid Method for Graph Laplacian Systems II: Robust Aggregation
We consider the iterative solution of linear systems whose matrices are Laplacians of undirected graphs. Designing robust solvers for this class of problems is challenging due to the diversity of connectivity patterns encountered in practical applications. Our starting point is a recently proposed aggregation-based algebraic multigrid method that combines the recursive static elimination of the...
متن کاملA Novel Aggregation Method based on Graph Matching for Algebraic MultiGrid Preconditioning of Sparse Linear Systems
Multilevel techniques are very effective tools for preconditioning iterative Krylov methods in the solution of sparse linear systems; among them, Algebraic MultiGrid (AMG) are widely employed variants. In [2, 4] it is shown how parallel smoothed aggregation techniques can be used in combination with domain decomposition Schwarz preconditioners to obtain AMG preconditioners; the effectiveness of...
متن کاملAn aggregation-based algebraic multigrid method
An algebraic multigrid method is presented to solve large systems of linear equations. The coarsening is obtained by aggregation of the unknowns. The aggregation scheme uses two passes of a pairwise matching algorithm applied to the matrix graph, resulting in most cases in a decrease of the number of variables by a factor slightly less than four. The matching algorithm favors the strongest nega...
متن کاملLean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
Laplacian matrices of graphs arise in large-scale computational applications such as semi-supervised machine learning; spectral clustering of images, genetic data and web pages; transportation network flows; electrical resistor circuits; and elliptic partial differential equations discretized on unstructured grids with finite elements. A Lean Algebraic Multigrid (LAMG) solver of the symmetric l...
متن کاملAnalysis of an Algebraic Petrov-Galerkin Smoothed Aggregation Multigrid Method
We give a convergence estimate for a Petrov-Galerkin Algebraic Multigrid method. In this method, the prolongations are defined using the concept of smoothed aggregation while the restrictions are simple aggregation operators. The analysis is carried out by showing that these methods can be interpreted as variational Ritz-Galerkin ones using modified transfer and smoothing operators. The estimat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2017
ISSN: 1064-8275,1095-7197
DOI: 10.1137/16m1071420