论文信息 - Coarsening by compatible relaxation

Coarsening by compatible relaxation

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.

O. E. Livne | O. Livne

[1] Achi Brandt. General Highly Accurate Algebraic Coarsening Schemes , 1999 .

[2] Gene H. Golub,et al. Scaling by Binormalization , 2004, Numerical Algorithms.

[3] K. Stuben,et al. Algebraic Multigrid (AMG) : An Introduction With Applications , 2000 .

[4] A. Brandt. General highly accurate algebraic coarsening. , 2000 .

[5] A. Brandt. Rigorous quantitative analysis of multigrid, I: constant coefficients two-level cycle with L 2 -norm , 1994 .

[6] Thomas A. Manteuffel,et al. Algebraic Multigrid Based on Element Interpolation (AMGe) , 2000, SIAM J. Sci. Comput..

[7] Thomas A. Manteuffel,et al. Adaptive Smoothed Aggregation (αSA) , 2004, SIAM J. Sci. Comput..

[8] Boris Diskin. MULTIGRID ALGORITHM WITH CONDITIONAL COARSENING FOR THE NON-ALIGNED SONIC FLOW , 1997 .

[9] D. Ron,et al. Multigrid Solvers and Multilevel Optimization Strategies , 2003 .

[10] A. Brandt. Algebraic multigrid theory: The symmetric case , 1986 .