Paper Info
Title
A multigrid method based on graph matching for convection-diffusion equations.
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 (C) 2002 John Wiley Sons, Ltd.
Year
DOI
Venue
2003
10.1002/nla.317
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS
Keywords
Field
DocType
convection-diffusion,multigrid,finite element method,matching,monotone scheme,M-matrix
Convection–diffusion equation,Mathematical optimization,M-matrix,Finite element method,Robustness (computer science),Numerical solution of the convection–diffusion equation,Matching (graph theory),Stiffness matrix,Mathematics,Multigrid method
Journal
Volume
Issue
ISSN
10
1-2
1070-5325
Citations 
PageRank 
References 
15
1.16
8
Authors
3
Name
Order
Citations
PageRank
Hwanho Kim1161.50
Jinchao Xu21478238.14
Ludmil Zikatanov318925.89