Compatible Relaxation and Coarsening in Algebraic Multigrid | Zendy

James Brannick | Zendy; Robert D. Falgout | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Compatible Relaxation and Coarsening in Algebraic Multigrid

Author(s) -

James Brannick,

Robert D. Falgout

Publication year - 2010

Publication title -

siam journal on scientific computing

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.674

H-Index - 147

eISSN - 1095-7197

pISSN - 1064-8275

DOI - 10.1137/090772216

Subject(s) - multigrid method , mathematics , relaxation (psychology) , metric (unit) , connection (principal bundle) , algebraic number , simple (philosophy) , grid , algorithm , mathematical analysis , partial differential equation , geometry , psychology , social psychology , philosophy , operations management , epistemology , economics

We introduce a coarsening algorithm for algebraic multigrid (AMG) based on the concept of compatible relaxation (CR). The algorithm is significantly different from standard methods, most notably because it does not rely on any notion of strength of connection. We study its behavior on a number of model problems and evaluate the performance of an AMG algorithm that incorporates the coarsening approach. Finally, we introduce a variant of CR that provides a sharper metric of coarse-grid quality and demonstrate its potential with two simple examples.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research