A multigrid method based on graph matching for convection-diffusion equations

Hwan Ho Kim, Jinchao Xu, Ludmil Zikatanov

Research output: Contribution to journalArticlepeer-review

50 Scopus citations

Abstract

In this paper we propose a practical and robust multigrid method for convection-diffusion problems based on a new coarsening techniques for unstructured grids. The idea is to use a graph matching technique to define proper coarse subspaces. Such an approach is based on the graph corresponding to the stiffness matrix, and is purely algebraic. We prove that our coarsening technique preserves the M matrix property. We also give several numerical examples illustrating the robustness of the method with respect to the variations in both the diffusion and convection coefficients. Copyright © 2002 John Wiley & Sons, Ltd.
Original languageEnglish (US)
Pages (from-to)181-195
Number of pages15
JournalNumerical Linear Algebra with Applications
Volume10
Issue number1-2
DOIs
StatePublished - Jan 1 2003
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2023-02-15

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A multigrid method based on graph matching for convection-diffusion equations'. Together they form a unique fingerprint.

Cite this