A New Petrov–Galerkin Smoothed Aggregation Preconditioner for Nonsymmetric Linear Systems

We propose a new variant of smoothed aggregation (SA) suitable for nonsymmetric linear systems. The new algorithm is based on two key generalizations of SA: restriction smoothing and local damping. Restriction smoothing refers to the smoothing of a tentative restriction operator via a damped Jacobi-...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on scientific computing 2008-01, Vol.31 (1), p.143-166
Main Authors: Sala, Marzio, Tuminaro, Raymond S.
Format: Article
Language:English
Subjects:
Algorithms
Energy
Laboratories
Methods
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose a new variant of smoothed aggregation (SA) suitable for nonsymmetric linear systems. The new algorithm is based on two key generalizations of SA: restriction smoothing and local damping. Restriction smoothing refers to the smoothing of a tentative restriction operator via a damped Jacobi-like iteration. Restriction smoothing is analogous to prolongator smoothing in standard SA and in fact has the same form as the transpose of prolongator smoothing when the matrix is symmetric. Local damping refers to damping parameters used in the Jacobi-like iteration. In standard SA, a single damping parameter is computed via an eigenvalue computation. Here, local damping parameters are computed by considering the minimization of an energy-like quantity for each individual grid transfer basis function. Numerical results are given showing how this method performs on highly nonsymmetric systems.
ISSN:1064-8275
1095-7197
DOI:10.1137/060659545