.png){kind=icon}
.png){kind=icon}
Return
Multigrid convergence for second order elliptic problems with smooth complex coefficients
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cma.2008.05.018.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The finite element method when applied to a second order partial differential equation in divergence form can generate operators that are neither Hermitian nor definite when the coefficient function is complex valued. For such problems, under a uniqueness assumption, we prove the continuous dependence of the exact solution and its finite element approximations on data provided that the coefficients are smooth and uniformly bounded away from zero. Then we show that a multigrid algorithm converges once the coarse mesh size is smaller than some fixed number, providing an efficient solver for computing discrete approximations. Numerical experiments, while confirming the theory, also reveal pronounced sensitivity of Gauss-Seidel iterations on the ordering of the unknowns for certain problems. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
Multigrid
Non-symmetry
Complex
Finite element
V-cycle
Backslash cycle
Gauss-Seidel
Ordering
Smoothing
Perturbation
Preconditioning
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
