A coarse grid generation algorithm for agglomeration multigrid method on unstructured grids

Noriyuki Okamoto; Kazuhiro Nakahashit; Shigeru Obayashi

doi:10.2514/6.1998-615

A coarse grid generation algorithm for agglomeration multigrid method on unstructured grids

Noriyuki Okamoto, Kazuhiro Nakahashit, Shigeru Obayashi

Creative Flow Research Division

Research output: Contribution to conference › Paper › peer-review

5 Citations (Scopus)

Abstract

A new agglomeration algorithm to generate coarse grids for multigrid methods on unstructured and hybrid grids is proposed in this paper. The algorithm, which we call a global coarsening algorithm, is based on the edge coloring of the grids so that it can agglomerate any type of grids. The agglomeration procedure is automatic and generates a globally optimum shape in contrast to the conventional greedy-type frontal algorithm. The method is applied to compute the 2D/3D Euler and 2D Navier-Stokes equations on triangular, tetrahedral and hybrid meshes, respectively. The present agglomeration multigrid method shows better convergence than the existing method owing to the better quality of the coarse grids.

Original language	English
DOIs	https://doi.org/10.2514/6.1998-615
Publication status	Published - 1998
Event	36th AIAA Aerospace Sciences Meeting and Exhibit, 1998 - Reno, United States Duration: 1998 Jan 12 → 1998 Jan 15

Other

Other	36th AIAA Aerospace Sciences Meeting and Exhibit, 1998
Country	United States
City	Reno
Period	98/1/12 → 98/1/15

ASJC Scopus subject areas

Engineering(all)
Space and Planetary Science

Access to Document

10.2514/6.1998-615

Fingerprint Dive into the research topics of 'A coarse grid generation algorithm for agglomeration multigrid method on unstructured grids'. Together they form a unique fingerprint.

Cite this

@conference{7991aca021094f1e948e27ebef16785f,

title = "A coarse grid generation algorithm for agglomeration multigrid method on unstructured grids",

abstract = "A new agglomeration algorithm to generate coarse grids for multigrid methods on unstructured and hybrid grids is proposed in this paper. The algorithm, which we call a global coarsening algorithm, is based on the edge coloring of the grids so that it can agglomerate any type of grids. The agglomeration procedure is automatic and generates a globally optimum shape in contrast to the conventional greedy-type frontal algorithm. The method is applied to compute the 2D/3D Euler and 2D Navier-Stokes equations on triangular, tetrahedral and hybrid meshes, respectively. The present agglomeration multigrid method shows better convergence than the existing method owing to the better quality of the coarse grids.",

author = "Noriyuki Okamoto and Kazuhiro Nakahashit and Shigeru Obayashi",

note = "Publisher Copyright: {\textcopyright} 1997, American Institute of Aeronautics and Astronautics, Inc.; 36th AIAA Aerospace Sciences Meeting and Exhibit, 1998 ; Conference date: 12-01-1998 Through 15-01-1998",

year = "1998",

doi = "10.2514/6.1998-615",

language = "English",

}

TY - CONF

T1 - A coarse grid generation algorithm for agglomeration multigrid method on unstructured grids

AU - Okamoto, Noriyuki

AU - Nakahashit, Kazuhiro

AU - Obayashi, Shigeru

PY - 1998

Y1 - 1998

N2 - A new agglomeration algorithm to generate coarse grids for multigrid methods on unstructured and hybrid grids is proposed in this paper. The algorithm, which we call a global coarsening algorithm, is based on the edge coloring of the grids so that it can agglomerate any type of grids. The agglomeration procedure is automatic and generates a globally optimum shape in contrast to the conventional greedy-type frontal algorithm. The method is applied to compute the 2D/3D Euler and 2D Navier-Stokes equations on triangular, tetrahedral and hybrid meshes, respectively. The present agglomeration multigrid method shows better convergence than the existing method owing to the better quality of the coarse grids.

AB - A new agglomeration algorithm to generate coarse grids for multigrid methods on unstructured and hybrid grids is proposed in this paper. The algorithm, which we call a global coarsening algorithm, is based on the edge coloring of the grids so that it can agglomerate any type of grids. The agglomeration procedure is automatic and generates a globally optimum shape in contrast to the conventional greedy-type frontal algorithm. The method is applied to compute the 2D/3D Euler and 2D Navier-Stokes equations on triangular, tetrahedral and hybrid meshes, respectively. The present agglomeration multigrid method shows better convergence than the existing method owing to the better quality of the coarse grids.

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

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

U2 - 10.2514/6.1998-615

DO - 10.2514/6.1998-615

M3 - Paper

AN - SCOPUS:84983119275

T2 - 36th AIAA Aerospace Sciences Meeting and Exhibit, 1998

Y2 - 12 January 1998 through 15 January 1998

ER -

A coarse grid generation algorithm for agglomeration multigrid method on unstructured grids

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this