Abstract
Algebraic multigrid methods are designed for the solution of (sparse) linear systems of equations using multigrid principles. In contrast to standard multigrid methods, AMG does not take advantage of the origin of a particular system of equations at hand, nor does it exploit any underlying geometrical situation. Fully automatically and based solely on algebraic information contained in the given matrix, AMG constructs a sequence of “grids” and corresponding operators. A special AMG algorithm will be presented. For a wide range of problems (including certain problems which do not have a continuous background) this algorithm yields an iterative method which exhibits a convergence behavior typical for multigrid methods.
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.
