Multigrid Methods Based on Hodge Decomposition for a Quad-Curl Problem

Susanne C. Brenner; Jintao Cui; Li Yeng Sung

doi:10.1515/cmam-2019-0011

Multigrid Methods Based on Hodge Decomposition for a Quad-Curl Problem

Susanne C. Brenner, Jintao Cui, Li Yeng Sung

Research output: Journal article publication › Journal article › Academic research › peer-review

4 Citations (Scopus)

Abstract

In this paper we investigate multigrid methods for a quad-curl problem on graded meshes. The approach is based on the Hodge decomposition. The solution for the quad-curl problem is approximated by solving standard second-order elliptic problems and optimal error estimates are obtained on graded meshes. We prove the uniform convergence of the multigrid algorithm for the resulting discrete problem. The performance of these methods is illustrated by numerical results.

Original language	English
Pages (from-to)	215-232
Number of pages	18
Journal	Computational Methods in Applied Mathematics
Volume	19
Issue number	2
DOIs	https://doi.org/10.1515/cmam-2019-0011
Publication status	Published - 1 Apr 2019

Keywords

Graded Meshes
Hodge Decomposition
Multigrid Methods
Quad-Curl Problem

ASJC Scopus subject areas

Numerical Analysis
Computational Mathematics
Applied Mathematics

More information

10.1515/cmam-2019-0011

Cite this

@article{a9978639f1594e1f8ce9756291101409,

title = "Multigrid Methods Based on Hodge Decomposition for a Quad-Curl Problem",

abstract = "In this paper we investigate multigrid methods for a quad-curl problem on graded meshes. The approach is based on the Hodge decomposition. The solution for the quad-curl problem is approximated by solving standard second-order elliptic problems and optimal error estimates are obtained on graded meshes. We prove the uniform convergence of the multigrid algorithm for the resulting discrete problem. The performance of these methods is illustrated by numerical results.",

keywords = "Graded Meshes, Hodge Decomposition, Multigrid Methods, Quad-Curl Problem",

author = "Brenner, {Susanne C.} and Jintao Cui and Sung, {Li Yeng}",

year = "2019",

month = apr,

day = "1",

doi = "10.1515/cmam-2019-0011",

language = "English",

volume = "19",

pages = "215--232",

journal = "Computational Methods in Applied Mathematics",

issn = "1609-4840",

publisher = "Walter de Gruyter GmbH",

number = "2",

}

TY - JOUR

T1 - Multigrid Methods Based on Hodge Decomposition for a Quad-Curl Problem

AU - Brenner, Susanne C.

AU - Cui, Jintao

AU - Sung, Li Yeng

PY - 2019/4/1

Y1 - 2019/4/1

N2 - In this paper we investigate multigrid methods for a quad-curl problem on graded meshes. The approach is based on the Hodge decomposition. The solution for the quad-curl problem is approximated by solving standard second-order elliptic problems and optimal error estimates are obtained on graded meshes. We prove the uniform convergence of the multigrid algorithm for the resulting discrete problem. The performance of these methods is illustrated by numerical results.

AB - In this paper we investigate multigrid methods for a quad-curl problem on graded meshes. The approach is based on the Hodge decomposition. The solution for the quad-curl problem is approximated by solving standard second-order elliptic problems and optimal error estimates are obtained on graded meshes. We prove the uniform convergence of the multigrid algorithm for the resulting discrete problem. The performance of these methods is illustrated by numerical results.

KW - Graded Meshes

KW - Hodge Decomposition

KW - Multigrid Methods

KW - Quad-Curl Problem

UR - http://www.scopus.com/inward/record.url?scp=85062452404&partnerID=8YFLogxK

U2 - 10.1515/cmam-2019-0011

DO - 10.1515/cmam-2019-0011

M3 - Journal article

AN - SCOPUS:85062452404

VL - 19

SP - 215

EP - 232

JO - Computational Methods in Applied Mathematics

JF - Computational Methods in Applied Mathematics

SN - 1609-4840

IS - 2

ER -

Multigrid Methods Based on Hodge Decomposition for a Quad-Curl Problem

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Cite this