Abstract
Many matrix equations are either inherently discrete (e.g., in geodesy) or for certain practical purposes remote from their origin (e.g., a finite element discretization on a preselected irregular grid). AMG is an algorithm designed to solve such problems by using information contrained only in the matrix while at the same time basing itself on multigrid principles. This paper introduces the basic AMG concepts, develops its foundations, and describes current AMG strategies.
Users
Please
log in to take part in the discussion (add own reviews or comments).