.png){kind=icon}
.png){kind=icon}
Return
Robust subspace correction methods for nearly singular systems
.png){kind=icon}
PRE
AI
DOI：10.1142/S0218202507002522.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we discuss convergence results for general (successive) subspace correction methods for solving nearly singular systems of equations. We provide parameter independent estimates under appropriate assumptions on the subspace solvers and space decompositions. The main assumption is that any component in the kernel of the singular part of the system can be decomposed into a sum of local (in each subspace) kernel components. This assumption also covers the case of ''hidden'' nearly singular behavior due to decreasing mesh size in the systems resulting from finite element discretizations of second order elliptic problems. To illustrate our abstract convergence framework, we analyze a multilevel method for the Neumann problem (H(grad) system), and also two-level methods for H(div) and H(curl) systems.
Keywords:
nearly singular problems
subspace corrections
nonexpansive operators
multigrid, domain decomposition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
2.2K
Citations:
4.6K