Abstract
AbstractA 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
