.png){kind=icon}
Return
Multigrid methods for isogeometric discretization
.png){kind=icon}
OA
AI
DOI：10.1016/j.cma.2012.08.015.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present (geometric) multigrid methods for isogeometric discretization of scalar second order elliptic problems. The smoothing property of the relaxation method, and the approximation property of the intergrid transfer operators are analyzed. These properties, when used in the framework of classical multigrid theory, imply uniform convergence of two-grid and multigrid methods. Supporting numerical results are provided for the smoothing property, the approximation property, convergence factor and iterations count for V-, W- and F-cycles, and the linear dependence of V-cycle convergence on the smoothing steps. For two dimensions, numerical results include the problems with variable coefficients, simple multi-patch geometry, a quarter annulus, and the dependence of convergence behavior on refinement levels e, whereas for three dimensions, only the constant coefficient problem in a unit cube is considered. The numerical results are complete up to polynomial order p = 4, and for C-0 and Cp-1 smoothness. (C) 2012 Elsevier B.V. All rights reserved.
Keywords:
B-splines
Galerkin formulation
Isogeometric method
Multigrid method
NURBS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.3W
Citations:
5.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more