Numerical Linear Algebra with Applications · 2004 · 74 citations · 8 references
ComputingComputer ScienceComputational GeometryComputational MechanicsGrid ComputingNumerical AlgorithmsNumerical AnalysisConvergenceGrid CoarseningGrid ConvergenceMultigrid Convergence
Abstract A proper coarse variable set for algebraic multigrid (AMG) solvers can be constructed using compatible relaxation (CR). For a given coarse set, CR is a modified relaxation scheme that keeps the values of the coarse variables intact. Its convergence factor is a predictor of the potential AMG efficiency, similarly to the smoothing factor in geometric multigrid. A practical, CR‐based coarse set construction algorithm is presented. Numerical results for model problems are demonstrated. Copyright © 2004 John Wiley & Sons, Ltd.
8
Algebraic multigrid theory: The symmetric case
Achi Brandt · Applied Mathematics and Computation · 1986 · 393 citations
Robustness and Scalability of Algebraic Multigrid
Andrew Cleary, Robert D. Falgout, Van Emden Henson et al. · SIAM Journal on Scientific Computing · 2000 · 167 citations