Algebraic distance for anisotropic diffusion problems: multilevel results

MaRDI QIDQ896893zbMATHFDO

Authors Achi Brandt, J. Brannick, K. Kahl, Irene Livshits

Publication date 15 December 2015

Published in ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1409.4702

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

algebraic distancesbootstrap algebraic multigridleast-squares interpolationstrength of connection

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Abstract: In this paper we motivate, discuss the implementation and present the resulting numerics for a new definition of strength of connection which is based on the notion of algebraic distance. This algebraic distance measure, combined with compatible relaxation, is used to choose suitable coarse grids and accurate interpolation operators for algebraic multigrid algorithms. The main tool of the proposed measure is the least squares functional defined using a set of relaxed test vectors. The motivating application is the anisotropic diffusion problem, in particular problems with non-grid aligned anisotropy. We demonstrate numerically that the measure yields a robust technique for determining strength of connectivity among variables, for both two-grid and multigrid solvers. %We illustrate the use of the measure to construct, in addition, an adaptive aggregation form of interpolation for the targeted anisotropic problems. %Our approach is not a two-level approach -- we provide preliminary results that show its extendability to multigrid. The proposed algebraic distance measure can also be used in any other coarsening procedure, assuming a rich enough set of the near-kernel components of the matrix for the targeted system is known or computed.

Recommendations

• An algebraic multilevel method for anisotropic elliptic equations based on subgraph matching.
• A new perspective on strength measures in algebraic multigrid
• Bootstrap algebraic multigrid: status report, open problems, and outlook
• Smoothed aggregation solvers for anisotropic diffusion
• An energy‐based AMG coarsening strategy

Cited in

(9)

• Least Angle Regression Coarsening in Bootstrap Algebraic Multigrid
• Optimal interpolation and compatible relaxation in classical algebraic multigrid
• Coarsening in algebraic multigrid using Gaussian processes
• A root-node-based algebraic multigrid method
• Algebraic distance on graphs
• An algebraic multilevel method for anisotropic elliptic equations based on subgraph matching.
• Constrained local approximate ideal restriction for advection-diffusion problems
• A new perspective on strength measures in algebraic multigrid
• Parallel Energy-Minimization Prolongation for Algebraic Multigrid

This page was built for publication: Algebraic distance for anisotropic diffusion problems: multilevel results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896893)