Premium
Operator‐based interpolation for bootstrap algebraic multigrid
Author(s) -
Manteuffel T.,
McCormick S.,
Park M.,
Ruge J.
Publication year - 2010
Publication title -
numerical linear algebra with applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.02
H-Index - 53
eISSN - 1099-1506
pISSN - 1070-5325
DOI - 10.1002/nla.711
Subject(s) - multigrid method , interpolation (computer graphics) , mathematics , solver , operator (biology) , discretization , scalar (mathematics) , algebraic number , mathematical analysis , computer science , mathematical optimization , partial differential equation , geometry , chemistry , repressor , transcription factor , gene , animation , biochemistry , computer graphics (images)
Bootstrap algebraic multigrid (BAMG) is a multigrid‐based solver for matrix equations of the form Ax = b . Its aim is to automatically determine the interpolation weights used in algebraic multigrid (AMG) by locally fitting a set of test vectors that have been relaxed as solutions to the corresponding homogeneous equation, Ax =0, and are then possibly improved later using a multilevel eigensolver. This paper introduces a flexible variant of BAMG that determines the interpolation weights indirectly by ‘collapsing’ the unwanted connections in ‘operator interpolation’. Compared to BAMG, this indirect BAMG approach ( i BAMG) is more in the spirit of classical AMG, which collapses unwanted connections in operator interpolation based on the (restrictive) assumption that smooth error is locally constant. This paper studies the numerical performance of i BAMG and establishes an equivalence, under certain assumptions, between it and a slightly modified (standard) BAMG scheme. To focus on camparing BAMG and i BAMG and exposing their behavior as the problem size grows, the numerical experiments concentrate on Poisson‐like scalar problems. Copyright © 2010 John Wiley & Sons, Ltd.