A survey of parallelization techniques for multigrid solvers
This chapter surveys the techniques that are necessary for constructing computationally
efficient parallel multigrid solvers. Both geometric and algebraic methods are considered …
efficient parallel multigrid solvers. Both geometric and algebraic methods are considered …
[图书][B] Domain decomposition methods-algorithms and theory
A Toselli, O Widlund - 2006 - books.google.com
This book offers a comprehensive presentation of some of the most successful and popular
domain decomposition preconditioners for finite and spectral element approximations of …
domain decomposition preconditioners for finite and spectral element approximations of …
An aggregation-based algebraic multigrid method
Y Notay - Electronic transactions on numerical analysis, 2010 - etna.ricam.oeaw.ac.at
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 …
coarsening is obtained by aggregation of the unknowns. The aggregation scheme uses two …
[图书][B] Domain decomposition methods for the numerical solution of partial differential equations
TPA Mathew - 2008 - Springer
These notes serve as an introduction to a subject of study in computational mathematics
referred to as domain decomposition methods. It concerns divide and conquer methods for …
referred to as domain decomposition methods. It concerns divide and conquer methods for …
An algebraic multigrid method with guaranteed convergence rate
We consider the iterative solution of large sparse symmetric positive definite linear systems.
We present an algebraic multigrid method which has a guaranteed convergence rate for the …
We present an algebraic multigrid method which has a guaranteed convergence rate for the …
Convergence of algebraic multigrid based on smoothed aggregation
P Van\vek, M Brezina, J Mandel - Numerische Mathematik, 2001 - Springer
We prove an abstract convergence estimate for the Algebraic Multigrid Method with
prolongator defined by a disaggregation followed by a smoothing. The method input is the …
prolongator defined by a disaggregation followed by a smoothing. The method input is the …
Parallel multigrid smoothing: polynomial versus Gauss–Seidel
M Adams, M Brezina, J Hu, R Tuminaro - Journal of Computational Physics, 2003 - Elsevier
Gauss–Seidel is often the smoother of choice within multigrid applications. In the context of
unstructured meshes, however, maintaining good parallel efficiency is difficult with …
unstructured meshes, however, maintaining good parallel efficiency is difficult with …
Algebraic multigrid based on element interpolation (AMGe)
M Brezina, AJ Cleary, RD Falgout, VE Henson… - SIAM Journal on …, 2001 - SIAM
We introduce AMGe, an algebraic multigrid method for solving the discrete equations that
arise in Ritz-type finite element methods for partial differential equations. Assuming access …
arise in Ritz-type finite element methods for partial differential equations. Assuming access …
Adaptive Smoothed Aggregation (SA) Multigrid
Substantial effort has been focused over the last two decades on developing multilevel
iterative methods capable of solving the large linear systems encountered in engineering …
iterative methods capable of solving the large linear systems encountered in engineering …
Adaptive Smoothed Aggregation (SA)
Substantial effort has been focused over the last two decades on developing multilevel
iterative methods capable of solving the large linear systems encountered in engineering …
iterative methods capable of solving the large linear systems encountered in engineering …