Compatible coarsening in the multigraph algorithm

DOI10.1016/J.ADVENGSOFT.2006.08.006zbMATH Open1137.65335OpenAlexW2071849277MaRDI QIDQ2643580FDOQ2643580

Authors: Randolph E. Bank 

Publication date: 27 August 2007

Published in: Advances in Engineering Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.advengsoft.2006.08.006

Recommendations

• Compatible relaxation and coarsening in algebraic multigrid
• Coarsening by compatible relaxation
• On Generalizing the Algebraic Multigrid Framework
• An algebraic multilevel multigraph algorithm
• scientific article; zbMATH DE number 1254443

zbMATH Keywords

algebraic multigridcompatible coarsening

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Cited In (8)

• Title not available (Why is that?)
• Coarsening by compatible relaxation
• Matrix reordering using multilevel graph coarsening for ILU preconditioning
• Compatible Coarse Nodal and Edge Elements Through Energy Functionals
• COHERENCE ANALYSIS FOR ITERATED LINE GRAPHS OF MULTI-SUBDIVISION GRAPH
• Compatible relaxation and coarsening in algebraic multigrid
• Relaxation-based coarsening and multiscale graph organization
• An algebraic multilevel multigraph algorithm

This page was built for publication: Compatible coarsening in the multigraph algorithm

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